/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/clever.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:42:04,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:42:04,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:42:04,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:42:04,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:42:04,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:42:04,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:42:04,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:42:04,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:42:04,313 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:42:04,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:42:04,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:42:04,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:42:04,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:42:04,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:42:04,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:42:04,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:42:04,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:42:04,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:42:04,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:42:04,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:42:04,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:42:04,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:42:04,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:42:04,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:42:04,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:42:04,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:42:04,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:42:04,349 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:42:04,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:42:04,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:42:04,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:42:04,351 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:42:04,351 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:42:04,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:42:04,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:42:04,353 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:42:04,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:42:04,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:42:04,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:42:04,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:42:04,361 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 20:42:04,391 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:42:04,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:42:04,392 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:42:04,392 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:42:04,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:42:04,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:42:04,393 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:42:04,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:42:04,393 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:42:04,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:42:04,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:42:04,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:42:04,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:42:04,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:42:04,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:42:04,395 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:42:04,395 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:42:04,395 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:42:04,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:42:04,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:42:04,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:42:04,396 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:42:04,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:42:04,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:42:04,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:42:04,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:42:04,396 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:42:04,397 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:42:04,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:42:04,397 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:42:04,397 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:42:04,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:42:04,397 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 20:42:04,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:42:04,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:42:04,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:42:04,653 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 20:42:04,654 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 20:42:04,654 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/clever.wvr.bpl [2022-03-15 20:42:04,655 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/clever.wvr.bpl' [2022-03-15 20:42:04,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:42:04,678 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 20:42:04,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:42:04,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:42:04,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:42:04,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:04" (1/1) ... [2022-03-15 20:42:04,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:04" (1/1) ... [2022-03-15 20:42:04,710 INFO L137 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 20:42:04,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:42:04,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:42:04,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:42:04,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:42:04,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:04" (1/1) ... [2022-03-15 20:42:04,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:04" (1/1) ... [2022-03-15 20:42:04,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:04" (1/1) ... [2022-03-15 20:42:04,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:04" (1/1) ... [2022-03-15 20:42:04,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:04" (1/1) ... [2022-03-15 20:42:04,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:04" (1/1) ... [2022-03-15 20:42:04,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:04" (1/1) ... [2022-03-15 20:42:04,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:42:04,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:42:04,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:42:04,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:42:04,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:04" (1/1) ... [2022-03-15 20:42:04,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:42:04,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:04,760 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 20:42:04,783 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 20:42:04,798 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 20:42:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 20:42:04,799 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 20:42:04,799 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 20:42:04,799 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 20:42:04,799 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 20:42:04,799 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 20:42:04,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:42:04,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:42:04,800 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 20:42:04,844 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:42:04,845 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:42:04,945 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:42:04,951 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:42:04,951 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 20:42:04,952 INFO L202 PluginConnector]: Adding new model clever.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:42:04 BoogieIcfgContainer [2022-03-15 20:42:04,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:42:04,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:42:04,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:42:04,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:42:04,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:04" (1/2) ... [2022-03-15 20:42:04,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f14334 and model type clever.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:42:04, skipping insertion in model container [2022-03-15 20:42:04,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:42:04" (2/2) ... [2022-03-15 20:42:04,961 INFO L111 eAbstractionObserver]: Analyzing ICFG clever.wvr.bpl [2022-03-15 20:42:04,965 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:42:04,965 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:42:04,965 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 20:42:04,965 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:42:04,990 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 20:42:05,048 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:42:05,057 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 20:42:05,057 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 20:42:05,070 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:42:05,080 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 68 flow [2022-03-15 20:42:05,083 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 68 flow [2022-03-15 20:42:05,085 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 68 flow [2022-03-15 20:42:05,113 INFO L129 PetriNetUnfolder]: 3/24 cut-off events. [2022-03-15 20:42:05,113 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 20:42:05,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 3/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2022-03-15 20:42:05,122 INFO L116 LiptonReduction]: Number of co-enabled transitions 118 [2022-03-15 20:42:05,436 INFO L131 LiptonReduction]: Checked pairs total: 78 [2022-03-15 20:42:05,436 INFO L133 LiptonReduction]: Total number of compositions: 12 [2022-03-15 20:42:05,443 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 19 places, 15 transitions, 46 flow [2022-03-15 20:42:05,457 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 20:42:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 20:42:05,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-03-15 20:42:05,476 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:05,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:05,476 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:05,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:05,479 INFO L85 PathProgramCache]: Analyzing trace with hash -286111882, now seen corresponding path program 1 times [2022-03-15 20:42:05,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:05,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561485798] [2022-03-15 20:42:05,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:05,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:05,591 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 20:42:05,592 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:05,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561485798] [2022-03-15 20:42:05,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561485798] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:42:05,593 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:42:05,593 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 20:42:05,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [133137648] [2022-03-15 20:42:05,595 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:05,599 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:05,611 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 14 transitions. [2022-03-15 20:42:05,611 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:05,722 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:42:05,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:42:05,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:05,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:42:05,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:42:05,741 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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) Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:05,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:05,765 INFO L93 Difference]: Finished difference Result 27 states and 55 transitions. [2022-03-15 20:42:05,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:42:05,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-03-15 20:42:05,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:05,774 INFO L225 Difference]: With dead ends: 27 [2022-03-15 20:42:05,774 INFO L226 Difference]: Without dead ends: 24 [2022-03-15 20:42:05,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:42:05,778 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:05,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:42:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-03-15 20:42:05,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-03-15 20:42:05,804 INFO L82 GeneralOperation]: Start removeUnreachable. 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 20:42:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 50 transitions. [2022-03-15 20:42:05,805 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 50 transitions. Word has length 8 [2022-03-15 20:42:05,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:05,805 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 50 transitions. [2022-03-15 20:42:05,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:05,806 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 50 transitions. [2022-03-15 20:42:05,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:42:05,806 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:05,806 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:05,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:42:05,807 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:05,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:05,807 INFO L85 PathProgramCache]: Analyzing trace with hash -269462603, now seen corresponding path program 1 times [2022-03-15 20:42:05,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:05,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46242080] [2022-03-15 20:42:05,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:05,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:05,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:05,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46242080] [2022-03-15 20:42:05,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46242080] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:42:05,841 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:42:05,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:42:05,841 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1609986291] [2022-03-15 20:42:05,841 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:05,842 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:05,845 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2022-03-15 20:42:05,845 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:05,886 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [146#(or (< i1 n) (<= n i2)), 145#(< i1 n)] [2022-03-15 20:42:05,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:42:05,887 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:05,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:42:05,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:42:05,888 INFO L87 Difference]: Start difference. First operand 24 states and 50 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:05,992 INFO L93 Difference]: Finished difference Result 36 states and 75 transitions. [2022-03-15 20:42:05,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:42:05,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-03-15 20:42:05,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:05,994 INFO L225 Difference]: With dead ends: 36 [2022-03-15 20:42:05,994 INFO L226 Difference]: Without dead ends: 32 [2022-03-15 20:42:05,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:42:05,995 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:05,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:05,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-15 20:42:06,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-03-15 20:42:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 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 20:42:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 70 transitions. [2022-03-15 20:42:06,001 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 70 transitions. Word has length 9 [2022-03-15 20:42:06,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:06,001 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 70 transitions. [2022-03-15 20:42:06,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 70 transitions. [2022-03-15 20:42:06,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:42:06,002 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:06,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:06,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:42:06,003 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:06,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:06,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1751990070, now seen corresponding path program 1 times [2022-03-15 20:42:06,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:06,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817650870] [2022-03-15 20:42:06,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:06,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:06,216 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 20:42:06,216 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:06,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817650870] [2022-03-15 20:42:06,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817650870] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:06,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520528270] [2022-03-15 20:42:06,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:06,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:06,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:06,219 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 20:42:06,234 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 20:42:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:06,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:42:06,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:06,402 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 20:42:06,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:06,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:06,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520528270] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:06,531 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:06,532 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-03-15 20:42:06,532 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [889404443] [2022-03-15 20:42:06,532 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:06,533 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:06,535 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 33 transitions. [2022-03-15 20:42:06,535 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:06,932 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [326#(and (= (+ k2 m) k1) (<= (+ k2 m) 0) (< 0 (+ k2 m 1))), 329#(and (= j1 i1) (or (= (+ k2 m) k1) (not (= (+ k2 m) 0))) (or (<= (+ k2 m) 0) (<= (+ k2 i1) 0)) (< 0 (+ k2 m 1))), 328#(and (or (< 0 m) (= k2 k1)) (or (< 0 m) (< 0 (+ k2 1))) (or (< 0 m) (<= k2 0))), 327#(and (or (= k2 k1) (< j1 m)) (or (< j1 m) (<= k2 0)) (or (< 0 (+ k2 1)) (< j1 m)))] [2022-03-15 20:42:06,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:42:06,932 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:06,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:42:06,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:42:06,935 INFO L87 Difference]: Start difference. First operand 32 states and 70 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:07,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:07,163 INFO L93 Difference]: Finished difference Result 74 states and 164 transitions. [2022-03-15 20:42:07,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 20:42:07,164 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:42:07,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:07,185 INFO L225 Difference]: With dead ends: 74 [2022-03-15 20:42:07,185 INFO L226 Difference]: Without dead ends: 63 [2022-03-15 20:42:07,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:42:07,189 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:07,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:07,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-03-15 20:42:07,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2022-03-15 20:42:07,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 2.4565217391304346) internal successors, (113), 46 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 113 transitions. [2022-03-15 20:42:07,207 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 113 transitions. Word has length 11 [2022-03-15 20:42:07,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:07,208 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 113 transitions. [2022-03-15 20:42:07,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 113 transitions. [2022-03-15 20:42:07,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:42:07,209 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:07,210 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:07,227 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 20:42:07,415 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 20:42:07,415 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:07,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:07,416 INFO L85 PathProgramCache]: Analyzing trace with hash 124204842, now seen corresponding path program 1 times [2022-03-15 20:42:07,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:07,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927098024] [2022-03-15 20:42:07,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:07,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:07,478 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:07,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927098024] [2022-03-15 20:42:07,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927098024] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:07,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847362622] [2022-03-15 20:42:07,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:07,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:07,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:07,482 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 20:42:07,484 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 20:42:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:07,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 20:42:07,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:07,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:07,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:07,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847362622] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:07,564 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:07,564 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 5 [2022-03-15 20:42:07,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [694559664] [2022-03-15 20:42:07,564 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:07,565 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:07,567 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 29 transitions. [2022-03-15 20:42:07,567 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:07,645 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [572#(< i1 n), 574#(or (< (+ i1 1) n) (<= n i1)), 573#(< (+ i1 1) n)] [2022-03-15 20:42:07,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:42:07,646 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:07,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:42:07,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:42:07,646 INFO L87 Difference]: Start difference. First operand 47 states and 113 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:07,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:07,721 INFO L93 Difference]: Finished difference Result 58 states and 139 transitions. [2022-03-15 20:42:07,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 20:42:07,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have 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 20:42:07,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:07,723 INFO L225 Difference]: With dead ends: 58 [2022-03-15 20:42:07,723 INFO L226 Difference]: Without dead ends: 58 [2022-03-15 20:42:07,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:42:07,726 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:07,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:07,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-03-15 20:42:07,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2022-03-15 20:42:07,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 2.4285714285714284) internal successors, (102), 42 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 102 transitions. [2022-03-15 20:42:07,742 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 102 transitions. Word has length 11 [2022-03-15 20:42:07,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:07,743 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 102 transitions. [2022-03-15 20:42:07,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:07,744 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 102 transitions. [2022-03-15 20:42:07,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:42:07,745 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:07,746 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:07,774 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 20:42:07,971 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 20:42:07,972 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:07,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash -659531547, now seen corresponding path program 2 times [2022-03-15 20:42:07,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:07,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727139720] [2022-03-15 20:42:07,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:07,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:08,033 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 20:42:08,033 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:08,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727139720] [2022-03-15 20:42:08,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727139720] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:08,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140360246] [2022-03-15 20:42:08,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:42:08,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:08,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:08,036 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 20:42:08,045 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 20:42:08,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:42:08,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:08,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:42:08,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:08,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:08,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140360246] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:08,129 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:08,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-03-15 20:42:08,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [961647159] [2022-03-15 20:42:08,130 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:08,131 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:08,133 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 42 transitions. [2022-03-15 20:42:08,133 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:08,309 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [798#(or (< i1 n) (<= n i2)), 801#(or (<= n (+ i2 1)) (<= (+ 2 i1) n)), 799#(or (< i1 n) (<= n (+ i2 1))), 800#(or (<= n i2) (<= (+ 2 i1) n)), 796#(<= n i2), 797#(<= n (+ i2 1)), 802#(or (<= (+ 2 i1) n) (<= n i1))] [2022-03-15 20:42:08,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:42:08,309 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:08,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:42:08,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:42:08,310 INFO L87 Difference]: Start difference. First operand 43 states and 102 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) 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 20:42:08,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:08,546 INFO L93 Difference]: Finished difference Result 79 states and 198 transitions. [2022-03-15 20:42:08,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:42:08,546 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) 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 12 [2022-03-15 20:42:08,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:08,547 INFO L225 Difference]: With dead ends: 79 [2022-03-15 20:42:08,547 INFO L226 Difference]: Without dead ends: 77 [2022-03-15 20:42:08,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:42:08,548 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:08,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:08,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-03-15 20:42:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2022-03-15 20:42:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 2.6285714285714286) internal successors, (184), 70 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 20:42:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 184 transitions. [2022-03-15 20:42:08,553 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 184 transitions. Word has length 12 [2022-03-15 20:42:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:08,553 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 184 transitions. [2022-03-15 20:42:08,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) 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 20:42:08,554 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 184 transitions. [2022-03-15 20:42:08,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:42:08,554 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:08,554 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:08,580 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 20:42:08,775 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 20:42:08,776 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:08,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:08,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2007650521, now seen corresponding path program 1 times [2022-03-15 20:42:08,777 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:08,777 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61120295] [2022-03-15 20:42:08,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:08,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:08,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:08,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61120295] [2022-03-15 20:42:08,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61120295] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:08,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188963049] [2022-03-15 20:42:08,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:08,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:08,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:08,866 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 20:42:08,898 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 20:42:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:08,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 20:42:08,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:08,990 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 20:42:08,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:09,123 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 20:42:09,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188963049] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:09,123 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:09,123 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-03-15 20:42:09,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1749291827] [2022-03-15 20:42:09,124 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:09,125 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:09,127 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 40 transitions. [2022-03-15 20:42:09,127 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:09,439 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1125#(and (= j1 i1) (= k1 i1) (<= 0 k2) (<= k2 0)), 1105#(or (and (<= k2 k1) (< k1 (+ k2 1))) (< j1 m)), 1113#(or (not (< 0 m)) (and (<= k2 (+ k1 1)) (< k1 k2)) (< 1 m)), 1109#(or (< (+ j1 1) m) (and (<= k2 (+ k1 1)) (< k1 k2)) (not (< j1 m))), 1124#(and (< k1 (+ k2 m 1)) (or (<= (+ j1 k2) k1) (<= (+ k2 m) k1))), 1123#(and (< k1 (+ k2 m 1)) (<= (+ k2 m) k1))] [2022-03-15 20:42:09,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:42:09,439 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:09,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:42:09,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:42:09,440 INFO L87 Difference]: Start difference. First operand 71 states and 184 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 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 20:42:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:09,783 INFO L93 Difference]: Finished difference Result 191 states and 461 transitions. [2022-03-15 20:42:09,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:42:09,783 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 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 12 [2022-03-15 20:42:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:09,784 INFO L225 Difference]: With dead ends: 191 [2022-03-15 20:42:09,784 INFO L226 Difference]: Without dead ends: 178 [2022-03-15 20:42:09,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:42:09,785 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:09,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:42:09,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-03-15 20:42:09,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 112. [2022-03-15 20:42:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 2.765765765765766) internal successors, (307), 111 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:09,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 307 transitions. [2022-03-15 20:42:09,793 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 307 transitions. Word has length 12 [2022-03-15 20:42:09,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:09,793 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 307 transitions. [2022-03-15 20:42:09,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 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 20:42:09,794 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 307 transitions. [2022-03-15 20:42:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:42:09,795 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:09,795 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:09,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:10,011 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 20:42:10,011 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:10,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:10,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1219028172, now seen corresponding path program 2 times [2022-03-15 20:42:10,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:10,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459263567] [2022-03-15 20:42:10,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:10,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:10,115 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 20:42:10,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:10,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459263567] [2022-03-15 20:42:10,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459263567] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:10,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715682543] [2022-03-15 20:42:10,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:42:10,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:10,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:10,117 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 20:42:10,119 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 20:42:10,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:42:10,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:10,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 20:42:10,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:10,261 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 20:42:10,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:10,402 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 20:42:10,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715682543] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:10,403 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:10,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 13 [2022-03-15 20:42:10,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1038377604] [2022-03-15 20:42:10,404 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:10,405 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:10,407 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2022-03-15 20:42:10,407 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:10,948 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [1627#(or (< (+ j1 1) m) (and (<= k2 (+ k1 1)) (< k1 k2)) (not (< j1 m))), 1649#(and (or (<= k2 (+ k1 i1 m)) (not (< 0 m))) (or (= i1 0) (<= m 0)) (or (<= (+ k1 i1 m) k2) (not (< 0 m)))), 1647#(and (= i1 0) (< k1 (+ k2 m 1)) (or (<= (+ k2 m) k1) (<= (+ j1 k2) (+ k1 i1)))), 1645#(and (or (<= k2 (+ 2 k1)) (< 2 m) (<= m 1)) (or (< (+ k1 1) k2) (< 2 m) (<= m 1))), 1646#(and (< k1 (+ k2 m 1)) (<= (+ k2 m) k1)), 1644#(and (or (<= m (+ j1 1)) (< (+ k1 1) k2) (< (+ 2 j1) m)) (or (<= m (+ j1 1)) (<= k2 (+ 2 k1)) (< (+ 2 j1) m))), 1623#(or (and (<= k2 k1) (< k1 (+ k2 1))) (< j1 m)), 1648#(and (or (<= (+ k1 i1 m) (+ j1 k2)) (not (< j1 m))) (or (<= (+ j1 k2) (+ k1 i1 m)) (not (< j1 m))) (or (= i1 0) (not (< j1 m))))] [2022-03-15 20:42:10,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:42:10,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:10,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:42:10,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:42:10,950 INFO L87 Difference]: Start difference. First operand 112 states and 307 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 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 20:42:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:11,462 INFO L93 Difference]: Finished difference Result 241 states and 610 transitions. [2022-03-15 20:42:11,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 20:42:11,463 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:42:11,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:11,464 INFO L225 Difference]: With dead ends: 241 [2022-03-15 20:42:11,464 INFO L226 Difference]: Without dead ends: 228 [2022-03-15 20:42:11,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:42:11,465 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:11,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:42:11,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-03-15 20:42:11,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 157. [2022-03-15 20:42:11,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.923076923076923) internal successors, (456), 156 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:11,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 456 transitions. [2022-03-15 20:42:11,474 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 456 transitions. Word has length 13 [2022-03-15 20:42:11,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:11,475 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 456 transitions. [2022-03-15 20:42:11,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 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 20:42:11,475 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 456 transitions. [2022-03-15 20:42:11,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:42:11,476 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:11,476 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:11,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:11,691 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 20:42:11,691 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:11,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:11,692 INFO L85 PathProgramCache]: Analyzing trace with hash -695624130, now seen corresponding path program 3 times [2022-03-15 20:42:11,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:11,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247639096] [2022-03-15 20:42:11,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:11,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:11,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:11,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247639096] [2022-03-15 20:42:11,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247639096] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:11,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253282619] [2022-03-15 20:42:11,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:42:11,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:11,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:11,787 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 20:42:11,816 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 20:42:11,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:42:11,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:11,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:42:11,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:11,948 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 20:42:11,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:12,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253282619] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:12,187 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:12,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-03-15 20:42:12,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2134061349] [2022-03-15 20:42:12,187 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:12,188 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:12,192 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 60 transitions. [2022-03-15 20:42:12,192 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:12,938 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [2321#(and (= j1 0) (or (= k1 (+ k2 (* 2 m))) (not (= (+ k2 (* 2 m)) 0))) (or (<= (+ k2 (* 2 m)) 0) (<= k2 0)) (< 0 (+ k2 (* 2 m) 1))), 2317#(and (= (+ k2 m) k1) (<= (+ k2 m) 0) (< 0 (+ k2 m 1))), 2319#(and (or (= k2 k1) (< j1 m)) (or (< j1 m) (<= k2 0)) (or (< 0 (+ k2 1)) (< j1 m))), 2320#(and (or (<= (+ k2 m) 0) (<= k2 m)) (= j1 0) (or (= (+ k2 m) k1) (not (= (+ k2 m) 0))) (< 0 (+ k2 m 1))), 2318#(and (<= (+ k2 (* 2 m)) 0) (= k1 (+ k2 (* 2 m))) (< 0 (+ k2 (* 2 m) 1))), 2323#(and (or (< 0 m) (< j1 m) (<= k2 0)) (or (< 0 m) (< 0 (+ k2 1)) (< j1 m)) (or (< 0 m) (= k2 k1) (< j1 m))), 2322#(and (or (< 0 m) (= k2 k1)) (or (< 0 m) (< 0 (+ k2 1))) (or (< 0 m) (<= k2 0)))] [2022-03-15 20:42:12,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:42:12,938 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:12,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:42:12,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:42:12,939 INFO L87 Difference]: Start difference. First operand 157 states and 456 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 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 20:42:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:13,250 INFO L93 Difference]: Finished difference Result 271 states and 689 transitions. [2022-03-15 20:42:13,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 20:42:13,250 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 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 20:42:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:13,252 INFO L225 Difference]: With dead ends: 271 [2022-03-15 20:42:13,252 INFO L226 Difference]: Without dead ends: 218 [2022-03-15 20:42:13,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:42:13,253 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:13,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:13,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-03-15 20:42:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 158. [2022-03-15 20:42:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.859872611464968) internal successors, (449), 157 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 449 transitions. [2022-03-15 20:42:13,260 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 449 transitions. Word has length 14 [2022-03-15 20:42:13,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:13,260 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 449 transitions. [2022-03-15 20:42:13,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 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 20:42:13,260 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 449 transitions. [2022-03-15 20:42:13,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:42:13,261 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:13,261 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:13,289 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 20:42:13,475 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 20:42:13,475 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:13,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:13,476 INFO L85 PathProgramCache]: Analyzing trace with hash -418155985, now seen corresponding path program 4 times [2022-03-15 20:42:13,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:13,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743529492] [2022-03-15 20:42:13,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:13,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:13,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:13,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:13,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743529492] [2022-03-15 20:42:13,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743529492] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:13,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428321409] [2022-03-15 20:42:13,535 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:42:13,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:13,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:13,537 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 20:42:13,547 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 20:42:13,569 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:42:13,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:13,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:42:13,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:13,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:13,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428321409] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:13,641 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:13,641 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-03-15 20:42:13,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [910816092] [2022-03-15 20:42:13,643 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:13,645 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:13,649 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 73 transitions. [2022-03-15 20:42:13,649 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:14,092 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [3020#(or (< i1 n) (<= n (+ i2 1))), 3027#(or (<= (+ 3 i1) n) (<= n (+ i2 1))), 3016#(or (<= (+ 2 i1) n) (<= n i1)), 3028#(or (<= n (+ 2 i2)) (<= (+ 2 i1) n)), 3025#(or (<= n i2) (<= (+ 3 i1) n)), 3026#(or (<= n (+ i2 1)) (<= (+ 2 i1) n)), 3021#(<= n (+ 2 i2)), 3024#(or (<= n i2) (<= (+ 2 i1) n)), 3023#(or (<= (+ 3 i1) n) (<= n (+ i1 1))), 3019#(<= n (+ i2 1)), 3018#(or (< i1 n) (<= n i2)), 3029#(or (<= n (+ 2 i2)) (<= (+ 3 i1) n)), 3022#(or (<= n (+ 2 i2)) (< i1 n)), 3017#(<= n i2)] [2022-03-15 20:42:14,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 20:42:14,092 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:14,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 20:42:14,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:42:14,093 INFO L87 Difference]: Start difference. First operand 158 states and 449 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 20:42:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:14,577 INFO L93 Difference]: Finished difference Result 299 states and 889 transitions. [2022-03-15 20:42:14,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 20:42:14,578 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 15 [2022-03-15 20:42:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:14,580 INFO L225 Difference]: With dead ends: 299 [2022-03-15 20:42:14,580 INFO L226 Difference]: Without dead ends: 295 [2022-03-15 20:42:14,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=567, Invalid=1325, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:42:14,581 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 138 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:14,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 0 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:42:14,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-03-15 20:42:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 246. [2022-03-15 20:42:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 3.0775510204081633) internal successors, (754), 245 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 754 transitions. [2022-03-15 20:42:14,590 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 754 transitions. Word has length 15 [2022-03-15 20:42:14,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:14,591 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 754 transitions. [2022-03-15 20:42:14,591 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 20:42:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 754 transitions. [2022-03-15 20:42:14,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:42:14,593 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:14,594 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:14,619 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 20:42:14,806 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 20:42:14,807 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:14,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:14,807 INFO L85 PathProgramCache]: Analyzing trace with hash -853945647, now seen corresponding path program 3 times [2022-03-15 20:42:14,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:14,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866664402] [2022-03-15 20:42:14,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:14,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:14,860 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:14,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866664402] [2022-03-15 20:42:14,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866664402] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:14,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878229370] [2022-03-15 20:42:14,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:42:14,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:14,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:14,862 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 20:42:14,889 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 20:42:14,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:42:14,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:14,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 20:42:14,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:14,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:14,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:14,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878229370] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:14,952 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:14,952 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-03-15 20:42:14,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [344161986] [2022-03-15 20:42:14,952 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:14,953 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:14,956 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 69 transitions. [2022-03-15 20:42:14,956 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:15,178 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [3955#(< j1 m), 3956#(or (<= m j1) (< (+ j1 1) m)), 3957#(or (< 1 m) (<= m 0)), 3958#(or (< j1 m) (< 1 m) (<= m 0))] [2022-03-15 20:42:15,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:42:15,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:15,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:42:15,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:42:15,179 INFO L87 Difference]: Start difference. First operand 246 states and 754 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:15,301 INFO L93 Difference]: Finished difference Result 451 states and 1312 transitions. [2022-03-15 20:42:15,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:42:15,302 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:42:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:15,304 INFO L225 Difference]: With dead ends: 451 [2022-03-15 20:42:15,304 INFO L226 Difference]: Without dead ends: 449 [2022-03-15 20:42:15,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:42:15,305 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:15,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:15,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2022-03-15 20:42:15,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 347. [2022-03-15 20:42:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 2.976878612716763) internal successors, (1030), 346 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1030 transitions. [2022-03-15 20:42:15,316 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1030 transitions. Word has length 15 [2022-03-15 20:42:15,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:15,317 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 1030 transitions. [2022-03-15 20:42:15,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1030 transitions. [2022-03-15 20:42:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:42:15,318 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:15,318 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:15,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:15,518 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 20:42:15,519 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:15,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:15,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1899851369, now seen corresponding path program 4 times [2022-03-15 20:42:15,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:15,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816109936] [2022-03-15 20:42:15,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:15,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:15,570 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 20:42:15,570 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:15,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816109936] [2022-03-15 20:42:15,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816109936] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:15,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692033458] [2022-03-15 20:42:15,571 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:42:15,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:15,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:15,572 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 20:42:15,599 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 20:42:15,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:42:15,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:15,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 20:42:15,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:15,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:15,658 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 20:42:15,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692033458] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:15,658 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:15,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-03-15 20:42:15,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1137254904] [2022-03-15 20:42:15,659 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:15,660 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:15,663 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 69 transitions. [2022-03-15 20:42:15,663 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:15,869 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [5205#(or (< j1 m) (<= 1 m)), 5206#(or (<= m j1) (< (+ j1 1) m) (<= 1 m))] [2022-03-15 20:42:15,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:42:15,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:15,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:42:15,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:42:15,871 INFO L87 Difference]: Start difference. First operand 347 states and 1030 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 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 20:42:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:15,916 INFO L93 Difference]: Finished difference Result 244 states and 643 transitions. [2022-03-15 20:42:15,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:42:15,916 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 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 15 [2022-03-15 20:42:15,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:15,917 INFO L225 Difference]: With dead ends: 244 [2022-03-15 20:42:15,917 INFO L226 Difference]: Without dead ends: 244 [2022-03-15 20:42:15,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:42:15,918 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:15,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:42:15,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-03-15 20:42:15,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 204. [2022-03-15 20:42:15,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.7536945812807883) internal successors, (559), 203 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:15,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 559 transitions. [2022-03-15 20:42:15,924 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 559 transitions. Word has length 15 [2022-03-15 20:42:15,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:15,924 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 559 transitions. [2022-03-15 20:42:15,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 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 20:42:15,925 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 559 transitions. [2022-03-15 20:42:15,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:42:15,925 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:15,925 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:15,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-15 20:42:16,141 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 20:42:16,141 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:16,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:16,142 INFO L85 PathProgramCache]: Analyzing trace with hash 272066141, now seen corresponding path program 5 times [2022-03-15 20:42:16,142 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:16,142 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603303724] [2022-03-15 20:42:16,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:16,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:16,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:42:16,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:16,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603303724] [2022-03-15 20:42:16,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603303724] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:16,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525823112] [2022-03-15 20:42:16,183 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:42:16,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:16,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:16,184 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 20:42:16,189 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 20:42:16,209 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 20:42:16,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:16,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:42:16,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:42:16,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:42:16,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525823112] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:16,264 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:16,264 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-03-15 20:42:16,264 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [340311047] [2022-03-15 20:42:16,264 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:16,265 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:16,268 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 61 transitions. [2022-03-15 20:42:16,268 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:16,539 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [5953#(or (<= n i2) (<= (+ i2 1) i1)), 5956#(or (<= n i2) (<= i2 i1)), 5958#(or (< (+ 2 i1) n) (<= n (+ i1 1))), 5954#(< i1 n), 5955#(< (+ i1 1) n), 5952#(or (<= n i2) (<= (+ 2 i2) n)), 5957#(or (< (+ i1 1) n) (<= n i1))] [2022-03-15 20:42:16,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:42:16,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:16,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:42:16,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:42:16,540 INFO L87 Difference]: Start difference. First operand 204 states and 559 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 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 20:42:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:17,026 INFO L93 Difference]: Finished difference Result 305 states and 760 transitions. [2022-03-15 20:42:17,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 20:42:17,026 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 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 20:42:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:17,028 INFO L225 Difference]: With dead ends: 305 [2022-03-15 20:42:17,028 INFO L226 Difference]: Without dead ends: 305 [2022-03-15 20:42:17,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=344, Invalid=1138, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 20:42:17,029 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:17,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:17,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-03-15 20:42:17,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 238. [2022-03-15 20:42:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 2.7510548523206753) internal successors, (652), 237 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 652 transitions. [2022-03-15 20:42:17,036 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 652 transitions. Word has length 15 [2022-03-15 20:42:17,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:17,037 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 652 transitions. [2022-03-15 20:42:17,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 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 20:42:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 652 transitions. [2022-03-15 20:42:17,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:42:17,037 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:17,037 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:17,059 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 20:42:17,256 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 20:42:17,256 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:17,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:17,257 INFO L85 PathProgramCache]: Analyzing trace with hash 283644044, now seen corresponding path program 6 times [2022-03-15 20:42:17,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:17,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085497553] [2022-03-15 20:42:17,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:17,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:17,452 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 20:42:17,452 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:17,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085497553] [2022-03-15 20:42:17,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085497553] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:17,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64593604] [2022-03-15 20:42:17,452 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:42:17,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:17,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:17,454 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 20:42:17,479 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 20:42:17,488 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 20:42:17,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:17,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 20:42:17,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:17,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:17,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64593604] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:17,894 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:17,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2022-03-15 20:42:17,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1936209834] [2022-03-15 20:42:17,895 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:17,896 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:17,899 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 78 transitions. [2022-03-15 20:42:17,899 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:19,292 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [6917#(and (or (<= n i2) (<= (+ 2 k1 i1) (+ k2 n m))) (or (<= n i2) (<= (+ k2 m) (+ k1 1)))), 6918#(and (or (<= n i2) (<= (+ 3 k1 i1) (+ k2 n m))) (or (<= n i2) (<= (+ (* 2 j1) k2) (+ k1 m 1)))), 6923#(and (or (<= n (+ i2 1)) (<= (+ k2 i1) 0)) (or (<= n (+ i2 1)) (<= 2 (+ k2 n))) (or (= (+ (* (- 1) j1) i1) 0) (<= n (+ i2 1))) (or (= (+ i1 (* (- 1) k1)) 0) (<= n (+ i2 1)))), 6907#(and (or (<= n i2) (not (<= (+ k2 m 1) k1)) (<= (+ k1 i1) (+ k2 n m))) (or (<= n i2) (<= (+ k2 m) k1))), 6910#(and (or (< (+ i1 1) n) (< j1 m) (< k1 (+ k2 1))) (or (<= k2 k1) (< (+ i1 1) n) (< j1 m))), 6922#(and (or (<= (+ 3 k1 i1) (+ k2 n (* 2 m))) (<= n (+ i2 1))) (or (<= (+ (* 2 j1) k2) (+ k1 1)) (<= n (+ i2 1)))), 6919#(and (or (= (+ i1 (* (- 1) k1)) 0) (<= n i2)) (or (<= n i2) (<= (+ k2 i1) m)) (or (<= n i2) (<= (+ 2 m) (+ k2 n))) (or (= (+ (* (- 1) j1) i1) 0) (<= n i2))), 6905#(and (or (< k1 (+ k2 m 1)) (<= n i2)) (or (<= n i2) (<= (+ k2 m) k1))), 6915#(and (or (<= k2 (+ 2 k1)) (not (< 0 m)) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (< 1 m)) (or (not (< 0 m)) (< (+ k1 1) k2) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (< 1 m))), 6909#(and (or (< i1 n) (<= k2 k1)) (or (< i1 n) (< k1 (+ k2 1)))), 6916#(and (or (<= n i2) (not (<= (+ k2 m 1) k1)) (<= (+ k1 i1 1) (+ k2 n m))) (or (<= n i2) (<= (+ k2 m) k1))), 6913#(and (or (not (< 0 m)) (not (< (+ i1 1) n)) (< j1 m) (< (+ 2 i1) n) (< 1 m) (< k1 k2)) (or (not (< 0 m)) (<= k2 (+ k1 1)) (not (< (+ i1 1) n)) (< j1 m) (< (+ 2 i1) n) (< 1 m))), 6911#(and (or (< (+ j1 1) m) (< (+ i1 1) n) (not (< j1 m)) (< k1 k2)) (or (<= k2 (+ k1 1)) (< (+ j1 1) m) (< (+ i1 1) n) (not (< j1 m)))), 6906#(and (or (< k1 (+ k2 (* 2 m) 1)) (<= n (+ i2 1))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) k1))), 6920#(and (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) k1)) (or (<= n (+ i2 1)) (<= (+ k1 i1 1) (+ k2 n (* 2 m))) (not (<= (+ k2 (* 2 m) 1) k1)))), 6908#(and (or (<= (+ k1 i1) (+ k2 n (* 2 m))) (<= n (+ i2 1)) (not (<= (+ k2 (* 2 m) 1) k1))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) k1))), 6921#(and (or (<= (+ 2 k1 i1) (+ k2 n (* 2 m))) (<= n (+ i2 1))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) (+ k1 1)))), 6914#(and (or (<= k2 (+ 2 k1)) (not (< 0 m)) (< (+ j1 1) m) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (not (< j1 m)) (< 1 m)) (or (not (< 0 m)) (< (+ k1 1) k2) (< (+ j1 1) m) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (not (< j1 m)) (< 1 m))), 6912#(and (or (not (< 0 m)) (< (+ i1 1) n) (not (< i1 n)) (< 1 m) (< k1 k2)) (or (not (< 0 m)) (<= k2 (+ k1 1)) (< (+ i1 1) n) (not (< i1 n)) (< 1 m)))] [2022-03-15 20:42:19,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 20:42:19,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:19,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 20:42:19,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1564, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:42:19,293 INFO L87 Difference]: Start difference. First operand 238 states and 652 transitions. Second operand has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 29 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 20:42:37,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:37,247 INFO L93 Difference]: Finished difference Result 712 states and 1570 transitions. [2022-03-15 20:42:37,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2022-03-15 20:42:37,248 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 29 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 16 [2022-03-15 20:42:37,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:37,251 INFO L225 Difference]: With dead ends: 712 [2022-03-15 20:42:37,251 INFO L226 Difference]: Without dead ends: 682 [2022-03-15 20:42:37,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11403 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=4068, Invalid=30714, Unknown=0, NotChecked=0, Total=34782 [2022-03-15 20:42:37,258 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 373 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 2213 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 2213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:37,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 0 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 2213 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:42:37,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-03-15 20:42:37,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 271. [2022-03-15 20:42:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 2.72962962962963) internal successors, (737), 270 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:37,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 737 transitions. [2022-03-15 20:42:37,269 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 737 transitions. Word has length 16 [2022-03-15 20:42:37,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:37,269 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 737 transitions. [2022-03-15 20:42:37,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 29 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 20:42:37,269 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 737 transitions. [2022-03-15 20:42:37,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:42:37,270 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:37,270 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:37,288 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 20:42:37,479 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 20:42:37,479 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:37,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash -661943032, now seen corresponding path program 5 times [2022-03-15 20:42:37,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:37,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164805741] [2022-03-15 20:42:37,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:37,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 20:42:37,597 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:37,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164805741] [2022-03-15 20:42:37,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164805741] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:37,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535646634] [2022-03-15 20:42:37,598 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:42:37,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:37,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:37,599 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 20:42:37,599 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 20:42:37,622 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 20:42:37,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:37,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 20:42:37,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:42:37,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:42:37,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535646634] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:37,950 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:37,950 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-03-15 20:42:37,950 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1889916763] [2022-03-15 20:42:37,950 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:37,951 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:37,955 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 95 transitions. [2022-03-15 20:42:37,955 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:38,967 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [8586#(and (= j1 0) (or (= (+ k2 m) k1) (not (= (+ k2 m) 0))) (< 0 (+ k2 m 1)) (or (<= (+ k2 m) 0) (<= k2 (* 2 m)))), 8585#(and (< 0 (+ (* 3 m) k2 1)) (= (+ (* 3 m) k2) k1) (<= (+ (* 3 m) k2) 0)), 8584#(and (<= (+ k2 (* 2 m)) 0) (= k1 (+ k2 (* 2 m))) (< 0 (+ k2 (* 2 m) 1))), 8588#(and (< 0 (+ (* 3 m) k2 1)) (= j1 0) (or (not (= (+ (* 3 m) k2) 0)) (= (+ (* 3 m) k2) k1)) (or (<= (+ (* 3 m) k2) 0) (<= k2 0))), 8587#(and (or (<= k2 m) (<= (+ k2 (* 2 m)) 0)) (= j1 0) (or (= k1 (+ k2 (* 2 m))) (not (= (+ k2 (* 2 m)) 0))) (< 0 (+ k2 (* 2 m) 1))), 8589#(and (or (= k2 k1) (< j1 m)) (or (< j1 m) (<= k2 0)) (or (< 0 (+ k2 1)) (< j1 m))), 8590#(and (or (< 0 m) (= k2 k1)) (or (< 0 m) (< 0 (+ k2 1))) (or (< 0 m) (<= k2 0))), 8591#(and (or (< 0 m) (< j1 m) (<= k2 0)) (or (< 0 m) (< 0 (+ k2 1)) (< j1 m)) (or (< 0 m) (= k2 k1) (< j1 m))), 8583#(and (= (+ k2 m) k1) (<= (+ k2 m) 0) (< 0 (+ k2 m 1)))] [2022-03-15 20:42:38,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 20:42:38,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:38,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 20:42:38,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:42:38,968 INFO L87 Difference]: Start difference. First operand 271 states and 737 transitions. Second operand has 17 states, 16 states have (on average 3.125) internal successors, (50), 16 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 20:42:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:39,347 INFO L93 Difference]: Finished difference Result 367 states and 965 transitions. [2022-03-15 20:42:39,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 20:42:39,347 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 16 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 20:42:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:39,349 INFO L225 Difference]: With dead ends: 367 [2022-03-15 20:42:39,349 INFO L226 Difference]: Without dead ends: 295 [2022-03-15 20:42:39,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=985, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:42:39,349 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:39,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-03-15 20:42:39,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 273. [2022-03-15 20:42:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 2.7316176470588234) internal successors, (743), 272 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 743 transitions. [2022-03-15 20:42:39,357 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 743 transitions. Word has length 17 [2022-03-15 20:42:39,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:39,357 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 743 transitions. [2022-03-15 20:42:39,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 16 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 20:42:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 743 transitions. [2022-03-15 20:42:39,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:42:39,358 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:39,358 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:39,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:39,571 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 20:42:39,571 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:39,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:39,572 INFO L85 PathProgramCache]: Analyzing trace with hash -561403325, now seen corresponding path program 7 times [2022-03-15 20:42:39,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:39,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333113389] [2022-03-15 20:42:39,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:39,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:39,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:39,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333113389] [2022-03-15 20:42:39,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333113389] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:39,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789986779] [2022-03-15 20:42:39,612 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:42:39,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:39,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:39,613 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 20:42:39,640 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 20:42:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:39,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:42:39,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:39,690 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:39,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:39,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789986779] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:39,718 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:39,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-03-15 20:42:39,718 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [394657042] [2022-03-15 20:42:39,718 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:39,719 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:39,723 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 87 transitions. [2022-03-15 20:42:39,723 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:39,992 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [9629#(< j1 m), 9631#(or (<= m (+ j1 1)) (< (+ 2 j1) m)), 9632#(or (< 2 m) (<= m 1)), 9634#(or (<= m j1) (< 2 m) (< (+ j1 1) m) (<= m 1)), 9630#(or (<= m j1) (< (+ j1 1) m)), 9633#(or (< 2 m) (< j1 m) (<= m 1))] [2022-03-15 20:42:39,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:42:39,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:39,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:42:39,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:42:39,993 INFO L87 Difference]: Start difference. First operand 273 states and 743 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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 20:42:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:40,174 INFO L93 Difference]: Finished difference Result 605 states and 1631 transitions. [2022-03-15 20:42:40,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:42:40,174 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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 20:42:40,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:40,177 INFO L225 Difference]: With dead ends: 605 [2022-03-15 20:42:40,177 INFO L226 Difference]: Without dead ends: 605 [2022-03-15 20:42:40,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:42:40,178 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:40,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:40,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-03-15 20:42:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 542. [2022-03-15 20:42:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 2.811460258780037) internal successors, (1521), 541 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1521 transitions. [2022-03-15 20:42:40,192 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1521 transitions. Word has length 17 [2022-03-15 20:42:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:40,192 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 1521 transitions. [2022-03-15 20:42:40,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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 20:42:40,192 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1521 transitions. [2022-03-15 20:42:40,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:42:40,194 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:40,194 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:40,216 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 20:42:40,411 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 20:42:40,411 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:40,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:40,412 INFO L85 PathProgramCache]: Analyzing trace with hash 253691195, now seen corresponding path program 8 times [2022-03-15 20:42:40,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:40,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578133192] [2022-03-15 20:42:40,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:40,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:40,466 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:40,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578133192] [2022-03-15 20:42:40,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578133192] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:40,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949607810] [2022-03-15 20:42:40,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:42:40,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:40,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:40,468 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 20:42:40,496 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 20:42:40,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:42:40,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:40,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:42:40,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:40,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:40,583 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 20:42:40,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949607810] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:40,583 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:40,583 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-03-15 20:42:40,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [727587942] [2022-03-15 20:42:40,584 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:40,585 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:40,589 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 87 transitions. [2022-03-15 20:42:40,589 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:40,953 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [11450#(or (<= m j1) (< (+ j1 1) m) (<= 2 m) (<= m 0)), 11448#(or (<= 2 m) (<= m 0)), 11449#(or (< j1 m) (<= 2 m) (<= m 0)), 11447#(or (<= m j1) (<= (+ 2 j1) m)), 11451#(or (<= m (+ j1 1)) (< (+ 2 j1) m) (<= 2 m) (<= m 0)), 11453#(or (= i1 0) (<= m 0)), 11452#(and (or (<= m j1) (<= i1 j1)) (or (= i1 0) (<= m j1)))] [2022-03-15 20:42:40,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:42:40,953 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:40,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:42:40,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:42:40,954 INFO L87 Difference]: Start difference. First operand 542 states and 1521 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 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 20:42:41,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:41,183 INFO L93 Difference]: Finished difference Result 441 states and 1131 transitions. [2022-03-15 20:42:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 20:42:41,183 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 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 20:42:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:41,185 INFO L225 Difference]: With dead ends: 441 [2022-03-15 20:42:41,185 INFO L226 Difference]: Without dead ends: 441 [2022-03-15 20:42:41,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:42:41,186 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:41,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:41,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-03-15 20:42:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 371. [2022-03-15 20:42:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 2.672972972972973) internal successors, (989), 370 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 989 transitions. [2022-03-15 20:42:41,196 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 989 transitions. Word has length 17 [2022-03-15 20:42:41,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:41,196 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 989 transitions. [2022-03-15 20:42:41,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 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 20:42:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 989 transitions. [2022-03-15 20:42:41,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:42:41,197 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:41,197 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:41,216 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 20:42:41,403 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 20:42:41,403 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:41,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:41,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1874487159, now seen corresponding path program 6 times [2022-03-15 20:42:41,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:41,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323367671] [2022-03-15 20:42:41,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:41,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:41,455 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:41,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:41,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323367671] [2022-03-15 20:42:41,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323367671] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:41,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462239144] [2022-03-15 20:42:41,456 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:42:41,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:41,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:41,457 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 20:42:41,457 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 20:42:41,484 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 20:42:41,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:41,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:42:41,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:41,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:41,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462239144] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:41,555 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:41,555 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2022-03-15 20:42:41,555 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1228023618] [2022-03-15 20:42:41,555 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:41,556 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:41,560 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 112 transitions. [2022-03-15 20:42:41,560 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:42,167 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [12786#(or (<= n i2) (<= (+ i1 4) n)), 12778#(<= n (+ 2 i2)), 12784#(or (<= n (+ 3 i2)) (<= (+ 2 i1) n)), 12780#(or (<= n (+ 2 i2)) (<= (+ 2 i1) n)), 12773#(or (< i1 n) (<= n (+ i2 1))), 12782#(<= n (+ 3 i2)), 12792#(or (<= n (+ 2 i1)) (<= (+ i1 4) n)), 12789#(or (<= n (+ 3 i2)) (<= (+ i1 4) n)), 12770#(<= n i2), 12781#(or (<= n (+ 2 i2)) (<= (+ 3 i1) n)), 12785#(or (<= n (+ 3 i2)) (<= (+ 3 i1) n)), 12783#(or (<= n (+ 3 i2)) (< i1 n)), 12788#(or (<= n (+ 2 i2)) (<= (+ i1 4) n)), 12790#(or (<= (+ 2 i1) n) (<= n i1)), 12779#(or (<= n (+ 2 i2)) (< i1 n)), 12772#(or (< i1 n) (<= n i2)), 12775#(or (<= n (+ i2 1)) (<= (+ 2 i1) n)), 12791#(or (<= (+ 3 i1) n) (<= n (+ i1 1))), 12771#(<= n (+ i2 1)), 12776#(or (<= n i2) (<= (+ 3 i1) n)), 12787#(or (<= n (+ i2 1)) (<= (+ i1 4) n)), 12774#(or (<= n i2) (<= (+ 2 i1) n)), 12777#(or (<= (+ 3 i1) n) (<= n (+ i2 1)))] [2022-03-15 20:42:42,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 20:42:42,167 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:42,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 20:42:42,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=804, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:42:42,168 INFO L87 Difference]: Start difference. First operand 371 states and 989 transitions. Second operand has 33 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 32 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:43,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:43,037 INFO L93 Difference]: Finished difference Result 980 states and 2683 transitions. [2022-03-15 20:42:43,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 20:42:43,037 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 32 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have 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 20:42:43,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:43,041 INFO L225 Difference]: With dead ends: 980 [2022-03-15 20:42:43,041 INFO L226 Difference]: Without dead ends: 976 [2022-03-15 20:42:43,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1270 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1352, Invalid=3204, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 20:42:43,043 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 178 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:43,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 0 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:42:43,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2022-03-15 20:42:43,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 546. [2022-03-15 20:42:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 2.746788990825688) internal successors, (1497), 545 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1497 transitions. [2022-03-15 20:42:43,058 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1497 transitions. Word has length 18 [2022-03-15 20:42:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:43,059 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 1497 transitions. [2022-03-15 20:42:43,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 32 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1497 transitions. [2022-03-15 20:42:43,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:42:43,060 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:43,060 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:43,085 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 20:42:43,275 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 20:42:43,275 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:43,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:43,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1740596542, now seen corresponding path program 9 times [2022-03-15 20:42:43,277 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:43,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451988421] [2022-03-15 20:42:43,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:43,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:43,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:43,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451988421] [2022-03-15 20:42:43,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451988421] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:43,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438264663] [2022-03-15 20:42:43,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:42:43,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:43,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:43,455 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 20:42:43,455 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 20:42:43,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 20:42:43,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:43,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 20:42:43,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:43,673 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:43,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:43,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438264663] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:43,915 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:43,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 24 [2022-03-15 20:42:43,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [629730459] [2022-03-15 20:42:43,916 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:43,916 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:43,920 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 96 transitions. [2022-03-15 20:42:43,920 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:45,687 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [15075#(and (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) k1)) (or (<= n (+ i2 1)) (<= (+ k1 i1 1) (+ k2 n (* 2 m))) (not (<= (+ k2 (* 2 m) 1) k1)))), 15077#(and (or (<= (+ 2 k1 i1) (+ k2 n (* 2 m))) (<= n (+ i2 1))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) (+ k1 1)))), 15083#(and (or (<= (+ (* 2 j1) k2) (+ k1 1)) (<= n (+ i2 1))) (or (<= (+ 3 k1 i1) (+ (* 2 j1) k2 n)) (<= n (+ i2 1)))), 15068#(and (or (not (< (+ j1 1) m)) (< (+ k1 1) k2) (< (+ 2 j1) m) (< (+ i1 1) n)) (or (not (< (+ j1 1) m)) (<= k2 (+ 2 k1)) (< (+ 2 j1) m) (< (+ i1 1) n))), 15079#(and (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) (+ 2 k1))) (or (<= (+ 3 k1 i1) (+ k2 n (* 2 m))) (<= n (+ i2 1)))), 15081#(and (or (<= n (+ i2 1)) (<= (+ k1 i1 4) (+ k2 n (* 2 m)))) (or (<= n (+ i2 1)) (<= (+ (* 2 j1) k2) (+ 2 k1)))), 15063#(and (or (<= n i2) (not (<= (+ k2 m 1) k1)) (<= (+ k1 i1) (+ k2 n m))) (or (<= n i2) (<= (+ k2 m) k1))), 15072#(and (or (<= k2 (+ k1 4)) (not (< (+ j1 1) m)) (< 2 m) (< (+ 2 j1) m) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (not (< 1 m))) (or (not (< (+ j1 1) m)) (< 2 m) (< (+ 2 j1) m) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (not (< 1 m)) (< (+ 3 k1) k2))), 15078#(and (or (<= n i2) (<= (+ 3 k1 i1) (+ k2 n m))) (or (<= n i2) (<= (+ k2 m) (+ 2 k1)))), 15071#(and (or (< 2 m) (< (+ j1 1) m) (not (< (+ i1 1) n)) (<= k2 (+ 3 k1)) (< (+ 2 i1) n) (not (< j1 m)) (not (< 1 m))) (or (< (+ 2 k1) k2) (< 2 m) (< (+ j1 1) m) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (not (< j1 m)) (not (< 1 m)))), 15076#(and (or (<= n i2) (<= (+ 2 k1 i1) (+ k2 n m))) (or (<= n i2) (<= (+ k2 m) (+ k1 1)))), 15067#(and (or (< (+ j1 1) m) (< (+ i1 1) n) (not (< j1 m)) (< k1 k2)) (or (<= k2 (+ k1 1)) (< (+ j1 1) m) (< (+ i1 1) n) (not (< j1 m)))), 15080#(and (or (<= n i2) (<= (+ k1 i1 4) (+ k2 n m))) (or (<= n i2) (<= (+ (* 2 j1) k2) (+ 2 k1 m)))), 15082#(and (or (<= (+ 3 k1 i1 m) (+ (* 2 j1) k2 n)) (<= n i2)) (or (<= n i2) (<= (+ (* 2 j1) k2) (+ k1 m 1)))), 15061#(and (or (< k1 (+ k2 m 1)) (<= n i2)) (or (<= n i2) (<= (+ k2 m) k1))), 15064#(and (or (<= (+ k1 i1) (+ k2 n (* 2 m))) (<= n (+ i2 1)) (not (<= (+ k2 (* 2 m) 1) k1))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) k1))), 15069#(and (or (<= k2 (+ 2 k1)) (< 2 m) (< (+ i1 1) n) (not (< i1 n)) (not (< 1 m))) (or (< (+ k1 1) k2) (< 2 m) (< (+ i1 1) n) (not (< i1 n)) (not (< 1 m)))), 15062#(and (or (< k1 (+ k2 (* 2 m) 1)) (<= n (+ i2 1))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) k1))), 15073#(and (or (< 2 m) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (not (< 1 m)) (< (+ 3 k1) k2)) (or (<= k2 (+ k1 4)) (< 2 m) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (not (< 1 m)))), 15084#(and (or (= (+ i1 (* (- 1) k1)) 0) (<= n i2)) (or (<= n i2) (<= (+ k2 i1) m)) (or (<= n i2) (<= (+ 2 m) (+ k2 n))) (or (= (+ (* (- 1) j1) i1) 0) (<= n i2))), 15065#(and (or (< i1 n) (<= k2 k1)) (or (< i1 n) (< k1 (+ k2 1)))), 15066#(and (or (< (+ i1 1) n) (< j1 m) (< k1 (+ k2 1))) (or (<= k2 k1) (< (+ i1 1) n) (< j1 m))), 15085#(and (or (<= n (+ i2 1)) (<= (+ k2 i1) 0)) (or (<= n (+ i2 1)) (<= 2 (+ k2 n))) (or (= (+ (* (- 1) j1) i1) 0) (<= n (+ i2 1))) (or (= (+ i1 (* (- 1) k1)) 0) (<= n (+ i2 1)))), 15070#(and (or (<= k2 (+ 2 k1)) (< 2 m) (not (< (+ i1 1) n)) (< j1 m) (< (+ 2 i1) n) (not (< 1 m))) (or (< (+ k1 1) k2) (< 2 m) (not (< (+ i1 1) n)) (< j1 m) (< (+ 2 i1) n) (not (< 1 m)))), 15074#(and (or (<= n i2) (not (<= (+ k2 m 1) k1)) (<= (+ k1 i1 1) (+ k2 n m))) (or (<= n i2) (<= (+ k2 m) k1)))] [2022-03-15 20:42:45,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 20:42:45,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:45,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 20:42:45,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2371, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 20:42:45,688 INFO L87 Difference]: Start difference. First operand 546 states and 1497 transitions. Second operand has 38 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 37 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 20:43:22,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:22,494 INFO L93 Difference]: Finished difference Result 1519 states and 3472 transitions. [2022-03-15 20:43:22,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2022-03-15 20:43:22,495 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 37 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:43:22,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:22,501 INFO L225 Difference]: With dead ends: 1519 [2022-03-15 20:43:22,501 INFO L226 Difference]: Without dead ends: 1489 [2022-03-15 20:43:22,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24471 ImplicationChecksByTransitivity, 36.1s TimeCoverageRelationStatistics Valid=7491, Invalid=62469, Unknown=0, NotChecked=0, Total=69960 [2022-03-15 20:43:22,512 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 646 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 3076 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 3076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:22,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [646 Valid, 0 Invalid, 3772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 3076 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 20:43:22,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2022-03-15 20:43:22,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 593. [2022-03-15 20:43:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 592 states have (on average 2.7364864864864864) internal successors, (1620), 592 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 1620 transitions. [2022-03-15 20:43:22,543 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 1620 transitions. Word has length 18 [2022-03-15 20:43:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:22,543 INFO L470 AbstractCegarLoop]: Abstraction has 593 states and 1620 transitions. [2022-03-15 20:43:22,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 37 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 20:43:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 1620 transitions. [2022-03-15 20:43:22,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:43:22,545 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:22,545 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:22,567 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 20:43:22,759 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 20:43:22,759 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:22,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:22,760 INFO L85 PathProgramCache]: Analyzing trace with hash -396325167, now seen corresponding path program 10 times [2022-03-15 20:43:22,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:22,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491741355] [2022-03-15 20:43:22,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:22,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:22,792 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:43:22,793 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:22,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491741355] [2022-03-15 20:43:22,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491741355] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:22,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632500663] [2022-03-15 20:43:22,793 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:43:22,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:22,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:22,794 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 20:43:22,795 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 20:43:22,817 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:43:22,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:22,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:43:22,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:22,847 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 20:43:22,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 20:43:22,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632500663] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:22,874 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:22,874 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-03-15 20:43:22,874 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2023666225] [2022-03-15 20:43:22,874 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:22,875 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:22,878 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 82 transitions. [2022-03-15 20:43:22,878 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:23,269 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [18334#(or (<= n i2) (<= n i1) (< (+ i2 1) n)), 18335#(or (<= n i2) (<= i2 i1)), 18332#(or (<= n i2) (< (+ i2 1) n)), 18330#(or (<= (+ n 1) i1) (< i2 n)), 18329#(< i2 n), 18331#(or (<= n i1) (< i2 n)), 18333#(or (<= n i2) (<= (+ n 1) i1) (< (+ i2 1) n))] [2022-03-15 20:43:23,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:43:23,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:23,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:43:23,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:43:23,270 INFO L87 Difference]: Start difference. First operand 593 states and 1620 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 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 20:43:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:23,517 INFO L93 Difference]: Finished difference Result 809 states and 2159 transitions. [2022-03-15 20:43:23,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:43:23,517 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 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 20:43:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:23,520 INFO L225 Difference]: With dead ends: 809 [2022-03-15 20:43:23,520 INFO L226 Difference]: Without dead ends: 795 [2022-03-15 20:43:23,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:43:23,521 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:23,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:43:23,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-03-15 20:43:23,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 716. [2022-03-15 20:43:23,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 2.7006993006993008) internal successors, (1931), 715 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1931 transitions. [2022-03-15 20:43:23,539 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1931 transitions. Word has length 18 [2022-03-15 20:43:23,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:23,539 INFO L470 AbstractCegarLoop]: Abstraction has 716 states and 1931 transitions. [2022-03-15 20:43:23,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 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 20:43:23,539 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1931 transitions. [2022-03-15 20:43:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:43:23,541 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:23,541 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:23,563 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 20:43:23,755 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 20:43:23,756 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:23,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:23,756 INFO L85 PathProgramCache]: Analyzing trace with hash -385964598, now seen corresponding path program 11 times [2022-03-15 20:43:23,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:23,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389280387] [2022-03-15 20:43:23,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:23,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:23,810 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:23,810 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:23,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389280387] [2022-03-15 20:43:23,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389280387] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:23,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167579379] [2022-03-15 20:43:23,810 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:43:23,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:23,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:23,815 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 20:43:23,816 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 20:43:23,839 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 20:43:23,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:23,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:43:23,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:23,872 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:23,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:23,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167579379] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:23,904 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:23,904 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-03-15 20:43:23,904 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1893641268] [2022-03-15 20:43:23,904 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:23,905 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:23,909 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 105 transitions. [2022-03-15 20:43:23,909 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:24,408 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [20723#(or (<= n (+ i2 1)) (<= (+ 2 i2) i1)), 20729#(or (<= n (+ i2 1)) (<= i2 i1)), 20725#(or (<= n (+ i2 1)) (<= (+ i2 1) i1)), 20726#(< i1 n), 20720#(or (<= n i2) (<= (+ 2 i2) n)), 20730#(or (< (+ i1 1) n) (<= n i1)), 20727#(< (+ i1 1) n), 20732#(or (<= n (+ 2 i1)) (< (+ 3 i1) n)), 20722#(or (<= n (+ i2 1)) (<= (+ 3 i2) n)), 20724#(or (<= n i2) (<= i2 i1)), 20721#(or (<= n i2) (<= (+ i2 1) i1)), 20728#(or (<= n i2) (<= i2 (+ i1 1))), 20731#(or (< (+ 2 i1) n) (<= n (+ i1 1)))] [2022-03-15 20:43:24,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:43:24,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:24,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:43:24,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:43:24,409 INFO L87 Difference]: Start difference. First operand 716 states and 1931 transitions. Second operand has 20 states, 20 states have (on average 3.45) internal successors, (69), 19 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 20:43:25,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:25,606 INFO L93 Difference]: Finished difference Result 1134 states and 2809 transitions. [2022-03-15 20:43:25,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 20:43:25,607 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 19 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 20:43:25,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:25,613 INFO L225 Difference]: With dead ends: 1134 [2022-03-15 20:43:25,613 INFO L226 Difference]: Without dead ends: 1134 [2022-03-15 20:43:25,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=888, Invalid=3018, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 20:43:25,615 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 210 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:25,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 0 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:43:25,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2022-03-15 20:43:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 810. [2022-03-15 20:43:25,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 809 states have (on average 2.661310259579728) internal successors, (2153), 809 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 2153 transitions. [2022-03-15 20:43:25,658 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 2153 transitions. Word has length 19 [2022-03-15 20:43:25,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:25,658 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 2153 transitions. [2022-03-15 20:43:25,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 19 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 20:43:25,658 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 2153 transitions. [2022-03-15 20:43:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:43:25,660 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:25,660 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:25,683 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 20:43:25,882 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 20:43:25,882 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:25,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:25,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1654451153, now seen corresponding path program 12 times [2022-03-15 20:43:25,883 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:25,883 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111332188] [2022-03-15 20:43:25,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:25,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:25,942 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:43:25,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:25,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111332188] [2022-03-15 20:43:25,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111332188] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:25,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166919257] [2022-03-15 20:43:25,942 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:43:25,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:25,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:25,944 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 20:43:25,944 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 20:43:25,966 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 20:43:25,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:25,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:43:25,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:43:26,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:26,070 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:43:26,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166919257] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:26,070 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:26,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-03-15 20:43:26,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [994140680] [2022-03-15 20:43:26,070 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:26,071 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:26,076 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 105 transitions. [2022-03-15 20:43:26,076 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:26,443 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [23704#(or (<= m (+ j1 1)) (< (+ 2 j1) m) (< 3 m) (<= m 2)), 23703#(or (<= m j1) (< (+ j1 1) m) (< 3 m) (<= m 2)), 23701#(or (< 3 m) (<= m 2)), 23702#(or (< 3 m) (<= m 2) (< j1 m)), 23699#(or (<= m (+ j1 1)) (< (+ 2 j1) m)), 23697#(< j1 m), 23698#(or (<= m j1) (< (+ j1 1) m)), 23700#(or (< (+ 3 j1) m) (<= m (+ 2 j1)))] [2022-03-15 20:43:26,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 20:43:26,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:26,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 20:43:26,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:43:26,447 INFO L87 Difference]: Start difference. First operand 810 states and 2153 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 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 20:43:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:26,668 INFO L93 Difference]: Finished difference Result 1712 states and 4578 transitions. [2022-03-15 20:43:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:43:26,669 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 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 20:43:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:26,675 INFO L225 Difference]: With dead ends: 1712 [2022-03-15 20:43:26,676 INFO L226 Difference]: Without dead ends: 1708 [2022-03-15 20:43:26,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:43:26,676 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 166 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:26,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 0 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:43:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2022-03-15 20:43:26,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1624. [2022-03-15 20:43:26,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1623 states have (on average 2.723351817621688) internal successors, (4420), 1623 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 4420 transitions. [2022-03-15 20:43:26,710 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 4420 transitions. Word has length 19 [2022-03-15 20:43:26,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:26,710 INFO L470 AbstractCegarLoop]: Abstraction has 1624 states and 4420 transitions. [2022-03-15 20:43:26,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 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 20:43:26,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 4420 transitions. [2022-03-15 20:43:26,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:43:26,712 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:26,713 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:26,737 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 20:43:26,931 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 20:43:26,931 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:26,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:26,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1274287571, now seen corresponding path program 13 times [2022-03-15 20:43:26,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:26,932 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325006691] [2022-03-15 20:43:26,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:26,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:26,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:26,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325006691] [2022-03-15 20:43:26,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325006691] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:26,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032320925] [2022-03-15 20:43:26,995 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:43:26,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:26,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:26,997 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 20:43:26,997 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 20:43:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:27,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:43:27,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:27,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:27,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032320925] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:27,124 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:27,125 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2022-03-15 20:43:27,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1033308166] [2022-03-15 20:43:27,125 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:27,143 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:27,149 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 105 transitions. [2022-03-15 20:43:27,149 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:27,612 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [28816#(or (< (+ 3 j1) m) (<= m (+ 2 j1)) (<= m 1) (<= 3 m)), 28810#(or (<= m j1) (<= (+ 2 j1) m)), 28811#(or (<= m (+ j1 1)) (<= (+ 3 j1) m)), 28817#(and (or (<= m j1) (<= i1 j1)) (or (= i1 0) (<= m j1))), 28812#(or (<= m 1) (<= 3 m)), 28815#(or (<= m (+ j1 1)) (< (+ 2 j1) m) (<= m 1) (<= 3 m)), 28813#(or (< j1 m) (<= m 1) (<= 3 m)), 28818#(or (= i1 0) (<= m 0)), 28814#(or (<= m j1) (< (+ j1 1) m) (<= m 1) (<= 3 m))] [2022-03-15 20:43:27,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:43:27,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:27,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:43:27,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2022-03-15 20:43:27,613 INFO L87 Difference]: Start difference. First operand 1624 states and 4420 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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 20:43:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:27,997 INFO L93 Difference]: Finished difference Result 1252 states and 3200 transitions. [2022-03-15 20:43:27,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 20:43:27,997 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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 20:43:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:28,001 INFO L225 Difference]: With dead ends: 1252 [2022-03-15 20:43:28,001 INFO L226 Difference]: Without dead ends: 1252 [2022-03-15 20:43:28,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 62 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=346, Invalid=1214, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 20:43:28,002 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 164 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:28,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 0 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:43:28,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2022-03-15 20:43:28,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1147. [2022-03-15 20:43:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 1146 states have (on average 2.618673647469459) internal successors, (3001), 1146 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 3001 transitions. [2022-03-15 20:43:28,024 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 3001 transitions. Word has length 19 [2022-03-15 20:43:28,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:28,024 INFO L470 AbstractCegarLoop]: Abstraction has 1147 states and 3001 transitions. [2022-03-15 20:43:28,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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 20:43:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 3001 transitions. [2022-03-15 20:43:28,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:43:28,026 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:28,026 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:28,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-03-15 20:43:28,243 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 20:43:28,244 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:28,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:28,244 INFO L85 PathProgramCache]: Analyzing trace with hash -750104496, now seen corresponding path program 7 times [2022-03-15 20:43:28,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:28,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132100956] [2022-03-15 20:43:28,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:28,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:28,356 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 20:43:28,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:28,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132100956] [2022-03-15 20:43:28,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132100956] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:28,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255187376] [2022-03-15 20:43:28,356 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:43:28,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:28,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:28,358 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 20:43:28,359 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 20:43:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:28,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 20:43:28,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 20:43:28,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:28,892 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 20:43:28,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255187376] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:28,893 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:28,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 20:43:28,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1547140029] [2022-03-15 20:43:28,893 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:28,895 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:28,901 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 138 transitions. [2022-03-15 20:43:28,901 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:30,311 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [32535#(and (< 0 (+ (* 3 m) k2 1)) (= (+ (* 3 m) k2) k1) (<= (+ (* 3 m) k2) 0)), 32540#(and (or (<= (+ k2 m) 0) (<= k2 (* 3 m))) (= j1 0) (or (= (+ k2 m) k1) (not (= (+ k2 m) 0))) (< 0 (+ k2 m 1))), 32543#(and (or (<= (+ (* m 4) k2) 0) (<= k2 0)) (= j1 0) (< 0 (+ (* m 4) k2 1)) (or (= (+ (* m 4) k2) k1) (not (= (+ (* m 4) k2) 0)))), 32534#(and (<= (+ k2 (* 2 m)) 0) (= k1 (+ k2 (* 2 m))) (< 0 (+ k2 (* 2 m) 1))), 32533#(and (= (+ k2 m) k1) (<= (+ k2 m) 0) (< 0 (+ k2 m 1))), 32537#(and (or (= k2 k1) (< j1 m)) (or (< j1 m) (<= k2 0)) (or (< 0 (+ k2 1)) (< j1 m))), 32538#(and (or (< 0 m) (= k2 k1)) (or (< 0 m) (< 0 (+ k2 1))) (or (< 0 m) (<= k2 0))), 32542#(and (< 0 (+ (* 3 m) k2 1)) (= j1 0) (or (not (= (+ (* 3 m) k2) 0)) (= (+ (* 3 m) k2) k1)) (or (<= k2 m) (<= (+ (* 3 m) k2) 0))), 32539#(and (or (< 0 m) (< j1 m) (<= k2 0)) (or (< 0 m) (< 0 (+ k2 1)) (< j1 m)) (or (< 0 m) (= k2 k1) (< j1 m))), 32536#(and (= (+ (* m 4) k2) k1) (<= (+ (* m 4) k2) 0) (< 0 (+ (* m 4) k2 1))), 32541#(and (= j1 0) (or (<= k2 (* 2 m)) (<= (+ k2 (* 2 m)) 0)) (or (= k1 (+ k2 (* 2 m))) (not (= (+ k2 (* 2 m)) 0))) (< 0 (+ k2 (* 2 m) 1)))] [2022-03-15 20:43:30,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:43:30,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:30,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:43:30,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:43:30,312 INFO L87 Difference]: Start difference. First operand 1147 states and 3001 transitions. Second operand has 20 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 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 20:43:30,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:30,795 INFO L93 Difference]: Finished difference Result 1279 states and 3335 transitions. [2022-03-15 20:43:30,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 20:43:30,795 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 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 20 [2022-03-15 20:43:30,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:30,799 INFO L225 Difference]: With dead ends: 1279 [2022-03-15 20:43:30,799 INFO L226 Difference]: Without dead ends: 1176 [2022-03-15 20:43:30,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=365, Invalid=1441, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 20:43:30,799 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:30,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:43:30,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2022-03-15 20:43:30,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1151. [2022-03-15 20:43:30,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1150 states have (on average 2.6165217391304347) internal successors, (3009), 1150 states have internal predecessors, (3009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 3009 transitions. [2022-03-15 20:43:30,825 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 3009 transitions. Word has length 20 [2022-03-15 20:43:30,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:30,825 INFO L470 AbstractCegarLoop]: Abstraction has 1151 states and 3009 transitions. [2022-03-15 20:43:30,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 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 20:43:30,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 3009 transitions. [2022-03-15 20:43:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:43:30,827 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:30,827 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:30,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-03-15 20:43:31,043 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 20:43:31,043 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:31,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:31,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1876992121, now seen corresponding path program 14 times [2022-03-15 20:43:31,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:31,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386307718] [2022-03-15 20:43:31,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:31,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:31,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:31,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386307718] [2022-03-15 20:43:31,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386307718] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:31,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308249574] [2022-03-15 20:43:31,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:43:31,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:31,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:31,251 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 20:43:31,251 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 20:43:31,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:43:31,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:31,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 20:43:31,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:43:31,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:43:31,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308249574] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:31,752 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:31,752 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 24 [2022-03-15 20:43:31,752 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1392268359] [2022-03-15 20:43:31,753 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:31,754 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:31,759 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 128 transitions. [2022-03-15 20:43:31,759 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:34,397 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [36299#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) k1)) (or (<= (+ 2 k1 (* 2 i1)) (+ (* 2 n) (* 3 m) k2)) (<= n (+ 2 i2)) (not (<= (+ (* 3 m) k2 1) k1)))), 36314#(and (or (= (+ i1 (* (- 1) k1)) 0) (<= n i2)) (or (<= (+ 6 (* 2 m)) (+ (* 2 n) k2)) (<= n i2)) (or (<= n i2) (<= (+ k2 (* 2 i1)) (* 2 m))) (or (= (+ (* (- 1) j1) i1) 0) (<= n i2))), 36288#(and (or (<= n i2) (<= (+ 3 k1 (* 2 i1)) (+ (* 2 n) k2 m))) (or (<= n i2) (<= (+ k2 m) (+ k1 1)))), 36312#(and (or (<= n (+ i2 1)) (<= (+ k1 (* 2 i1) 8) (+ (* 2 n) k2 (* 2 m)))) (or (<= n (+ i2 1)) (<= (+ (* 3 j1) k2) (+ 2 k1 m)))), 36290#(and (or (<= n i2) (<= (+ 6 k1 (* 2 i1)) (+ (* 2 n) k2 m))) (or (<= n i2) (<= (+ k2 m) (+ 2 k1)))), 36295#(and (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) (+ k1 1))) (or (<= n (+ i2 1)) (<= (+ 5 k1 (* 2 i1)) (+ (* 2 n) k2 (* 2 m))))), 36286#(and (or (<= n i2) (<= (+ k1 (* 2 i1)) (+ (* 2 n) k2 m)) (not (<= (+ k2 m 1) k1))) (or (<= n i2) (<= (+ k2 m) k1))), 36303#(and (or (< i1 n) (<= k2 k1)) (or (< i1 n) (< k1 (+ k2 1)))), 36310#(and (or (not (< 0 m)) (< (+ k1 1) k2) (< j1 m) (< 1 m) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (<= k2 (+ 2 k1)) (not (< 0 m)) (< j1 m) (< 1 m) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 36315#(and (or (<= n (+ i2 1)) (<= (+ k2 (* 2 i1)) m)) (or (= (+ (* (- 1) j1) i1) 0) (<= n (+ i2 1))) (or (= (+ i1 (* (- 1) k1)) 0) (<= n (+ i2 1))) (or (<= n (+ i2 1)) (<= (+ 6 m) (+ (* 2 n) k2)))), 36305#(and (or (< (+ j1 1) m) (< (+ i1 1) n) (not (< j1 m)) (< k1 k2)) (or (<= k2 (+ k1 1)) (< (+ j1 1) m) (< (+ i1 1) n) (not (< j1 m)))), 36308#(and (or (<= k2 (+ 2 k1)) (not (< 0 m)) (< (+ j1 1) m) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (not (< j1 m)) (< 1 m)) (or (not (< 0 m)) (< (+ k1 1) k2) (< (+ j1 1) m) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (not (< j1 m)) (< 1 m))), 36313#(and (or (<= n (+ 2 i2)) (<= (+ k1 (* 2 i1) 8) (+ (* 2 n) (* 3 m) k2))) (or (<= n (+ 2 i2)) (<= (+ (* 3 j1) k2) (+ 2 k1)))), 36309#(and (or (<= k2 (+ 2 k1)) (not (< 0 m)) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (< 1 m)) (or (not (< 0 m)) (< (+ k1 1) k2) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (< 1 m))), 36306#(and (or (not (< 0 m)) (< (+ i1 1) n) (not (< i1 n)) (< 1 m) (< k1 k2)) (or (not (< 0 m)) (<= k2 (+ k1 1)) (< (+ i1 1) n) (not (< i1 n)) (< 1 m))), 36291#(and (or (< k1 (+ k2 (* 2 m) 1)) (<= n (+ i2 1))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) k1))), 36296#(and (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) (+ 2 k1))) (or (<= n (+ i2 1)) (<= (+ 6 k1 (* 2 i1)) (+ (* 2 n) k2 (* 2 m))))), 36318#(and (or (not (< 0 m)) (<= k2 (+ 3 k1)) (< 1 m) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (< (+ 2 k1) k2) (not (< 0 m)) (< 1 m) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 36293#(and (or (<= (+ 2 k1 (* 2 i1)) (+ (* 2 n) k2 (* 2 m))) (<= n (+ i2 1)) (not (<= (+ k2 (* 2 m) 1) k1))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) k1))), 36287#(and (or (<= n i2) (not (<= (+ k2 m 1) k1)) (<= (+ 2 k1 (* 2 i1)) (+ (* 2 n) k2 m))) (or (<= n i2) (<= (+ k2 m) k1))), 36304#(and (or (< (+ i1 1) n) (< j1 m) (< k1 (+ k2 1))) (or (<= k2 k1) (< (+ i1 1) n) (< j1 m))), 36300#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ k1 1))) (or (<= n (+ 2 i2)) (<= (+ 3 k1 (* 2 i1)) (+ (* 2 n) (* 3 m) k2)))), 36285#(and (or (< k1 (+ k2 m 1)) (<= n i2)) (or (<= n i2) (<= (+ k2 m) k1))), 36297#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) k1)) (or (<= n (+ 2 i2)) (< k1 (+ (* 3 m) k2 1)))), 36301#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ k1 1))) (or (<= n (+ 2 i2)) (<= (+ 5 k1 (* 2 i1)) (+ (* 2 n) (* 3 m) k2)))), 36307#(and (or (not (< 0 m)) (not (< (+ i1 1) n)) (< j1 m) (< (+ 2 i1) n) (< 1 m) (< k1 k2)) (or (not (< 0 m)) (<= k2 (+ k1 1)) (not (< (+ i1 1) n)) (< j1 m) (< (+ 2 i1) n) (< 1 m))), 36294#(and (or (<= n (+ i2 1)) (<= (+ 3 k1 (* 2 i1)) (+ (* 2 n) k2 (* 2 m)))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) (+ k1 1)))), 36289#(and (or (<= n i2) (<= (+ 5 k1 (* 2 i1)) (+ (* 2 n) k2 m))) (or (<= n i2) (<= (+ k2 m) (+ k1 1)))), 36292#(and (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) k1)) (or (<= n (+ i2 1)) (not (<= (+ k2 (* 2 m) 1) k1)) (<= (+ k1 (* 2 i1)) (+ (* 2 n) k2 (* 2 m))))), 36311#(and (or (<= n i2) (<= (+ k1 (* 2 i1) 8) (+ (* 2 n) k2 m))) (or (<= (+ (* 3 j1) k2) (+ 2 k1 (* 2 m))) (<= n i2))), 36316#(and (or (= (+ (* (- 1) j1) i1) 0) (<= n (+ 2 i2))) (or (<= n (+ 2 i2)) (<= (+ k2 (* 2 i1)) 0)) (or (<= n (+ 2 i2)) (<= 6 (+ (* 2 n) k2))) (or (<= n (+ 2 i2)) (= (+ i1 (* (- 1) k1)) 0))), 36302#(and (or (<= n (+ 2 i2)) (<= (+ 6 k1 (* 2 i1)) (+ (* 2 n) (* 3 m) k2))) (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ 2 k1)))), 36317#(and (or (< (+ 2 k1) k2) (not (< 0 m)) (< (+ j1 1) m) (not (< j1 m)) (< 1 m) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (not (< 0 m)) (< (+ j1 1) m) (<= k2 (+ 3 k1)) (not (< j1 m)) (< 1 m) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 36298#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) k1)) (or (<= n (+ 2 i2)) (<= (+ k1 (* 2 i1)) (+ (* 2 n) (* 3 m) k2)) (not (<= (+ (* 3 m) k2 1) k1))))] [2022-03-15 20:43:34,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-15 20:43:34,398 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:34,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-15 20:43:34,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=3320, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 20:43:34,398 INFO L87 Difference]: Start difference. First operand 1151 states and 3009 transitions. Second operand has 48 states, 47 states have (on average 2.234042553191489) internal successors, (105), 47 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:18,531 INFO L93 Difference]: Finished difference Result 2495 states and 5506 transitions. [2022-03-15 20:44:18,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 270 states. [2022-03-15 20:44:18,531 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.234042553191489) internal successors, (105), 47 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 20:44:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:18,539 INFO L225 Difference]: With dead ends: 2495 [2022-03-15 20:44:18,540 INFO L226 Difference]: Without dead ends: 2444 [2022-03-15 20:44:18,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31164 ImplicationChecksByTransitivity, 43.4s TimeCoverageRelationStatistics Valid=10420, Invalid=78682, Unknown=0, NotChecked=0, Total=89102 [2022-03-15 20:44:18,545 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 824 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 3944 mSolverCounterSat, 889 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 889 IncrementalHoareTripleChecker+Valid, 3944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:18,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [824 Valid, 0 Invalid, 4833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [889 Valid, 3944 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 20:44:18,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2022-03-15 20:44:18,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 1198. [2022-03-15 20:44:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1197 states have (on average 2.6056808688387636) internal successors, (3119), 1197 states have internal predecessors, (3119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:18,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 3119 transitions. [2022-03-15 20:44:18,573 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 3119 transitions. Word has length 20 [2022-03-15 20:44:18,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:18,573 INFO L470 AbstractCegarLoop]: Abstraction has 1198 states and 3119 transitions. [2022-03-15 20:44:18,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.234042553191489) internal successors, (105), 47 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:18,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 3119 transitions. [2022-03-15 20:44:18,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:44:18,575 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:18,575 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:18,599 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 20:44:18,787 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 20:44:18,787 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:18,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:18,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1968165900, now seen corresponding path program 15 times [2022-03-15 20:44:18,789 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:18,789 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446139708] [2022-03-15 20:44:18,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:18,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:18,927 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:18,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446139708] [2022-03-15 20:44:18,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446139708] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:18,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397306302] [2022-03-15 20:44:18,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:44:18,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:18,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:18,929 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 20:44:18,929 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 20:44:18,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 20:44:18,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:18,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 20:44:18,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:44:19,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:44:19,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397306302] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:19,512 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:19,512 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2022-03-15 20:44:19,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1633310747] [2022-03-15 20:44:19,512 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:19,513 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:19,518 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 114 transitions. [2022-03-15 20:44:19,518 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:20,974 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [41851#(and (= j1 i1) (= k1 i1) (<= 0 (+ k2 i1)) (<= (+ k2 i1) 0)), 41847#(and (<= (+ (* 2 j1) k2) (+ 2 k1)) (<= (+ 2 k1) (+ (* 2 j1) k2))), 41834#(and (<= (+ k2 m) (+ 2 k1)) (<= (+ 2 k1) (+ k2 m))), 41841#(and (<= (+ k2 (* 2 m)) (+ 3 k1)) (<= (+ 3 k1) (+ k2 (* 2 m)))), 41842#(and (or (< (+ 2 k1) k2) (< 3 m) (<= m 2) (< j1 m)) (or (< 3 m) (<= k2 (+ 3 k1)) (<= m 2) (< j1 m))), 41843#(and (or (<= k2 (+ k1 4)) (< (+ j1 1) m) (< 3 m) (<= m 2) (not (< j1 m))) (or (< (+ j1 1) m) (< 3 m) (<= m 2) (not (< j1 m)) (< (+ 3 k1) k2))), 41849#(and (<= (+ (* 2 j1) k2) (+ k1 1)) (<= (+ k1 1) (+ (* 2 j1) k2))), 41837#(and (<= (+ 2 k1 m) (+ (* 2 j1) k2)) (<= (+ (* 2 j1) k2) (+ 2 k1 m))), 41832#(and (< k1 (+ k2 m 1)) (<= (+ k2 m) k1)), 41836#(and (<= (+ (* 2 j1) k2) (+ 3 k1 m)) (<= (+ 3 k1) (+ k2 m))), 41850#(and (= j1 i1) (= k1 i1) (<= m (+ k2 i1)) (<= (+ k2 i1) m)), 41838#(and (< k1 (+ k2 (* 2 m) 1)) (<= (+ k2 (* 2 m)) k1)), 41793#(or (not (< (+ j1 1) m)) (< (+ 2 j1) m) (and (<= k2 (+ 2 k1)) (< (+ k1 1) k2))), 41833#(and (<= (+ k1 1) (+ k2 m)) (<= (+ k2 m) (+ k1 1))), 41840#(and (<= (+ 2 k1) (+ k2 (* 2 m))) (<= (+ k2 (* 2 m)) (+ 2 k1))), 41844#(and (or (not (< (+ j1 1) m)) (< (+ 2 j1) m) (< (+ k1 4) k2) (< 3 m) (<= m 2)) (or (not (< (+ j1 1) m)) (<= k2 (+ 5 k1)) (< (+ 2 j1) m) (< 3 m) (<= m 2))), 41785#(or (and (<= k2 k1) (< k1 (+ k2 1))) (< j1 m)), 41835#(and (<= (+ k2 m) (+ 3 k1)) (<= (+ 3 k1) (+ k2 m))), 41846#(and (<= (+ (* 2 j1) k2) (+ 3 k1)) (<= (+ 3 k1) (+ k2 (* 2 m)))), 41816#(or (< 3 m) (and (< (+ 5 k1) k2) (<= k2 (+ 6 k1))) (not (< 2 m))), 41789#(or (< (+ j1 1) m) (and (<= k2 (+ k1 1)) (< k1 k2)) (not (< j1 m))), 41839#(and (<= (+ k2 (* 2 m)) (+ k1 1)) (<= (+ k1 1) (+ k2 (* 2 m)))), 41845#(and (or (< (+ 3 j1) m) (not (< (+ 2 j1) m)) (< 3 m) (<= k2 (+ 6 k1)) (<= m 2)) (or (< (+ 5 k1) k2) (< (+ 3 j1) m) (not (< (+ 2 j1) m)) (< 3 m) (<= m 2))), 41848#(and (<= (+ (* 2 j1) k2) (+ k1 m 1)) (<= (+ k1 m 1) (+ (* 2 j1) k2))), 41797#(or (< (+ 3 j1) m) (not (< (+ 2 j1) m)) (and (< (+ 2 k1) k2) (<= k2 (+ 3 k1)))), 41801#(or (and (< (+ 2 k1) k2) (<= k2 (+ 3 k1))) (< 3 m) (not (< 2 m)))] [2022-03-15 20:44:20,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 20:44:20,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:20,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 20:44:20,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 20:44:20,976 INFO L87 Difference]: Start difference. First operand 1198 states and 3119 transitions. Second operand has 39 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 38 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:29,413 INFO L93 Difference]: Finished difference Result 4099 states and 10481 transitions. [2022-03-15 20:44:29,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-03-15 20:44:29,414 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 38 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 20:44:29,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:29,429 INFO L225 Difference]: With dead ends: 4099 [2022-03-15 20:44:29,429 INFO L226 Difference]: Without dead ends: 4074 [2022-03-15 20:44:29,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 37 SyntacticMatches, 11 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5360 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1914, Invalid=19842, Unknown=0, NotChecked=0, Total=21756 [2022-03-15 20:44:29,431 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 402 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 5059 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 5059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:29,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 0 Invalid, 5335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 5059 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 20:44:29,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4074 states. [2022-03-15 20:44:29,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4074 to 1828. [2022-03-15 20:44:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1827 states have (on average 2.649151614668856) internal successors, (4840), 1827 states have internal predecessors, (4840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:29,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 4840 transitions. [2022-03-15 20:44:29,511 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 4840 transitions. Word has length 20 [2022-03-15 20:44:29,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:29,511 INFO L470 AbstractCegarLoop]: Abstraction has 1828 states and 4840 transitions. [2022-03-15 20:44:29,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 38 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:29,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 4840 transitions. [2022-03-15 20:44:29,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:44:29,514 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:29,514 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:29,539 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 20:44:29,726 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 20:44:29,726 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:29,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:29,727 INFO L85 PathProgramCache]: Analyzing trace with hash 682077057, now seen corresponding path program 8 times [2022-03-15 20:44:29,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:29,727 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382550890] [2022-03-15 20:44:29,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:29,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:29,793 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:29,793 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:29,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382550890] [2022-03-15 20:44:29,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382550890] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:29,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730845997] [2022-03-15 20:44:29,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:44:29,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:29,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:29,795 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 20:44:29,795 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 20:44:29,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:44:29,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:29,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:44:29,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:29,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:29,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730845997] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:29,909 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:29,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 12 [2022-03-15 20:44:29,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1446968856] [2022-03-15 20:44:29,909 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:29,910 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:29,917 INFO L252 McrAutomatonBuilder]: Finished intersection with 91 states and 159 transitions. [2022-03-15 20:44:29,917 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:30,894 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [49936#(<= n i2), 49949#(or (<= n (+ i2 1)) (<= (+ 2 i1) n)), 49948#(or (<= n (+ 2 i2)) (< i1 n)), 49969#(or (<= n (+ 3 i1)) (<= (+ 5 i1) n)), 49959#(or (<= n (+ 3 i2)) (<= (+ i1 4) n)), 49961#(or (< i1 n) (<= n (+ i2 4))), 49938#(or (<= n i2) (<= (+ 2 i1) n)), 49964#(or (<= n (+ i2 4)) (<= (+ i1 4) n)), 49965#(or (<= n (+ i2 1)) (<= (+ 5 i1) n)), 49937#(or (< i1 n) (<= n i2)), 49957#(or (<= n (+ 2 i2)) (<= (+ i1 4) n)), 49956#(or (<= n (+ 2 i2)) (<= (+ 3 i1) n)), 49944#(or (<= n (+ 2 i1)) (<= (+ i1 4) n)), 49960#(<= n (+ i2 4)), 49946#(or (< i1 n) (<= n (+ i2 1))), 49968#(or (<= n (+ i2 4)) (<= (+ 5 i1) n)), 49955#(or (<= n (+ i2 1)) (<= (+ i1 4) n)), 49942#(or (<= (+ 2 i1) n) (<= n i1)), 49958#(or (<= n (+ 3 i2)) (<= (+ 3 i1) n)), 49941#(or (<= n i2) (<= (+ 5 i1) n)), 49967#(or (<= n (+ 3 i2)) (<= (+ 5 i1) n)), 49954#(or (<= (+ 3 i1) n) (<= n (+ i2 1))), 49950#(or (<= n (+ 2 i2)) (<= (+ 2 i1) n)), 49963#(or (<= n (+ i2 4)) (<= (+ 3 i1) n)), 49966#(or (<= n (+ 2 i2)) (<= (+ 5 i1) n)), 49943#(or (<= (+ 3 i1) n) (<= n (+ i1 1))), 49947#(<= n (+ 2 i2)), 49952#(or (<= n (+ 3 i2)) (< i1 n)), 49940#(or (<= n i2) (<= (+ i1 4) n)), 49945#(<= n (+ i2 1)), 49939#(or (<= n i2) (<= (+ 3 i1) n)), 49951#(<= n (+ 3 i2)), 49962#(or (<= n (+ i2 4)) (<= (+ 2 i1) n)), 49953#(or (<= n (+ 3 i2)) (<= (+ 2 i1) n))] [2022-03-15 20:44:30,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 20:44:30,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:30,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 20:44:30,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=1560, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 20:44:30,895 INFO L87 Difference]: Start difference. First operand 1828 states and 4840 transitions. Second operand has 46 states, 46 states have (on average 2.608695652173913) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:32,175 INFO L93 Difference]: Finished difference Result 3808 states and 10262 transitions. [2022-03-15 20:44:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-15 20:44:32,176 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.608695652173913) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 20:44:32,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:32,187 INFO L225 Difference]: With dead ends: 3808 [2022-03-15 20:44:32,187 INFO L226 Difference]: Without dead ends: 3803 [2022-03-15 20:44:32,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2907 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2741, Invalid=6571, Unknown=0, NotChecked=0, Total=9312 [2022-03-15 20:44:32,189 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 246 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:32,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 0 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:44:32,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3803 states. [2022-03-15 20:44:32,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3803 to 2460. [2022-03-15 20:44:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2460 states, 2459 states have (on average 2.708418056120374) internal successors, (6660), 2459 states have internal predecessors, (6660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:32,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 6660 transitions. [2022-03-15 20:44:32,236 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 6660 transitions. Word has length 21 [2022-03-15 20:44:32,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:32,236 INFO L470 AbstractCegarLoop]: Abstraction has 2460 states and 6660 transitions. [2022-03-15 20:44:32,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.608695652173913) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:32,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 6660 transitions. [2022-03-15 20:44:32,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:44:32,239 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:32,239 INFO L514 BasicCegarLoop]: trace histogram [7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:32,263 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 20:44:32,455 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 20:44:32,455 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:32,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:32,456 INFO L85 PathProgramCache]: Analyzing trace with hash 119166659, now seen corresponding path program 16 times [2022-03-15 20:44:32,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:32,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591114784] [2022-03-15 20:44:32,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:32,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:32,532 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:44:32,533 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:32,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591114784] [2022-03-15 20:44:32,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591114784] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:32,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679440711] [2022-03-15 20:44:32,533 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:44:32,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:32,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:32,536 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 20:44:32,563 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 20:44:32,567 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:44:32,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:32,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:44:32,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:44:32,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:32,717 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:44:32,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679440711] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:32,717 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:32,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2022-03-15 20:44:32,718 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [928308880] [2022-03-15 20:44:32,718 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:32,719 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:32,726 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 123 transitions. [2022-03-15 20:44:32,726 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:33,178 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [58941#(or (< (+ 3 j1) m) (<= m (+ 2 j1))), 58943#(or (<= m 3) (< 4 m)), 58946#(or (<= m (+ j1 1)) (< (+ 2 j1) m) (<= m 3) (< 4 m)), 58945#(or (<= m j1) (< (+ j1 1) m) (<= m 3) (< 4 m)), 58944#(or (< j1 m) (<= m 3) (< 4 m)), 58947#(or (< (+ 3 j1) m) (<= m (+ 2 j1)) (<= m 3) (< 4 m)), 58942#(or (< (+ j1 4) m) (<= m (+ 3 j1))), 58939#(or (<= m j1) (< (+ j1 1) m)), 58938#(< j1 m), 58940#(or (<= m (+ j1 1)) (< (+ 2 j1) m))] [2022-03-15 20:44:33,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 20:44:33,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:33,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 20:44:33,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:44:33,179 INFO L87 Difference]: Start difference. First operand 2460 states and 6660 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) 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 20:44:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:33,495 INFO L93 Difference]: Finished difference Result 4481 states and 12114 transitions. [2022-03-15 20:44:33,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:44:33,495 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) 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 21 [2022-03-15 20:44:33,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:33,504 INFO L225 Difference]: With dead ends: 4481 [2022-03-15 20:44:33,504 INFO L226 Difference]: Without dead ends: 4476 [2022-03-15 20:44:33,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=415, Invalid=1391, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 20:44:33,504 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 209 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:33,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 0 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:44:33,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4476 states. [2022-03-15 20:44:33,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4476 to 4335. [2022-03-15 20:44:33,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4335 states, 4334 states have (on average 2.7392708814028612) internal successors, (11872), 4334 states have internal predecessors, (11872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:33,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4335 states to 4335 states and 11872 transitions. [2022-03-15 20:44:33,568 INFO L78 Accepts]: Start accepts. Automaton has 4335 states and 11872 transitions. Word has length 21 [2022-03-15 20:44:33,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:33,568 INFO L470 AbstractCegarLoop]: Abstraction has 4335 states and 11872 transitions. [2022-03-15 20:44:33,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) 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 20:44:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 4335 states and 11872 transitions. [2022-03-15 20:44:33,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:44:33,572 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:33,572 INFO L514 BasicCegarLoop]: trace histogram [7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:33,591 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 20:44:33,783 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 20:44:33,783 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:33,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:33,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1176685747, now seen corresponding path program 17 times [2022-03-15 20:44:33,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:33,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112501992] [2022-03-15 20:44:33,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:33,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:33,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:33,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112501992] [2022-03-15 20:44:33,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112501992] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:33,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905442402] [2022-03-15 20:44:33,870 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:44:33,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:33,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:33,871 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 20:44:33,873 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 20:44:33,893 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 20:44:33,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:33,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:44:33,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:33,999 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:34,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:34,035 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:34,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905442402] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:34,035 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:34,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 21 [2022-03-15 20:44:34,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [57588471] [2022-03-15 20:44:34,035 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:34,037 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:34,042 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 123 transitions. [2022-03-15 20:44:34,042 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:34,680 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [72272#(or (<= m 2) (< j1 m) (<= 4 m)), 72269#(or (<= (+ j1 4) m) (<= m j1)), 72280#(or (< (+ 3 j1) m) (<= m (+ 2 j1)) (<= 4 m) (<= m 0)), 72268#(or (<= (+ j1 4) m) (<= m (+ 2 j1))), 72279#(or (<= m (+ j1 1)) (< (+ 2 j1) m) (<= 4 m) (<= m 0)), 72274#(or (<= m j1) (< (+ j1 1) m) (<= m 2) (<= 4 m)), 72277#(or (<= m 2) (<= 4 m) (< (+ j1 4) m) (<= m (+ 3 j1))), 72281#(or (<= 4 m) (< (+ j1 4) m) (<= m (+ 3 j1)) (<= m 0)), 72278#(or (<= m j1) (< (+ j1 1) m) (<= 4 m) (<= m 0)), 72267#(or (<= m (+ j1 1)) (<= (+ 3 j1) m)), 72271#(or (<= 4 m) (<= m 0)), 72275#(or (<= m (+ j1 1)) (< (+ 2 j1) m) (<= m 2) (<= 4 m)), 72276#(or (< (+ 3 j1) m) (<= m (+ 2 j1)) (<= m 2) (<= 4 m)), 72266#(or (<= m j1) (<= (+ 2 j1) m)), 72270#(or (<= m 2) (<= 4 m)), 72273#(or (< j1 m) (<= 4 m) (<= m 0))] [2022-03-15 20:44:34,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 20:44:34,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:34,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 20:44:34,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1024, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 20:44:34,681 INFO L87 Difference]: Start difference. First operand 4335 states and 11872 transitions. Second operand has 29 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 29 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:35,204 INFO L93 Difference]: Finished difference Result 3101 states and 8100 transitions. [2022-03-15 20:44:35,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 20:44:35,205 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 29 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 20:44:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:35,211 INFO L225 Difference]: With dead ends: 3101 [2022-03-15 20:44:35,211 INFO L226 Difference]: Without dead ends: 3101 [2022-03-15 20:44:35,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=663, Invalid=2199, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 20:44:35,212 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 275 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:35,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 0 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:44:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2022-03-15 20:44:35,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 2426. [2022-03-15 20:44:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2426 states, 2425 states have (on average 2.6523711340206186) internal successors, (6432), 2425 states have internal predecessors, (6432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 6432 transitions. [2022-03-15 20:44:35,253 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 6432 transitions. Word has length 21 [2022-03-15 20:44:35,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:35,254 INFO L470 AbstractCegarLoop]: Abstraction has 2426 states and 6432 transitions. [2022-03-15 20:44:35,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 29 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:35,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 6432 transitions. [2022-03-15 20:44:35,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 20:44:35,257 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:35,257 INFO L514 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:35,281 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 20:44:35,479 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 20:44:35,479 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:35,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:35,479 INFO L85 PathProgramCache]: Analyzing trace with hash 951327806, now seen corresponding path program 18 times [2022-03-15 20:44:35,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:35,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879997125] [2022-03-15 20:44:35,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:35,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:35,654 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:35,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879997125] [2022-03-15 20:44:35,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879997125] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:35,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475346685] [2022-03-15 20:44:35,654 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:44:35,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:35,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:35,656 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 20:44:35,657 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 20:44:35,679 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-03-15 20:44:35,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:35,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 20:44:35,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:35,911 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:44:35,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:44:36,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475346685] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:36,206 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:36,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 27 [2022-03-15 20:44:36,207 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [8284674] [2022-03-15 20:44:36,207 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:36,208 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:36,214 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 132 transitions. [2022-03-15 20:44:36,214 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:38,210 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [80443#(and (<= (+ k1 1) (+ k2 m)) (<= (+ k2 m) (+ k1 1))), 80448#(and (<= (+ k2 m) (+ k1 4)) (<= (+ k1 4) (+ k2 m))), 80451#(and (<= (+ 2 k1 m) (+ (* 2 j1) k2)) (<= (+ (* 2 j1) k2) (+ 2 k1 m))), 80441#(and (< k1 (+ k2 m 1)) (<= (+ k2 m) k1)), 80458#(and (<= (+ (* 2 j1) k2) (+ 2 k1)) (<= (+ 2 k1) (+ (* 2 j1) k2))), 80465#(and (or (<= k2 (+ k1 4)) (not (< (+ 3 j1) m)) (< (+ j1 4) m)) (or (not (< (+ 3 j1) m)) (< (+ j1 4) m) (< (+ 3 k1) k2))), 80453#(and (= j1 i1) (= k1 i1) (<= m (+ k2 i1)) (<= (+ k2 i1) m)), 80444#(and (<= (+ k2 (* 2 m)) (+ k1 1)) (<= (+ k1 1) (+ k2 (* 2 m)))), 80442#(and (< k1 (+ k2 (* 2 m) 1)) (<= (+ k2 (* 2 m)) k1)), 80455#(and (<= (+ k2 (* 2 m)) (+ k1 4)) (<= (+ k1 4) (+ k2 (* 2 m)))), 80466#(and (or (< j1 m) (<= m 3) (< 4 m) (<= (+ k2 m) (+ k1 8))) (or (<= (+ k1 8) (+ k2 m)) (< j1 m) (<= m 3) (< 4 m))), 80450#(and (<= (+ (* 2 j1) k2) (+ 3 k1 m)) (<= (+ 3 k1 m) (+ (* 2 j1) k2))), 80460#(and (= j1 i1) (= k1 i1) (<= 0 (+ k2 i1)) (<= (+ k2 i1) 0)), 80449#(and (<= (+ (* 2 j1) k2) (+ k1 m 4)) (<= (+ k1 4) (+ k2 m))), 80427#(or (and (<= (+ k1 8) k2) (<= k2 (+ k1 8))) (not (< 3 m)) (< 4 m)), 80462#(and (or (< (+ j1 1) m) (not (< j1 m)) (< k1 k2)) (or (<= k2 (+ k1 1)) (< (+ j1 1) m) (not (< j1 m)))), 80456#(and (<= (+ k1 4) (+ k2 (* 2 m))) (<= (+ (* 2 j1) k2) (+ k1 4))), 80447#(and (<= (+ k2 m) (+ 3 k1)) (<= (+ 3 k1) (+ k2 m))), 80457#(and (<= (+ (* 2 j1) k2) (+ 3 k1)) (<= (+ 3 k1) (+ (* 2 j1) k2))), 80459#(and (<= (+ (* 2 j1) k2) (+ k1 1)) (<= (+ k1 1) (+ (* 2 j1) k2))), 80454#(and (<= (+ k2 (* 2 m)) (+ 3 k1)) (<= (+ 3 k1) (+ k2 (* 2 m)))), 80461#(and (or (< j1 m) (< k1 (+ k2 1))) (or (<= k2 k1) (< j1 m))), 80446#(and (<= (+ 2 k1) (+ k2 (* 2 m))) (<= (+ k2 (* 2 m)) (+ 2 k1))), 80468#(and (or (not (< (+ j1 1) m)) (<= (+ k2 m) (+ k1 10)) (< (+ 2 j1) m) (<= m 3) (< 4 m)) (or (not (< (+ j1 1) m)) (< (+ 2 j1) m) (<= (+ k1 10) (+ k2 m)) (<= m 3) (< 4 m))), 80445#(and (<= (+ k2 m) (+ 2 k1)) (<= (+ 2 k1) (+ k2 m))), 80452#(and (<= (+ (* 2 j1) k2) (+ k1 m 1)) (<= (+ k1 m 1) (+ (* 2 j1) k2))), 80467#(and (or (< (+ j1 1) m) (<= (+ 9 k1) (+ k2 m)) (not (< j1 m)) (<= m 3) (< 4 m)) (or (<= (+ k2 m) (+ 9 k1)) (< (+ j1 1) m) (not (< j1 m)) (<= m 3) (< 4 m))), 80470#(and (or (not (< (+ 3 j1) m)) (<= (+ k1 12) (+ k2 m)) (<= m 3) (< (+ j1 4) m) (< 4 m)) (or (<= (+ k2 m) (+ k1 12)) (not (< (+ 3 j1) m)) (<= m 3) (< (+ j1 4) m) (< 4 m))), 80463#(and (or (not (< (+ j1 1) m)) (< (+ k1 1) k2) (< (+ 2 j1) m)) (or (not (< (+ j1 1) m)) (<= k2 (+ 2 k1)) (< (+ 2 j1) m))), 80431#(or (not (< 3 m)) (and (<= (+ k1 8) (+ k2 m)) (<= (+ k2 m) (+ k1 8))) (< 4 m)), 80469#(and (or (< (+ 3 j1) m) (not (< (+ 2 j1) m)) (<= (+ k2 m) (+ k1 11)) (<= m 3) (< 4 m)) (or (< (+ 3 j1) m) (not (< (+ 2 j1) m)) (<= (+ k1 11) (+ k2 m)) (<= m 3) (< 4 m))), 80464#(and (or (< (+ 3 j1) m) (not (< (+ 2 j1) m)) (<= k2 (+ 3 k1))) (or (< (+ 2 k1) k2) (< (+ 3 j1) m) (not (< (+ 2 j1) m))))] [2022-03-15 20:44:38,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 20:44:38,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:38,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 20:44:38,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3237, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 20:44:38,211 INFO L87 Difference]: Start difference. First operand 2426 states and 6432 transitions. Second operand has 47 states, 46 states have (on average 2.260869565217391) internal successors, (104), 46 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:52,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:52,316 INFO L93 Difference]: Finished difference Result 7919 states and 20856 transitions. [2022-03-15 20:44:52,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-03-15 20:44:52,317 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.260869565217391) internal successors, (104), 46 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 20:44:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:52,334 INFO L225 Difference]: With dead ends: 7919 [2022-03-15 20:44:52,334 INFO L226 Difference]: Without dead ends: 7894 [2022-03-15 20:44:52,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10054 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=3171, Invalid=32739, Unknown=0, NotChecked=0, Total=35910 [2022-03-15 20:44:52,337 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 556 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 7096 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 7096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:52,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [556 Valid, 0 Invalid, 7489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 7096 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 20:44:52,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7894 states. [2022-03-15 20:44:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7894 to 3418. [2022-03-15 20:44:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3418 states, 3417 states have (on average 2.684225929177641) internal successors, (9172), 3417 states have internal predecessors, (9172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 9172 transitions. [2022-03-15 20:44:52,432 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 9172 transitions. Word has length 22 [2022-03-15 20:44:52,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:52,432 INFO L470 AbstractCegarLoop]: Abstraction has 3418 states and 9172 transitions. [2022-03-15 20:44:52,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.260869565217391) internal successors, (104), 46 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:52,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 9172 transitions. [2022-03-15 20:44:52,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 20:44:52,435 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:52,435 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:52,457 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 20:44:52,651 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 20:44:52,651 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:52,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:52,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1035358142, now seen corresponding path program 19 times [2022-03-15 20:44:52,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:52,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236686539] [2022-03-15 20:44:52,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:44:52,708 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:52,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236686539] [2022-03-15 20:44:52,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236686539] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:52,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245559562] [2022-03-15 20:44:52,709 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:44:52,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:52,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:52,712 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 20:44:52,715 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 20:44:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:52,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:44:52,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-15 20:44:52,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-15 20:44:52,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245559562] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:52,836 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:52,837 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2022-03-15 20:44:52,837 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [141031286] [2022-03-15 20:44:52,837 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:52,838 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:52,846 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 132 transitions. [2022-03-15 20:44:52,846 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:53,571 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [95629#(or (<= n i2) (<= (+ n 1) i1) (< (+ i2 1) n)), 95635#(or (<= n (+ i2 1)) (<= n (+ i1 1)) (< (+ 2 i2) n)), 95630#(or (<= n i2) (<= n i1) (< (+ i2 1) n)), 95628#(or (<= n i2) (< (+ i2 1) n)), 95632#(or (<= (+ n 1) i1) (<= n (+ i2 1)) (< (+ 2 i2) n)), 95634#(or (<= n i2) (< (+ i2 1) n) (<= n (+ i1 1))), 95626#(or (<= n i1) (< i2 n)), 95627#(or (<= n (+ i1 1)) (< i2 n)), 95633#(or (<= n (+ i2 1)) (<= n i1) (< (+ 2 i2) n)), 95625#(or (<= (+ n 1) i1) (< i2 n)), 95637#(or (<= n (+ i2 1)) (<= i2 i1)), 95636#(or (<= n i2) (<= i2 (+ i1 1))), 95631#(or (<= n (+ i2 1)) (< (+ 2 i2) n)), 95624#(< i2 n)] [2022-03-15 20:44:53,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:44:53,572 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:53,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:44:53,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:44:53,572 INFO L87 Difference]: Start difference. First operand 3418 states and 9172 transitions. Second operand has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 22 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:54,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:54,183 INFO L93 Difference]: Finished difference Result 5870 states and 15177 transitions. [2022-03-15 20:44:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 20:44:54,183 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 22 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 20:44:54,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:54,193 INFO L225 Difference]: With dead ends: 5870 [2022-03-15 20:44:54,193 INFO L226 Difference]: Without dead ends: 5759 [2022-03-15 20:44:54,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=759, Invalid=2103, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 20:44:54,194 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:54,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:44:54,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5759 states. [2022-03-15 20:44:54,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5759 to 3917. [2022-03-15 20:44:54,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3917 states, 3916 states have (on average 2.6555158324821244) internal successors, (10399), 3916 states have internal predecessors, (10399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3917 states to 3917 states and 10399 transitions. [2022-03-15 20:44:54,285 INFO L78 Accepts]: Start accepts. Automaton has 3917 states and 10399 transitions. Word has length 22 [2022-03-15 20:44:54,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:54,285 INFO L470 AbstractCegarLoop]: Abstraction has 3917 states and 10399 transitions. [2022-03-15 20:44:54,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 22 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:54,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3917 states and 10399 transitions. [2022-03-15 20:44:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:44:54,289 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:54,289 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:54,314 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 20:44:54,511 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 20:44:54,511 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:54,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:54,512 INFO L85 PathProgramCache]: Analyzing trace with hash 100055514, now seen corresponding path program 9 times [2022-03-15 20:44:54,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:54,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207867947] [2022-03-15 20:44:54,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:54,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-15 20:44:54,640 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:54,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207867947] [2022-03-15 20:44:54,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207867947] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:54,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160004629] [2022-03-15 20:44:54,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:44:54,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:54,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:54,641 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 20:44:54,642 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 20:44:54,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:44:54,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:54,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 20:44:54,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:54,844 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-15 20:44:54,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-15 20:44:55,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160004629] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:55,179 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:55,179 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-03-15 20:44:55,179 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1827651083] [2022-03-15 20:44:55,180 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:55,181 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:55,190 INFO L252 McrAutomatonBuilder]: Finished intersection with 107 states and 189 transitions. [2022-03-15 20:44:55,190 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:57,239 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [109559#(and (= (+ k2 m) k1) (<= (+ k2 m) 0) (< 0 (+ k2 m 1))), 109561#(and (< 0 (+ (* 3 m) k2 1)) (= (+ (* 3 m) k2) k1) (<= (+ (* 3 m) k2) 0)), 109566#(and (or (< 0 m) (= k2 k1)) (or (< 0 m) (< 0 (+ k2 1))) (or (< 0 m) (<= k2 0))), 109560#(and (<= (+ k2 (* 2 m)) 0) (= k1 (+ k2 (* 2 m))) (< 0 (+ k2 (* 2 m) 1))), 109564#(and (= j1 0) (or (= (+ k2 m) k1) (not (= (+ k2 m) 0))) (< 0 (+ k2 m 1)) (or (<= (+ k2 m) 0) (<= k2 (* m 4)))), 109568#(and (= j1 0) (or (= k1 (+ k2 (* 2 m))) (not (= (+ k2 (* 2 m)) 0))) (or (<= k2 (* 3 m)) (<= (+ k2 (* 2 m)) 0)) (< 0 (+ k2 (* 2 m) 1))), 109571#(and (or (= k1 (+ (* 5 m) k2)) (not (= (+ (* 5 m) k2) 0))) (= j1 0) (or (<= (+ (* 5 m) k2) 0) (<= k2 0)) (< 0 (+ (* 5 m) k2 1))), 109562#(and (= (+ (* m 4) k2) k1) (<= (+ (* m 4) k2) 0) (< 0 (+ (* m 4) k2 1))), 109567#(and (or (< 0 m) (< j1 m) (<= k2 0)) (or (< 0 m) (< 0 (+ k2 1)) (< j1 m)) (or (< 0 m) (= k2 k1) (< j1 m))), 109569#(and (< 0 (+ (* 3 m) k2 1)) (= j1 0) (or (<= k2 (* 2 m)) (<= (+ (* 3 m) k2) 0)) (or (not (= (+ (* 3 m) k2) 0)) (= (+ (* 3 m) k2) k1))), 109565#(and (or (= k2 k1) (< j1 m)) (or (< j1 m) (<= k2 0)) (or (< 0 (+ k2 1)) (< j1 m))), 109563#(and (<= (+ (* 5 m) k2) 0) (< 0 (+ (* 5 m) k2 1)) (= k1 (+ (* 5 m) k2))), 109570#(and (= j1 0) (or (<= k2 m) (<= (+ (* m 4) k2) 0)) (< 0 (+ (* m 4) k2 1)) (or (= (+ (* m 4) k2) k1) (not (= (+ (* m 4) k2) 0))))] [2022-03-15 20:44:57,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:44:57,240 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:57,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:44:57,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1205, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 20:44:57,240 INFO L87 Difference]: Start difference. First operand 3917 states and 10399 transitions. Second operand has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:57,880 INFO L93 Difference]: Finished difference Result 4087 states and 10841 transitions. [2022-03-15 20:44:57,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 20:44:57,882 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 20:44:57,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:57,887 INFO L225 Difference]: With dead ends: 4087 [2022-03-15 20:44:57,887 INFO L226 Difference]: Without dead ends: 3949 [2022-03-15 20:44:57,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=469, Invalid=1981, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 20:44:57,888 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 135 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:57,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 0 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:44:57,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3949 states. [2022-03-15 20:44:57,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3949 to 3921. [2022-03-15 20:44:57,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3920 states have (on average 2.6548469387755103) internal successors, (10407), 3920 states have internal predecessors, (10407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:57,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 10407 transitions. [2022-03-15 20:44:57,950 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 10407 transitions. Word has length 23 [2022-03-15 20:44:57,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:57,950 INFO L470 AbstractCegarLoop]: Abstraction has 3921 states and 10407 transitions. [2022-03-15 20:44:57,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:57,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 10407 transitions. [2022-03-15 20:44:57,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:44:57,954 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:57,954 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:57,976 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 20:44:58,167 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 20:44:58,167 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:58,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:58,168 INFO L85 PathProgramCache]: Analyzing trace with hash -931958083, now seen corresponding path program 20 times [2022-03-15 20:44:58,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:58,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907205829] [2022-03-15 20:44:58,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:58,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:58,215 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 20:44:58,215 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:58,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907205829] [2022-03-15 20:44:58,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907205829] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:58,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785937802] [2022-03-15 20:44:58,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:44:58,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:58,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:58,217 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 20:44:58,218 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 20:44:58,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:44:58,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:58,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:44:58,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 20:44:58,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 20:44:58,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785937802] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:58,334 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:58,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-03-15 20:44:58,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2140587216] [2022-03-15 20:44:58,335 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:58,336 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:58,346 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 161 transitions. [2022-03-15 20:44:58,346 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:59,199 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [121672#(or (<= n i2) (<= i2 i1)), 121682#(or (<= n i2) (<= i2 (+ 2 i1))), 121678#(or (<= n (+ 2 i2)) (<= (+ i2 4) n)), 121681#(or (<= n (+ 2 i2)) (<= (+ i2 1) i1)), 121666#(< (+ i1 1) n), 121677#(or (<= n (+ i2 1)) (<= i2 i1)), 121668#(or (< (+ 2 i1) n) (<= n (+ i1 1))), 121685#(or (< (+ i1 4) n) (<= n (+ 3 i1))), 121674#(or (<= n (+ i2 1)) (<= (+ 3 i2) n)), 121675#(or (<= n (+ i2 1)) (<= (+ 2 i2) i1)), 121684#(or (<= n (+ 2 i2)) (<= i2 i1)), 121669#(or (<= n (+ 2 i1)) (< (+ 3 i1) n)), 121676#(or (<= n (+ i2 1)) (<= (+ i2 1) i1)), 121671#(or (<= n i2) (<= (+ i2 1) i1)), 121667#(or (< (+ i1 1) n) (<= n i1)), 121670#(or (<= n i2) (<= (+ 2 i2) n)), 121680#(or (<= n (+ 2 i2)) (<= (+ 2 i2) i1)), 121679#(or (<= n (+ 2 i2)) (<= (+ 3 i2) i1)), 121665#(< i1 n), 121673#(or (<= n i2) (<= i2 (+ i1 1))), 121683#(or (<= i2 (+ i1 1)) (<= n (+ i2 1)))] [2022-03-15 20:44:59,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 20:44:59,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:59,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 20:44:59,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:44:59,200 INFO L87 Difference]: Start difference. First operand 3921 states and 10407 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:01,625 INFO L93 Difference]: Finished difference Result 5939 states and 14526 transitions. [2022-03-15 20:45:01,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-15 20:45:01,625 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 20:45:01,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:01,633 INFO L225 Difference]: With dead ends: 5939 [2022-03-15 20:45:01,633 INFO L226 Difference]: Without dead ends: 5939 [2022-03-15 20:45:01,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2137 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1911, Invalid=6461, Unknown=0, NotChecked=0, Total=8372 [2022-03-15 20:45:01,634 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 376 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:01,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 0 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:45:01,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5939 states. [2022-03-15 20:45:01,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5939 to 4292. [2022-03-15 20:45:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4292 states, 4291 states have (on average 2.5791190864600324) internal successors, (11067), 4291 states have internal predecessors, (11067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:01,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 11067 transitions. [2022-03-15 20:45:01,736 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 11067 transitions. Word has length 23 [2022-03-15 20:45:01,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:01,736 INFO L470 AbstractCegarLoop]: Abstraction has 4292 states and 11067 transitions. [2022-03-15 20:45:01,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:01,736 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 11067 transitions. [2022-03-15 20:45:01,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:45:01,740 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:01,740 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:01,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 20:45:01,959 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 20:45:01,959 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:01,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:01,960 INFO L85 PathProgramCache]: Analyzing trace with hash 965917544, now seen corresponding path program 21 times [2022-03-15 20:45:01,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:01,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646507866] [2022-03-15 20:45:01,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:01,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:02,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:02,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646507866] [2022-03-15 20:45:02,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646507866] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:02,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389615906] [2022-03-15 20:45:02,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:45:02,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:02,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:02,191 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 20:45:02,191 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 20:45:02,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-03-15 20:45:02,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:02,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 20:45:02,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:45:02,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:45:02,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389615906] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:02,900 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:02,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 9] total 33 [2022-03-15 20:45:02,900 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [161498104] [2022-03-15 20:45:02,900 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:02,902 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:02,910 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 161 transitions. [2022-03-15 20:45:02,910 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:06,953 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 46 new interpolants: [136539#(and (or (<= k2 (+ k1 4)) (not (< (+ j1 1) m)) (< 2 m) (< (+ 2 j1) m) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (not (< 1 m))) (or (not (< (+ j1 1) m)) (< 2 m) (< (+ 2 j1) m) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (not (< 1 m)) (< (+ 3 k1) k2))), 136522#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) k1)) (or (<= (+ 2 k1 (* 2 i1)) (+ (* 2 n) (* 3 m) k2)) (<= n (+ 2 i2)) (not (<= (+ (* 3 m) k2 1) k1)))), 136517#(and (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) (+ 2 k1))) (or (<= n (+ i2 1)) (<= (+ k1 (* 2 i1) 4) (+ (* 2 n) k2 (* 2 m))))), 136510#(and (or (< i1 n) (<= k2 k1)) (or (< i1 n) (< k1 (+ k2 1)))), 136527#(and (or (<= n i2) (<= (+ k1 (* 2 i1) 8) (+ (* 2 n) k2 m))) (or (<= n i2) (<= (+ k2 m) (+ k1 4)))), 136504#(and (or (<= n i2) (not (<= (+ k2 m 1) k1)) (<= (+ 2 k1 (* 2 i1)) (+ (* 2 n) k2 m))) (or (<= n i2) (<= (+ k2 m) k1))), 136513#(and (or (not (< (+ j1 1) m)) (< (+ k1 1) k2) (< (+ 2 j1) m) (< (+ i1 1) n)) (or (not (< (+ j1 1) m)) (<= k2 (+ 2 k1)) (< (+ 2 j1) m) (< (+ i1 1) n))), 136528#(and (or (<= n i2) (<= (+ k1 (* 2 i1) 10) (+ (* 2 n) k2 m))) (or (<= (+ (* 3 j1) k2) (+ k1 (* 2 m) 4)) (<= n i2))), 136542#(and (or (= (+ i1 (* (- 1) k1)) 0) (<= n i2)) (or (<= (+ 6 (* 2 m)) (+ (* 2 n) k2)) (<= n i2)) (or (<= n i2) (<= (+ k2 (* 2 i1)) (* 2 m))) (or (= (+ (* (- 1) j1) i1) 0) (<= n i2))), 136518#(and (or (<= n i2) (<= (+ 6 k1 (* 2 i1)) (+ (* 2 n) k2 m))) (or (<= n i2) (<= (+ k2 m) (+ 2 k1)))), 136544#(and (or (= (+ (* (- 1) j1) i1) 0) (<= n (+ 2 i2))) (or (<= n (+ 2 i2)) (<= (+ k2 (* 2 i1)) 0)) (or (<= n (+ 2 i2)) (<= 6 (+ (* 2 n) k2))) (or (<= n (+ 2 i2)) (= (+ i1 (* (- 1) k1)) 0))), 136521#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) k1)) (or (<= n (+ 2 i2)) (<= (+ k1 (* 2 i1)) (+ (* 2 n) (* 3 m) k2)) (not (<= (+ (* 3 m) k2 1) k1)))), 136503#(and (or (<= n i2) (<= (+ k1 (* 2 i1)) (+ (* 2 n) k2 m)) (not (<= (+ k2 m 1) k1))) (or (<= n i2) (<= (+ k2 m) k1))), 136519#(and (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) (+ 2 k1))) (or (<= n (+ i2 1)) (<= (+ 6 k1 (* 2 i1)) (+ (* 2 n) k2 (* 2 m))))), 136526#(and (or (<= (+ k2 m) (+ 3 k1)) (<= n i2)) (or (<= n i2) (<= (+ 7 k1 (* 2 i1)) (+ (* 2 n) k2 m)))), 136545#(and (or (<= k2 (+ 5 k1)) (< 2 m) (< (+ j1 1) m) (not (< j1 m)) (not (< 1 m)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (< 2 m) (< (+ k1 4) k2) (< (+ j1 1) m) (not (< j1 m)) (not (< 1 m)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 136514#(and (or (<= k2 (+ 2 k1)) (< 2 m) (< (+ i1 1) n) (not (< i1 n)) (not (< 1 m))) (or (< (+ k1 1) k2) (< 2 m) (< (+ i1 1) n) (not (< i1 n)) (not (< 1 m)))), 136511#(and (or (< (+ i1 1) n) (< j1 m) (< k1 (+ k2 1))) (or (<= k2 k1) (< (+ i1 1) n) (< j1 m))), 136507#(and (or (<= (+ 2 k1 (* 2 i1)) (+ (* 2 n) k2 (* 2 m))) (<= n (+ i2 1)) (not (<= (+ k2 (* 2 m) 1) k1))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) k1))), 136508#(and (or (<= n i2) (<= (+ 3 k1 (* 2 i1)) (+ (* 2 n) k2 m))) (or (<= n i2) (<= (+ k2 m) (+ k1 1)))), 136509#(and (or (<= n (+ i2 1)) (<= (+ 3 k1 (* 2 i1)) (+ (* 2 n) k2 (* 2 m)))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) (+ k1 1)))), 136547#(and (or (< 2 m) (<= k2 (+ 6 k1)) (not (< 1 m)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (< (+ 5 k1) k2) (< 2 m) (not (< 1 m)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 136516#(and (or (<= n i2) (<= (+ k1 (* 2 i1) 4) (+ (* 2 n) k2 m))) (or (<= n i2) (<= (+ k2 m) (+ 2 k1)))), 136535#(and (or (<= n (+ 2 i2)) (<= (+ k1 (* 2 i1) 8) (+ (* 2 n) (* 3 m) k2))) (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ k1 4)))), 136524#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ 2 k1))) (or (<= n (+ 2 i2)) (<= (+ k1 (* 2 i1) 4) (+ (* 2 n) (* 3 m) k2)))), 136538#(and (or (< 2 m) (< (+ j1 1) m) (not (< (+ i1 1) n)) (<= k2 (+ 3 k1)) (< (+ 2 i1) n) (not (< j1 m)) (not (< 1 m))) (or (< (+ 2 k1) k2) (< 2 m) (< (+ j1 1) m) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (not (< j1 m)) (not (< 1 m)))), 136540#(and (or (< 2 m) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (not (< 1 m)) (< (+ 3 k1) k2)) (or (<= k2 (+ k1 4)) (< 2 m) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (not (< 1 m)))), 136512#(and (or (< (+ j1 1) m) (< (+ i1 1) n) (not (< j1 m)) (< k1 k2)) (or (<= k2 (+ k1 1)) (< (+ j1 1) m) (< (+ i1 1) n) (not (< j1 m)))), 136506#(and (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) k1)) (or (<= n (+ i2 1)) (not (<= (+ k2 (* 2 m) 1) k1)) (<= (+ k1 (* 2 i1)) (+ (* 2 n) k2 (* 2 m))))), 136531#(and (or (<= n (+ i2 1)) (<= (+ (* 3 j1) k2) (+ k1 m 4))) (or (<= n (+ i2 1)) (<= (+ k1 (* 2 i1) 10) (+ (* 2 n) k2 (* 2 m))))), 136523#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ k1 1))) (or (<= n (+ 2 i2)) (<= (+ 3 k1 (* 2 i1)) (+ (* 2 n) (* 3 m) k2)))), 136541#(and (or (< 2 m) (< j1 m) (not (< 1 m)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n) (< (+ 3 k1) k2)) (or (<= k2 (+ k1 4)) (< 2 m) (< j1 m) (not (< 1 m)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 136533#(and (or (<= n (+ i2 1)) (<= (+ (* 3 j1) k2) (+ 2 k1 m))) (or (<= (+ k1 m (* 2 i1) 8) (+ (* 2 n) (* 3 j1) k2)) (<= n (+ i2 1)))), 136520#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) k1)) (or (<= n (+ 2 i2)) (< k1 (+ (* 3 m) k2 1)))), 136530#(and (or (<= n (+ i2 1)) (<= (+ k1 (* 2 i1) 8) (+ (* 2 n) k2 (* 2 m)))) (or (<= (+ k2 (* 2 m)) (+ k1 4)) (<= n (+ i2 1)))), 136546#(and (or (not (< (+ j1 1) m)) (< 2 m) (< (+ 2 j1) m) (<= k2 (+ 6 k1)) (not (< 1 m)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (< (+ 5 k1) k2) (not (< (+ j1 1) m)) (< 2 m) (< (+ 2 j1) m) (not (< 1 m)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 136534#(and (or (<= n (+ 2 i2)) (<= (+ 7 k1 (* 2 i1)) (+ (* 2 n) (* 3 m) k2))) (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ 3 k1)))), 136536#(and (or (<= n (+ 2 i2)) (<= (+ k1 (* 2 i1) 10) (+ (* 2 n) (* 3 m) k2))) (or (<= (+ (* 3 j1) k2) (+ k1 4)) (<= n (+ 2 i2)))), 136532#(and (or (<= (+ (* 3 j1) k2) (+ 2 k1 (* 2 m))) (<= n i2)) (or (<= n i2) (<= (+ k1 (* 2 m) (* 2 i1) 8) (+ (* 2 n) (* 3 j1) k2)))), 136502#(and (or (< k1 (+ k2 m 1)) (<= n i2)) (or (<= n i2) (<= (+ k2 m) k1))), 136515#(and (or (<= k2 (+ 2 k1)) (< 2 m) (not (< (+ i1 1) n)) (< j1 m) (< (+ 2 i1) n) (not (< 1 m))) (or (< (+ k1 1) k2) (< 2 m) (not (< (+ i1 1) n)) (< j1 m) (< (+ 2 i1) n) (not (< 1 m)))), 136543#(and (or (<= n (+ i2 1)) (<= (+ k2 (* 2 i1)) m)) (or (= (+ (* (- 1) j1) i1) 0) (<= n (+ i2 1))) (or (= (+ i1 (* (- 1) k1)) 0) (<= n (+ i2 1))) (or (<= n (+ i2 1)) (<= (+ 6 m) (+ (* 2 n) k2)))), 136529#(and (or (<= (+ k2 (* 2 m)) (+ 3 k1)) (<= n (+ i2 1))) (or (<= n (+ i2 1)) (<= (+ 7 k1 (* 2 i1)) (+ (* 2 n) k2 (* 2 m))))), 136525#(and (or (<= n (+ 2 i2)) (<= (+ 6 k1 (* 2 i1)) (+ (* 2 n) (* 3 m) k2))) (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ 2 k1)))), 136505#(and (or (< k1 (+ k2 (* 2 m) 1)) (<= n (+ i2 1))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) k1))), 136537#(and (or (<= n (+ 2 i2)) (<= (+ k1 (* 2 i1) 8) (+ (* 2 n) (* 3 j1) k2))) (or (<= n (+ 2 i2)) (<= (+ (* 3 j1) k2) (+ 2 k1))))] [2022-03-15 20:45:06,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 20:45:06,953 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:06,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 20:45:06,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=6182, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 20:45:06,954 INFO L87 Difference]: Start difference. First operand 4292 states and 11067 transitions. Second operand has 63 states, 62 states have (on average 2.1774193548387095) internal successors, (135), 62 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:09,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:09,374 INFO L93 Difference]: Finished difference Result 9267 states and 20788 transitions. [2022-03-15 20:47:09,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 430 states. [2022-03-15 20:47:09,375 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.1774193548387095) internal successors, (135), 62 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 20:47:09,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:09,389 INFO L225 Difference]: With dead ends: 9267 [2022-03-15 20:47:09,389 INFO L226 Difference]: Without dead ends: 9178 [2022-03-15 20:47:09,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 468 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81585 ImplicationChecksByTransitivity, 120.2s TimeCoverageRelationStatistics Valid=23349, Invalid=197081, Unknown=0, NotChecked=0, Total=220430 [2022-03-15 20:47:09,401 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1398 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 7458 mSolverCounterSat, 2226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2226 IncrementalHoareTripleChecker+Valid, 7458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:09,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1398 Valid, 0 Invalid, 9684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2226 Valid, 7458 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-03-15 20:47:09,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9178 states. [2022-03-15 20:47:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9178 to 4383. [2022-03-15 20:47:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4383 states, 4382 states have (on average 2.5709721588315837) internal successors, (11266), 4382 states have internal predecessors, (11266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 11266 transitions. [2022-03-15 20:47:09,486 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 11266 transitions. Word has length 23 [2022-03-15 20:47:09,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:09,487 INFO L470 AbstractCegarLoop]: Abstraction has 4383 states and 11266 transitions. [2022-03-15 20:47:09,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.1774193548387095) internal successors, (135), 62 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 11266 transitions. [2022-03-15 20:47:09,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:47:09,491 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:09,491 INFO L514 BasicCegarLoop]: trace histogram [9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:09,513 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 20:47:09,713 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 20:47:09,714 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:09,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:09,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1338043183, now seen corresponding path program 22 times [2022-03-15 20:47:09,715 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:09,715 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821462224] [2022-03-15 20:47:09,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:09,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:47:09,802 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:09,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821462224] [2022-03-15 20:47:09,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821462224] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:09,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232753732] [2022-03-15 20:47:09,803 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:47:09,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:09,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:09,804 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 20:47:09,805 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 20:47:09,829 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:47:09,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:09,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:47:09,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 25 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:47:09,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 25 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:47:10,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232753732] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:10,031 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:10,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2022-03-15 20:47:10,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2017686848] [2022-03-15 20:47:10,032 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:10,033 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:10,040 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 141 transitions. [2022-03-15 20:47:10,040 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:10,589 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [155519#(or (< (+ j1 4) m) (<= m (+ 3 j1))), 155518#(or (< (+ 3 j1) m) (<= m (+ 2 j1))), 155524#(or (< 5 m) (<= m (+ j1 1)) (< (+ 2 j1) m) (<= m 4)), 155523#(or (< 5 m) (<= m j1) (< (+ j1 1) m) (<= m 4)), 155515#(< j1 m), 155525#(or (< 5 m) (< (+ 3 j1) m) (<= m (+ 2 j1)) (<= m 4)), 155516#(or (<= m j1) (< (+ j1 1) m)), 155522#(or (< 5 m) (<= m 4) (< j1 m)), 155521#(or (< 5 m) (<= m 4)), 155526#(or (< 5 m) (<= m 4) (< (+ j1 4) m) (<= m (+ 3 j1))), 155520#(or (<= m (+ j1 4)) (< (+ 5 j1) m)), 155517#(or (<= m (+ j1 1)) (< (+ 2 j1) m))] [2022-03-15 20:47:10,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 20:47:10,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:10,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 20:47:10,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=995, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:47:10,591 INFO L87 Difference]: Start difference. First operand 4383 states and 11266 transitions. Second operand has 26 states, 26 states have (on average 2.769230769230769) 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 20:47:11,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:11,061 INFO L93 Difference]: Finished difference Result 7338 states and 19016 transitions. [2022-03-15 20:47:11,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 20:47:11,062 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.769230769230769) 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 23 [2022-03-15 20:47:11,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:11,076 INFO L225 Difference]: With dead ends: 7338 [2022-03-15 20:47:11,076 INFO L226 Difference]: Without dead ends: 7326 [2022-03-15 20:47:11,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=598, Invalid=2054, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 20:47:11,077 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 251 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:11,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 0 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:47:11,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7326 states. [2022-03-15 20:47:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7326 to 7177. [2022-03-15 20:47:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7177 states, 7176 states have (on average 2.6025641025641026) internal successors, (18676), 7176 states have internal predecessors, (18676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:11,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7177 states to 7177 states and 18676 transitions. [2022-03-15 20:47:11,213 INFO L78 Accepts]: Start accepts. Automaton has 7177 states and 18676 transitions. Word has length 23 [2022-03-15 20:47:11,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:11,213 INFO L470 AbstractCegarLoop]: Abstraction has 7177 states and 18676 transitions. [2022-03-15 20:47:11,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.769230769230769) 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 20:47:11,214 INFO L276 IsEmpty]: Start isEmpty. Operand 7177 states and 18676 transitions. [2022-03-15 20:47:11,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:47:11,260 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:11,260 INFO L514 BasicCegarLoop]: trace histogram [9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:11,276 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 20:47:11,460 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 20:47:11,461 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:11,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:11,461 INFO L85 PathProgramCache]: Analyzing trace with hash -17597921, now seen corresponding path program 23 times [2022-03-15 20:47:11,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:11,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581711984] [2022-03-15 20:47:11,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:11,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:11,563 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:11,563 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:11,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581711984] [2022-03-15 20:47:11,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581711984] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:11,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75308594] [2022-03-15 20:47:11,563 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:47:11,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:11,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:11,564 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 20:47:11,566 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 20:47:11,585 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 20:47:11,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:11,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:47:11,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 21 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:11,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 16 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:11,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75308594] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:11,746 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:11,746 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 25 [2022-03-15 20:47:11,746 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1713973064] [2022-03-15 20:47:11,746 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:11,747 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:11,754 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 141 transitions. [2022-03-15 20:47:11,754 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:12,528 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [177424#(or (<= 5 m) (< (+ j1 4) m) (<= m (+ 3 j1)) (<= m 0)), 177413#(or (<= 5 m) (< j1 m) (<= m 3)), 177425#(or (<= m (+ j1 4)) (<= 5 m) (<= m 3) (< (+ 5 j1) m)), 177408#(or (<= m j1) (<= (+ 2 j1) m)), 177420#(or (<= 5 m) (< j1 m) (<= m 0)), 177415#(or (<= m (+ j1 1)) (<= 5 m) (< (+ 2 j1) m) (<= m 3)), 177411#(or (<= (+ 5 j1) m) (<= m (+ 3 j1))), 177418#(or (<= m j1) (<= (+ 5 j1) m)), 177412#(or (<= 5 m) (<= m 3)), 177423#(or (< (+ 3 j1) m) (<= 5 m) (<= m (+ 2 j1)) (<= m 0)), 177417#(or (<= 5 m) (<= m 3) (< (+ j1 4) m) (<= m (+ 3 j1))), 177421#(or (<= 5 m) (<= m j1) (< (+ j1 1) m) (<= m 0)), 177426#(or (<= m (+ j1 4)) (<= 5 m) (< (+ 5 j1) m) (<= m 0)), 177422#(or (<= m (+ j1 1)) (<= 5 m) (< (+ 2 j1) m) (<= m 0)), 177416#(or (< (+ 3 j1) m) (<= 5 m) (<= m (+ 2 j1)) (<= m 3)), 177409#(or (<= m (+ j1 1)) (<= (+ 3 j1) m)), 177419#(or (<= 5 m) (<= m 0)), 177414#(or (<= 5 m) (<= m j1) (< (+ j1 1) m) (<= m 3)), 177410#(or (<= (+ j1 4) m) (<= m (+ 2 j1)))] [2022-03-15 20:47:12,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 20:47:12,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:12,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 20:47:12,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=1469, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:47:12,529 INFO L87 Difference]: Start difference. First operand 7177 states and 18676 transitions. Second operand has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:13,250 INFO L93 Difference]: Finished difference Result 5281 states and 13234 transitions. [2022-03-15 20:47:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 20:47:13,251 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 20:47:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:13,260 INFO L225 Difference]: With dead ends: 5281 [2022-03-15 20:47:13,260 INFO L226 Difference]: Without dead ends: 5281 [2022-03-15 20:47:13,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 89 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1570 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=922, Invalid=3238, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 20:47:13,261 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 409 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:13,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 0 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:47:13,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5281 states. [2022-03-15 20:47:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5281 to 4337. [2022-03-15 20:47:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4337 states, 4336 states have (on average 2.52559963099631) internal successors, (10951), 4336 states have internal predecessors, (10951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:13,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4337 states to 4337 states and 10951 transitions. [2022-03-15 20:47:13,376 INFO L78 Accepts]: Start accepts. Automaton has 4337 states and 10951 transitions. Word has length 23 [2022-03-15 20:47:13,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:13,376 INFO L470 AbstractCegarLoop]: Abstraction has 4337 states and 10951 transitions. [2022-03-15 20:47:13,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 4337 states and 10951 transitions. [2022-03-15 20:47:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 20:47:13,381 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:13,381 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:13,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 20:47:13,602 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 20:47:13,603 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:13,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:13,603 INFO L85 PathProgramCache]: Analyzing trace with hash 15582473, now seen corresponding path program 10 times [2022-03-15 20:47:13,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:13,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250214016] [2022-03-15 20:47:13,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:13,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:13,699 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:13,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250214016] [2022-03-15 20:47:13,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250214016] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:13,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312493583] [2022-03-15 20:47:13,699 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:47:13,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:13,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:13,701 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 20:47:13,729 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 20:47:13,734 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:47:13,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:13,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:47:13,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:13,790 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:13,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:13,846 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:13,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312493583] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:13,846 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:13,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 14 [2022-03-15 20:47:13,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1078984273] [2022-03-15 20:47:13,847 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:13,849 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:13,864 INFO L252 McrAutomatonBuilder]: Finished intersection with 120 states and 214 transitions. [2022-03-15 20:47:13,864 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:15,376 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 47 new interpolants: [191644#(or (<= (+ 6 i1) n) (<= n (+ i1 4))), 191640#(or (<= (+ 6 i1) n) (<= n (+ 3 i2))), 191607#(or (<= n (+ 3 i2)) (< i1 n)), 191618#(or (<= n i2) (<= (+ 5 i1) n)), 191610#(or (<= n i2) (<= (+ 2 i1) n)), 191598#(<= n i2), 191620#(or (<= n (+ i2 1)) (<= (+ i1 4) n)), 191627#(or (<= (+ 3 i1) n) (<= n (+ 5 i2))), 191634#(or (<= n (+ 2 i2)) (<= (+ 5 i1) n)), 191612#(or (<= n (+ 2 i2)) (<= (+ 2 i1) n)), 191632#(or (<= (+ 3 i1) n) (<= n (+ i1 1))), 191609#(or (< i1 n) (<= n (+ 5 i2))), 191623#(or (<= n (+ 2 i2)) (<= (+ 3 i1) n)), 191633#(or (<= n (+ 2 i1)) (<= (+ i1 4) n)), 191602#(<= n (+ i2 4)), 191631#(or (<= (+ 2 i1) n) (<= n i1)), 191641#(or (<= (+ 6 i1) n) (<= n (+ i2 4))), 191617#(or (<= n i2) (<= (+ i1 4) n)), 191629#(or (<= n (+ i2 4)) (<= (+ i1 4) n)), 191606#(or (<= n (+ 2 i2)) (< i1 n)), 191614#(or (<= n (+ i2 4)) (<= (+ 2 i1) n)), 191599#(<= n (+ i2 1)), 191621#(or (<= n (+ i2 1)) (<= (+ 5 i1) n)), 191637#(or (<= n (+ 5 i2)) (<= (+ 5 i1) n)), 191603#(<= n (+ 5 i2)), 191625#(or (<= n (+ 3 i2)) (<= (+ 3 i1) n)), 191643#(or (<= n (+ 3 i1)) (<= (+ 5 i1) n)), 191608#(or (< i1 n) (<= n (+ i2 4))), 191624#(or (<= n (+ 2 i2)) (<= (+ i1 4) n)), 191630#(or (<= n (+ 5 i2)) (<= (+ i1 4) n)), 191616#(or (<= n i2) (<= (+ 3 i1) n)), 191638#(or (<= (+ 6 i1) n) (<= n (+ i2 1))), 191642#(or (<= (+ 6 i1) n) (<= n (+ 5 i2))), 191615#(or (<= (+ 2 i1) n) (<= n (+ 5 i2))), 191601#(<= n (+ 3 i2)), 191639#(or (<= (+ 6 i1) n) (<= n (+ 2 i2))), 191611#(or (<= n (+ i2 1)) (<= (+ 2 i1) n)), 191604#(or (< i1 n) (<= n i2)), 191622#(or (<= (+ 6 i1) n) (<= n i2)), 191626#(or (<= n (+ i2 4)) (<= (+ 3 i1) n)), 191613#(or (<= n (+ 3 i2)) (<= (+ 2 i1) n)), 191605#(or (< i1 n) (<= n (+ i2 1))), 191600#(<= n (+ 2 i2)), 191619#(or (<= (+ 3 i1) n) (<= n (+ i2 1))), 191635#(or (<= n (+ 3 i2)) (<= (+ 5 i1) n)), 191628#(or (<= n (+ 3 i2)) (<= (+ i1 4) n)), 191636#(or (<= n (+ i2 4)) (<= (+ 5 i1) n))] [2022-03-15 20:47:15,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 20:47:15,376 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:15,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 20:47:15,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1041, Invalid=2741, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 20:47:15,378 INFO L87 Difference]: Start difference. First operand 4337 states and 10951 transitions. Second operand has 61 states, 61 states have (on average 2.639344262295082) internal successors, (161), 60 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:17,436 INFO L93 Difference]: Finished difference Result 9562 states and 25214 transitions. [2022-03-15 20:47:17,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 20:47:17,436 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.639344262295082) internal successors, (161), 60 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 20:47:17,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:17,450 INFO L225 Difference]: With dead ends: 9562 [2022-03-15 20:47:17,451 INFO L226 Difference]: Without dead ends: 9550 [2022-03-15 20:47:17,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5997 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4974, Invalid=12056, Unknown=0, NotChecked=0, Total=17030 [2022-03-15 20:47:17,453 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 360 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:17,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 0 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:47:17,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9550 states. [2022-03-15 20:47:17,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9550 to 5460. [2022-03-15 20:47:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5460 states, 5459 states have (on average 2.5645722659827808) internal successors, (14000), 5459 states have internal predecessors, (14000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:17,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5460 states to 5460 states and 14000 transitions. [2022-03-15 20:47:17,590 INFO L78 Accepts]: Start accepts. Automaton has 5460 states and 14000 transitions. Word has length 24 [2022-03-15 20:47:17,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:17,590 INFO L470 AbstractCegarLoop]: Abstraction has 5460 states and 14000 transitions. [2022-03-15 20:47:17,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.639344262295082) internal successors, (161), 60 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:17,590 INFO L276 IsEmpty]: Start isEmpty. Operand 5460 states and 14000 transitions. [2022-03-15 20:47:17,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 20:47:17,594 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:17,594 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:17,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-03-15 20:47:17,800 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 20:47:17,800 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:17,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:17,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1016431124, now seen corresponding path program 24 times [2022-03-15 20:47:17,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:17,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125176295] [2022-03-15 20:47:17,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:17,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:18,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:18,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125176295] [2022-03-15 20:47:18,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125176295] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:18,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425950591] [2022-03-15 20:47:18,053 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:47:18,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:18,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:18,054 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 20:47:18,056 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 20:47:18,082 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 20:47:18,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:18,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 20:47:18,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:18,373 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:47:18,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:47:18,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425950591] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:18,842 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:18,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 33 [2022-03-15 20:47:18,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [387853081] [2022-03-15 20:47:18,842 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:18,844 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:18,856 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 190 transitions. [2022-03-15 20:47:18,856 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:23,533 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 53 new interpolants: [212446#(and (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) k1)) (or (<= n (+ i2 1)) (<= (+ 3 k1 (* 3 i1)) (+ (* 3 n) k2 (* 2 m))) (not (<= (+ k2 (* 2 m) 1) k1)))), 212469#(and (or (not (< 0 m)) (< (+ k1 1) k2) (< j1 m) (< 1 m) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (<= k2 (+ 2 k1)) (not (< 0 m)) (< j1 m) (< 1 m) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 212486#(and (or (<= (+ k1 (* 3 i1) 15) (+ (* 3 m) (* 3 n) k2)) (<= n (+ 2 i2))) (or (<= n (+ 2 i2)) (<= (+ k2 (* j1 4)) (+ 3 k1 m)))), 212444#(and (or (< k1 (+ k2 (* 2 m) 1)) (<= n (+ i2 1))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) k1))), 212476#(and (or (<= n (+ 3 i2)) (<= (+ (* m 4) k2) k1)) (or (<= n (+ 3 i2)) (<= (+ k1 (* 3 i1)) (+ (* 3 n) (* m 4) k2)) (not (<= (+ (* m 4) k2 1) k1)))), 212468#(and (or (<= k2 (+ 2 k1)) (not (< 0 m)) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (< 1 m)) (or (not (< 0 m)) (< (+ k1 1) k2) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (< 1 m))), 212451#(and (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) (+ 2 k1))) (or (<= (+ k1 (* 3 i1) 11) (+ (* 3 n) k2 (* 2 m))) (<= n (+ i2 1)))), 212456#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ k1 1))) (or (<= n (+ 2 i2)) (<= (+ 7 k1 (* 3 i1)) (+ (* 3 m) (* 3 n) k2)))), 212474#(and (or (<= k2 (+ k1 4)) (< (+ i1 4) n) (not (< 0 m)) (not (< (+ 3 i1) n)) (< (+ j1 1) m) (not (< j1 m)) (< 1 m)) (or (< (+ i1 4) n) (not (< 0 m)) (not (< (+ 3 i1) n)) (< (+ j1 1) m) (not (< j1 m)) (< 1 m) (< (+ 3 k1) k2))), 212483#(and (or (<= n i2) (<= (+ k1 (* 3 i1) 15) (+ (* 3 n) k2 m))) (or (<= (+ k2 (* j1 4)) (+ (* 3 m) 3 k1)) (<= n i2))), 212459#(and (or (<= n i2) (<= (+ k1 (* 3 i1) 12) (+ (* 3 n) k2 m))) (or (<= (+ k2 m) (+ 3 k1)) (<= n i2))), 212488#(and (or (<= (+ k2 (* 3 i1)) (* 2 m)) (<= n (+ i2 1))) (or (= (+ (* (- 1) j1) i1) 0) (<= n (+ i2 1))) (or (<= (+ (* 2 m) 12) (+ (* 3 n) k2)) (<= n (+ i2 1))) (or (= (+ i1 (* (- 1) k1)) 0) (<= n (+ i2 1)))), 212448#(and (or (<= n (+ i2 1)) (<= (+ 7 k1 (* 3 i1)) (+ (* 3 n) k2 (* 2 m)))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) (+ k1 1)))), 212487#(and (or (<= n (+ 3 i2)) (<= (+ k1 (* 3 i1) 15) (+ (* 3 n) (* m 4) k2))) (or (<= n (+ 3 i2)) (<= (+ k2 (* j1 4)) (+ 3 k1)))), 212440#(and (or (<= n i2) (<= (+ 3 k1 (* 3 i1)) (+ (* 3 n) k2 m)) (not (<= (+ k2 m 1) k1))) (or (<= n i2) (<= (+ k2 m) k1))), 212490#(and (or (<= n (+ 3 i2)) (<= 12 (+ (* 3 n) k2))) (or (<= n (+ 3 i2)) (= (+ i1 (* (- 1) k1)) 0)) (or (<= n (+ 3 i2)) (<= (+ k2 (* 3 i1)) 0)) (or (= (+ (* (- 1) j1) i1) 0) (<= n (+ 3 i2)))), 212458#(and (or (<= n (+ 2 i2)) (<= (+ k1 (* 3 i1) 11) (+ (* 3 m) (* 3 n) k2))) (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ 2 k1)))), 212455#(and (or (<= n (+ 2 i2)) (<= (+ k1 (* 3 i1) 4) (+ (* 3 m) (* 3 n) k2))) (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ k1 1)))), 212481#(and (or (<= n (+ 3 i2)) (<= (+ (* m 4) k2) (+ 2 k1))) (or (<= n (+ 3 i2)) (<= (+ k1 (* 3 i1) 11) (+ (* 3 n) (* m 4) k2)))), 212470#(and (or (< (+ 2 k1) k2) (not (< 0 m)) (< (+ j1 1) m) (not (< j1 m)) (< 1 m) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (not (< 0 m)) (< (+ j1 1) m) (<= k2 (+ 3 k1)) (not (< j1 m)) (< 1 m) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 212480#(and (or (<= n (+ 3 i2)) (<= (+ k1 (* 3 i1) 8) (+ (* 3 n) (* m 4) k2))) (or (<= n (+ 3 i2)) (<= (+ (* m 4) k2) (+ 2 k1)))), 212489#(and (or (<= n (+ 2 i2)) (<= (+ k2 (* 3 i1)) m)) (or (= (+ (* (- 1) j1) i1) 0) (<= n (+ 2 i2))) (or (<= n (+ 2 i2)) (<= (+ m 12) (+ (* 3 n) k2))) (or (<= n (+ 2 i2)) (= (+ i1 (* (- 1) k1)) 0))), 212441#(and (or (<= n i2) (<= (+ k1 (* 3 i1) 4) (+ (* 3 n) k2 m))) (or (<= n i2) (<= (+ k2 m) (+ k1 1)))), 212463#(and (or (< (+ i1 1) n) (< j1 m) (< k1 (+ k2 1))) (or (<= k2 k1) (< (+ i1 1) n) (< j1 m))), 212477#(and (or (<= n (+ 3 i2)) (<= (+ (* m 4) k2) k1)) (or (<= (+ 3 k1 (* 3 i1)) (+ (* 3 n) (* m 4) k2)) (<= n (+ 3 i2)) (not (<= (+ (* m 4) k2 1) k1)))), 212475#(and (or (< (+ i1 4) n) (not (< 0 m)) (not (< (+ 3 i1) n)) (< 1 m) (< (+ 3 k1) k2)) (or (<= k2 (+ k1 4)) (< (+ i1 4) n) (not (< 0 m)) (not (< (+ 3 i1) n)) (< 1 m))), 212460#(and (or (<= n (+ i2 1)) (<= (+ k1 (* 3 i1) 12) (+ (* 3 n) k2 (* 2 m)))) (or (<= (+ k2 (* 2 m)) (+ 3 k1)) (<= n (+ i2 1)))), 212478#(and (or (<= n (+ 3 i2)) (<= (+ (* m 4) k2) (+ k1 1))) (or (<= (+ k1 (* 3 i1) 4) (+ (* 3 n) (* m 4) k2)) (<= n (+ 3 i2)))), 212442#(and (or (<= n i2) (<= (+ k2 m) (+ k1 1))) (or (<= n i2) (<= (+ 7 k1 (* 3 i1)) (+ (* 3 n) k2 m)))), 212464#(and (or (< (+ j1 1) m) (< (+ i1 1) n) (not (< j1 m)) (< k1 k2)) (or (<= k2 (+ k1 1)) (< (+ j1 1) m) (< (+ i1 1) n) (not (< j1 m)))), 212443#(and (or (<= n i2) (<= (+ k1 (* 3 i1) 8) (+ (* 3 n) k2 m))) (or (<= n i2) (<= (+ k2 m) (+ 2 k1)))), 212450#(and (or (<= n i2) (<= (+ k1 (* 3 i1) 11) (+ (* 3 n) k2 m))) (or (<= n i2) (<= (+ k2 m) (+ 2 k1)))), 212457#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ 2 k1))) (or (<= n (+ 2 i2)) (<= (+ k1 (* 3 i1) 8) (+ (* 3 m) (* 3 n) k2)))), 212485#(and (or (<= n (+ i2 1)) (<= (+ k2 (* j1 4)) (+ 3 k1 (* 2 m)))) (or (<= (+ k1 (* 3 i1) 15) (+ (* 3 n) k2 (* 2 m))) (<= n (+ i2 1)))), 212454#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) k1)) (or (<= n (+ 2 i2)) (<= (+ 3 k1 (* 3 i1)) (+ (* 3 m) (* 3 n) k2)) (not (<= (+ (* 3 m) k2 1) k1)))), 212452#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) k1)) (or (<= n (+ 2 i2)) (< k1 (+ (* 3 m) k2 1)))), 212472#(and (or (< (+ i1 4) n) (not (< 0 m)) (not (< (+ 3 i1) n)) (<= k2 (+ 3 k1)) (< j1 m) (< 1 m)) (or (< (+ i1 4) n) (< (+ 2 k1) k2) (not (< 0 m)) (not (< (+ 3 i1) n)) (< j1 m) (< 1 m))), 212447#(and (or (<= n (+ i2 1)) (<= (+ k1 (* 3 i1) 4) (+ (* 3 n) k2 (* 2 m)))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) (+ k1 1)))), 212471#(and (or (not (< 0 m)) (<= k2 (+ 3 k1)) (< 1 m) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (< (+ 2 k1) k2) (not (< 0 m)) (< 1 m) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 212461#(and (or (<= n (+ 2 i2)) (<= (+ k1 (* 3 i1) 12) (+ (* 3 m) (* 3 n) k2))) (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ 3 k1)))), 212439#(and (or (<= n i2) (<= (+ k1 (* 3 i1)) (+ (* 3 n) k2 m)) (not (<= (+ k2 m 1) k1))) (or (<= n i2) (<= (+ k2 m) k1))), 212467#(and (or (<= k2 (+ 2 k1)) (not (< 0 m)) (< (+ j1 1) m) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (not (< j1 m)) (< 1 m)) (or (not (< 0 m)) (< (+ k1 1) k2) (< (+ j1 1) m) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (not (< j1 m)) (< 1 m))), 212473#(and (or (<= n (+ 3 i2)) (<= (+ (* m 4) k2) k1)) (or (<= n (+ 3 i2)) (< k1 (+ (* m 4) k2 1)))), 212466#(and (or (not (< 0 m)) (not (< (+ i1 1) n)) (< j1 m) (< (+ 2 i1) n) (< 1 m) (< k1 k2)) (or (not (< 0 m)) (<= k2 (+ k1 1)) (not (< (+ i1 1) n)) (< j1 m) (< (+ 2 i1) n) (< 1 m))), 212484#(and (or (= (+ i1 (* (- 1) k1)) 0) (<= n i2)) (or (<= n i2) (<= (+ k2 (* 3 i1)) (* 3 m))) (or (<= n i2) (<= (+ (* 3 m) 12) (+ (* 3 n) k2))) (or (= (+ (* (- 1) j1) i1) 0) (<= n i2))), 212482#(and (or (<= n (+ 3 i2)) (<= (+ k1 (* 3 i1) 12) (+ (* 3 n) (* m 4) k2))) (or (<= n (+ 3 i2)) (<= (+ (* m 4) k2) (+ 3 k1)))), 212453#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) k1)) (or (<= n (+ 2 i2)) (<= (+ k1 (* 3 i1)) (+ (* 3 m) (* 3 n) k2)) (not (<= (+ (* 3 m) k2 1) k1)))), 212465#(and (or (not (< 0 m)) (< (+ i1 1) n) (not (< i1 n)) (< 1 m) (< k1 k2)) (or (not (< 0 m)) (<= k2 (+ k1 1)) (< (+ i1 1) n) (not (< i1 n)) (< 1 m))), 212445#(and (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) k1)) (or (<= n (+ i2 1)) (not (<= (+ k2 (* 2 m) 1) k1)) (<= (+ k1 (* 3 i1)) (+ (* 3 n) k2 (* 2 m))))), 212479#(and (or (<= n (+ 3 i2)) (<= (+ 7 k1 (* 3 i1)) (+ (* 3 n) (* m 4) k2))) (or (<= n (+ 3 i2)) (<= (+ (* m 4) k2) (+ k1 1)))), 212462#(and (or (< i1 n) (<= k2 k1)) (or (< i1 n) (< k1 (+ k2 1)))), 212438#(and (or (< k1 (+ k2 m 1)) (<= n i2)) (or (<= n i2) (<= (+ k2 m) k1))), 212449#(and (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) (+ 2 k1))) (or (<= n (+ i2 1)) (<= (+ k1 (* 3 i1) 8) (+ (* 3 n) k2 (* 2 m)))))] [2022-03-15 20:47:23,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-03-15 20:47:23,533 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:23,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-03-15 20:47:23,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=7316, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 20:47:23,535 INFO L87 Difference]: Start difference. First operand 5460 states and 14000 transitions. Second operand has 70 states, 69 states have (on average 2.260869565217391) internal successors, (156), 69 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:01,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:49:01,871 INFO L93 Difference]: Finished difference Result 10092 states and 22744 transitions. [2022-03-15 20:49:01,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 399 states. [2022-03-15 20:49:01,872 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 2.260869565217391) internal successors, (156), 69 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 20:49:01,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:49:01,886 INFO L225 Difference]: With dead ends: 10092 [2022-03-15 20:49:01,886 INFO L226 Difference]: Without dead ends: 10012 [2022-03-15 20:49:01,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 437 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68695 ImplicationChecksByTransitivity, 96.0s TimeCoverageRelationStatistics Valid=21797, Invalid=170485, Unknown=0, NotChecked=0, Total=192282 [2022-03-15 20:49:01,897 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1225 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 9241 mSolverCounterSat, 1768 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1225 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 11009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1768 IncrementalHoareTripleChecker+Valid, 9241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:49:01,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1225 Valid, 0 Invalid, 11009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1768 Valid, 9241 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-03-15 20:49:01,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10012 states. [2022-03-15 20:49:01,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10012 to 5597. [2022-03-15 20:49:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 2.5568263045032165) internal successors, (14308), 5596 states have internal predecessors, (14308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 14308 transitions. [2022-03-15 20:49:02,003 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 14308 transitions. Word has length 24 [2022-03-15 20:49:02,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:49:02,003 INFO L470 AbstractCegarLoop]: Abstraction has 5597 states and 14308 transitions. [2022-03-15 20:49:02,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 2.260869565217391) internal successors, (156), 69 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:02,003 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 14308 transitions. [2022-03-15 20:49:02,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 20:49:02,009 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:49:02,009 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:49:02,035 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 20:49:02,235 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 20:49:02,235 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:49:02,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:49:02,236 INFO L85 PathProgramCache]: Analyzing trace with hash -495097972, now seen corresponding path program 25 times [2022-03-15 20:49:02,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:49:02,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074240859] [2022-03-15 20:49:02,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:49:02,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:49:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:49:02,483 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:02,483 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:49:02,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074240859] [2022-03-15 20:49:02,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074240859] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:49:02,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531309455] [2022-03-15 20:49:02,484 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:49:02,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:49:02,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:49:02,488 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 20:49:02,489 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 20:49:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:49:02,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 20:49:02,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:49:02,841 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:49:02,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:49:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:49:03,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531309455] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:49:03,165 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:49:03,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 31 [2022-03-15 20:49:03,165 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1782983885] [2022-03-15 20:49:03,165 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:49:03,167 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:49:03,179 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 150 transitions. [2022-03-15 20:49:03,179 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:49:05,690 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 38 new interpolants: [234664#(and (<= (+ (* 2 j1) k2) (+ k1 m 4)) (<= (+ k1 m 4) (+ (* 2 j1) k2))), 234681#(and (<= (+ (* 2 j1) k2) (+ 2 k1)) (<= (+ 2 k1) (+ (* 2 j1) k2))), 234670#(and (<= (+ 2 k1 m) (+ (* 2 j1) k2)) (<= (+ (* 2 j1) k2) (+ 2 k1 m))), 234669#(and (or (< (+ j1 1) m) (not (< j1 m)) (< k1 k2)) (or (<= k2 (+ k1 1)) (< (+ j1 1) m) (not (< j1 m)))), 234650#(and (< k1 (+ k2 m 1)) (<= (+ k2 m) k1)), 234674#(and (or (< (+ k1 4) k2) (< (+ 5 j1) m) (not (< (+ j1 4) m))) (or (<= k2 (+ 5 k1)) (< (+ 5 j1) m) (not (< (+ j1 4) m)))), 234676#(and (or (< 5 m) (< (+ j1 1) m) (<= (+ k1 11) (+ k2 m)) (<= m 4) (not (< j1 m))) (or (< 5 m) (< (+ j1 1) m) (<= (+ k2 m) (+ k1 11)) (<= m 4) (not (< j1 m)))), 234659#(and (<= (+ k2 (* 2 m)) (+ 3 k1)) (<= (+ 3 k1) (+ k2 (* 2 m)))), 234640#(or (not (< 4 m)) (< 5 m) (and (<= (+ k2 m) (+ k1 10)) (<= (+ k1 10) (+ k2 m)))), 234636#(or (not (< 4 m)) (< 5 m) (and (<= k2 (+ k1 10)) (<= (+ k1 10) k2))), 234685#(and (= j1 i1) (= k1 i1) (<= 0 (+ k2 i1)) (<= (+ k2 i1) 0)), 234651#(and (< k1 (+ k2 (* 2 m) 1)) (<= (+ k2 (* 2 m)) k1)), 234684#(and (= j1 i1) (= k1 i1) (<= m (+ k2 i1)) (<= (+ k2 i1) m)), 234682#(and (<= (+ (* 2 j1) k2) (+ k1 m 1)) (<= (+ k1 m 1) (+ (* 2 j1) k2))), 234663#(and (<= (+ 5 k1) (+ k2 (* 2 m))) (<= (+ (* 2 j1) k2) (+ 5 k1))), 234679#(and (or (< 5 m) (not (< (+ 3 j1) m)) (<= m 4) (<= (+ 14 k1) (+ k2 m)) (< (+ j1 4) m)) (or (< 5 m) (<= (+ k2 m) (+ 14 k1)) (not (< (+ 3 j1) m)) (<= m 4) (< (+ j1 4) m))), 234683#(and (<= (+ (* 2 j1) k2) (+ k1 1)) (<= (+ k1 1) (+ (* 2 j1) k2))), 234655#(and (<= (+ k2 m) (+ k1 4)) (<= (+ k1 4) (+ k2 m))), 234668#(and (or (< j1 m) (< k1 (+ k2 1))) (or (<= k2 k1) (< j1 m))), 234671#(and (or (not (< (+ j1 1) m)) (< (+ k1 1) k2) (< (+ 2 j1) m)) (or (not (< (+ j1 1) m)) (<= k2 (+ 2 k1)) (< (+ 2 j1) m))), 234652#(and (<= (+ k1 1) (+ k2 m)) (<= (+ k2 m) (+ k1 1))), 234672#(and (or (< (+ 3 j1) m) (not (< (+ 2 j1) m)) (<= k2 (+ 3 k1))) (or (< (+ 2 k1) k2) (< (+ 3 j1) m) (not (< (+ 2 j1) m)))), 234654#(and (<= (+ k2 m) (+ 3 k1)) (<= (+ 3 k1) (+ k2 m))), 234675#(and (or (< 5 m) (<= (+ k1 10) (+ k2 m)) (<= m 4) (< j1 m)) (or (< 5 m) (<= (+ k2 m) (+ k1 10)) (<= m 4) (< j1 m))), 234660#(and (<= (+ k2 (* 2 m)) (+ k1 4)) (<= (+ k1 4) (+ k2 (* 2 m)))), 234653#(and (<= (+ k2 m) (+ 2 k1)) (<= (+ 2 k1) (+ k2 m))), 234657#(and (<= (+ k2 (* 2 m)) (+ k1 1)) (<= (+ k1 1) (+ k2 (* 2 m)))), 234656#(and (<= (+ 5 k1) (+ k2 m)) (<= (+ k2 m) (+ 5 k1))), 234667#(and (<= (+ (* 2 j1) k2) (+ 3 k1)) (<= (+ 3 k1) (+ (* 2 j1) k2))), 234661#(and (<= (+ 5 k1) (+ k2 (* 2 m))) (<= (+ k2 (* 2 m)) (+ 5 k1))), 234665#(and (<= (+ (* 2 j1) k2) (+ k1 4)) (<= (+ k1 4) (+ (* 2 j1) k2))), 234658#(and (<= (+ 2 k1) (+ k2 (* 2 m))) (<= (+ k2 (* 2 m)) (+ 2 k1))), 234666#(and (<= (+ (* 2 j1) k2) (+ 3 k1 m)) (<= (+ 3 k1 m) (+ (* 2 j1) k2))), 234662#(and (<= (+ 5 k1) (+ k2 m)) (<= (+ (* 2 j1) k2) (+ 5 k1 m))), 234678#(and (or (< 5 m) (< (+ 3 j1) m) (not (< (+ 2 j1) m)) (<= (+ k1 13) (+ k2 m)) (<= m 4)) (or (< 5 m) (< (+ 3 j1) m) (not (< (+ 2 j1) m)) (<= (+ k2 m) (+ k1 13)) (<= m 4))), 234677#(and (or (< 5 m) (not (< (+ j1 1) m)) (< (+ 2 j1) m) (<= m 4) (<= (+ k1 12) (+ k2 m))) (or (< 5 m) (not (< (+ j1 1) m)) (<= (+ k2 m) (+ k1 12)) (< (+ 2 j1) m) (<= m 4))), 234680#(and (or (< 5 m) (<= m 4) (<= (+ k1 15) (+ k2 m)) (< (+ 5 j1) m) (not (< (+ j1 4) m))) (or (< 5 m) (<= (+ k2 m) (+ k1 15)) (<= m 4) (< (+ 5 j1) m) (not (< (+ j1 4) m)))), 234673#(and (or (<= k2 (+ k1 4)) (not (< (+ 3 j1) m)) (< (+ j1 4) m)) (or (not (< (+ 3 j1) m)) (< (+ j1 4) m) (< (+ 3 k1) k2)))] [2022-03-15 20:49:05,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-15 20:49:05,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:49:05,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-15 20:49:05,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=4471, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 20:49:05,692 INFO L87 Difference]: Start difference. First operand 5597 states and 14308 transitions. Second operand has 55 states, 54 states have (on average 2.2222222222222223) internal successors, (120), 54 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:25,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:49:25,771 INFO L93 Difference]: Finished difference Result 20680 states and 53410 transitions. [2022-03-15 20:49:25,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2022-03-15 20:49:25,771 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.2222222222222223) internal successors, (120), 54 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 20:49:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:49:25,803 INFO L225 Difference]: With dead ends: 20680 [2022-03-15 20:49:25,803 INFO L226 Difference]: Without dead ends: 20655 [2022-03-15 20:49:25,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 49 SyntacticMatches, 8 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13735 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=4374, Invalid=44246, Unknown=0, NotChecked=0, Total=48620 [2022-03-15 20:49:25,806 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 621 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 9566 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 9566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:49:25,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [621 Valid, 0 Invalid, 10094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [528 Valid, 9566 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-03-15 20:49:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20655 states. [2022-03-15 20:49:25,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20655 to 7393. [2022-03-15 20:49:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7393 states, 7392 states have (on average 2.5863095238095237) internal successors, (19118), 7392 states have internal predecessors, (19118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7393 states to 7393 states and 19118 transitions. [2022-03-15 20:49:26,007 INFO L78 Accepts]: Start accepts. Automaton has 7393 states and 19118 transitions. Word has length 24 [2022-03-15 20:49:26,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:49:26,007 INFO L470 AbstractCegarLoop]: Abstraction has 7393 states and 19118 transitions. [2022-03-15 20:49:26,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.2222222222222223) internal successors, (120), 54 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 7393 states and 19118 transitions. [2022-03-15 20:49:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 20:49:26,013 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:49:26,013 INFO L514 BasicCegarLoop]: trace histogram [11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:49:26,040 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 20:49:26,227 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 20:49:26,227 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:49:26,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:49:26,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1067397955, now seen corresponding path program 26 times [2022-03-15 20:49:26,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:49:26,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551058992] [2022-03-15 20:49:26,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:49:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:49:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:49:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 31 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:49:26,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:49:26,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551058992] [2022-03-15 20:49:26,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551058992] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:49:26,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029993033] [2022-03-15 20:49:26,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:49:26,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:49:26,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:49:26,326 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 20:49:26,326 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 20:49:26,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:49:26,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:49:26,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 20:49:26,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:49:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 32 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:49:26,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:49:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 32 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:49:26,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029993033] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:49:26,543 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:49:26,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2022-03-15 20:49:26,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [516975258] [2022-03-15 20:49:26,543 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:49:26,545 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:49:26,554 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 159 transitions. [2022-03-15 20:49:26,554 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:49:27,242 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [270632#(or (< (+ j1 4) m) (<= m (+ 3 j1))), 270635#(or (< 6 m) (<= m 5)), 270629#(or (<= m j1) (< (+ j1 1) m)), 270631#(or (< (+ 3 j1) m) (<= m (+ 2 j1))), 270637#(or (<= m j1) (< (+ j1 1) m) (< 6 m) (<= m 5)), 270633#(or (<= m (+ j1 4)) (< (+ 5 j1) m)), 270628#(< j1 m), 270630#(or (<= m (+ j1 1)) (< (+ 2 j1) m)), 270634#(or (<= m (+ 5 j1)) (< (+ 6 j1) m)), 270639#(or (< (+ 3 j1) m) (<= m (+ 2 j1)) (< 6 m) (<= m 5)), 270636#(or (< 6 m) (<= m 5) (< j1 m)), 270638#(or (<= m (+ j1 1)) (< (+ 2 j1) m) (< 6 m) (<= m 5)), 270640#(or (< 6 m) (<= m 5) (< (+ j1 4) m) (<= m (+ 3 j1))), 270641#(or (<= m (+ j1 4)) (< 6 m) (<= m 5) (< (+ 5 j1) m))] [2022-03-15 20:49:27,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 20:49:27,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:49:27,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 20:49:27,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=1367, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:49:27,243 INFO L87 Difference]: Start difference. First operand 7393 states and 19118 transitions. Second operand has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 30 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:27,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:49:27,775 INFO L93 Difference]: Finished difference Result 11759 states and 30687 transitions. [2022-03-15 20:49:27,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 20:49:27,776 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 30 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 20:49:27,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:49:27,792 INFO L225 Difference]: With dead ends: 11759 [2022-03-15 20:49:27,792 INFO L226 Difference]: Without dead ends: 11745 [2022-03-15 20:49:27,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1329 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=814, Invalid=2846, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 20:49:27,793 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:49:27,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:49:27,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11745 states. [2022-03-15 20:49:27,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11745 to 11558. [2022-03-15 20:49:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11558 states, 11557 states have (on average 2.6174612788786016) internal successors, (30250), 11557 states have internal predecessors, (30250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11558 states to 11558 states and 30250 transitions. [2022-03-15 20:49:27,995 INFO L78 Accepts]: Start accepts. Automaton has 11558 states and 30250 transitions. Word has length 25 [2022-03-15 20:49:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:49:27,996 INFO L470 AbstractCegarLoop]: Abstraction has 11558 states and 30250 transitions. [2022-03-15 20:49:27,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 30 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 11558 states and 30250 transitions. [2022-03-15 20:49:28,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 20:49:28,003 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:49:28,003 INFO L514 BasicCegarLoop]: trace histogram [11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:49:28,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 20:49:28,203 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 20:49:28,204 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:49:28,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:49:28,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1737924019, now seen corresponding path program 27 times [2022-03-15 20:49:28,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:49:28,205 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105172568] [2022-03-15 20:49:28,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:49:28,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:49:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:49:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:28,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:49:28,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105172568] [2022-03-15 20:49:28,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105172568] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:49:28,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972221027] [2022-03-15 20:49:28,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:49:28,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:49:28,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:49:28,344 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 20:49:28,345 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 20:49:28,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-03-15 20:49:28,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:49:28,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 20:49:28,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:49:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 27 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:28,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:49:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:28,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972221027] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:49:28,549 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:49:28,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 29 [2022-03-15 20:49:28,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1248639186] [2022-03-15 20:49:28,549 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:49:28,551 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:49:28,559 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 159 transitions. [2022-03-15 20:49:28,560 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:49:29,475 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [305731#(or (<= (+ 5 j1) m) (<= m (+ 3 j1))), 305740#(or (<= 6 m) (<= m j1) (< (+ j1 1) m) (<= m 0)), 305739#(or (<= 6 m) (< j1 m) (<= m 0)), 305730#(or (<= (+ j1 4) m) (<= m (+ 2 j1))), 305737#(or (<= (+ 6 j1) m) (<= m j1)), 305746#(or (<= 6 m) (< (+ 3 j1) m) (<= m (+ 2 j1)) (<= m 0)), 305733#(or (<= 6 m) (<= m 4)), 305735#(or (<= 6 m) (<= m j1) (< (+ j1 1) m) (<= m 4)), 305729#(or (<= m (+ j1 1)) (<= (+ 3 j1) m)), 305743#(or (<= 6 m) (<= m 4) (< (+ j1 4) m) (<= m (+ 3 j1))), 305748#(or (<= m (+ j1 4)) (<= 6 m) (< (+ 5 j1) m) (<= m 0)), 305742#(or (<= 6 m) (< (+ 3 j1) m) (<= m (+ 2 j1)) (<= m 4)), 305741#(or (<= m (+ j1 1)) (<= 6 m) (< (+ 2 j1) m) (<= m 0)), 305747#(or (<= 6 m) (< (+ j1 4) m) (<= m (+ 3 j1)) (<= m 0)), 305745#(or (<= 6 m) (<= m (+ 5 j1)) (<= m 4) (< (+ 6 j1) m)), 305728#(or (<= m j1) (<= (+ 2 j1) m)), 305736#(or (<= m (+ j1 1)) (<= 6 m) (< (+ 2 j1) m) (<= m 4)), 305732#(or (<= m (+ j1 4)) (<= (+ 6 j1) m)), 305738#(or (<= 6 m) (<= m 0)), 305734#(or (<= 6 m) (<= m 4) (< j1 m)), 305744#(or (<= m (+ j1 4)) (<= 6 m) (<= m 4) (< (+ 5 j1) m)), 305749#(or (<= 6 m) (<= m (+ 5 j1)) (< (+ 6 j1) m) (<= m 0))] [2022-03-15 20:49:29,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 20:49:29,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:49:29,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 20:49:29,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1994, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 20:49:29,476 INFO L87 Difference]: Start difference. First operand 11558 states and 30250 transitions. Second operand has 39 states, 39 states have (on average 2.641025641025641) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:30,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:49:30,453 INFO L93 Difference]: Finished difference Result 8722 states and 22099 transitions. [2022-03-15 20:49:30,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 20:49:30,453 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.641025641025641) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 20:49:30,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:49:30,463 INFO L225 Difference]: With dead ends: 8722 [2022-03-15 20:49:30,464 INFO L226 Difference]: Without dead ends: 8722 [2022-03-15 20:49:30,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 100 SyntacticMatches, 7 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2172 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1222, Invalid=4478, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 20:49:30,465 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 408 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:49:30,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [408 Valid, 0 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:49:30,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8722 states. [2022-03-15 20:49:30,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8722 to 7285. [2022-03-15 20:49:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7285 states, 7284 states have (on average 2.5446183415705654) internal successors, (18535), 7284 states have internal predecessors, (18535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7285 states to 7285 states and 18535 transitions. [2022-03-15 20:49:30,566 INFO L78 Accepts]: Start accepts. Automaton has 7285 states and 18535 transitions. Word has length 25 [2022-03-15 20:49:30,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:49:30,566 INFO L470 AbstractCegarLoop]: Abstraction has 7285 states and 18535 transitions. [2022-03-15 20:49:30,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.641025641025641) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:30,566 INFO L276 IsEmpty]: Start isEmpty. Operand 7285 states and 18535 transitions. [2022-03-15 20:49:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:49:30,570 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:49:30,571 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:49:30,586 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 20:49:30,771 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 20:49:30,771 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:49:30,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:49:30,771 INFO L85 PathProgramCache]: Analyzing trace with hash -451112606, now seen corresponding path program 11 times [2022-03-15 20:49:30,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:49:30,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367701364] [2022-03-15 20:49:30,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:49:30,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:49:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:49:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-15 20:49:30,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:49:30,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367701364] [2022-03-15 20:49:30,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367701364] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:49:30,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816962442] [2022-03-15 20:49:30,919 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:49:30,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:49:30,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:49:30,924 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 20:49:30,953 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 20:49:30,961 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-03-15 20:49:30,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:49:30,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 20:49:30,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:49:31,238 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:49:31,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:49:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 21 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:49:31,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816962442] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:49:31,673 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:49:31,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 20:49:31,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [58388504] [2022-03-15 20:49:31,673 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:49:31,675 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:49:31,689 INFO L252 McrAutomatonBuilder]: Finished intersection with 138 states and 248 transitions. [2022-03-15 20:49:31,689 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:49:34,345 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [329297#(and (< 0 (+ (* 3 m) k2 1)) (= (+ (* 3 m) k2) k1) (<= (+ (* 3 m) k2) 0)), 329295#(and (= (+ k2 m) k1) (<= (+ k2 m) 0) (< 0 (+ k2 m 1))), 329305#(and (= j1 0) (or (= k1 (+ k2 (* 2 m))) (not (= (+ k2 (* 2 m)) 0))) (< 0 (+ k2 (* 2 m) 1)) (or (<= (+ k2 (* 2 m)) 0) (<= k2 (* m 4)))), 329299#(and (<= (+ (* 5 m) k2) 0) (< 0 (+ (* 5 m) k2 1)) (= k1 (+ (* 5 m) k2))), 329303#(and (or (< 0 m) (< j1 m) (<= k2 0)) (or (< 0 m) (< 0 (+ k2 1)) (< j1 m)) (or (< 0 m) (= k2 k1) (< j1 m))), 329304#(and (or (<= (+ k2 m) 0) (<= k2 (* 5 m))) (= j1 0) (or (= (+ k2 m) k1) (not (= (+ k2 m) 0))) (< 0 (+ k2 m 1))), 329309#(and (or (<= (+ k2 (* 6 m)) 0) (<= k2 0)) (= j1 0) (< 0 (+ k2 (* 6 m) 1)) (or (not (= (+ k2 (* 6 m)) 0)) (= (+ k2 (* 6 m)) k1))), 329308#(and (or (= k1 (+ (* 5 m) k2)) (not (= (+ (* 5 m) k2) 0))) (= j1 0) (or (<= k2 m) (<= (+ (* 5 m) k2) 0)) (< 0 (+ (* 5 m) k2 1))), 329301#(and (or (= k2 k1) (< j1 m)) (or (< j1 m) (<= k2 0)) (or (< 0 (+ k2 1)) (< j1 m))), 329302#(and (or (< 0 m) (= k2 k1)) (or (< 0 m) (< 0 (+ k2 1))) (or (< 0 m) (<= k2 0))), 329298#(and (= (+ (* m 4) k2) k1) (<= (+ (* m 4) k2) 0) (< 0 (+ (* m 4) k2 1))), 329300#(and (< 0 (+ k2 (* 6 m) 1)) (= (+ k2 (* 6 m)) k1) (<= (+ k2 (* 6 m)) 0)), 329296#(and (<= (+ k2 (* 2 m)) 0) (= k1 (+ k2 (* 2 m))) (< 0 (+ k2 (* 2 m) 1))), 329306#(and (< 0 (+ (* 3 m) k2 1)) (= j1 0) (or (<= k2 (* 3 m)) (<= (+ (* 3 m) k2) 0)) (or (not (= (+ (* 3 m) k2) 0)) (= (+ (* 3 m) k2) k1))), 329307#(and (or (<= k2 (* 2 m)) (<= (+ (* m 4) k2) 0)) (= j1 0) (< 0 (+ (* m 4) k2 1)) (or (= (+ (* m 4) k2) k1) (not (= (+ (* m 4) k2) 0))))] [2022-03-15 20:49:34,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 20:49:34,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:49:34,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 20:49:34,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1564, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 20:49:34,346 INFO L87 Difference]: Start difference. First operand 7285 states and 18535 transitions. Second operand has 26 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:35,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:49:35,130 INFO L93 Difference]: Finished difference Result 7501 states and 19108 transitions. [2022-03-15 20:49:35,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 20:49:35,130 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 20:49:35,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:49:35,139 INFO L225 Difference]: With dead ends: 7501 [2022-03-15 20:49:35,139 INFO L226 Difference]: Without dead ends: 7324 [2022-03-15 20:49:35,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=587, Invalid=2605, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 20:49:35,140 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 142 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:49:35,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 0 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:49:35,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7324 states. [2022-03-15 20:49:35,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7324 to 7289. [2022-03-15 20:49:35,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7289 states, 7288 states have (on average 2.5443194291986826) internal successors, (18543), 7288 states have internal predecessors, (18543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7289 states to 7289 states and 18543 transitions. [2022-03-15 20:49:35,242 INFO L78 Accepts]: Start accepts. Automaton has 7289 states and 18543 transitions. Word has length 26 [2022-03-15 20:49:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:49:35,242 INFO L470 AbstractCegarLoop]: Abstraction has 7289 states and 18543 transitions. [2022-03-15 20:49:35,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 7289 states and 18543 transitions. [2022-03-15 20:49:35,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:49:35,246 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:49:35,246 INFO L514 BasicCegarLoop]: trace histogram [9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:49:35,262 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 20:49:35,447 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 20:49:35,447 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:49:35,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:49:35,448 INFO L85 PathProgramCache]: Analyzing trace with hash -358028007, now seen corresponding path program 28 times [2022-03-15 20:49:35,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:49:35,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23048672] [2022-03-15 20:49:35,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:49:35,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:49:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:49:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:49:35,700 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:49:35,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23048672] [2022-03-15 20:49:35,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23048672] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:49:35,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660760617] [2022-03-15 20:49:35,700 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:49:35,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:49:35,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:49:35,702 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 20:49:35,702 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 20:49:35,725 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:49:35,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:49:35,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-15 20:49:35,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:49:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:49:35,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:49:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 1 proven. 75 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:49:36,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660760617] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:49:36,277 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:49:36,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 29 [2022-03-15 20:49:36,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1242817694] [2022-03-15 20:49:36,277 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:49:36,279 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:49:36,291 INFO L252 McrAutomatonBuilder]: Finished intersection with 111 states and 194 transitions. [2022-03-15 20:49:36,291 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:49:39,499 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 48 new interpolants: [351639#(and (or (< 3 m) (<= m 2) (< j1 m) (<= (+ 9 k1) (+ k2 m))) (or (<= (+ k2 m) (+ 9 k1)) (< 3 m) (<= m 2) (< j1 m))), 351615#(and (<= (+ 5 k1) (+ k2 m)) (<= (+ k2 m) (+ 5 k1))), 351614#(and (<= (+ k2 m) (+ k1 4)) (<= (+ k1 4) (+ k2 m))), 351598#(and (< k1 (+ k2 m 1)) (<= (+ k2 m) k1)), 351605#(and (or (< j1 m) (< k1 (+ k2 1))) (or (<= k2 k1) (< j1 m))), 351637#(and (<= (+ 2 k1) (+ (* 3 j1) k2)) (<= (+ (* 3 j1) k2) (+ 2 k1))), 351607#(and (or (not (< (+ j1 1) m)) (< (+ k1 1) k2) (< (+ 2 j1) m)) (or (not (< (+ j1 1) m)) (<= k2 (+ 2 k1)) (< (+ 2 j1) m))), 351612#(and (or (< (+ 3 j1) m) (not (< (+ 2 j1) m)) (<= (+ k1 12) (+ k2 (* 2 m))) (< 3 m) (<= m 2)) (or (< (+ 3 j1) m) (<= (+ k2 (* 2 m)) (+ k1 12)) (not (< (+ 2 j1) m)) (< 3 m) (<= m 2))), 351632#(and (<= (+ k1 4) (+ (* 3 m) k2)) (<= (+ (* 3 m) k2) (+ k1 4))), 351604#(and (<= (+ 2 k1) (+ k2 (* 2 m))) (<= (+ k2 (* 2 m)) (+ 2 k1))), 351580#(or (< 3 m) (and (<= k2 (+ 9 k1)) (<= (+ 9 k1) k2)) (not (< 2 m))), 351600#(and (<= (+ (* 3 m) k2) k1) (< k1 (+ (* 3 m) k2 1))), 351633#(and (<= (+ 5 k1) (+ (* 3 m) k2)) (<= (+ (* 3 m) k2) (+ 5 k1))), 351630#(and (<= (+ (* 3 m) k2) (+ 2 k1)) (<= (+ 2 k1) (+ (* 3 m) k2))), 351611#(and (or (not (< (+ j1 1) m)) (< (+ 2 j1) m) (< 3 m) (<= (+ k2 (* 2 m)) (+ k1 11)) (<= m 2)) (or (<= (+ k1 11) (+ k2 (* 2 m))) (not (< (+ j1 1) m)) (< (+ 2 j1) m) (< 3 m) (<= m 2))), 351631#(and (<= (+ 3 k1) (+ (* 3 m) k2)) (<= (+ (* 3 m) k2) (+ 3 k1))), 351621#(and (<= (+ k2 (* 2 m)) (+ k1 4)) (<= (+ k1 4) (+ k2 (* 2 m)))), 351624#(and (<= (+ (* 3 j1) k2) (+ 6 k1 m)) (<= (+ 6 k1) (+ k2 (* 2 m)))), 351623#(and (<= (+ k2 (* 2 m)) (+ 6 k1)) (<= (+ 6 k1) (+ k2 (* 2 m)))), 351617#(and (<= (+ 6 k1) (+ k2 m)) (<= (+ (* 3 j1) k2) (+ 6 k1 (* 2 m)))), 351602#(and (<= (+ k2 m) (+ 2 k1)) (<= (+ 2 k1) (+ k2 m))), 351640#(and (or (<= (+ k2 m) (+ k1 10)) (< (+ j1 1) m) (< 3 m) (<= m 2) (not (< j1 m))) (or (< (+ j1 1) m) (< 3 m) (<= (+ k1 10) (+ k2 m)) (<= m 2) (not (< j1 m)))), 351610#(and (or (<= (+ k2 (* 2 m)) (+ k1 10)) (< (+ j1 1) m) (< 3 m) (<= m 2) (not (< j1 m))) (or (< (+ j1 1) m) (< 3 m) (<= (+ k1 10) (+ k2 (* 2 m))) (<= m 2) (not (< j1 m)))), 351629#(and (<= (+ k1 1) (+ (* 3 m) k2)) (<= (+ (* 3 m) k2) (+ k1 1))), 351584#(or (and (<= (+ k2 m) (+ 9 k1)) (<= (+ 9 k1) (+ k2 m))) (< 3 m) (not (< 2 m))), 351608#(and (or (< (+ 3 j1) m) (not (< (+ 2 j1) m)) (<= k2 (+ 3 k1))) (or (< (+ 2 k1) k2) (< (+ 3 j1) m) (not (< (+ 2 j1) m)))), 351603#(and (<= (+ k2 (* 2 m)) (+ k1 1)) (<= (+ k1 1) (+ k2 (* 2 m)))), 351641#(and (or (not (< (+ j1 1) m)) (< (+ 2 j1) m) (< 3 m) (<= (+ k1 11) (+ k2 m)) (<= m 2)) (or (not (< (+ j1 1) m)) (< (+ 2 j1) m) (< 3 m) (<= (+ k2 m) (+ k1 11)) (<= m 2))), 351588#(or (and (<= (+ 9 k1) (+ k2 (* 2 m))) (<= (+ k2 (* 2 m)) (+ 9 k1))) (< 3 m) (not (< 2 m))), 351606#(and (or (< (+ j1 1) m) (not (< j1 m)) (< k1 k2)) (or (<= k2 (+ k1 1)) (< (+ j1 1) m) (not (< j1 m)))), 351626#(and (<= (+ (* 3 j1) k2) (+ 2 k1 m)) (<= (+ 2 k1 m) (+ (* 3 j1) k2))), 351618#(and (<= (+ (* 3 j1) k2) (+ k1 (* 2 m) 4)) (<= (+ k1 (* 2 m) 4) (+ (* 3 j1) k2))), 351620#(and (<= (+ k2 (* 2 m)) (+ 3 k1)) (<= (+ 3 k1) (+ k2 (* 2 m)))), 351619#(and (<= (+ (* 3 j1) k2) (+ 2 k1 (* 2 m))) (<= (+ 2 k1 (* 2 m)) (+ (* 3 j1) k2))), 351627#(and (= j1 i1) (<= (+ k2 (* 2 i1)) (* 2 m)) (<= (* 2 m) (+ k2 (* 2 i1))) (= k1 i1)), 351628#(and (= j1 i1) (<= m (+ k2 (* 2 i1))) (= k1 i1) (<= (+ k2 (* 2 i1)) m)), 351616#(and (<= (+ 6 k1) (+ k2 m)) (<= (+ k2 m) (+ 6 k1))), 351601#(and (<= (+ k1 1) (+ k2 m)) (<= (+ k2 m) (+ k1 1))), 351622#(and (<= (+ 5 k1) (+ k2 (* 2 m))) (<= (+ k2 (* 2 m)) (+ 5 k1))), 351635#(and (<= (+ (* 3 j1) k2) (+ 6 k1)) (<= (+ 6 k1) (+ (* 3 m) k2))), 351636#(and (<= (+ (* 3 j1) k2) (+ k1 4)) (<= (+ k1 4) (+ (* 3 j1) k2))), 351613#(and (<= (+ k2 m) (+ 3 k1)) (<= (+ 3 k1) (+ k2 m))), 351638#(and (= j1 i1) (<= 0 (+ k2 (* 2 i1))) (= k1 i1) (<= (+ k2 (* 2 i1)) 0)), 351634#(and (<= (+ (* 3 m) k2) (+ 6 k1)) (<= (+ 6 k1) (+ (* 3 m) k2))), 351599#(and (< k1 (+ k2 (* 2 m) 1)) (<= (+ k2 (* 2 m)) k1)), 351625#(and (<= (+ (* 3 j1) k2) (+ k1 m 4)) (<= (+ k1 m 4) (+ (* 3 j1) k2))), 351642#(and (or (<= (+ k2 m) (+ k1 12)) (< (+ 3 j1) m) (not (< (+ 2 j1) m)) (< 3 m) (<= m 2)) (or (< (+ 3 j1) m) (not (< (+ 2 j1) m)) (< 3 m) (<= m 2) (<= (+ k1 12) (+ k2 m)))), 351609#(and (or (< 3 m) (<= m 2) (< j1 m) (<= (+ k2 (* 2 m)) (+ 9 k1))) (or (< 3 m) (<= m 2) (< j1 m) (<= (+ 9 k1) (+ k2 (* 2 m)))))] [2022-03-15 20:49:39,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-15 20:49:39,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:49:39,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-15 20:49:39,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=5465, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 20:49:39,500 INFO L87 Difference]: Start difference. First operand 7289 states and 18543 transitions. Second operand has 65 states, 64 states have (on average 2.359375) internal successors, (151), 64 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:01,265 INFO L93 Difference]: Finished difference Result 11968 states and 30104 transitions. [2022-03-15 20:50:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2022-03-15 20:50:01,265 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.359375) internal successors, (151), 64 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 20:50:01,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:01,282 INFO L225 Difference]: With dead ends: 11968 [2022-03-15 20:50:01,282 INFO L226 Difference]: Without dead ends: 11889 [2022-03-15 20:50:01,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 66 SyntacticMatches, 9 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20334 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=4468, Invalid=64964, Unknown=0, NotChecked=0, Total=69432 [2022-03-15 20:50:01,286 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 836 mSDsluCounter, 4336 mSDsCounter, 0 mSdLazyCounter, 12598 mSolverCounterSat, 565 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 13163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 565 IncrementalHoareTripleChecker+Valid, 12598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:01,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [836 Valid, 0 Invalid, 13163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [565 Valid, 12598 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-03-15 20:50:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11889 states. [2022-03-15 20:50:01,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11889 to 7963. [2022-03-15 20:50:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7963 states, 7962 states have (on average 2.5344134639537805) internal successors, (20179), 7962 states have internal predecessors, (20179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7963 states to 7963 states and 20179 transitions. [2022-03-15 20:50:01,434 INFO L78 Accepts]: Start accepts. Automaton has 7963 states and 20179 transitions. Word has length 26 [2022-03-15 20:50:01,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:01,434 INFO L470 AbstractCegarLoop]: Abstraction has 7963 states and 20179 transitions. [2022-03-15 20:50:01,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.359375) internal successors, (151), 64 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 7963 states and 20179 transitions. [2022-03-15 20:50:01,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:50:01,439 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:01,439 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:01,454 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 20:50:01,639 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 20:50:01,639 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:01,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:01,640 INFO L85 PathProgramCache]: Analyzing trace with hash 101137841, now seen corresponding path program 29 times [2022-03-15 20:50:01,641 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:01,641 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457391148] [2022-03-15 20:50:01,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:01,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 45 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 20:50:01,703 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:01,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457391148] [2022-03-15 20:50:01,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457391148] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:01,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636701296] [2022-03-15 20:50:01,703 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:50:01,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:01,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:01,704 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 20:50:01,705 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 20:50:01,736 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 20:50:01,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:01,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:50:01,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 45 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 20:50:01,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:01,830 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 45 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 20:50:01,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636701296] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:01,830 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:01,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2022-03-15 20:50:01,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [128772186] [2022-03-15 20:50:01,831 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:01,832 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:01,844 INFO L252 McrAutomatonBuilder]: Finished intersection with 111 states and 194 transitions. [2022-03-15 20:50:01,844 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:03,009 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [380078#(or (<= n i2) (< (+ i2 1) n)), 380099#(or (<= n (+ 2 i2)) (<= i2 i1)), 380087#(or (<= n i2) (< (+ i2 1) n) (<= n (+ i1 1))), 380079#(or (<= n (+ i2 1)) (< (+ 2 i2) n)), 380082#(or (<= n i1) (< i2 n)), 380089#(or (<= n i2) (<= i2 (+ 2 i1))), 380093#(or (<= n (+ i2 1)) (<= n (+ 2 i1)) (< (+ 2 i2) n)), 380091#(or (<= n (+ i2 1)) (<= n i1) (< (+ 2 i2) n)), 380098#(or (< (+ 3 i2) n) (<= n (+ 2 i2)) (<= n (+ 2 i1))), 380083#(or (<= n (+ i1 1)) (< i2 n)), 380097#(or (< (+ 3 i2) n) (<= n (+ 2 i2)) (<= n (+ i1 1))), 380077#(< i2 n), 380085#(or (<= n i2) (<= (+ n 1) i1) (< (+ i2 1) n)), 380080#(or (< (+ 3 i2) n) (<= n (+ 2 i2))), 380095#(or (< (+ 3 i2) n) (<= n (+ 2 i2)) (<= (+ n 1) i1)), 380081#(or (<= (+ n 1) i1) (< i2 n)), 380090#(or (<= (+ n 1) i1) (<= n (+ i2 1)) (< (+ 2 i2) n)), 380092#(or (<= n (+ i2 1)) (<= n (+ i1 1)) (< (+ 2 i2) n)), 380084#(or (<= n (+ 2 i1)) (< i2 n)), 380088#(or (<= n i2) (<= n (+ 2 i1)) (< (+ i2 1) n)), 380096#(or (< (+ 3 i2) n) (<= n (+ 2 i2)) (<= n i1)), 380094#(or (<= i2 (+ i1 1)) (<= n (+ i2 1))), 380086#(or (<= n i2) (<= n i1) (< (+ i2 1) n))] [2022-03-15 20:50:03,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 20:50:03,010 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:03,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 20:50:03,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 20:50:03,010 INFO L87 Difference]: Start difference. First operand 7963 states and 20179 transitions. Second operand has 34 states, 34 states have (on average 3.6176470588235294) internal successors, (123), 33 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:04,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:04,695 INFO L93 Difference]: Finished difference Result 19447 states and 47540 transitions. [2022-03-15 20:50:04,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-15 20:50:04,697 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.6176470588235294) internal successors, (123), 33 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 20:50:04,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:04,725 INFO L225 Difference]: With dead ends: 19447 [2022-03-15 20:50:04,726 INFO L226 Difference]: Without dead ends: 19087 [2022-03-15 20:50:04,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2786 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2660, Invalid=7240, Unknown=0, NotChecked=0, Total=9900 [2022-03-15 20:50:04,727 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 417 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:04,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 0 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:50:04,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19087 states. [2022-03-15 20:50:04,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19087 to 8487. [2022-03-15 20:50:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8487 states, 8486 states have (on average 2.5124911619137404) internal successors, (21321), 8486 states have internal predecessors, (21321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:04,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8487 states to 8487 states and 21321 transitions. [2022-03-15 20:50:04,959 INFO L78 Accepts]: Start accepts. Automaton has 8487 states and 21321 transitions. Word has length 26 [2022-03-15 20:50:04,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:04,960 INFO L470 AbstractCegarLoop]: Abstraction has 8487 states and 21321 transitions. [2022-03-15 20:50:04,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.6176470588235294) internal successors, (123), 33 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:04,960 INFO L276 IsEmpty]: Start isEmpty. Operand 8487 states and 21321 transitions. [2022-03-15 20:50:04,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:50:04,965 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:04,965 INFO L514 BasicCegarLoop]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:04,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-03-15 20:50:05,165 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 20:50:05,166 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:05,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:05,166 INFO L85 PathProgramCache]: Analyzing trace with hash -611073218, now seen corresponding path program 30 times [2022-03-15 20:50:05,167 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:05,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230954560] [2022-03-15 20:50:05,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:05,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:05,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:05,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230954560] [2022-03-15 20:50:05,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230954560] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:05,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261297573] [2022-03-15 20:50:05,407 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:50:05,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:05,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:05,408 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 20:50:05,409 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 20:50:05,434 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-03-15 20:50:05,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:05,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 20:50:05,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 1 proven. 95 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:50:05,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:50:06,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261297573] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:06,558 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:06,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 15] total 46 [2022-03-15 20:50:06,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [160322180] [2022-03-15 20:50:06,558 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:06,560 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:06,570 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 168 transitions. [2022-03-15 20:50:06,570 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:09,685 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 44 new interpolants: [416879#(and (or (not (< (+ 5 j1) m)) (< 6 m) (<= m 5) (< (+ 6 j1) m) (<= k2 (+ k1 12))) (or (not (< (+ 5 j1) m)) (< 6 m) (<= m 5) (< (+ k1 11) k2) (< (+ 6 j1) m))), 416878#(and (= j1 i1) (= k1 i1) (<= 0 (+ k2 i1)) (<= (+ k2 i1) 0)), 416850#(and (<= (+ 5 k1) (+ k2 m)) (<= (+ k2 m) (+ 5 k1))), 416859#(and (<= (+ 5 k1) (+ k2 (* 2 m))) (<= (+ k2 (* 2 m)) (+ 5 k1))), 416786#(or (< (+ 3 j1) m) (not (< (+ 2 j1) m)) (and (< (+ 2 k1) k2) (<= k2 (+ 3 k1)))), 416846#(and (<= (+ k1 1) (+ k2 m)) (<= (+ k2 m) (+ k1 1))), 416864#(and (or (<= k2 (+ 7 k1)) (< (+ j1 1) m) (< 6 m) (<= m 5) (not (< j1 m))) (or (< (+ 6 k1) k2) (< (+ j1 1) m) (< 6 m) (<= m 5) (not (< j1 m)))), 416874#(and (<= (+ (* 2 j1) k2) (+ 3 k1)) (<= (+ 3 k1) (+ (* 2 j1) k2))), 416856#(and (<= (+ 2 k1) (+ k2 (* 2 m))) (<= (+ k2 (* 2 m)) (+ 2 k1))), 416847#(and (<= (+ k2 m) (+ 2 k1)) (<= (+ 2 k1) (+ k2 m))), 416873#(and (<= (+ (* 2 j1) k2) (+ k1 4)) (<= (+ k1 4) (+ (* 2 j1) k2))), 416876#(and (<= (+ (* 2 j1) k2) (+ k1 1)) (<= (+ k1 1) (+ (* 2 j1) k2))), 416863#(and (or (< (+ 5 k1) k2) (< 6 m) (<= m 5) (< j1 m)) (or (<= k2 (+ 6 k1)) (< 6 m) (<= m 5) (< j1 m))), 416857#(and (<= (+ k2 (* 2 m)) (+ 3 k1)) (<= (+ 3 k1) (+ k2 (* 2 m)))), 416877#(and (= j1 i1) (= k1 i1) (<= m (+ k2 i1)) (<= (+ k2 i1) m)), 416849#(and (<= (+ k2 m) (+ k1 4)) (<= (+ k1 4) (+ k2 m))), 416848#(and (<= (+ k2 m) (+ 3 k1)) (<= (+ 3 k1) (+ k2 m))), 416866#(and (or (< (+ 3 j1) m) (not (< (+ 2 j1) m)) (<= k2 (+ 9 k1)) (< 6 m) (<= m 5)) (or (< (+ 3 j1) m) (not (< (+ 2 j1) m)) (< (+ k1 8) k2) (< 6 m) (<= m 5))), 416862#(and (<= (+ 5 k1) (+ (* 2 j1) k2)) (<= (+ (* 2 j1) k2) (+ 5 k1))), 416867#(and (or (<= k2 (+ k1 10)) (< 6 m) (not (< (+ 3 j1) m)) (<= m 5) (< (+ j1 4) m)) (or (< 6 m) (not (< (+ 3 j1) m)) (<= m 5) (< (+ 9 k1) k2) (< (+ j1 4) m))), 416853#(and (<= (+ 5 k1 m) (+ (* 2 j1) k2)) (<= (+ (* 2 j1) k2) (+ 5 k1 m))), 416861#(and (<= (+ (* 2 j1) k2) (+ 6 k1)) (<= (+ 6 k1) (+ k2 (* 2 m)))), 416854#(and (< k1 (+ k2 (* 2 m) 1)) (<= (+ k2 (* 2 m)) k1)), 416872#(and (<= (+ (* 2 j1) k2) (+ k1 m 1)) (<= (+ k1 m 1) (+ (* 2 j1) k2))), 416871#(and (<= (+ 2 k1 m) (+ (* 2 j1) k2)) (<= (+ (* 2 j1) k2) (+ 2 k1 m))), 416860#(and (<= (+ k2 (* 2 m)) (+ 6 k1)) (<= (+ 6 k1) (+ k2 (* 2 m)))), 416845#(and (< k1 (+ k2 m 1)) (<= (+ k2 m) k1)), 416865#(and (or (< (+ 7 k1) k2) (not (< (+ j1 1) m)) (< (+ 2 j1) m) (< 6 m) (<= m 5)) (or (not (< (+ j1 1) m)) (<= k2 (+ k1 8)) (< (+ 2 j1) m) (< 6 m) (<= m 5))), 416798#(or (not (< (+ 5 j1) m)) (and (< (+ 5 k1) k2) (<= k2 (+ 6 k1))) (< (+ 6 j1) m)), 416778#(or (< (+ j1 1) m) (and (<= k2 (+ k1 1)) (< k1 k2)) (not (< j1 m))), 416858#(and (<= (+ k2 (* 2 m)) (+ k1 4)) (<= (+ k1 4) (+ k2 (* 2 m)))), 416855#(and (<= (+ k2 (* 2 m)) (+ k1 1)) (<= (+ k1 1) (+ k2 (* 2 m)))), 416790#(or (not (< (+ 3 j1) m)) (< (+ j1 4) m) (and (<= k2 (+ k1 4)) (< (+ 3 k1) k2))), 416868#(and (<= (+ (* 2 j1) k2) (+ k1 m 4)) (<= (+ k1 m 4) (+ (* 2 j1) k2))), 416802#(or (< 6 m) (and (< (+ 5 k1) k2) (<= k2 (+ 6 k1))) (not (< 5 m))), 416782#(or (not (< (+ j1 1) m)) (< (+ 2 j1) m) (and (<= k2 (+ 2 k1)) (< (+ k1 1) k2))), 416851#(and (<= (+ 6 k1) (+ k2 m)) (<= (+ k2 m) (+ 6 k1))), 416794#(or (and (<= k2 (+ 5 k1)) (< (+ k1 4) k2)) (< (+ 5 j1) m) (not (< (+ j1 4) m))), 416870#(and (<= (+ (* 2 j1) k2) (+ 3 k1 m)) (<= (+ 3 k1 m) (+ (* 2 j1) k2))), 416869#(and (or (< 6 m) (<= m 5) (<= k2 (+ k1 11)) (< (+ 5 j1) m) (not (< (+ j1 4) m))) (or (< 6 m) (<= m 5) (< (+ 5 j1) m) (not (< (+ j1 4) m)) (< (+ k1 10) k2))), 416875#(and (<= (+ (* 2 j1) k2) (+ 2 k1)) (<= (+ 2 k1) (+ (* 2 j1) k2))), 416774#(or (and (<= k2 k1) (< k1 (+ k2 1))) (< j1 m)), 416852#(and (<= (+ 6 k1) (+ k2 m)) (<= (+ (* 2 j1) k2) (+ 6 k1 m))), 416829#(or (and (< (+ k1 11) k2) (<= k2 (+ k1 12))) (< 6 m) (not (< 5 m)))] [2022-03-15 20:50:09,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 20:50:09,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:09,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 20:50:09,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=6551, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 20:50:09,686 INFO L87 Difference]: Start difference. First operand 8487 states and 21321 transitions. Second operand has 63 states, 62 states have (on average 2.193548387096774) internal successors, (136), 62 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:38,022 INFO L93 Difference]: Finished difference Result 35756 states and 91144 transitions. [2022-03-15 20:50:38,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2022-03-15 20:50:38,023 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.193548387096774) internal successors, (136), 62 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 20:50:38,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:38,078 INFO L225 Difference]: With dead ends: 35756 [2022-03-15 20:50:38,078 INFO L226 Difference]: Without dead ends: 35731 [2022-03-15 20:50:38,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 43 SyntacticMatches, 14 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20073 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=6443, Invalid=68359, Unknown=0, NotChecked=0, Total=74802 [2022-03-15 20:50:38,081 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 827 mSDsluCounter, 3811 mSDsCounter, 0 mSdLazyCounter, 12346 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 13049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 12346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:38,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [827 Valid, 0 Invalid, 13049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 12346 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-03-15 20:50:38,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35731 states. [2022-03-15 20:50:38,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35731 to 10913. [2022-03-15 20:50:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10913 states, 10912 states have (on average 2.5483870967741935) internal successors, (27808), 10912 states have internal predecessors, (27808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10913 states to 10913 states and 27808 transitions. [2022-03-15 20:50:38,444 INFO L78 Accepts]: Start accepts. Automaton has 10913 states and 27808 transitions. Word has length 26 [2022-03-15 20:50:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:38,444 INFO L470 AbstractCegarLoop]: Abstraction has 10913 states and 27808 transitions. [2022-03-15 20:50:38,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.193548387096774) internal successors, (136), 62 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 10913 states and 27808 transitions. [2022-03-15 20:50:38,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 20:50:38,450 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:38,450 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:38,466 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 20:50:38,651 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 20:50:38,651 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:38,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:38,651 INFO L85 PathProgramCache]: Analyzing trace with hash -136641581, now seen corresponding path program 12 times [2022-03-15 20:50:38,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:38,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504112817] [2022-03-15 20:50:38,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:38,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:38,758 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 22 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:38,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:38,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504112817] [2022-03-15 20:50:38,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504112817] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:38,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863589947] [2022-03-15 20:50:38,758 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:50:38,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:38,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:38,760 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 20:50:38,761 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 20:50:38,787 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-03-15 20:50:38,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:38,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 20:50:38,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:38,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:38,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863589947] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:38,886 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:38,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 16 [2022-03-15 20:50:38,886 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [746480981] [2022-03-15 20:50:38,886 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:38,888 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:38,905 INFO L252 McrAutomatonBuilder]: Finished intersection with 153 states and 277 transitions. [2022-03-15 20:50:38,905 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:40,968 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 62 new interpolants: [475069#(or (<= n (+ 3 i1)) (<= (+ 5 i1) n)), 475049#(or (<= n (+ 2 i2)) (<= (+ 5 i1) n)), 475028#(or (<= n (+ 3 i2)) (<= (+ 2 i1) n)), 475026#(or (<= n (+ i2 1)) (<= (+ 2 i1) n)), 475029#(<= n (+ i2 4)), 475051#(or (<= n (+ i2 4)) (<= (+ 5 i1) n)), 475041#(or (<= n (+ 2 i2)) (<= (+ i1 4) n)), 475053#(or (<= (+ 6 i1) n) (<= n i2)), 475036#(or (<= (+ 3 i1) n) (<= n (+ i2 1))), 475020#(<= n (+ 3 i2)), 475044#(or (<= n (+ i2 4)) (<= (+ i1 4) n)), 475043#(or (<= n (+ i2 4)) (<= (+ 3 i1) n)), 475039#(or (<= n i2) (<= (+ i1 4) n)), 475017#(<= n i2), 475032#(<= n (+ 5 i2)), 475073#(or (<= n (+ i2 1)) (<= (+ 7 i1) n)), 475078#(or (<= n (+ 6 i2)) (<= (+ 7 i1) n)), 475058#(or (< i1 n) (<= n (+ 6 i2))), 475070#(or (<= (+ 6 i1) n) (<= n (+ i1 4))), 475059#(or (<= (+ 2 i1) n) (<= n (+ 6 i2))), 475048#(or (<= n (+ i2 1)) (<= (+ 5 i1) n)), 475037#(or (<= n (+ 2 i2)) (<= (+ 3 i1) n)), 475021#(or (< i1 n) (<= n i2)), 475024#(or (<= n (+ 3 i2)) (< i1 n)), 475072#(or (<= n i2) (<= (+ 7 i1) n)), 475062#(or (<= (+ 5 i1) n) (<= n (+ 6 i2))), 475066#(or (<= (+ 2 i1) n) (<= n i1)), 475061#(or (<= (+ i1 4) n) (<= n (+ 6 i2))), 475042#(or (<= n (+ 3 i2)) (<= (+ i1 4) n)), 475046#(or (<= n (+ 5 i2)) (<= (+ i1 4) n)), 475054#(or (<= (+ 6 i1) n) (<= n (+ i2 1))), 475027#(or (<= n (+ 2 i2)) (<= (+ 2 i1) n)), 475068#(or (<= n (+ 2 i1)) (<= (+ i1 4) n)), 475064#(or (<= (+ 6 i1) n) (<= n (+ 5 i2))), 475022#(or (< i1 n) (<= n (+ i2 1))), 475033#(or (< i1 n) (<= n (+ 5 i2))), 475040#(or (<= n (+ i2 1)) (<= (+ i1 4) n)), 475018#(<= n (+ i2 1)), 475035#(or (<= n i2) (<= (+ 3 i1) n)), 475076#(or (<= n (+ i2 4)) (<= (+ 7 i1) n)), 475057#(<= n (+ 6 i2)), 475030#(or (< i1 n) (<= n (+ i2 4))), 475031#(or (<= n (+ i2 4)) (<= (+ 2 i1) n)), 475047#(or (<= n i2) (<= (+ 5 i1) n)), 475038#(or (<= n (+ 3 i2)) (<= (+ 3 i1) n)), 475034#(or (<= (+ 2 i1) n) (<= n (+ 5 i2))), 475055#(or (<= (+ 6 i1) n) (<= n (+ 2 i2))), 475019#(<= n (+ 2 i2)), 475071#(or (<= n (+ 5 i1)) (<= (+ 7 i1) n)), 475052#(or (<= n (+ 5 i2)) (<= (+ 5 i1) n)), 475074#(or (<= n (+ 2 i2)) (<= (+ 7 i1) n)), 475063#(or (<= (+ 6 i1) n) (<= n (+ i2 4))), 475077#(or (<= n (+ 5 i2)) (<= (+ 7 i1) n)), 475067#(or (<= (+ 3 i1) n) (<= n (+ i1 1))), 475045#(or (<= (+ 3 i1) n) (<= n (+ 5 i2))), 475023#(or (<= n (+ 2 i2)) (< i1 n)), 475056#(or (<= (+ 6 i1) n) (<= n (+ 3 i2))), 475050#(or (<= n (+ 3 i2)) (<= (+ 5 i1) n)), 475065#(or (<= (+ 6 i1) n) (<= n (+ 6 i2))), 475025#(or (<= n i2) (<= (+ 2 i1) n)), 475060#(or (<= (+ 3 i1) n) (<= n (+ 6 i2))), 475075#(or (<= n (+ 3 i2)) (<= (+ 7 i1) n))] [2022-03-15 20:50:40,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-03-15 20:50:40,968 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:40,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-03-15 20:50:40,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1682, Invalid=4480, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 20:50:40,969 INFO L87 Difference]: Start difference. First operand 10913 states and 27808 transitions. Second operand has 78 states, 78 states have (on average 2.6666666666666665) internal successors, (208), 77 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:44,287 INFO L93 Difference]: Finished difference Result 22261 states and 58726 transitions. [2022-03-15 20:50:44,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-03-15 20:50:44,287 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 2.6666666666666665) internal successors, (208), 77 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 20:50:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:44,320 INFO L225 Difference]: With dead ends: 22261 [2022-03-15 20:50:44,321 INFO L226 Difference]: Without dead ends: 22236 [2022-03-15 20:50:44,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10983 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=8329, Invalid=20401, Unknown=0, NotChecked=0, Total=28730 [2022-03-15 20:50:44,322 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 469 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:44,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 0 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:50:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22236 states. [2022-03-15 20:50:44,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22236 to 13863. [2022-03-15 20:50:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13863 states, 13862 states have (on average 2.5867840138508154) internal successors, (35858), 13862 states have internal predecessors, (35858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13863 states to 13863 states and 35858 transitions. [2022-03-15 20:50:44,573 INFO L78 Accepts]: Start accepts. Automaton has 13863 states and 35858 transitions. Word has length 27 [2022-03-15 20:50:44,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:44,573 INFO L470 AbstractCegarLoop]: Abstraction has 13863 states and 35858 transitions. [2022-03-15 20:50:44,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 2.6666666666666665) internal successors, (208), 77 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:44,573 INFO L276 IsEmpty]: Start isEmpty. Operand 13863 states and 35858 transitions. [2022-03-15 20:50:44,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 20:50:44,580 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:44,580 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:44,596 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 20:50:44,780 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 20:50:44,780 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:44,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:44,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1089780842, now seen corresponding path program 31 times [2022-03-15 20:50:44,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:44,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928316012] [2022-03-15 20:50:44,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:44,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 34 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 20:50:44,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:44,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928316012] [2022-03-15 20:50:44,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928316012] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:44,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221500276] [2022-03-15 20:50:44,833 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:50:44,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:44,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:44,834 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 20:50:44,863 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 20:50:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:44,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:50:44,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 34 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 20:50:44,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 34 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 20:50:44,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221500276] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:44,968 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:44,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-03-15 20:50:44,969 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [190111782] [2022-03-15 20:50:44,969 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:44,971 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:44,990 INFO L252 McrAutomatonBuilder]: Finished intersection with 129 states and 229 transitions. [2022-03-15 20:50:44,990 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:46,488 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [525437#(or (<= n (+ 2 i1)) (< (+ 3 i1) n)), 525424#(or (<= n i2) (<= i2 (+ i1 1))), 525421#(or (<= n (+ 2 i2)) (<= (+ i2 4) n)), 525433#(or (<= n (+ 2 i2)) (<= i2 i1)), 525417#(or (<= n i2) (<= i2 i1)), 525415#(or (<= n i2) (<= (+ 2 i2) n)), 525430#(or (<= n (+ 3 i2)) (<= (+ 2 i2) i1)), 525422#(or (<= n (+ 2 i2)) (<= (+ 3 i2) i1)), 525414#(< (+ i1 1) n), 525431#(or (<= n i2) (<= i2 (+ 2 i1))), 525428#(or (<= n (+ 3 i2)) (<= (+ i2 4) i1)), 525442#(or (<= n (+ 2 i2)) (<= i2 (+ i1 1))), 525423#(or (<= n (+ 2 i2)) (<= (+ 2 i2) i1)), 525426#(or (<= n (+ 2 i2)) (<= (+ i2 1) i1)), 525413#(< i1 n), 525438#(or (< (+ i1 4) n) (<= n (+ 3 i1))), 525419#(or (<= n (+ i2 1)) (<= (+ 2 i2) i1)), 525441#(or (<= n (+ i1 4)) (< (+ 5 i1) n)), 525434#(or (<= n (+ 3 i2)) (<= (+ i2 1) i1)), 525427#(or (<= (+ 5 i2) n) (<= n (+ 3 i2))), 525420#(or (<= n (+ i2 1)) (<= (+ i2 1) i1)), 525416#(or (<= n i2) (<= (+ i2 1) i1)), 525440#(or (<= n (+ i2 1)) (<= i2 (+ 2 i1))), 525429#(or (<= n (+ 3 i2)) (<= (+ 3 i2) i1)), 525425#(or (<= n (+ i2 1)) (<= i2 i1)), 525439#(or (<= n i2) (<= i2 (+ 3 i1))), 525436#(or (< (+ 2 i1) n) (<= n (+ i1 1))), 525432#(or (<= i2 (+ i1 1)) (<= n (+ i2 1))), 525443#(or (<= n (+ 3 i2)) (<= i2 i1)), 525418#(or (<= n (+ i2 1)) (<= (+ 3 i2) n)), 525435#(or (< (+ i1 1) n) (<= n i1))] [2022-03-15 20:50:46,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 20:50:46,489 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:46,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 20:50:46,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1351, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 20:50:46,489 INFO L87 Difference]: Start difference. First operand 13863 states and 35858 transitions. Second operand has 40 states, 40 states have (on average 3.725) internal successors, (149), 39 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:50,728 INFO L93 Difference]: Finished difference Result 19720 states and 47680 transitions. [2022-03-15 20:50:50,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-03-15 20:50:50,730 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.725) internal successors, (149), 39 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 20:50:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:50,759 INFO L225 Difference]: With dead ends: 19720 [2022-03-15 20:50:50,760 INFO L226 Difference]: Without dead ends: 19720 [2022-03-15 20:50:50,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4025 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3635, Invalid=12115, Unknown=0, NotChecked=0, Total=15750 [2022-03-15 20:50:50,761 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 703 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:50,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [703 Valid, 0 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:50:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19720 states. [2022-03-15 20:50:50,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19720 to 14744. [2022-03-15 20:50:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14744 states, 14743 states have (on average 2.532116936851387) internal successors, (37331), 14743 states have internal predecessors, (37331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:51,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14744 states to 14744 states and 37331 transitions. [2022-03-15 20:50:51,079 INFO L78 Accepts]: Start accepts. Automaton has 14744 states and 37331 transitions. Word has length 27 [2022-03-15 20:50:51,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:51,080 INFO L470 AbstractCegarLoop]: Abstraction has 14744 states and 37331 transitions. [2022-03-15 20:50:51,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.725) internal successors, (149), 39 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:51,080 INFO L276 IsEmpty]: Start isEmpty. Operand 14744 states and 37331 transitions. [2022-03-15 20:50:51,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 20:50:51,085 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:51,085 INFO L514 BasicCegarLoop]: trace histogram [13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:51,101 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 20:50:51,286 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 20:50:51,286 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:51,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:51,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1767132625, now seen corresponding path program 32 times [2022-03-15 20:50:51,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:51,287 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591527389] [2022-03-15 20:50:51,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:51,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 39 proven. 71 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:50:51,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:51,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591527389] [2022-03-15 20:50:51,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591527389] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:51,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294306091] [2022-03-15 20:50:51,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:50:51,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:51,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:51,408 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 20:50:51,410 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 20:50:51,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:50:51,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:51,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 20:50:51,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 40 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:50:51,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 40 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:50:51,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294306091] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:51,662 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:51,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2022-03-15 20:50:51,662 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [738610890] [2022-03-15 20:50:51,662 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:51,665 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:51,678 INFO L252 McrAutomatonBuilder]: Finished intersection with 103 states and 177 transitions. [2022-03-15 20:50:51,678 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:52,432 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [575020#(or (< 7 m) (<= m 6)), 575018#(or (<= m (+ 5 j1)) (< (+ 6 j1) m)), 575021#(or (< 7 m) (< j1 m) (<= m 6)), 575023#(or (<= m (+ j1 1)) (< (+ 2 j1) m) (< 7 m) (<= m 6)), 575014#(or (<= m (+ j1 1)) (< (+ 2 j1) m)), 575019#(or (<= m (+ 6 j1)) (< (+ 7 j1) m)), 575027#(or (<= m (+ 5 j1)) (< 7 m) (<= m 6) (< (+ 6 j1) m)), 575022#(or (<= m j1) (< (+ j1 1) m) (< 7 m) (<= m 6)), 575025#(or (< 7 m) (<= m 6) (< (+ j1 4) m) (<= m (+ 3 j1))), 575016#(or (< (+ j1 4) m) (<= m (+ 3 j1))), 575012#(< j1 m), 575024#(or (< (+ 3 j1) m) (<= m (+ 2 j1)) (< 7 m) (<= m 6)), 575026#(or (<= m (+ j1 4)) (< 7 m) (<= m 6) (< (+ 5 j1) m)), 575013#(or (<= m j1) (< (+ j1 1) m)), 575017#(or (<= m (+ j1 4)) (< (+ 5 j1) m)), 575015#(or (< (+ 3 j1) m) (<= m (+ 2 j1)))] [2022-03-15 20:50:52,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 20:50:52,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:52,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 20:50:52,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=1798, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 20:50:52,433 INFO L87 Difference]: Start difference. First operand 14744 states and 37331 transitions. Second operand has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:53,107 INFO L93 Difference]: Finished difference Result 22322 states and 57148 transitions. [2022-03-15 20:50:53,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 20:50:53,108 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 20:50:53,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:53,146 INFO L225 Difference]: With dead ends: 22322 [2022-03-15 20:50:53,147 INFO L226 Difference]: Without dead ends: 22305 [2022-03-15 20:50:53,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1063, Invalid=3767, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 20:50:53,148 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 355 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:53,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 0 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:50:53,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22305 states. [2022-03-15 20:50:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22305 to 22083. [2022-03-15 20:50:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22083 states, 22082 states have (on average 2.559958337107146) internal successors, (56529), 22082 states have internal predecessors, (56529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22083 states to 22083 states and 56529 transitions. [2022-03-15 20:50:53,528 INFO L78 Accepts]: Start accepts. Automaton has 22083 states and 56529 transitions. Word has length 27 [2022-03-15 20:50:53,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:53,528 INFO L470 AbstractCegarLoop]: Abstraction has 22083 states and 56529 transitions. [2022-03-15 20:50:53,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:53,528 INFO L276 IsEmpty]: Start isEmpty. Operand 22083 states and 56529 transitions. [2022-03-15 20:50:53,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 20:50:53,535 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:53,535 INFO L514 BasicCegarLoop]: trace histogram [13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:53,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 20:50:53,735 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 20:50:53,736 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:53,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:53,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2047761249, now seen corresponding path program 33 times [2022-03-15 20:50:53,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:53,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180159442] [2022-03-15 20:50:53,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:53,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 19 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:53,900 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:53,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180159442] [2022-03-15 20:50:53,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180159442] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:53,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509710374] [2022-03-15 20:50:53,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:50:53,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:53,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:53,902 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 20:50:53,902 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 20:50:53,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-03-15 20:50:53,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:53,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 20:50:53,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 34 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:54,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 27 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:54,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509710374] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:54,144 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:54,144 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 33 [2022-03-15 20:50:54,144 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1673653181] [2022-03-15 20:50:54,145 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:54,146 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:54,158 INFO L252 McrAutomatonBuilder]: Finished intersection with 103 states and 177 transitions. [2022-03-15 20:50:54,158 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:55,236 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [641758#(or (<= m (+ j1 1)) (<= 7 m) (< (+ 2 j1) m) (<= m 5)), 641751#(or (<= (+ j1 4) m) (<= m (+ 2 j1))), 641752#(or (<= (+ 5 j1) m) (<= m (+ 3 j1))), 641754#(or (<= (+ 7 j1) m) (<= m (+ 5 j1))), 641769#(or (<= m (+ j1 4)) (<= 7 m) (< (+ 5 j1) m) (<= m 0)), 641759#(or (< (+ 3 j1) m) (<= 7 m) (<= m (+ 2 j1)) (<= m 5)), 641764#(or (<= 7 m) (< j1 m) (<= m 0)), 641763#(or (<= 7 m) (<= m 0)), 641773#(or (<= 7 m) (<= m (+ 6 j1)) (< (+ 7 j1) m) (<= m 0)), 641768#(or (<= 7 m) (< (+ j1 4) m) (<= m (+ 3 j1)) (<= m 0)), 641762#(or (<= (+ 7 j1) m) (<= m j1)), 641757#(or (<= 7 m) (<= m j1) (< (+ j1 1) m) (<= m 5)), 641765#(or (<= 7 m) (<= m j1) (< (+ j1 1) m) (<= m 0)), 641767#(or (< (+ 3 j1) m) (<= 7 m) (<= m (+ 2 j1)) (<= m 0)), 641753#(or (<= m (+ j1 4)) (<= (+ 6 j1) m)), 641772#(or (<= 7 m) (<= m (+ 5 j1)) (< (+ 6 j1) m) (<= m 0)), 641755#(or (<= 7 m) (<= m 5)), 641761#(or (<= m (+ j1 4)) (<= 7 m) (<= m 5) (< (+ 5 j1) m)), 641756#(or (<= 7 m) (<= m 5) (< j1 m)), 641771#(or (<= 7 m) (<= m 5) (<= m (+ 6 j1)) (< (+ 7 j1) m)), 641750#(or (<= m (+ j1 1)) (<= (+ 3 j1) m)), 641766#(or (<= m (+ j1 1)) (<= 7 m) (< (+ 2 j1) m) (<= m 0)), 641749#(or (<= m j1) (<= (+ 2 j1) m)), 641770#(or (<= 7 m) (<= m (+ 5 j1)) (<= m 5) (< (+ 6 j1) m)), 641760#(or (<= 7 m) (<= m 5) (< (+ j1 4) m) (<= m (+ 3 j1)))] [2022-03-15 20:50:55,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 20:50:55,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:55,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 20:50:55,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=707, Invalid=2599, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 20:50:55,237 INFO L87 Difference]: Start difference. First operand 22083 states and 56529 transitions. Second operand has 44 states, 44 states have (on average 2.6136363636363638) internal successors, (115), 44 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:56,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:56,582 INFO L93 Difference]: Finished difference Result 16987 states and 42279 transitions. [2022-03-15 20:50:56,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 20:50:56,583 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.6136363636363638) internal successors, (115), 44 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 20:50:56,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:56,609 INFO L225 Difference]: With dead ends: 16987 [2022-03-15 20:50:56,609 INFO L226 Difference]: Without dead ends: 16987 [2022-03-15 20:50:56,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 111 SyntacticMatches, 7 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2879 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1563, Invalid=5919, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 20:50:56,611 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 544 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:56,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [544 Valid, 0 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:50:56,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16987 states. [2022-03-15 20:50:56,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16987 to 14474. [2022-03-15 20:50:56,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14474 states, 14473 states have (on average 2.489532232432806) internal successors, (36031), 14473 states have internal predecessors, (36031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14474 states to 14474 states and 36031 transitions. [2022-03-15 20:50:56,871 INFO L78 Accepts]: Start accepts. Automaton has 14474 states and 36031 transitions. Word has length 27 [2022-03-15 20:50:56,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:56,871 INFO L470 AbstractCegarLoop]: Abstraction has 14474 states and 36031 transitions. [2022-03-15 20:50:56,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.6136363636363638) internal successors, (115), 44 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:56,872 INFO L276 IsEmpty]: Start isEmpty. Operand 14474 states and 36031 transitions. [2022-03-15 20:50:56,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 20:50:56,877 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:56,877 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:56,893 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 20:50:57,078 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 20:50:57,078 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:57,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:57,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2046519271, now seen corresponding path program 34 times [2022-03-15 20:50:57,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:57,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931756674] [2022-03-15 20:50:57,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:57,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:57,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:57,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931756674] [2022-03-15 20:50:57,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931756674] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:57,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323427568] [2022-03-15 20:50:57,394 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:50:57,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:57,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:57,395 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 20:50:57,396 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 20:50:57,420 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:50:57,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:57,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 20:50:57,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 20:50:57,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 20:50:58,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323427568] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:58,241 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:58,241 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 36 [2022-03-15 20:50:58,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1516094190] [2022-03-15 20:50:58,241 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:58,243 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:58,260 INFO L252 McrAutomatonBuilder]: Finished intersection with 147 states and 264 transitions. [2022-03-15 20:50:58,260 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:51:05,933 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 76 new interpolants: [688056#(and (or (<= n (+ i2 4)) (<= (+ (* 5 m) k2) (+ 3 k1))) (or (<= n (+ i2 4)) (<= (+ 19 (* i1 4) k1) (+ (* n 4) (* 5 m) k2)))), 688062#(and (or (< (+ 2 k1) k2) (not (< 0 m)) (< (+ j1 1) m) (not (< j1 m)) (< 1 m) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (not (< 0 m)) (< (+ j1 1) m) (<= k2 (+ 3 k1)) (not (< j1 m)) (< 1 m) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 688028#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) k1)) (or (<= n (+ 2 i2)) (<= (+ (* i1 4) k1 4) (+ (* n 4) (* 3 m) k2)) (not (<= (+ (* 3 m) k2 1) k1)))), 688070#(and (or (<= n (+ i2 4)) (<= 20 (+ (* n 4) k2))) (or (= (+ (* (- 1) j1) i1) 0) (<= n (+ i2 4))) (or (<= n (+ i2 4)) (<= (+ (* i1 4) k2) 0)) (or (= (+ i1 (* (- 1) k1)) 0) (<= n (+ i2 4)))), 687999#(and (or (not (< 0 m)) (< (+ i1 1) n) (not (< i1 n)) (< 1 m) (< k1 k2)) (or (not (< 0 m)) (<= k2 (+ k1 1)) (< (+ i1 1) n) (not (< i1 n)) (< 1 m))), 688050#(and (or (<= n (+ i2 4)) (<= (+ (* i1 4) k1 4) (+ (* n 4) (* 5 m) k2)) (not (<= (+ (* 5 m) k2 1) k1))) (or (<= n (+ i2 4)) (<= (+ (* 5 m) k2) k1))), 688071#(and (or (not (< (+ i1 4) n)) (<= k2 (+ 5 k1)) (not (< 0 m)) (< 1 m) (< (+ 5 i1) n)) (or (not (< (+ i1 4) n)) (not (< 0 m)) (< (+ k1 4) k2) (< 1 m) (< (+ 5 i1) n))), 688018#(and (or (<= (+ (* i1 4) 9 k1) (+ (* n 4) k2 (* 2 m))) (<= n (+ i2 1))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) (+ k1 1)))), 688055#(and (or (<= n (+ i2 4)) (<= (+ (* 5 m) k2) (+ 3 k1))) (or (<= n (+ i2 4)) (<= (+ (* i1 4) k1 15) (+ (* n 4) (* 5 m) k2)))), 688007#(and (or (<= n i2) (<= (+ (* i1 4) 5 k1) (+ (* n 4) k2 m))) (or (<= n i2) (<= (+ k2 m) (+ k1 1)))), 688026#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) k1)) (or (<= n (+ 2 i2)) (< k1 (+ (* 3 m) k2 1)))), 688044#(and (or (<= n (+ 3 i2)) (<= (+ (* i1 4) k1 15) (+ (* n 4) (* m 4) k2))) (or (<= n (+ 3 i2)) (<= (+ (* m 4) k2) (+ 3 k1)))), 688051#(and (or (<= n (+ i2 4)) (<= (+ (* 5 m) k2) (+ k1 1))) (or (<= n (+ i2 4)) (<= (+ (* i1 4) 5 k1) (+ (* n 4) (* 5 m) k2)))), 688031#(and (or (<= n (+ 2 i2)) (<= (+ (* i1 4) k1 10) (+ (* n 4) (* 3 m) k2))) (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ 2 k1)))), 688004#(and (or (< k1 (+ k2 m 1)) (<= n i2)) (or (<= n i2) (<= (+ k2 m) k1))), 688040#(and (or (<= n (+ 3 i2)) (<= (+ (* m 4) k2) (+ k1 1))) (or (<= (+ (* i1 4) 5 k1) (+ (* n 4) (* m 4) k2)) (<= n (+ 3 i2)))), 688029#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ k1 1))) (or (<= n (+ 2 i2)) (<= (+ (* i1 4) 5 k1) (+ (* n 4) (* 3 m) k2)))), 688003#(and (or (not (< 0 m)) (< (+ k1 1) k2) (< j1 m) (< 1 m) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (<= k2 (+ 2 k1)) (not (< 0 m)) (< j1 m) (< 1 m) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 688019#(and (or (<= n (+ i2 1)) (<= (+ (* i1 4) k1 10) (+ (* n 4) k2 (* 2 m)))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) (+ 2 k1)))), 688005#(and (or (<= n i2) (not (<= (+ k2 m 1) k1)) (<= (+ (* i1 4) k1) (+ (* n 4) k2 m))) (or (<= n i2) (<= (+ k2 m) k1))), 688022#(and (or (<= (+ k2 (* 2 m)) (+ 3 k1)) (<= n (+ i2 1))) (or (<= n (+ i2 1)) (<= (+ 19 (* i1 4) k1) (+ (* n 4) k2 (* 2 m))))), 688030#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ k1 1))) (or (<= n (+ 2 i2)) (<= (+ (* i1 4) 9 k1) (+ (* n 4) (* 3 m) k2)))), 688047#(and (or (<= n (+ 3 i2)) (<= (+ (* i1 4) k1 24) (+ (* n 4) (* m 4) k2))) (or (<= n (+ 3 i2)) (<= (+ (* 5 j1) k2) (+ k1 m 4)))), 688053#(and (or (<= n (+ i2 4)) (<= (+ (* i1 4) k1 10) (+ (* n 4) (* 5 m) k2))) (or (<= (+ (* 5 m) k2) (+ 2 k1)) (<= n (+ i2 4)))), 688024#(and (or (<= n i2) (<= (+ (* 5 j1) k2) (+ (* m 4) k1 4))) (or (<= (+ (* i1 4) k1 24) (+ (* n 4) k2 m)) (<= n i2))), 688014#(and (or (< k1 (+ k2 (* 2 m) 1)) (<= n (+ i2 1))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) k1))), 688013#(and (or (<= (+ (* i1 4) k1 20) (+ (* n 4) k2 m)) (<= n i2)) (or (<= n i2) (<= (+ k2 m) (+ k1 4)))), 688011#(and (or (<= (+ k2 m) (+ 3 k1)) (<= n i2)) (or (<= n i2) (<= (+ (* i1 4) k1 15) (+ (* n 4) k2 m)))), 688068#(and (or (not (< (+ i1 4) n)) (<= k2 (+ 5 k1)) (not (< 0 m)) (< (+ j1 1) m) (not (< j1 m)) (< 1 m) (< (+ 5 i1) n)) (or (not (< (+ i1 4) n)) (not (< 0 m)) (< (+ k1 4) k2) (< (+ j1 1) m) (not (< j1 m)) (< 1 m) (< (+ 5 i1) n))), 688061#(and (or (<= (+ (* i1 4) k2) (* 2 m)) (<= n (+ 2 i2))) (or (= (+ (* (- 1) j1) i1) 0) (<= n (+ 2 i2))) (or (<= n (+ 2 i2)) (<= (+ (* 2 m) 20) (+ (* n 4) k2))) (or (<= n (+ 2 i2)) (= (+ i1 (* (- 1) k1)) 0))), 688045#(and (or (<= n (+ 3 i2)) (<= (+ (* m 4) k2) (+ 3 k1))) (or (<= n (+ 3 i2)) (<= (+ 19 (* i1 4) k1) (+ (* n 4) (* m 4) k2)))), 688041#(and (or (<= n (+ 3 i2)) (<= (+ (* i1 4) 9 k1) (+ (* n 4) (* m 4) k2))) (or (<= n (+ 3 i2)) (<= (+ (* m 4) k2) (+ k1 1)))), 688021#(and (or (<= n (+ i2 1)) (<= (+ (* i1 4) k1 15) (+ (* n 4) k2 (* 2 m)))) (or (<= (+ k2 (* 2 m)) (+ 3 k1)) (<= n (+ i2 1)))), 688032#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ 2 k1))) (or (<= n (+ 2 i2)) (<= (+ (* i1 4) 14 k1) (+ (* n 4) (* 3 m) k2)))), 688067#(and (or (not (< (+ i1 4) n)) (not (< 0 m)) (< j1 m) (< 1 m) (< (+ 5 i1) n) (< (+ 3 k1) k2)) (or (<= k2 (+ k1 4)) (not (< (+ i1 4) n)) (not (< 0 m)) (< j1 m) (< 1 m) (< (+ 5 i1) n))), 688057#(and (or (<= n (+ i2 4)) (<= (+ (* i1 4) k1 20) (+ (* n 4) (* 5 m) k2))) (or (<= n (+ i2 4)) (<= (+ (* 5 m) k2) (+ k1 4)))), 688052#(and (or (<= n (+ i2 4)) (<= (+ (* 5 m) k2) (+ k1 1))) (or (<= n (+ i2 4)) (<= (+ (* i1 4) 9 k1) (+ (* n 4) (* 5 m) k2)))), 688000#(and (or (not (< 0 m)) (not (< (+ i1 1) n)) (< j1 m) (< (+ 2 i1) n) (< 1 m) (< k1 k2)) (or (not (< 0 m)) (<= k2 (+ k1 1)) (not (< (+ i1 1) n)) (< j1 m) (< (+ 2 i1) n) (< 1 m))), 688046#(and (or (<= n (+ 3 i2)) (<= (+ (* i1 4) k1 20) (+ (* n 4) (* m 4) k2))) (or (<= n (+ 3 i2)) (<= (+ (* m 4) k2) (+ k1 4)))), 688009#(and (or (<= n i2) (<= (+ (* i1 4) k1 10) (+ (* n 4) k2 m))) (or (<= n i2) (<= (+ k2 m) (+ 2 k1)))), 688066#(and (or (< (+ i1 4) n) (not (< 0 m)) (not (< (+ 3 i1) n)) (< 1 m) (< (+ 3 k1) k2)) (or (<= k2 (+ k1 4)) (< (+ i1 4) n) (not (< 0 m)) (not (< (+ 3 i1) n)) (< 1 m))), 687997#(and (or (< (+ i1 1) n) (< j1 m) (< k1 (+ k2 1))) (or (<= k2 k1) (< (+ i1 1) n) (< j1 m))), 688048#(and (or (<= n (+ i2 4)) (<= (+ (* 5 m) k2) k1)) (or (<= n (+ i2 4)) (< k1 (+ (* 5 m) k2 1)))), 688015#(and (or (<= n (+ i2 1)) (not (<= (+ k2 (* 2 m) 1) k1)) (<= (+ (* i1 4) k1) (+ (* n 4) k2 (* 2 m)))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) k1))), 688012#(and (or (<= n i2) (<= (+ 19 (* i1 4) k1) (+ (* n 4) k2 m))) (or (<= (+ k2 m) (+ 3 k1)) (<= n i2))), 688002#(and (or (<= k2 (+ 2 k1)) (not (< 0 m)) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (< 1 m)) (or (not (< 0 m)) (< (+ k1 1) k2) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (< 1 m))), 688060#(and (or (<= n (+ i2 1)) (<= (+ (* i1 4) k2) (* 3 m))) (or (= (+ (* (- 1) j1) i1) 0) (<= n (+ i2 1))) (or (<= n (+ i2 1)) (<= (+ (* 3 m) 20) (+ (* n 4) k2))) (or (= (+ i1 (* (- 1) k1)) 0) (<= n (+ i2 1)))), 688037#(and (or (<= n (+ 3 i2)) (<= (+ (* m 4) k2) k1)) (or (<= n (+ 3 i2)) (< k1 (+ (* m 4) k2 1)))), 688042#(and (or (<= n (+ 3 i2)) (<= (+ (* m 4) k2) (+ 2 k1))) (or (<= n (+ 3 i2)) (<= (+ (* i1 4) k1 10) (+ (* n 4) (* m 4) k2)))), 688034#(and (or (<= n (+ 2 i2)) (<= (+ 19 (* i1 4) k1) (+ (* n 4) (* 3 m) k2))) (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ 3 k1)))), 687998#(and (or (< (+ j1 1) m) (< (+ i1 1) n) (not (< j1 m)) (< k1 k2)) (or (<= k2 (+ k1 1)) (< (+ j1 1) m) (< (+ i1 1) n) (not (< j1 m)))), 688038#(and (or (<= n (+ 3 i2)) (<= (+ (* m 4) k2) k1)) (or (<= n (+ 3 i2)) (not (<= (+ (* m 4) k2 1) k1)) (<= (+ (* i1 4) k1) (+ (* n 4) (* m 4) k2)))), 688027#(and (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) k1)) (or (<= n (+ 2 i2)) (not (<= (+ (* 3 m) k2 1) k1)) (<= (+ (* i1 4) k1) (+ (* n 4) (* 3 m) k2)))), 688020#(and (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) (+ 2 k1))) (or (<= n (+ i2 1)) (<= (+ (* i1 4) 14 k1) (+ (* n 4) k2 (* 2 m))))), 688016#(and (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) k1)) (or (<= n (+ i2 1)) (not (<= (+ k2 (* 2 m) 1) k1)) (<= (+ (* i1 4) k1 4) (+ (* n 4) k2 (* 2 m))))), 688058#(and (or (<= n (+ i2 4)) (<= (+ (* 5 j1) k2) (+ k1 4))) (or (<= n (+ i2 4)) (<= (+ (* i1 4) k1 24) (+ (* n 4) (* 5 m) k2)))), 688033#(and (or (<= n (+ 2 i2)) (<= (+ (* i1 4) k1 15) (+ (* n 4) (* 3 m) k2))) (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ 3 k1)))), 688049#(and (or (<= (+ (* i1 4) k1) (+ (* n 4) (* 5 m) k2)) (<= n (+ i2 4)) (not (<= (+ (* 5 m) k2 1) k1))) (or (<= n (+ i2 4)) (<= (+ (* 5 m) k2) k1))), 688025#(and (or (<= (+ (* i1 4) k1 24) (+ (* n 4) k2 (* 2 m))) (<= n (+ i2 1))) (or (<= n (+ i2 1)) (<= (+ (* 5 j1) k2) (+ (* 3 m) k1 4)))), 688006#(and (or (<= n i2) (<= (+ k2 m) k1)) (or (<= n i2) (not (<= (+ k2 m 1) k1)) (<= (+ (* i1 4) k1 4) (+ (* n 4) k2 m)))), 688023#(and (or (<= n (+ i2 1)) (<= (+ (* i1 4) k1 20) (+ (* n 4) k2 (* 2 m)))) (or (<= (+ k2 (* 2 m)) (+ k1 4)) (<= n (+ i2 1)))), 688065#(and (or (<= k2 (+ k1 4)) (< (+ i1 4) n) (not (< 0 m)) (not (< (+ 3 i1) n)) (< (+ j1 1) m) (not (< j1 m)) (< 1 m)) (or (< (+ i1 4) n) (not (< 0 m)) (not (< (+ 3 i1) n)) (< (+ j1 1) m) (not (< j1 m)) (< 1 m) (< (+ 3 k1) k2))), 688036#(and (or (<= n (+ 2 i2)) (<= (+ (* i1 4) k1 24) (+ (* n 4) (* 3 m) k2))) (or (<= n (+ 2 i2)) (<= (+ (* 5 j1) k2) (+ k1 (* 2 m) 4)))), 688008#(and (or (<= n i2) (<= (+ (* i1 4) 9 k1) (+ (* n 4) k2 m))) (or (<= n i2) (<= (+ k2 m) (+ k1 1)))), 688010#(and (or (<= (+ (* i1 4) 14 k1) (+ (* n 4) k2 m)) (<= n i2)) (or (<= n i2) (<= (+ k2 m) (+ 2 k1)))), 688039#(and (or (<= n (+ 3 i2)) (<= (+ (* m 4) k2) k1)) (or (<= n (+ 3 i2)) (<= (+ (* i1 4) k1 4) (+ (* n 4) (* m 4) k2)) (not (<= (+ (* m 4) k2 1) k1)))), 688001#(and (or (<= k2 (+ 2 k1)) (not (< 0 m)) (< (+ j1 1) m) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (not (< j1 m)) (< 1 m)) (or (not (< 0 m)) (< (+ k1 1) k2) (< (+ j1 1) m) (not (< (+ i1 1) n)) (< (+ 2 i1) n) (not (< j1 m)) (< 1 m))), 688063#(and (or (not (< 0 m)) (<= k2 (+ 3 k1)) (< 1 m) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (< (+ 2 k1) k2) (not (< 0 m)) (< 1 m) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 688043#(and (or (<= n (+ 3 i2)) (<= (+ (* m 4) k2) (+ 2 k1))) (or (<= n (+ 3 i2)) (<= (+ (* i1 4) 14 k1) (+ (* n 4) (* m 4) k2)))), 688064#(and (or (< (+ i1 4) n) (not (< 0 m)) (not (< (+ 3 i1) n)) (<= k2 (+ 3 k1)) (< j1 m) (< 1 m)) (or (< (+ i1 4) n) (< (+ 2 k1) k2) (not (< 0 m)) (not (< (+ 3 i1) n)) (< j1 m) (< 1 m))), 688035#(and (or (<= n (+ 2 i2)) (<= (+ (* i1 4) k1 20) (+ (* n 4) (* 3 m) k2))) (or (<= n (+ 2 i2)) (<= (+ (* 3 m) k2) (+ k1 4)))), 688054#(and (or (<= n (+ i2 4)) (<= (+ (* i1 4) 14 k1) (+ (* n 4) (* 5 m) k2))) (or (<= (+ (* 5 m) k2) (+ 2 k1)) (<= n (+ i2 4)))), 688059#(and (or (<= n i2) (<= (+ (* i1 4) k2) (* m 4))) (or (= (+ i1 (* (- 1) k1)) 0) (<= n i2)) (or (<= n i2) (<= (+ (* m 4) 20) (+ (* n 4) k2))) (or (= (+ (* (- 1) j1) i1) 0) (<= n i2))), 688069#(and (or (<= n (+ 3 i2)) (<= (+ m 20) (+ (* n 4) k2))) (or (<= n (+ 3 i2)) (<= (+ (* i1 4) k2) m)) (or (<= n (+ 3 i2)) (= (+ i1 (* (- 1) k1)) 0)) (or (= (+ (* (- 1) j1) i1) 0) (<= n (+ 3 i2)))), 687996#(and (or (< i1 n) (<= k2 k1)) (or (< i1 n) (< k1 (+ k2 1)))), 688017#(and (or (<= n (+ i2 1)) (<= (+ (* i1 4) 5 k1) (+ (* n 4) k2 (* 2 m)))) (or (<= n (+ i2 1)) (<= (+ k2 (* 2 m)) (+ k1 1))))] [2022-03-15 20:51:05,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-03-15 20:51:05,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:51:05,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-03-15 20:51:05,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=12452, Unknown=0, NotChecked=0, Total=12882 [2022-03-15 20:51:05,936 INFO L87 Difference]: Start difference. First operand 14474 states and 36031 transitions. Second operand has 96 states, 95 states have (on average 2.2842105263157895) internal successors, (217), 95 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 20:54:01,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 524 states. [2022-03-15 20:54:01,776 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 20:54:01,776 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 20:54:01,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 569 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117754 ImplicationChecksByTransitivity, 171.7s TimeCoverageRelationStatistics Valid=36959, Invalid=288511, Unknown=0, NotChecked=0, Total=325470 [2022-03-15 20:54:01,782 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 429 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 16161 mSolverCounterSat, 2597 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 18758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2597 IncrementalHoareTripleChecker+Valid, 16161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:54:01,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 0 Invalid, 18758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2597 Valid, 16161 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-03-15 20:54:01,783 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2022-03-15 20:54:01,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-03-15 20:54:01,984 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 20:54:01,984 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (14474states) and FLOYD_HOARE automaton (currently 524 states, 96 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 571 known predicates. [2022-03-15 20:54:01,986 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 20:54:01,986 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 20:54:01,988 INFO L732 BasicCegarLoop]: Path program histogram: [34, 12, 1, 1, 1] [2022-03-15 20:54:01,989 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:54:01,989 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:54:01,991 INFO L202 PluginConnector]: Adding new model clever.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:54:01 BasicIcfg [2022-03-15 20:54:01,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:54:01,991 INFO L158 Benchmark]: Toolchain (without parser) took 717313.51ms. Allocated memory was 187.7MB in the beginning and 1.2GB in the end (delta: 972.0MB). Free memory was 153.1MB in the beginning and 706.3MB in the end (delta: -553.2MB). Peak memory consumption was 419.1MB. Max. memory is 8.0GB. [2022-03-15 20:54:01,991 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 154.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:54:01,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.69ms. Allocated memory is still 187.7MB. Free memory was 152.9MB in the beginning and 151.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:54:01,991 INFO L158 Benchmark]: Boogie Preprocessor took 14.70ms. Allocated memory is still 187.7MB. Free memory was 151.4MB in the beginning and 150.5MB in the end (delta: 884.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:54:01,992 INFO L158 Benchmark]: RCFGBuilder took 225.09ms. Allocated memory is still 187.7MB. Free memory was 150.4MB in the beginning and 141.8MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-03-15 20:54:01,992 INFO L158 Benchmark]: TraceAbstraction took 717036.76ms. Allocated memory was 187.7MB in the beginning and 1.2GB in the end (delta: 972.0MB). Free memory was 141.4MB in the beginning and 706.3MB in the end (delta: -564.9MB). Peak memory consumption was 406.5MB. Max. memory is 8.0GB. [2022-03-15 20:54:01,992 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 154.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.69ms. Allocated memory is still 187.7MB. Free memory was 152.9MB in the beginning and 151.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.70ms. Allocated memory is still 187.7MB. Free memory was 151.4MB in the beginning and 150.5MB in the end (delta: 884.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 225.09ms. Allocated memory is still 187.7MB. Free memory was 150.4MB in the beginning and 141.8MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 717036.76ms. Allocated memory was 187.7MB in the beginning and 1.2GB in the end (delta: 972.0MB). Free memory was 141.4MB in the beginning and 706.3MB in the end (delta: -564.9MB). Peak memory consumption was 406.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 30 PlacesBefore, 19 PlacesAfterwards, 26 TransitionsBefore, 15 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 2 FixpointIterations, 4 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 78 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 78, positive conditional: 0, positive unconditional: 78, 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: 54, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 78, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 54, unknown conditional: 0, unknown unconditional: 54] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, 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: 49]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (14474states) and FLOYD_HOARE automaton (currently 524 states, 96 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 571 known predicates. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (14474states) and FLOYD_HOARE automaton (currently 524 states, 96 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 571 known predicates. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (14474states) and FLOYD_HOARE automaton (currently 524 states, 96 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 571 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 39 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 716.9s, OverallIterations: 49, TraceHistogramMax: 13, PathProgramHistogramMax: 34, EmptinessCheckTime: 0.2s, AutomataDifference: 618.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15758 SdHoareTripleChecker+Valid, 49.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15758 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 41.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26818 mSDsCounter, 13981 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105661 IncrementalHoareTripleChecker+Invalid, 119642 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13981 mSolverCounterUnsat, 0 mSDtfsCounter, 105661 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8429 GetRequests, 2974 SyntacticMatches, 210 SemanticMatches, 5244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453547 ImplicationChecksByTransitivity, 600.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22083occurred in iteration=47, InterpolantAutomatonStates: 3545, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 48 MinimizatonAttempts, 101387 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 1927 NumberOfCodeBlocks, 1901 NumberOfCodeBlocksAsserted, 226 NumberOfCheckSat, 2739 ConstructedInterpolants, 0 QuantifiedInterpolants, 24498 SizeOfPredicates, 127 NumberOfNonLiveVariables, 3519 ConjunctsInSsa, 723 ConjunctsInUnsatCore, 143 InterpolantComputations, 2 PerfectInterpolantSequences, 1753/5614 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