/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/mult-equiv.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:31:36,183 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:31:36,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:31:36,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:31:36,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:31:36,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:31:36,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:31:36,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:31:36,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:31:36,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:31:36,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:31:36,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:31:36,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:31:36,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:31:36,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:31:36,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:31:36,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:31:36,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:31:36,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:31:36,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:31:36,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:31:36,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:31:36,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:31:36,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:31:36,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:31:36,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:31:36,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:31:36,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:31:36,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:31:36,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:31:36,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:31:36,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:31:36,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:31:36,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:31:36,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:31:36,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:31:36,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:31:36,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:31:36,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:31:36,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:31:36,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:31:36,304 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 21:31:36,318 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:31:36,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:31:36,318 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:31:36,318 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:31:36,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:31:36,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:31:36,319 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:31:36,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:31:36,319 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:31:36,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:31:36,319 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:31:36,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:31:36,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:31:36,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:31:36,320 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:31:36,320 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:31:36,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:31:36,320 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:31:36,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:31:36,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:31:36,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:31:36,320 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:31:36,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:31:36,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:31:36,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:31:36,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:31:36,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:31:36,321 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:31:36,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:31:36,321 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:31:36,321 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:31:36,321 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:31:36,322 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 21:31:36,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:31:36,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:31:36,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:31:36,519 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:31:36,521 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:31:36,522 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/mult-equiv.wvr.bpl [2022-03-15 21:31:36,522 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/mult-equiv.wvr.bpl' [2022-03-15 21:31:36,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:31:36,544 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:31:36,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:31:36,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:31:36,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:31:36,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:31:36" (1/1) ... [2022-03-15 21:31:36,562 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:31:36" (1/1) ... [2022-03-15 21:31:36,567 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:31:36,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:31:36,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:31:36,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:31:36,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:31:36,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:31:36" (1/1) ... [2022-03-15 21:31:36,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:31:36" (1/1) ... [2022-03-15 21:31:36,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:31:36" (1/1) ... [2022-03-15 21:31:36,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:31:36" (1/1) ... [2022-03-15 21:31:36,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:31:36" (1/1) ... [2022-03-15 21:31:36,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:31:36" (1/1) ... [2022-03-15 21:31:36,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:31:36" (1/1) ... [2022-03-15 21:31:36,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:31:36,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:31:36,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:31:36,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:31:36,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:31:36" (1/1) ... [2022-03-15 21:31:36,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:31:36,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:36,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 21:31:36,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 21:31:36,679 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:31:36,679 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:31:36,679 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:31:36,680 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:31:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:31:36,680 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:31:36,680 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:31:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:31:36,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:31:36,681 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:31:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:31:36,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:31:36,682 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 21:31:36,717 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:31:36,718 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:31:36,815 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:31:36,824 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:31:36,824 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 21:31:36,826 INFO L202 PluginConnector]: Adding new model mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:31:36 BoogieIcfgContainer [2022-03-15 21:31:36,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:31:36,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:31:36,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:31:36,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:31:36,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:31:36" (1/2) ... [2022-03-15 21:31:36,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e1a08d and model type mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:31:36, skipping insertion in model container [2022-03-15 21:31:36,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:31:36" (2/2) ... [2022-03-15 21:31:36,833 INFO L111 eAbstractionObserver]: Analyzing ICFG mult-equiv.wvr.bpl [2022-03-15 21:31:36,841 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:31:36,841 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:31:36,842 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:31:36,842 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:31:36,899 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 21:31:36,935 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:31:36,949 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 21:31:36,949 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 21:31:36,956 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:31:36,986 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 76 flow [2022-03-15 21:31:36,988 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 76 flow [2022-03-15 21:31:36,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 76 flow [2022-03-15 21:31:37,020 INFO L129 PetriNetUnfolder]: 3/23 cut-off events. [2022-03-15 21:31:37,020 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 21:31:37,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 3/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2022-03-15 21:31:37,034 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 21:31:37,117 INFO L131 LiptonReduction]: Checked pairs total: 224 [2022-03-15 21:31:37,117 INFO L133 LiptonReduction]: Total number of compositions: 7 [2022-03-15 21:31:37,124 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 20 transitions, 64 flow [2022-03-15 21:31:37,136 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 42 states, 41 states have (on average 2.7560975609756095) internal successors, (113), 41 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 41 states have (on average 2.7560975609756095) internal successors, (113), 41 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:37,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 21:31:37,141 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:37,142 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:37,142 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:31:37,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:37,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1637801114, now seen corresponding path program 1 times [2022-03-15 21:31:37,158 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:37,158 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108722739] [2022-03-15 21:31:37,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:37,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:37,252 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:37,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108722739] [2022-03-15 21:31:37,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108722739] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:31:37,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:31:37,253 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 21:31:37,253 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [70788331] [2022-03-15 21:31:37,254 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:37,256 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:37,266 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 21:31:37,266 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:37,466 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:31:37,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:31:37,467 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:37,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:31:37,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:31:37,493 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 2.7560975609756095) internal successors, (113), 41 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) Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:37,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:37,534 INFO L93 Difference]: Finished difference Result 81 states and 223 transitions. [2022-03-15 21:31:37,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:31:37,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 21:31:37,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:37,545 INFO L225 Difference]: With dead ends: 81 [2022-03-15 21:31:37,545 INFO L226 Difference]: Without dead ends: 77 [2022-03-15 21:31:37,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:31:37,551 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:37,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 5 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:31:37,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-03-15 21:31:37,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2022-03-15 21:31:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 2.7758620689655173) internal successors, (161), 58 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 21:31:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 161 transitions. [2022-03-15 21:31:37,581 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 161 transitions. Word has length 11 [2022-03-15 21:31:37,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:37,581 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 161 transitions. [2022-03-15 21:31:37,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:37,581 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 161 transitions. [2022-03-15 21:31:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 21:31:37,582 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:37,582 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:37,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:31:37,582 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:31:37,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:37,583 INFO L85 PathProgramCache]: Analyzing trace with hash 743730651, now seen corresponding path program 1 times [2022-03-15 21:31:37,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:37,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287109482] [2022-03-15 21:31:37,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:37,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:37,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:37,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:37,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287109482] [2022-03-15 21:31:37,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287109482] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:31:37,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:31:37,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 21:31:37,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [354020052] [2022-03-15 21:31:37,629 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:37,630 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:37,632 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 21:31:37,632 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:37,822 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [328#(< 1 N), 331#(or (< 1 L) (<= L 0) (< 1 N)), 329#(or (< 0 L) (< 1 N)), 334#(or (< 0 N) (<= L 0)), 332#(or (<= L 0) (< 1 N)), 335#(or (< 0 N) (= N L)), 327#(< 0 L), 330#(or (< 1 L) (<= L 0)), 333#(< 0 N)] [2022-03-15 21:31:37,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 21:31:37,829 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:37,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 21:31:37,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:31:37,830 INFO L87 Difference]: Start difference. First operand 59 states and 161 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:38,107 INFO L93 Difference]: Finished difference Result 171 states and 473 transitions. [2022-03-15 21:31:38,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 21:31:38,107 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 21:31:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:38,109 INFO L225 Difference]: With dead ends: 171 [2022-03-15 21:31:38,109 INFO L226 Difference]: Without dead ends: 159 [2022-03-15 21:31:38,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2022-03-15 21:31:38,110 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 139 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:38,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 4 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:31:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-03-15 21:31:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2022-03-15 21:31:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.878787878787879) internal successors, (380), 132 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 380 transitions. [2022-03-15 21:31:38,120 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 380 transitions. Word has length 12 [2022-03-15 21:31:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:38,120 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 380 transitions. [2022-03-15 21:31:38,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:38,120 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 380 transitions. [2022-03-15 21:31:38,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:31:38,121 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:38,121 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:38,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 21:31:38,122 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:31:38,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1824020089, now seen corresponding path program 1 times [2022-03-15 21:31:38,123 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:38,123 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014437403] [2022-03-15 21:31:38,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:38,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:38,243 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 21:31:38,244 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:38,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014437403] [2022-03-15 21:31:38,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014437403] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:38,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115931580] [2022-03-15 21:31:38,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:38,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:38,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:38,246 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:38,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:31:38,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:38,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 21:31:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:31:38,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:38,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:31:38,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115931580] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:38,464 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:38,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-03-15 21:31:38,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1068888490] [2022-03-15 21:31:38,464 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:38,465 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:38,467 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 59 transitions. [2022-03-15 21:31:38,467 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:38,976 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [884#(and (or (not (< 0 N)) (= q 0)) (or (= p 0) (not (< 0 N)))), 882#(and (or (not (< 0 N)) (<= M q)) (or (not (< 0 N)) (< q (+ M p 1))) (or (= p 0) (not (< 0 N)))), 881#(and (< 0 N) (or (= p 0) (< 1 N)) (or (< 1 N) (= q 0))), 885#(= p (+ M q)), 880#(and (< 0 N) (or (< 1 N) (not (<= (+ M p 1) q))) (or (<= M q) (< 1 N)) (or (= p 0) (< 1 N))), 886#(and (or (= p 0) (not (< 0 N)) (< 1 N)) (or (not (< 0 N)) (< 1 N) (= q 0))), 883#(and (or (= p 0) (not (< 0 N)) (< 1 N)) (or (not (< 0 N)) (< 1 N) (not (<= (+ M p 1) q))) (or (not (< 0 N)) (<= M q) (< 1 N)))] [2022-03-15 21:31:38,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 21:31:38,977 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:38,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 21:31:38,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:31:38,977 INFO L87 Difference]: Start difference. First operand 133 states and 380 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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 21:31:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:39,455 INFO L93 Difference]: Finished difference Result 276 states and 758 transitions. [2022-03-15 21:31:39,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 21:31:39,455 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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 21:31:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:39,457 INFO L225 Difference]: With dead ends: 276 [2022-03-15 21:31:39,457 INFO L226 Difference]: Without dead ends: 223 [2022-03-15 21:31:39,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:31:39,458 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 71 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:39,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 11 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:31:39,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-03-15 21:31:39,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 148. [2022-03-15 21:31:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 2.857142857142857) internal successors, (420), 147 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 420 transitions. [2022-03-15 21:31:39,467 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 420 transitions. Word has length 14 [2022-03-15 21:31:39,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:39,467 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 420 transitions. [2022-03-15 21:31:39,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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 21:31:39,468 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 420 transitions. [2022-03-15 21:31:39,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:31:39,469 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:39,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:39,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 21:31:39,685 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 21:31:39,685 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:31:39,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:39,686 INFO L85 PathProgramCache]: Analyzing trace with hash -873324117, now seen corresponding path program 1 times [2022-03-15 21:31:39,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:39,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283451491] [2022-03-15 21:31:39,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:39,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:39,711 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 21:31:39,711 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:39,712 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283451491] [2022-03-15 21:31:39,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283451491] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:39,712 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945578847] [2022-03-15 21:31:39,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:39,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:39,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:39,732 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:39,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 21:31:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:39,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:31:39,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:39,792 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 21:31:39,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:39,839 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 21:31:39,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945578847] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:39,842 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:39,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-03-15 21:31:39,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1038040419] [2022-03-15 21:31:39,843 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:39,843 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:39,845 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 65 transitions. [2022-03-15 21:31:39,845 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:40,124 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1570#(or (not (< 1 N)) (< 3 N)), 1567#(or (<= 1 L) (< 1 N)), 1565#(< 1 N), 1566#(or (<= 2 L) (<= L 0)), 1568#(or (<= 2 L) (<= L 0) (< 1 N)), 1569#(< 3 N)] [2022-03-15 21:31:40,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 21:31:40,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:40,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 21:31:40,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:31:40,126 INFO L87 Difference]: Start difference. First operand 148 states and 420 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 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 21:31:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:40,488 INFO L93 Difference]: Finished difference Result 311 states and 805 transitions. [2022-03-15 21:31:40,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 21:31:40,488 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 21:31:40,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:40,490 INFO L225 Difference]: With dead ends: 311 [2022-03-15 21:31:40,490 INFO L226 Difference]: Without dead ends: 311 [2022-03-15 21:31:40,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=800, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:31:40,491 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 116 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:40,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 1 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:31:40,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-03-15 21:31:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 161. [2022-03-15 21:31:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.84375) internal successors, (455), 160 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 455 transitions. [2022-03-15 21:31:40,500 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 455 transitions. Word has length 14 [2022-03-15 21:31:40,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:40,500 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 455 transitions. [2022-03-15 21:31:40,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 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 21:31:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 455 transitions. [2022-03-15 21:31:40,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:31:40,502 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:40,502 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:40,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 21:31:40,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 21:31:40,719 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:31:40,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:40,720 INFO L85 PathProgramCache]: Analyzing trace with hash -213754660, now seen corresponding path program 2 times [2022-03-15 21:31:40,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:40,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725174696] [2022-03-15 21:31:40,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:40,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:40,775 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:40,775 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725174696] [2022-03-15 21:31:40,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725174696] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:40,775 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491782963] [2022-03-15 21:31:40,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:31:40,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:40,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:40,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:40,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 21:31:40,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:31:40,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:31:40,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:31:40,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:40,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:40,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491782963] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:40,924 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:40,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-03-15 21:31:40,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1635788482] [2022-03-15 21:31:40,924 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:40,926 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:40,929 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 84 transitions. [2022-03-15 21:31:40,929 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:41,605 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [2336#(or (< 0 N) (= p (+ M q))), 2339#(or (< 1 N) (= (+ (* 2 M) q) p)), 2265#(= (+ (* 2 M) q) p), 2341#(and (or (< 0 N) (= q p)) (or (= (+ (* 2 M) p) q) (not (< 1 N)) (< 2 N))), 2347#(and (or (not (< 1 N)) (< 2 N) (= q 0)) (or (not (< 1 N)) (= p 0) (< 2 N))), 2337#(or (< 1 N) (= q p)), 2344#(and (or (< 0 N) (= q 0)) (or (not (< 1 N)) (< 2 N) (= q 0)) (or (< 0 N) (= (* 2 M) p)) (or (not (< 1 N)) (< 2 N) (= (* 2 M) (+ (* 2 M) p)))), 2338#(or (= p (+ M q)) (< 1 N)), 2342#(and (or (< 0 N) (= p (+ M q))) (or (not (< 1 N)) (< 2 N) (= (+ (* 2 M) p) (+ M q)))), 2340#(and (or (= (* 2 M) p) (< 1 N)) (or (< 1 N) (= q 0))), 2345#(or (= (+ (* 2 M) p) q) (not (< 1 N)) (< 2 N)), 2346#(or (not (< 1 N)) (< 2 N) (= q (+ M p))), 2335#(or (< 0 N) (= q p)), 2343#(and (or (< 0 N) (= q 0)) (or (< 0 N) (= (* 2 M) p)))] [2022-03-15 21:31:41,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 21:31:41,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:41,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 21:31:41,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-03-15 21:31:41,606 INFO L87 Difference]: Start difference. First operand 161 states and 455 transitions. Second operand has 21 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:43,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:43,146 INFO L93 Difference]: Finished difference Result 549 states and 1531 transitions. [2022-03-15 21:31:43,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 21:31:43,147 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:31:43,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:43,149 INFO L225 Difference]: With dead ends: 549 [2022-03-15 21:31:43,149 INFO L226 Difference]: Without dead ends: 543 [2022-03-15 21:31:43,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=487, Invalid=2165, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 21:31:43,151 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 228 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:43,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 19 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:31:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-03-15 21:31:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 267. [2022-03-15 21:31:43,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 3.056390977443609) internal successors, (813), 266 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 813 transitions. [2022-03-15 21:31:43,160 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 813 transitions. Word has length 15 [2022-03-15 21:31:43,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:43,160 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 813 transitions. [2022-03-15 21:31:43,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 813 transitions. [2022-03-15 21:31:43,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:31:43,162 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:43,162 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:43,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 21:31:43,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:43,381 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:31:43,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:43,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1248262798, now seen corresponding path program 2 times [2022-03-15 21:31:43,383 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:43,383 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147052035] [2022-03-15 21:31:43,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:43,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:43,423 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:43,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147052035] [2022-03-15 21:31:43,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147052035] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:31:43,423 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:31:43,423 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 21:31:43,423 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1539030655] [2022-03-15 21:31:43,423 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:43,424 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:43,426 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 75 transitions. [2022-03-15 21:31:43,426 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:43,717 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [3508#(or (< 2 L) (<= L 1)), 3504#(or (= N L) (< 1 N)), 3505#(or (= N L) (not (< 0 N)) (< 1 N)), 3507#(or (< 1 L) (<= L 0)), 3506#(< 0 L), 3497#(< 1 N), 3502#(or (<= N 0) (<= L 0) (< 1 N)), 3501#(or (not (< 0 N)) (<= L 0)), 3499#(or (not (< 0 N)) (< 1 N)), 3498#(not (< 0 N)), 3503#(and (or (<= N 0) (<= L 1)) (or (= (+ (* (- 1) L) N) 0) (not (< 0 N)))), 3500#(or (<= L 0) (< 1 N))] [2022-03-15 21:31:43,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 21:31:43,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:43,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 21:31:43,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:31:43,719 INFO L87 Difference]: Start difference. First operand 267 states and 813 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:43,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:43,948 INFO L93 Difference]: Finished difference Result 307 states and 894 transitions. [2022-03-15 21:31:43,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 21:31:43,948 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:31:43,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:43,949 INFO L225 Difference]: With dead ends: 307 [2022-03-15 21:31:43,950 INFO L226 Difference]: Without dead ends: 296 [2022-03-15 21:31:43,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:31:43,950 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 159 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:43,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 9 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:31:43,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-03-15 21:31:43,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 257. [2022-03-15 21:31:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 3.05859375) internal successors, (783), 256 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 783 transitions. [2022-03-15 21:31:43,956 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 783 transitions. Word has length 15 [2022-03-15 21:31:43,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:43,956 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 783 transitions. [2022-03-15 21:31:43,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:43,956 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 783 transitions. [2022-03-15 21:31:43,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:31:43,957 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:43,957 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:43,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 21:31:43,957 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:31:43,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:43,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1019929814, now seen corresponding path program 3 times [2022-03-15 21:31:43,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:43,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423473891] [2022-03-15 21:31:43,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:43,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:43,983 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:43,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423473891] [2022-03-15 21:31:43,983 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423473891] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:43,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509881141] [2022-03-15 21:31:43,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:31:43,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:43,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:43,985 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:44,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 21:31:44,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:31:44,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:31:44,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:31:44,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:44,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:44,158 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 21:31:44,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509881141] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:44,158 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:44,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2022-03-15 21:31:44,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [82805226] [2022-03-15 21:31:44,159 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:44,160 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:44,162 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 90 transitions. [2022-03-15 21:31:44,162 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:44,536 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [4450#(< 0 L), 4459#(or (< 2 N) (not (< 0 N)) (<= (+ L 1) N)), 4452#(or (< 1 L) (<= L 0)), 4451#(or (< 0 L) (< 1 N)), 4453#(or (< 2 L) (<= L 1)), 4460#(or (= (+ (* (- 1) L) N) 0) (not (< 0 N))), 4456#(or (not (< 0 N)) (< 1 N)), 4458#(and (or (< 0 N) (<= L N)) (or (< 2 N) (not (< 0 N)) (<= (+ L 1) N))), 4455#(or (< 2 L) (< 1 N) (<= L 1)), 4457#(or (< 1 N) (<= L N)), 4454#(or (< 1 L) (<= L 0) (< 1 N)), 4449#(< 1 N)] [2022-03-15 21:31:44,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 21:31:44,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:44,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 21:31:44,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2022-03-15 21:31:44,538 INFO L87 Difference]: Start difference. First operand 257 states and 783 transitions. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:46,271 INFO L93 Difference]: Finished difference Result 847 states and 2276 transitions. [2022-03-15 21:31:46,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-03-15 21:31:46,271 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:31:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:46,275 INFO L225 Difference]: With dead ends: 847 [2022-03-15 21:31:46,275 INFO L226 Difference]: Without dead ends: 839 [2022-03-15 21:31:46,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3508 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1699, Invalid=8401, Unknown=0, NotChecked=0, Total=10100 [2022-03-15 21:31:46,277 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 340 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:46,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 3 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:31:46,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-03-15 21:31:46,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 421. [2022-03-15 21:31:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.1952380952380954) internal successors, (1342), 420 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1342 transitions. [2022-03-15 21:31:46,292 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1342 transitions. Word has length 15 [2022-03-15 21:31:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:46,292 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 1342 transitions. [2022-03-15 21:31:46,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1342 transitions. [2022-03-15 21:31:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:31:46,293 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:46,293 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:46,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 21:31:46,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:46,510 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:31:46,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:46,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1939497765, now seen corresponding path program 3 times [2022-03-15 21:31:46,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:46,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321223383] [2022-03-15 21:31:46,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:46,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:46,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:46,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321223383] [2022-03-15 21:31:46,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321223383] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:46,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764668688] [2022-03-15 21:31:46,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:31:46,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:46,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:46,553 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:46,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 21:31:46,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:31:46,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:31:46,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:31:46,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:46,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:46,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764668688] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:46,703 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:46,703 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-03-15 21:31:46,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1893226358] [2022-03-15 21:31:46,704 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:46,705 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:46,707 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 103 transitions. [2022-03-15 21:31:46,707 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:47,292 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [6416#(or (< 1 N) (<= L 2) (< 3 L)), 6407#(or (< 1 L) (<= L 0)), 6414#(or (< 1 N) (<= L 1)), 6417#(or (< 1 N) (<= L 2)), 6409#(< 1 N), 6425#(or (< 2 N) (<= L 0) (<= N 1)), 6426#(or (not (< 1 N)) (< 2 N) (<= L 1)), 6412#(or (< 2 L) (< 1 N) (<= L 1)), 6423#(or (not (< 1 N)) (< 2 N)), 6388#(or (< 0 N) (<= L 2)), 6395#(or (and (< 0 N) (or (not (< 1 N)) (< 2 N))) (<= L 2)), 6408#(or (< 2 L) (<= L 1)), 6406#(< 0 L), 6415#(or (<= L 2) (< 3 L)), 6422#(and (or (not (< 1 N)) (< 2 N) (<= L 0)) (or (< 0 N) (<= L 0))), 6411#(or (< 1 L) (<= L 0) (< 1 N)), 6410#(or (< 0 L) (< 1 N)), 6420#(or (< 0 N) (<= L 1)), 6424#(and (or (< 0 N) (<= L 1)) (or (not (< 1 N)) (< 2 N) (<= L 1))), 6399#(or (not (< 1 N)) (< 2 N) (<= L 2)), 6413#(or (<= L 0) (< 1 N)), 6421#(and (< 0 N) (or (not (< 1 N)) (< 2 N))), 6418#(< 0 N), 6419#(or (< 0 N) (<= L 0))] [2022-03-15 21:31:47,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:31:47,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:47,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:31:47,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:31:47,294 INFO L87 Difference]: Start difference. First operand 421 states and 1342 transitions. Second operand has 31 states, 31 states have (on average 2.774193548387097) internal successors, (86), 30 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:48,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:48,920 INFO L93 Difference]: Finished difference Result 987 states and 2907 transitions. [2022-03-15 21:31:48,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-15 21:31:48,920 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.774193548387097) internal successors, (86), 30 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:31:48,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:48,924 INFO L225 Difference]: With dead ends: 987 [2022-03-15 21:31:48,924 INFO L226 Difference]: Without dead ends: 931 [2022-03-15 21:31:48,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3931 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2113, Invalid=9877, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 21:31:48,927 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 527 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:48,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [527 Valid, 1 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:31:48,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-03-15 21:31:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 556. [2022-03-15 21:31:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 3.2612612612612613) internal successors, (1810), 555 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1810 transitions. [2022-03-15 21:31:48,941 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1810 transitions. Word has length 16 [2022-03-15 21:31:48,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:48,941 INFO L470 AbstractCegarLoop]: Abstraction has 556 states and 1810 transitions. [2022-03-15 21:31:48,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.774193548387097) internal successors, (86), 30 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:48,941 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1810 transitions. [2022-03-15 21:31:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:31:48,942 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:48,942 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:48,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 21:31:49,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:49,158 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:31:49,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:49,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1515274985, now seen corresponding path program 4 times [2022-03-15 21:31:49,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:49,159 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419142261] [2022-03-15 21:31:49,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:49,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:31:49,180 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:49,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419142261] [2022-03-15 21:31:49,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419142261] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:31:49,180 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:31:49,181 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 21:31:49,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [590142884] [2022-03-15 21:31:49,181 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:49,181 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:49,183 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 73 transitions. [2022-03-15 21:31:49,183 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:49,262 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8683#(< 0 N)] [2022-03-15 21:31:49,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:31:49,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:49,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:31:49,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:31:49,263 INFO L87 Difference]: Start difference. First operand 556 states and 1810 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:49,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:49,306 INFO L93 Difference]: Finished difference Result 543 states and 1743 transitions. [2022-03-15 21:31:49,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:31:49,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:31:49,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:49,309 INFO L225 Difference]: With dead ends: 543 [2022-03-15 21:31:49,309 INFO L226 Difference]: Without dead ends: 509 [2022-03-15 21:31:49,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:31:49,310 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:49,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 3 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:31:49,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-03-15 21:31:49,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 452. [2022-03-15 21:31:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 3.3348115299334813) internal successors, (1504), 451 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1504 transitions. [2022-03-15 21:31:49,321 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1504 transitions. Word has length 16 [2022-03-15 21:31:49,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:49,322 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 1504 transitions. [2022-03-15 21:31:49,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:49,322 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1504 transitions. [2022-03-15 21:31:49,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:31:49,323 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:49,323 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:49,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 21:31:49,323 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:31:49,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:49,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1658511507, now seen corresponding path program 1 times [2022-03-15 21:31:49,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:49,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853364417] [2022-03-15 21:31:49,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:49,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:49,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:49,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853364417] [2022-03-15 21:31:49,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853364417] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:49,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871323309] [2022-03-15 21:31:49,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:49,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:49,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:49,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:49,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 21:31:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:49,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:31:49,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:49,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:49,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:49,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871323309] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:49,438 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:49,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-03-15 21:31:49,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1217430619] [2022-03-15 21:31:49,440 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:49,441 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:49,445 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 92 transitions. [2022-03-15 21:31:49,445 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:49,761 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [10232#(or (< 1 L) (<= L 0)), 10238#(or (= (+ (* (- 1) L) N) 0) (not (< 0 N))), 10233#(or (< 1 L) (<= L 0) (< 1 N)), 10234#(not (< 0 N)), 10236#(or (< 1 L) (<= N 0) (<= L 0)), 10231#(or (< 0 L) (< 1 N)), 10230#(< 1 N), 10235#(or (< 0 L) (not (< 0 N))), 10237#(or (not (< 0 N)) (<= N (+ L 1))), 10229#(< 0 L)] [2022-03-15 21:31:49,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 21:31:49,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:49,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 21:31:49,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:31:49,762 INFO L87 Difference]: Start difference. First operand 452 states and 1504 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:50,178 INFO L93 Difference]: Finished difference Result 687 states and 2110 transitions. [2022-03-15 21:31:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 21:31:50,179 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:31:50,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:50,181 INFO L225 Difference]: With dead ends: 687 [2022-03-15 21:31:50,181 INFO L226 Difference]: Without dead ends: 664 [2022-03-15 21:31:50,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=426, Invalid=1296, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 21:31:50,182 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 169 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:50,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 2 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:31:50,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-03-15 21:31:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 472. [2022-03-15 21:31:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 3.307855626326964) internal successors, (1558), 471 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1558 transitions. [2022-03-15 21:31:50,192 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1558 transitions. Word has length 16 [2022-03-15 21:31:50,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:50,193 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 1558 transitions. [2022-03-15 21:31:50,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:50,193 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1558 transitions. [2022-03-15 21:31:50,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:31:50,194 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:50,194 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:50,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 21:31:50,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:50,407 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:31:50,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:50,408 INFO L85 PathProgramCache]: Analyzing trace with hash -194325570, now seen corresponding path program 4 times [2022-03-15 21:31:50,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:50,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768547043] [2022-03-15 21:31:50,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:50,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:50,450 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:50,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768547043] [2022-03-15 21:31:50,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768547043] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:50,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926243349] [2022-03-15 21:31:50,451 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:31:50,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:50,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:50,452 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:50,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 21:31:50,476 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:31:50,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:31:50,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:31:50,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:50,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:50,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926243349] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:50,605 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:50,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-03-15 21:31:50,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [883263960] [2022-03-15 21:31:50,605 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:50,606 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:50,609 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 102 transitions. [2022-03-15 21:31:50,609 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:51,384 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [12049#(or (not (< 1 N)) (< 2 N) (<= 3 L)), 12028#(< 1 N), 12046#(or (< 2 L) (< 1 N) (<= L 1)), 12034#(< 0 N), 12043#(or (< 0 N) (<= 3 L)), 12052#(or (< 4 N) (<= 4 L) (<= N 3)), 12030#(or (< 1 L) (<= L 0)), 12051#(or (not (< 1 N)) (< 2 N) (<= 4 L)), 12029#(or (< 0 L) (< 1 N)), 12042#(or (< 4 N) (<= 2 L) (<= N 3)), 12038#(or (< 4 N) (<= N 3)), 12035#(or (< 2 L) (<= L 1)), 12031#(or (< 1 L) (<= L 0) (< 1 N)), 12041#(or (not (< 1 N)) (< 2 N) (<= 2 L)), 11992#(< 0 L), 12039#(or (< 0 N) (<= 2 L)), 12040#(and (or (< 0 N) (<= 2 L)) (or (not (< 1 N)) (< 2 N) (<= 2 L))), 12050#(or (< 4 N) (<= 3 L) (<= N 3)), 12045#(and (or (not (< 1 N)) (< 2 N) (<= 3 L)) (or (< 0 N) (<= 3 L))), 12036#(and (< 0 N) (or (not (< 1 N)) (< 2 N))), 12047#(or (<= 4 L) (< 1 N)), 12048#(and (or (< 0 N) (<= 4 L)) (or (not (< 1 N)) (< 2 N) (<= 4 L))), 12044#(or (< 0 N) (<= 4 L)), 12032#(or (<= 2 L) (< 1 N)), 12033#(or (<= 3 L) (< 1 N)), 12037#(or (not (< 1 N)) (< 2 N))] [2022-03-15 21:31:51,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 21:31:51,384 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:51,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 21:31:51,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1190, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 21:31:51,385 INFO L87 Difference]: Start difference. First operand 472 states and 1558 transitions. Second operand has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:53,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:53,503 INFO L93 Difference]: Finished difference Result 1302 states and 4108 transitions. [2022-03-15 21:31:53,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2022-03-15 21:31:53,503 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:31:53,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:53,516 INFO L225 Difference]: With dead ends: 1302 [2022-03-15 21:31:53,517 INFO L226 Difference]: Without dead ends: 1290 [2022-03-15 21:31:53,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9687 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5033, Invalid=21699, Unknown=0, NotChecked=0, Total=26732 [2022-03-15 21:31:53,538 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 578 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:53,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [578 Valid, 1 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:31:53,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2022-03-15 21:31:53,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 741. [2022-03-15 21:31:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 3.4054054054054053) internal successors, (2520), 740 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2520 transitions. [2022-03-15 21:31:53,570 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2520 transitions. Word has length 17 [2022-03-15 21:31:53,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:53,570 INFO L470 AbstractCegarLoop]: Abstraction has 741 states and 2520 transitions. [2022-03-15 21:31:53,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2520 transitions. [2022-03-15 21:31:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:31:53,572 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:53,572 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:53,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 21:31:53,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:53,773 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:31:53,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:53,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1103725102, now seen corresponding path program 2 times [2022-03-15 21:31:53,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:53,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645035171] [2022-03-15 21:31:53,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:53,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:53,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:53,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645035171] [2022-03-15 21:31:53,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645035171] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:53,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825822959] [2022-03-15 21:31:53,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:31:53,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:53,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:53,831 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:53,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 21:31:53,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:31:53,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:31:53,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:31:53,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:53,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:53,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:54,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825822959] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:54,017 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:54,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-03-15 21:31:54,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2124011009] [2022-03-15 21:31:54,017 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:54,018 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:54,020 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 91 transitions. [2022-03-15 21:31:54,020 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:54,499 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [15203#(or (< 2 L) (<= L 1)), 15211#(or (< 1 L) (<= L 0) (< 1 N)), 15207#(or (<= N 2) (< 3 N)), 15218#(or (not (< 1 N)) (<= N (+ L 1)) (< 3 N)), 15217#(or (not (< 1 N)) (<= N (+ 2 L)) (< 3 N)), 15205#(or (not (< 0 N)) (< 1 N)), 15215#(or (<= (+ 2 N) L) (< 1 N)), 15216#(and (or (<= (+ 2 N) L) (< 1 N)) (or (< 3 N) (<= N L))), 15214#(or (< 2 L) (< 1 N) (<= L 1)), 15209#(or (< 1 N) (<= N L)), 15210#(and (or (< 1 N) (<= N L)) (or (<= N (+ 2 L)) (< 3 N))), 15201#(< 0 L), 15219#(or (not (< 1 N)) (< 3 N) (<= N L)), 15208#(or (< 0 L) (< 1 N)), 15206#(and (or (<= N 0) (< 1 N)) (or (<= N 2) (< 3 N))), 15204#(< 1 N), 15212#(or (< 1 N) (<= (+ N 1) L)), 15213#(and (or (<= N (+ L 1)) (< 3 N)) (or (< 1 N) (<= (+ N 1) L))), 15202#(or (< 1 L) (<= L 0))] [2022-03-15 21:31:54,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:31:54,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:54,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:31:54,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=995, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:31:54,500 INFO L87 Difference]: Start difference. First operand 741 states and 2520 transitions. Second operand has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:55,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:55,400 INFO L93 Difference]: Finished difference Result 1463 states and 4668 transitions. [2022-03-15 21:31:55,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 21:31:55,401 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:31:55,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:55,406 INFO L225 Difference]: With dead ends: 1463 [2022-03-15 21:31:55,406 INFO L226 Difference]: Without dead ends: 1447 [2022-03-15 21:31:55,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1752 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1198, Invalid=4502, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 21:31:55,408 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 358 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:55,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 1 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:31:55,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2022-03-15 21:31:55,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 715. [2022-03-15 21:31:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 3.4005602240896358) internal successors, (2428), 714 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 2428 transitions. [2022-03-15 21:31:55,436 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 2428 transitions. Word has length 17 [2022-03-15 21:31:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:55,436 INFO L470 AbstractCegarLoop]: Abstraction has 715 states and 2428 transitions. [2022-03-15 21:31:55,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 2428 transitions. [2022-03-15 21:31:55,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:31:55,443 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:55,443 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:55,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 21:31:55,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 21:31:55,659 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:31:55,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:55,660 INFO L85 PathProgramCache]: Analyzing trace with hash 507536888, now seen corresponding path program 3 times [2022-03-15 21:31:55,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:55,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920763157] [2022-03-15 21:31:55,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:55,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:55,761 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 21:31:55,761 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:55,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920763157] [2022-03-15 21:31:55,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920763157] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:55,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507990061] [2022-03-15 21:31:55,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:31:55,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:55,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:55,763 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:55,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 21:31:55,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 21:31:55,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:31:55,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 21:31:55,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:55,890 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 21:31:55,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:56,100 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 21:31:56,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507990061] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:56,100 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:56,100 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 21:31:56,101 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1240398589] [2022-03-15 21:31:56,101 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:56,102 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:56,104 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 93 transitions. [2022-03-15 21:31:56,104 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:57,475 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [18319#(and (or (= p (+ M q)) (< 1 N)) (or (< 1 N) (<= (+ N 1) L))), 18329#(and (or (not (< 1 N)) (< 3 N) (<= N L)) (or (not (< 1 N)) (< 3 N) (= q p)) (or (not (< 1 N)) (< 3 N) (= q 0))), 18317#(and (or (= (+ (* 2 M) p) q) (not (< 1 N)) (< 3 N)) (or (<= N 2) (< 3 N))), 18321#(and (or (not (< 0 N)) (< 1 N) (<= (+ N 1) L)) (or (= p (+ M q)) (not (< 0 N)) (< 1 N)) (or (not (< 0 N)) (<= N (+ L 1)) (< 3 N)) (or (= (+ (* 2 M) p) (+ M q)) (<= N 1) (< 3 N))), 18328#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 18313#(and (or (< 1 N) (= q p)) (or (< 1 N) (<= N L))), 18316#(and (or (not (< 0 N)) (< 1 N) (= q p)) (or (not (< 0 N)) (<= N (+ 2 L)) (< 3 N)) (or (< 0 L) (not (< 0 N)) (< 1 N)) (or (= (+ (* 2 M) p) q) (<= N 1) (< 3 N))), 18311#(and (or (< 1 N) (= q p)) (or (<= N 0) (< 1 N))), 18312#(and (or (< 1 N) (= q p)) (or (= (+ (* 2 M) p) q) (not (< 1 N)) (< 3 N)) (or (<= N 0) (< 1 N)) (or (<= N 2) (< 3 N))), 18324#(and (or (not (< 0 N)) (< 3 N) (<= N L)) (or (<= (+ 2 N) L) (not (< 0 N)) (< 1 N)) (or (not (< 0 N)) (< 1 N) (= (+ (* 2 M) q) p)) (or (not (< 0 N)) (< 3 N) (= q 0)) (or (= (+ (* 2 M) q) (+ (* 2 M) p)) (<= N 1) (< 3 N))), 18330#(and (or (not (< 1 N)) (= q 0)) (or (not (< 1 N)) (= p 0)) (or (= N L) (not (< 1 N)))), 18315#(and (or (= (+ (* 2 M) p) q) (not (< 0 N)) (< 3 N)) (or (<= N 2) (< 3 N)) (or (not (< 0 N)) (< 1 N))), 18322#(and (or (= (* 2 M) p) (< 1 N)) (or (<= (+ 2 N) L) (< 1 N)) (or (< 1 N) (= q 0))), 18323#(and (or (< 3 N) (= q 0)) (or (= (* 2 M) p) (< 1 N)) (or (<= (+ 2 N) L) (< 1 N)) (or (not (< 1 N)) (= (+ (* 2 M) q) (+ (* 2 M) p)) (< 3 N)) (or (< 3 N) (<= N L))), 18327#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 18314#(and (or (< 1 N) (= q p)) (or (< 1 N) (<= N L)) (or (= (+ (* 2 M) p) q) (not (< 1 N)) (< 3 N)) (or (<= N (+ 2 L)) (< 3 N))), 18318#(or (< 0 L) (= q p)), 18320#(and (or (= p (+ M q)) (< 1 N)) (or (<= N (+ L 1)) (< 3 N)) (or (not (< 1 N)) (= (+ (* 2 M) p) (+ M q)) (< 3 N)) (or (< 1 N) (<= (+ N 1) L))), 18325#(and (or (= (+ (* 2 M) p) q) (not (< 1 N)) (< 3 N)) (or (not (< 1 N)) (<= N (+ 2 L)) (< 3 N))), 18326#(and (or (not (< 1 N)) (= q (+ M p)) (< 3 N)) (or (not (< 1 N)) (<= N (+ L 1)) (< 3 N)))] [2022-03-15 21:31:57,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 21:31:57,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:57,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 21:31:57,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1295, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 21:31:57,477 INFO L87 Difference]: Start difference. First operand 715 states and 2428 transitions. Second operand has 29 states, 28 states have (on average 2.75) internal successors, (77), 28 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 21:32:02,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:02,344 INFO L93 Difference]: Finished difference Result 1636 states and 4693 transitions. [2022-03-15 21:32:02,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-15 21:32:02,345 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.75) internal successors, (77), 28 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 17 [2022-03-15 21:32:02,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:02,350 INFO L225 Difference]: With dead ends: 1636 [2022-03-15 21:32:02,351 INFO L226 Difference]: Without dead ends: 1587 [2022-03-15 21:32:02,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1744, Invalid=11828, Unknown=0, NotChecked=0, Total=13572 [2022-03-15 21:32:02,352 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 501 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:02,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 4 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1787 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:32:02,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2022-03-15 21:32:02,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 712. [2022-03-15 21:32:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 711 states have (on average 3.388185654008439) internal successors, (2409), 711 states have internal predecessors, (2409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 2409 transitions. [2022-03-15 21:32:02,371 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 2409 transitions. Word has length 17 [2022-03-15 21:32:02,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:02,371 INFO L470 AbstractCegarLoop]: Abstraction has 712 states and 2409 transitions. [2022-03-15 21:32:02,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.75) internal successors, (77), 28 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 21:32:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 2409 transitions. [2022-03-15 21:32:02,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:32:02,373 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:02,373 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:02,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 21:32:02,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 21:32:02,602 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:32:02,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:02,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1173767216, now seen corresponding path program 4 times [2022-03-15 21:32:02,603 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:02,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915508424] [2022-03-15 21:32:02,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:02,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:02,699 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 21:32:02,699 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:02,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915508424] [2022-03-15 21:32:02,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915508424] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:02,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97503644] [2022-03-15 21:32:02,700 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:32:02,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:02,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:02,701 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:02,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 21:32:02,727 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:32:02,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:32:02,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 21:32:02,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:02,784 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 21:32:02,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:02,975 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 21:32:02,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97503644] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:02,976 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:02,976 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 21:32:02,976 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [480228293] [2022-03-15 21:32:02,984 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:02,984 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:02,988 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 118 transitions. [2022-03-15 21:32:02,988 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:03,876 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [21663#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 21668#(or (< 2 L) (< 1 N) (<= L 1) (= (+ (* 2 M) q) p)), 21672#(and (or (= (+ (* 2 M) p) q) (not (< 0 N))) (<= N 2) (or (not (< 0 N)) (< 1 N))), 21675#(and (or (not (< 0 N)) (= q 0)) (or (= (+ (* (- 1) L) N) 0) (not (< 0 N))) (or (= p 0) (not (< 0 N))) (or (not (< 0 N)) (not (<= N 1)))), 21677#(and (or (not (< 1 N)) (<= N (+ 2 L))) (or (= (+ (* 2 M) p) q) (not (< 1 N)))), 21674#(and (or (<= q M) (not (< 0 N))) (or (not (< 0 N)) (<= N (+ L 1))) (or (not (< 0 N)) (<= M q)) (or (= p 0) (not (< 0 N))) (or (not (< 0 N)) (not (<= N 1)))), 21676#(and (or (= (+ (* 2 M) p) q) (not (< 1 N))) (<= N 2)), 21673#(and (or (not (< 0 N)) (< 1 N) (= q p)) (or (= (+ (* 2 M) p) q) (<= N 1)) (or (not (< 0 N)) (<= N (+ 2 L))) (or (< 0 L) (not (< 0 N)) (< 1 N))), 21670#(and (or (< 1 N) (= q p)) (or (= (+ (* 2 M) p) q) (not (< 1 N))) (<= N 2) (or (<= N 0) (< 1 N))), 21666#(or (< 1 L) (= p (+ M q)) (< 1 N) (not (< 0 L))), 21671#(and (or (< 1 N) (= q p)) (or (< 1 N) (<= N L)) (or (= (+ (* 2 M) p) q) (not (< 1 N))) (<= N (+ 2 L))), 21679#(and (or (not (< 1 N)) (<= 0 q)) (or (not (< 1 N)) (= p 0)) (or (= N L) (not (< 1 N))) (or (not (< 1 N)) (<= q 0))), 21678#(and (or (not (< 1 N)) (= p 0)) (or (not (< 1 N)) (<= q M)) (or (not (< 1 N)) (<= M q)) (or (not (< 1 N)) (<= N (+ L 1)))), 21667#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 21669#(and (or (<= (+ 2 N) L) (not (< 0 L))) (or (not (< 0 L)) (= (+ (* 2 M) q) p))), 21664#(or (< 1 N) (= q p)), 21665#(or (< 0 L) (< 1 N) (= q p)), 21662#(or (< 0 L) (= q p))] [2022-03-15 21:32:03,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:32:03,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:03,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:32:03,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1127, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:32:03,877 INFO L87 Difference]: Start difference. First operand 712 states and 2409 transitions. Second operand has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:06,685 INFO L93 Difference]: Finished difference Result 1546 states and 4532 transitions. [2022-03-15 21:32:06,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-03-15 21:32:06,685 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:32:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:06,693 INFO L225 Difference]: With dead ends: 1546 [2022-03-15 21:32:06,693 INFO L226 Difference]: Without dead ends: 1476 [2022-03-15 21:32:06,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2576 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1672, Invalid=7834, Unknown=0, NotChecked=0, Total=9506 [2022-03-15 21:32:06,694 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 445 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:06,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 5 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:32:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2022-03-15 21:32:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 728. [2022-03-15 21:32:06,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 3.385144429160935) internal successors, (2461), 727 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 2461 transitions. [2022-03-15 21:32:06,713 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 2461 transitions. Word has length 17 [2022-03-15 21:32:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:06,713 INFO L470 AbstractCegarLoop]: Abstraction has 728 states and 2461 transitions. [2022-03-15 21:32:06,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 2461 transitions. [2022-03-15 21:32:06,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:32:06,715 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:06,715 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:06,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-03-15 21:32:06,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 21:32:06,928 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:32:06,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:06,929 INFO L85 PathProgramCache]: Analyzing trace with hash -519734406, now seen corresponding path program 5 times [2022-03-15 21:32:06,929 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:06,929 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541243329] [2022-03-15 21:32:06,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:06,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:06,993 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 21:32:06,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:06,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541243329] [2022-03-15 21:32:06,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541243329] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:06,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862673512] [2022-03-15 21:32:06,994 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:32:06,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:06,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:06,995 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:06,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 21:32:07,017 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:32:07,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:32:07,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:32:07,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:07,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:07,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:07,271 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 21:32:07,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862673512] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:07,272 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:07,272 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 17 [2022-03-15 21:32:07,272 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [432230296] [2022-03-15 21:32:07,272 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:07,273 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:07,275 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 118 transitions. [2022-03-15 21:32:07,275 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:07,977 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [24926#(and (or (< 0 L) (<= 1 N)) (or (< 0 L) (<= N 1))), 24932#(or (= (+ (* (- 1) L) N) 0) (not (< 1 N))), 24925#(or (< 0 L) (<= 1 N)), 24931#(or (not (< 1 N)) (<= N (+ L 1))), 24922#(or (< 0 L) (< 1 N)), 24928#(or (< 0 N) (< 2 L) (<= L 1)), 24918#(< 0 L), 24929#(<= N 2), 24924#(or (< 2 L) (< 1 N) (<= L 1)), 24938#(and (or (< 2 L) (<= L 1) (<= N 1)) (or (< 2 L) (<= L 1) (<= 1 N))), 24936#(and (or (= (+ (* (- 1) L) N) 0) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N))), 24923#(or (< 1 L) (<= L 0) (< 1 N)), 24920#(or (< 2 L) (<= L 1)), 24937#(and (or (< 1 L) (<= L 0) (<= 1 N)) (or (< 1 L) (<= L 0) (<= N 1))), 24935#(and (or (not (< 0 N)) (<= N (+ L 1))) (or (not (< 0 N)) (<= 2 N))), 24930#(or (not (< 1 N)) (<= N (+ 2 L))), 24919#(or (< 1 L) (<= L 0)), 24934#(and (or (not (< 0 N)) (<= N (+ 2 L))) (or (not (< 0 N)) (<= 2 N))), 24921#(< 1 N), 24927#(or (< 0 N) (< 1 L) (<= L 0)), 24933#(and (or (not (< 0 N)) (<= 2 N)) (<= N 2))] [2022-03-15 21:32:07,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 21:32:07,978 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:07,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 21:32:07,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1206, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 21:32:07,978 INFO L87 Difference]: Start difference. First operand 728 states and 2461 transitions. Second operand has 30 states, 30 states have (on average 3.0) internal successors, (90), 29 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:10,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:10,628 INFO L93 Difference]: Finished difference Result 2030 states and 6413 transitions. [2022-03-15 21:32:10,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-03-15 21:32:10,629 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.0) internal successors, (90), 29 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:32:10,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:10,636 INFO L225 Difference]: With dead ends: 2030 [2022-03-15 21:32:10,637 INFO L226 Difference]: Without dead ends: 2030 [2022-03-15 21:32:10,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7613 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3586, Invalid=17584, Unknown=0, NotChecked=0, Total=21170 [2022-03-15 21:32:10,640 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 430 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 535 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:10,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 1 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [535 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:32:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2022-03-15 21:32:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 907. [2022-03-15 21:32:10,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 3.479028697571744) internal successors, (3152), 906 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 3152 transitions. [2022-03-15 21:32:10,665 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 3152 transitions. Word has length 17 [2022-03-15 21:32:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:10,665 INFO L470 AbstractCegarLoop]: Abstraction has 907 states and 3152 transitions. [2022-03-15 21:32:10,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.0) internal successors, (90), 29 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:10,665 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 3152 transitions. [2022-03-15 21:32:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:32:10,667 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:10,667 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:10,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 21:32:10,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 21:32:10,883 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:32:10,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:10,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2034971054, now seen corresponding path program 5 times [2022-03-15 21:32:10,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:10,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330058183] [2022-03-15 21:32:10,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:10,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:10,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:10,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330058183] [2022-03-15 21:32:10,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330058183] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:10,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585201329] [2022-03-15 21:32:10,965 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:32:10,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:10,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:10,967 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:10,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 21:32:10,991 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:32:10,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:32:10,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 21:32:10,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:32:11,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:11,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:32:11,196 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585201329] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:11,196 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:11,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2022-03-15 21:32:11,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [132549036] [2022-03-15 21:32:11,197 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:11,197 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:11,200 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 97 transitions. [2022-03-15 21:32:11,200 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:11,642 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [29108#(and (< 0 N) (= p (+ M q))), 29018#(and (< 0 N) (= q p)), 29112#(and (or (<= (* 2 M) q) (not (< 0 N))) (or (<= q (* 2 M)) (not (< 0 N))) (or (= p 0) (not (< 0 N)))), 29107#(= (+ (* 2 M) q) p), 29109#(and (< 0 N) (or (< q (+ M p 1)) (< 1 N)) (or (<= (+ M p) q) (< 1 N))), 29111#(and (< 0 N) (or (= p (+ M q)) (< 1 N))), 29114#(and (or (not (< 0 N)) (= q 0)) (or (= p 0) (not (< 0 N)))), 29106#(= p (+ M q)), 29113#(and (or (<= q M) (not (< 0 N))) (or (not (< 0 N)) (<= M q)) (or (= p 0) (not (< 0 N)))), 29110#(and (< 0 N) (or (< 1 N) (= q p)))] [2022-03-15 21:32:11,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:32:11,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:11,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:32:11,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-03-15 21:32:11,643 INFO L87 Difference]: Start difference. First operand 907 states and 3152 transitions. Second operand has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 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 21:32:12,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:12,304 INFO L93 Difference]: Finished difference Result 1596 states and 5286 transitions. [2022-03-15 21:32:12,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 21:32:12,304 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 21:32:12,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:12,333 INFO L225 Difference]: With dead ends: 1596 [2022-03-15 21:32:12,333 INFO L226 Difference]: Without dead ends: 1546 [2022-03-15 21:32:12,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:32:12,334 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 97 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:12,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 27 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:32:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2022-03-15 21:32:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1196. [2022-03-15 21:32:12,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1195 states have (on average 3.584100418410042) internal successors, (4283), 1195 states have internal predecessors, (4283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 4283 transitions. [2022-03-15 21:32:12,360 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 4283 transitions. Word has length 17 [2022-03-15 21:32:12,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:12,361 INFO L470 AbstractCegarLoop]: Abstraction has 1196 states and 4283 transitions. [2022-03-15 21:32:12,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 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 21:32:12,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 4283 transitions. [2022-03-15 21:32:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:32:12,365 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:12,366 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:12,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 21:32:12,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 21:32:12,579 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:32:12,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:12,580 INFO L85 PathProgramCache]: Analyzing trace with hash 328697783, now seen corresponding path program 6 times [2022-03-15 21:32:12,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:12,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805393984] [2022-03-15 21:32:12,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:12,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:12,651 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:12,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805393984] [2022-03-15 21:32:12,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805393984] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:12,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954179039] [2022-03-15 21:32:12,651 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:32:12,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:12,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:12,652 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:12,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 21:32:12,679 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:32:12,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:32:12,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 21:32:12,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:12,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:12,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954179039] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:12,869 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:12,869 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-03-15 21:32:12,869 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [557063558] [2022-03-15 21:32:12,869 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:12,870 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:12,873 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 111 transitions. [2022-03-15 21:32:12,873 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:14,283 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [33268#(and (or (<= (+ M p) q) (<= N 2) (< 3 N)) (or (<= N 2) (< 3 N) (<= q (+ M p)))), 33257#(and (or (not (< 0 N)) (<= (+ M q) p)) (or (not (< 0 N)) (<= p (+ M q)))), 33270#(= p (+ M q)), 33256#(and (or (<= p q) (not (< 0 N)) (< 1 N)) (or (<= q p) (not (< 0 N)) (< 1 N))), 33264#(and (or (<= (+ M p) q) (<= N 2) (< 3 N)) (or (not (< 0 N)) (<= p (+ M q)) (< 1 N)) (or (<= N 2) (< 3 N) (<= q (+ M p))) (or (not (< 0 N)) (<= (+ M q) p) (< 1 N))), 33255#(and (or (<= q p) (not (< 0 N))) (or (<= p q) (not (< 0 N)))), 33269#(and (or (<= p 0) (<= N 2) (< 3 N)) (or (<= N 2) (< 3 N) (= q 0)) (or (<= 0 p) (<= N 2) (< 3 N))), 33267#(and (or (< q (+ (* 2 M) p 1)) (<= N 2) (< 3 N)) (or (<= N 2) (< 3 N) (<= (+ (* 2 M) p) q))), 33266#(and (or (<= (+ (* 3 M) p) q) (<= N 2) (< 3 N)) (or (<= N 2) (< q (+ (* 3 M) p 1)) (< 3 N))), 33254#(and (or (not (< 0 N)) (< q (+ M p 1)) (< 1 N)) (or (<= (+ M p) q) (not (< 0 N)) (< 1 N))), 33252#(and (< 0 N) (or (<= p (+ M q)) (< 1 N)) (or (<= (+ M q) p) (< 1 N))), 33271#(= (+ (* 3 M) q) p), 33263#(and (or (<= p q) (not (< 0 N)) (< 1 N)) (or (< q (+ (* 2 M) p 1)) (<= N 2) (< 3 N)) (or (<= N 2) (< 3 N) (<= (+ (* 2 M) p) q)) (or (<= q p) (not (< 0 N)) (< 1 N))), 33157#(= (+ (* 2 M) q) p), 33260#(and (or (not (< 0 N)) (<= (* 2 M) p)) (or (not (< 0 N)) (= q 0)) (or (not (< 0 N)) (<= p (* 2 M)))), 33253#(and (or (not (< 0 N)) (< q (+ M p 1))) (or (<= (+ M p) q) (not (< 0 N)))), 33250#(and (< 0 N) (or (< q (+ M p 1)) (< 1 N)) (or (<= (+ M p) q) (< 1 N))), 33265#(and (or (<= p 0) (<= N 2) (< 3 N)) (or (not (< 0 N)) (< 1 N) (<= (* 2 M) p)) (or (<= N 2) (< 3 N) (= q 0)) (or (<= 0 p) (<= N 2) (< 3 N)) (or (not (< 0 N)) (<= p (* 2 M)) (< 1 N)) (or (not (< 0 N)) (< 1 N) (= q 0))), 33261#(and (or (not (< 0 N)) (< 1 N) (<= (* 2 M) p)) (or (not (< 0 N)) (<= p (* 2 M)) (< 1 N)) (or (not (< 0 N)) (< 1 N) (= q 0))), 33258#(and (or (not (< 0 N)) (<= p (+ M q)) (< 1 N)) (or (not (< 0 N)) (<= (+ M q) p) (< 1 N))), 33262#(and (or (not (< 0 N)) (< q (+ M p 1)) (< 1 N)) (or (<= (+ M p) q) (not (< 0 N)) (< 1 N)) (or (<= (+ (* 3 M) p) q) (<= N 2) (< 3 N)) (or (<= N 2) (< q (+ (* 3 M) p 1)) (< 3 N))), 33251#(and (or (<= p q) (< 1 N)) (< 0 N) (or (<= q p) (< 1 N))), 33259#(and (< 0 N) (or (<= p (* 2 M)) (< 1 N)) (or (< 1 N) (<= (* 2 M) p)) (or (< 1 N) (= q 0)))] [2022-03-15 21:32:14,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:32:14,285 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:14,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:32:14,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1320, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 21:32:14,285 INFO L87 Difference]: Start difference. First operand 1196 states and 4283 transitions. Second operand has 33 states, 32 states have (on average 2.65625) 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 21:32:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:16,595 INFO L93 Difference]: Finished difference Result 2210 states and 7542 transitions. [2022-03-15 21:32:16,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 21:32:16,596 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.65625) 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 21:32:16,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:16,615 INFO L225 Difference]: With dead ends: 2210 [2022-03-15 21:32:16,616 INFO L226 Difference]: Without dead ends: 2190 [2022-03-15 21:32:16,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=582, Invalid=3840, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 21:32:16,617 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 294 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:16,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 23 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:32:16,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2022-03-15 21:32:16,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 1520. [2022-03-15 21:32:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1519 states have (on average 3.676102699144174) internal successors, (5584), 1519 states have internal predecessors, (5584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 5584 transitions. [2022-03-15 21:32:16,669 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 5584 transitions. Word has length 18 [2022-03-15 21:32:16,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:16,669 INFO L470 AbstractCegarLoop]: Abstraction has 1520 states and 5584 transitions. [2022-03-15 21:32:16,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.65625) 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 21:32:16,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 5584 transitions. [2022-03-15 21:32:16,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:32:16,672 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:16,672 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:16,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 21:32:16,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 21:32:16,906 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:32:16,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:16,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1883897145, now seen corresponding path program 7 times [2022-03-15 21:32:16,907 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:16,907 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62687240] [2022-03-15 21:32:16,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:16,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:17,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:17,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62687240] [2022-03-15 21:32:17,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62687240] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:17,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471353981] [2022-03-15 21:32:17,045 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:32:17,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:17,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:17,046 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:17,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 21:32:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:17,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:32:17,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:17,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:17,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471353981] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:17,434 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:17,434 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 21:32:17,434 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [899040656] [2022-03-15 21:32:17,434 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:17,435 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:17,438 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 113 transitions. [2022-03-15 21:32:17,438 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:19,405 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [38717#(and (or (not (< 0 N)) (<= p (+ M q)) (< 1 N)) (or (<= N 1) (< 3 N) (<= (+ L 1) N)) (or (<= N 1) (< 3 N) (<= q (+ M p))) (or (not (< 0 N)) (<= L (+ N 1)) (< 1 N)) (or (not (< 0 N)) (<= (+ M q) p) (< 1 N)) (or (<= (+ M p) q) (<= N 1) (< 3 N))), 38705#(and (or (<= L (+ N 1)) (< 1 N)) (or (<= p (+ M q)) (< 1 N)) (or (not (< 1 N)) (< 3 N) (<= q (+ M p))) (or (<= (+ M p) q) (not (< 1 N)) (< 3 N)) (or (not (< 1 N)) (< 3 N) (<= (+ L 1) N)) (or (<= (+ M q) p) (< 1 N))), 38714#(or (= (+ (* 3 M) q) p) (<= L 2) (< 3 L)), 38699#(and (or (< 1 N) (= q (+ M p))) (<= 1 N)), 38713#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 38719#(and (or (not (< 1 N)) (= q 0)) (or (not (< 1 N)) (= p 0)) (or (= N L) (not (< 1 N)))), 38712#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 38703#(and (or (< 1 N) (= q (+ M p))) (or (not (< 1 N)) (<= 3 N)) (or (not (< 1 N)) (= (+ (* 3 M) p) q) (< 3 N)) (<= 1 N)), 38704#(and (or (<= p q) (< 1 N)) (or (< 1 N) (<= L N)) (or (not (< 1 N)) (<= q (+ (* 2 M) p)) (< 3 N)) (or (not (< 1 N)) (< 3 N) (<= (+ 2 L) N)) (or (<= q p) (< 1 N)) (or (not (< 1 N)) (< 3 N) (<= (+ (* 2 M) p) q))), 38711#(or (< 0 L) (= q p)), 38710#(and (or (not (< 1 N)) (< 3 N) (<= L N)) (or (not (< 1 N)) (<= 0 p) (< 3 N)) (or (not (< 1 N)) (<= p 0) (< 3 N)) (or (not (< 1 N)) (< 3 N) (= q 0))), 38702#(and (or (<= p (* 2 M)) (< 1 N)) (or (<= L (+ 2 N)) (< 1 N)) (or (< 1 N) (<= (* 2 M) p)) (or (< 1 N) (= q 0))), 38709#(and (or (not (< 1 N)) (< 3 N) (<= q (+ M p))) (or (<= (+ M p) q) (not (< 1 N)) (< 3 N)) (or (not (< 1 N)) (< 3 N) (<= (+ L 1) N))), 38701#(and (or (<= L (+ N 1)) (< 1 N)) (or (<= p (+ M q)) (< 1 N)) (or (<= (+ M q) p) (< 1 N))), 38708#(and (or (not (< 1 N)) (<= q (+ (* 2 M) p)) (< 3 N)) (or (not (< 1 N)) (< 3 N) (<= (+ 2 L) N)) (or (not (< 1 N)) (< 3 N) (<= (+ (* 2 M) p) q))), 38700#(and (or (<= p q) (< 1 N)) (or (< 1 N) (<= L N)) (or (<= q p) (< 1 N))), 38706#(and (or (<= p (* 2 M)) (< 1 N)) (or (< 3 N) (= q 0)) (or (<= L (+ 2 N)) (< 1 N)) (or (not (< 1 N)) (< 3 N) (<= L N)) (or (not (< 1 N)) (<= 0 p) (< 3 N)) (or (< 1 N) (<= (* 2 M) p)) (or (not (< 1 N)) (<= p 0) (< 3 N))), 38716#(and (or (<= q (+ (* 2 M) p)) (<= N 1) (< 3 N)) (or (<= N 1) (< 3 N) (<= (+ 2 L) N)) (or (<= p q) (not (< 0 N)) (< 1 N)) (or (not (< 0 N)) (< 1 N) (<= L N)) (or (<= N 1) (< 3 N) (<= (+ (* 2 M) p) q)) (or (<= q p) (not (< 0 N)) (< 1 N))), 38718#(and (or (<= p 0) (<= N 1) (< 3 N)) (or (<= 0 p) (<= N 1) (< 3 N)) (or (not (< 0 N)) (< 1 N) (<= (* 2 M) p)) (or (<= L (+ 2 N)) (not (< 0 N)) (< 1 N)) (or (not (< 0 N)) (< 3 N) (= q 0)) (or (<= N 1) (< 3 N) (<= L N)) (or (not (< 0 N)) (<= p (* 2 M)) (< 1 N))), 38715#(and (or (<= 3 N) (<= N 1)) (or (= (+ (* 3 M) p) q) (<= N 1) (< 3 N)) (or (not (< 0 N)) (< 1 N) (= q (+ M p)))), 38707#(and (or (not (< 1 N)) (<= 3 N)) (or (not (< 1 N)) (= (+ (* 3 M) p) q) (< 3 N)))] [2022-03-15 21:32:19,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 21:32:19,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:19,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 21:32:19,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1398, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 21:32:19,406 INFO L87 Difference]: Start difference. First operand 1520 states and 5584 transitions. Second operand has 30 states, 29 states have (on average 3.0) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:28,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:28,973 INFO L93 Difference]: Finished difference Result 2731 states and 8610 transitions. [2022-03-15 21:32:28,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2022-03-15 21:32:28,973 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.0) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:32:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:28,979 INFO L225 Difference]: With dead ends: 2731 [2022-03-15 21:32:28,979 INFO L226 Difference]: Without dead ends: 2592 [2022-03-15 21:32:28,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11576 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=3936, Invalid=29736, Unknown=0, NotChecked=0, Total=33672 [2022-03-15 21:32:28,981 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 591 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 3837 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 4077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 3837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:28,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [591 Valid, 17 Invalid, 4077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 3837 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 21:32:28,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2022-03-15 21:32:29,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 1554. [2022-03-15 21:32:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1553 states have (on average 3.6838377334191885) internal successors, (5721), 1553 states have internal predecessors, (5721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 5721 transitions. [2022-03-15 21:32:29,016 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 5721 transitions. Word has length 18 [2022-03-15 21:32:29,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:29,016 INFO L470 AbstractCegarLoop]: Abstraction has 1554 states and 5721 transitions. [2022-03-15 21:32:29,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.0) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:29,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 5721 transitions. [2022-03-15 21:32:29,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:32:29,019 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:29,019 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:29,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 21:32:29,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:29,235 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:32:29,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:29,235 INFO L85 PathProgramCache]: Analyzing trace with hash -2093768657, now seen corresponding path program 8 times [2022-03-15 21:32:29,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:29,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998071668] [2022-03-15 21:32:29,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:29,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:29,306 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:29,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998071668] [2022-03-15 21:32:29,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998071668] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:29,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982710722] [2022-03-15 21:32:29,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:32:29,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:29,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:29,307 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:29,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 21:32:29,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:32:29,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:32:29,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:32:29,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:29,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:29,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982710722] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:29,595 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:29,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 21:32:29,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1472639198] [2022-03-15 21:32:29,595 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:29,596 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:29,600 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 144 transitions. [2022-03-15 21:32:29,600 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:31,402 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [44975#(and (or (not (< 1 N)) (<= 3 N)) (or (not (< 1 N)) (< q (+ (* 3 M) p 1))) (or (not (< 1 N)) (<= (+ (* 3 M) p) q))), 44978#(and (or (not (< 0 N)) (= q 0)) (or (= (+ (* (- 1) L) N) 0) (not (< 0 N))) (or (= p 0) (not (< 0 N))) (or (not (< 0 N)) (not (<= N 1)))), 44984#(or (< 1 L) (= p (+ M q)) (< 1 N) (not (< 0 L))), 44968#(or (< 0 L) (= q p)), 44985#(or (< 2 L) (< 1 N) (<= L 1) (= (+ (* 2 M) q) p)), 44980#(and (or (not (< 1 N)) (<= 0 q)) (or (not (< 1 N)) (= p 0)) (or (= N L) (not (< 1 N))) (or (not (< 1 N)) (<= q 0))), 44977#(and (or (<= q M) (not (< 0 N))) (or (not (< 0 N)) (<= (+ L 1) N)) (or (not (< 0 N)) (<= M q)) (or (= p 0) (not (< 0 N))) (or (not (< 0 N)) (not (<= N 1)))), 44979#(and (or (not (< 1 N)) (= p 0)) (or (not (< 1 N)) (<= q M)) (or (not (< 1 N)) (<= (+ L 1) N)) (or (not (< 1 N)) (<= M q))), 44972#(and (or (<= 3 N) (<= N 1)) (or (not (< 0 N)) (< q (+ M p 1)) (< 1 N)) (or (<= (+ M p) q) (not (< 0 N)) (< 1 N)) (or (<= (+ (* 3 M) p) q) (<= N 1)) (or (<= N 1) (< q (+ (* 3 M) p 1)))), 44970#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 44987#(and (or (<= L (+ 2 N)) (not (< 0 L))) (or (<= (+ (* 2 M) q) p) (not (< 0 L))) (or (<= p (+ (* 2 M) q)) (not (< 0 L)))), 44971#(and (or (not (< 1 N)) (<= 3 N)) (or (< q (+ M p 1)) (< 1 N)) (or (not (< 1 N)) (< q (+ (* 3 M) p 1))) (<= 1 N) (or (<= (+ M p) q) (< 1 N)) (or (not (< 1 N)) (<= (+ (* 3 M) p) q))), 44983#(or (< 0 L) (< 1 N) (= q p)), 44976#(and (or (not (< 1 N)) (<= (+ (* 2 M) p) q)) (or (not (< 1 N)) (<= q (+ (* 2 M) p))) (or (not (< 1 N)) (<= (+ 2 L) N))), 44982#(or (< 1 N) (= q p)), 44969#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 44986#(or (= (+ (* 3 M) q) p) (< 1 N) (<= L 2) (< 3 L)), 44973#(and (or (<= p q) (< 1 N)) (or (not (< 1 N)) (<= (+ (* 2 M) p) q)) (or (not (< 1 N)) (<= q (+ (* 2 M) p))) (or (<= q p) (< 1 N)) (or (not (< 1 N)) (<= (+ 2 L) N)) (<= L N)), 44974#(and (or (<= N 1) (<= (+ (* 2 M) p) q)) (or (not (< 0 N)) (<= L N)) (or (<= p q) (not (< 0 N)) (< 1 N)) (or (<= N 1) (<= (+ 2 L) N)) (or (<= q p) (not (< 0 N)) (< 1 N)) (or (<= q (+ (* 2 M) p)) (<= N 1))), 44981#(or (= (+ (* 3 M) q) p) (<= L 2) (< 3 L))] [2022-03-15 21:32:31,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 21:32:31,402 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:31,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 21:32:31,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1293, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 21:32:31,403 INFO L87 Difference]: Start difference. First operand 1554 states and 5721 transitions. Second operand has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:36,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:36,687 INFO L93 Difference]: Finished difference Result 3417 states and 11766 transitions. [2022-03-15 21:32:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-03-15 21:32:36,688 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:32:36,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:36,697 INFO L225 Difference]: With dead ends: 3417 [2022-03-15 21:32:36,697 INFO L226 Difference]: Without dead ends: 3351 [2022-03-15 21:32:36,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7231 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3492, Invalid=19764, Unknown=0, NotChecked=0, Total=23256 [2022-03-15 21:32:36,699 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 435 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 2725 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 3087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 2725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:36,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [435 Valid, 15 Invalid, 3087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 2725 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 21:32:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3351 states. [2022-03-15 21:32:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3351 to 1802. [2022-03-15 21:32:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1801 states have (on average 3.754580788450861) internal successors, (6762), 1801 states have internal predecessors, (6762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6762 transitions. [2022-03-15 21:32:36,771 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6762 transitions. Word has length 18 [2022-03-15 21:32:36,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:36,771 INFO L470 AbstractCegarLoop]: Abstraction has 1802 states and 6762 transitions. [2022-03-15 21:32:36,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6762 transitions. [2022-03-15 21:32:36,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:32:36,775 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:36,775 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:36,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 21:32:36,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:36,991 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:32:36,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:36,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1276937735, now seen corresponding path program 9 times [2022-03-15 21:32:36,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:36,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196831938] [2022-03-15 21:32:36,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:36,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:37,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:37,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196831938] [2022-03-15 21:32:37,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196831938] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:37,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975120661] [2022-03-15 21:32:37,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:32:37,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:37,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:37,096 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:37,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 21:32:37,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:32:37,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:32:37,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 21:32:37,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:37,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:37,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975120661] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:37,543 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:37,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 19 [2022-03-15 21:32:37,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [234446755] [2022-03-15 21:32:37,543 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:37,544 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:37,547 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 144 transitions. [2022-03-15 21:32:37,548 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:39,181 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [52379#(and (or (<= p q) (< 2 L) (not (< 1 L))) (or (< 2 L) (not (< 1 L)) (< q (+ p 1))) (or (<= 2 N) (< 2 L) (not (< 1 L)))), 52367#(or (< 0 L) (< 1 N) (= q p)), 52380#(and (or (not (< 2 L)) (< 3 L) (< (+ M q) (+ p 1))) (or (not (< 2 L)) (<= p (+ M q)) (< 3 L)) (or (not (< 2 L)) (<= 2 N) (< 3 L))), 52369#(and (or (< 0 L) (<= 2 N)) (or (< 0 L) (< q (+ (* 2 M) p 1))) (or (< 0 L) (<= (+ (* 2 M) p) q))), 52361#(and (or (not (< 0 N)) (<= (+ 2 L) N)) (or (<= (* 2 M) q) (not (< 0 N))) (or (<= q (* 2 M)) (not (< 0 N))) (or (= p 0) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N))), 52378#(and (or (<= (+ M p) q) (< 1 L) (not (< 0 L))) (or (< 1 L) (<= 2 N) (not (< 0 L))) (or (< 1 L) (< q (+ M p 1)) (not (< 0 L)))), 52368#(or (< 1 L) (= p (+ M q)) (< 1 N) (not (< 0 L))), 52372#(and (or (<= q M) (not (< 0 N))) (or (not (< 0 N)) (<= (+ L 1) N)) (or (not (< 0 N)) (<= M q)) (or (= p 0) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N))), 52376#(and (or (not (< 1 N)) (= p 0)) (or (not (< 1 N)) (<= q M)) (or (not (< 1 N)) (<= (+ L 1) N)) (or (not (< 1 N)) (<= M q))), 52370#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 52375#(or (= (+ (* 3 M) q) p) (< 1 N) (<= L 2) (< 3 L)), 52373#(and (or (= p 0) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N)) (or (= N L) (not (< 0 N))) (or (<= 0 q) (not (< 0 N))) (or (not (< 0 N)) (<= q 0))), 52360#(and (or (not (< 0 N)) (<= q (* 3 M))) (or (<= (* 3 M) q) (not (< 0 N))) (or (<= 3 N) (not (< 0 N))) (or (= p 0) (not (< 0 N)))), 52365#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 52364#(or (< 0 L) (= q p)), 52363#(and (or (not (< 1 N)) (<= (* 2 M) q)) (or (not (< 1 N)) (= p 0)) (or (not (< 1 N)) (<= q (* 2 M))) (or (not (< 1 N)) (<= (+ 2 L) N))), 52366#(or (< 1 N) (= q p)), 52374#(or (< 2 L) (< 1 N) (<= L 1) (= (+ (* 2 M) q) p)), 52371#(or (= (+ (* 3 M) q) p) (<= L 2) (< 3 L)), 52377#(and (or (not (< 1 N)) (<= 0 q)) (or (not (< 1 N)) (= p 0)) (or (= N L) (not (< 1 N))) (or (not (< 1 N)) (<= q 0))), 52362#(and (or (not (< 1 N)) (<= 3 N)) (or (not (< 1 N)) (= p 0)) (or (not (< 1 N)) (<= q (* 3 M))) (or (not (< 1 N)) (<= (* 3 M) q)))] [2022-03-15 21:32:39,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 21:32:39,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:39,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 21:32:39,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1489, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 21:32:39,182 INFO L87 Difference]: Start difference. First operand 1802 states and 6762 transitions. Second operand has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:44,081 INFO L93 Difference]: Finished difference Result 2695 states and 9519 transitions. [2022-03-15 21:32:44,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-03-15 21:32:44,081 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:32:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:44,088 INFO L225 Difference]: With dead ends: 2695 [2022-03-15 21:32:44,088 INFO L226 Difference]: Without dead ends: 2683 [2022-03-15 21:32:44,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7069 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2547, Invalid=19505, Unknown=0, NotChecked=0, Total=22052 [2022-03-15 21:32:44,091 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 452 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 2719 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 2989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:44,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 12 Invalid, 2989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2719 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 21:32:44,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2022-03-15 21:32:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 1817. [2022-03-15 21:32:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1816 states have (on average 3.75715859030837) internal successors, (6823), 1816 states have internal predecessors, (6823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 6823 transitions. [2022-03-15 21:32:44,141 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 6823 transitions. Word has length 18 [2022-03-15 21:32:44,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:44,141 INFO L470 AbstractCegarLoop]: Abstraction has 1817 states and 6823 transitions. [2022-03-15 21:32:44,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 6823 transitions. [2022-03-15 21:32:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:32:44,144 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:44,144 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:44,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 21:32:44,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:44,358 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:32:44,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:44,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1859812077, now seen corresponding path program 5 times [2022-03-15 21:32:44,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:44,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42341447] [2022-03-15 21:32:44,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:44,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:44,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:44,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42341447] [2022-03-15 21:32:44,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42341447] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:44,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438451022] [2022-03-15 21:32:44,406 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:32:44,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:44,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:44,407 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:44,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 21:32:44,426 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:32:44,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:32:44,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:32:44,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:44,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:44,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:44,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438451022] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:44,555 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:44,555 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2022-03-15 21:32:44,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1495812756] [2022-03-15 21:32:44,556 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:44,556 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:44,560 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 125 transitions. [2022-03-15 21:32:44,560 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:44,987 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [59045#(or (not (< 1 N)) (<= 1 L)), 59059#(or (<= (+ 2 N) L) (<= L 0)), 59054#(or (not (< 1 N)) (<= 2 L)), 59043#(< 3 N), 59050#(or (<= 3 L) (< 1 N) (<= L 1)), 59055#(or (<= 2 L) (<= N 3)), 59052#(or (< 5 N) (<= N 3)), 59042#(< 1 N), 59046#(or (<= 3 L) (<= L 1)), 59056#(or (not (< 1 N)) (<= N (+ L 1))), 59047#(or (<= 4 L) (<= L 2)), 59041#(or (<= 2 L) (<= L 0)), 59048#(or (<= 1 L) (< 1 N)), 59051#(or (<= 4 L) (< 1 N) (<= L 2)), 59049#(or (<= 2 L) (<= L 0) (< 1 N)), 59057#(or (= N L) (not (< 1 N))), 59044#(or (not (< 1 N)) (< 3 N)), 59053#(or (<= 1 L) (<= N 3)), 59058#(or (<= 4 L) (<= L 0))] [2022-03-15 21:32:44,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:32:44,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:44,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:32:44,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:32:44,988 INFO L87 Difference]: Start difference. First operand 1817 states and 6823 transitions. Second operand has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 27 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:45,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:45,968 INFO L93 Difference]: Finished difference Result 5393 states and 19271 transitions. [2022-03-15 21:32:45,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 21:32:45,968 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 27 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:32:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:45,982 INFO L225 Difference]: With dead ends: 5393 [2022-03-15 21:32:45,982 INFO L226 Difference]: Without dead ends: 5393 [2022-03-15 21:32:45,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2493 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1637, Invalid=6553, Unknown=0, NotChecked=0, Total=8190 [2022-03-15 21:32:45,984 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 549 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:45,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [549 Valid, 1 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:32:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5393 states. [2022-03-15 21:32:46,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5393 to 2805. [2022-03-15 21:32:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2805 states, 2804 states have (on average 3.8238231098430813) internal successors, (10722), 2804 states have internal predecessors, (10722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 10722 transitions. [2022-03-15 21:32:46,081 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 10722 transitions. Word has length 18 [2022-03-15 21:32:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:46,082 INFO L470 AbstractCegarLoop]: Abstraction has 2805 states and 10722 transitions. [2022-03-15 21:32:46,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 27 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:46,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 10722 transitions. [2022-03-15 21:32:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:32:46,088 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:46,088 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:46,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-03-15 21:32:46,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:46,304 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:32:46,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:46,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1892809519, now seen corresponding path program 10 times [2022-03-15 21:32:46,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:46,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446273954] [2022-03-15 21:32:46,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:46,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:46,394 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:46,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:46,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446273954] [2022-03-15 21:32:46,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446273954] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:46,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944099115] [2022-03-15 21:32:46,395 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:32:46,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:46,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:46,396 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:46,434 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:32:46,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:32:46,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 21:32:46,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:46,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 21:32:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:32:46,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:32:46,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944099115] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:46,611 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:46,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-03-15 21:32:46,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1691459393] [2022-03-15 21:32:46,611 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:46,612 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:46,616 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 129 transitions. [2022-03-15 21:32:46,616 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:47,209 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [70300#(= (+ (* 2 M) q) p), 70303#(and (or (not (< 0 N)) (<= q (* 3 M))) (or (<= (* 3 M) q) (not (< 0 N))) (or (= p 0) (not (< 0 N)))), 70310#(and (or (<= (* 2 M) q) (not (< 0 N))) (or (<= q (* 2 M)) (not (< 0 N))) (or (= p 0) (not (< 0 N)))), 70308#(and (< 1 N) (= q p)), 70312#(and (or (not (< 0 N)) (= q 0)) (or (= p 0) (not (< 0 N)))), 70301#(= (+ (* 3 M) q) p), 70305#(or (= (+ (* 3 M) q) p) (< 1 N)), 70304#(or (< 1 N) (= (+ (* 2 M) q) p)), 70306#(and (< 1 N) (= q (+ M p))), 70298#(or (< 1 N) (= q p)), 70307#(and (<= (+ M p) q) (< q (+ M p 1))), 70309#(and (= p (+ M q)) (< 1 N)), 70302#(or (= p (+ M q)) (< 1 N)), 70311#(and (or (<= q M) (not (< 0 N))) (or (not (< 0 N)) (<= M q)) (or (= p 0) (not (< 0 N)))), 70299#(= p (+ M q))] [2022-03-15 21:32:47,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:32:47,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:47,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:32:47,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:32:47,210 INFO L87 Difference]: Start difference. First operand 2805 states and 10722 transitions. Second operand has 25 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:48,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:48,207 INFO L93 Difference]: Finished difference Result 4050 states and 14861 transitions. [2022-03-15 21:32:48,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 21:32:48,208 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:32:48,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:48,217 INFO L225 Difference]: With dead ends: 4050 [2022-03-15 21:32:48,217 INFO L226 Difference]: Without dead ends: 4042 [2022-03-15 21:32:48,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=315, Invalid=2441, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:32:48,219 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 170 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:48,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 40 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:32:48,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4042 states. [2022-03-15 21:32:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4042 to 3003. [2022-03-15 21:32:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3003 states, 3002 states have (on average 3.8704197201865425) internal successors, (11619), 3002 states have internal predecessors, (11619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:48,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 3003 states and 11619 transitions. [2022-03-15 21:32:48,289 INFO L78 Accepts]: Start accepts. Automaton has 3003 states and 11619 transitions. Word has length 18 [2022-03-15 21:32:48,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:48,289 INFO L470 AbstractCegarLoop]: Abstraction has 3003 states and 11619 transitions. [2022-03-15 21:32:48,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:48,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 11619 transitions. [2022-03-15 21:32:48,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:32:48,295 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:48,295 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:48,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 21:32:48,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:48,514 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:32:48,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:48,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1462332510, now seen corresponding path program 6 times [2022-03-15 21:32:48,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:48,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716174178] [2022-03-15 21:32:48,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:48,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:48,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:48,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716174178] [2022-03-15 21:32:48,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716174178] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:48,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517430699] [2022-03-15 21:32:48,620 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:32:48,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:48,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:48,621 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:48,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 21:32:48,646 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:32:48,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:32:48,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 21:32:48,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:48,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:48,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517430699] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:48,762 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:48,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-03-15 21:32:48,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [674445141] [2022-03-15 21:32:48,762 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:48,763 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:48,767 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 148 transitions. [2022-03-15 21:32:48,767 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:50,054 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [80555#(and (or (< 0 N) (= q 0)) (or (< 0 N) (= p (* M 4))) (or (= (+ q (* M 4)) (+ (* 2 M) p)) (not (< 1 N)) (< 2 N)) (or (not (< 1 N)) (< 2 N) (= (+ (* 2 M) p) (* M 4)))), 80534#(and (or (< 0 N) (= q p)) (or (= (+ (* 2 M) p) q) (not (< 1 N)) (< 2 N))), 80443#(= (+ q (* M 4)) p), 80550#(or (not (< 1 N)) (< 2 N) (= p (+ M q))), 80547#(or (= (+ (* 3 M) q) p) (< 1 N)), 80553#(or (= (+ q (* M 4)) p) (< 1 N)), 80540#(or (< 0 N) (= (+ (* 2 M) q) p)), 80545#(or (< 4 N) (= (+ (* 3 M) p) q) (<= N 3)), 80539#(or (not (< 1 N)) (< 2 N) (= q (+ M p))), 80536#(or (= p (+ M q)) (< 1 N)), 80543#(or (not (< 1 N)) (< 2 N) (= q p)), 80541#(or (< 1 N) (= (+ (* 2 M) q) p)), 80538#(or (= (+ (* 2 M) p) q) (not (< 1 N)) (< 2 N)), 80551#(or (< 4 N) (= q (+ M p)) (<= N 3)), 80548#(or (< 0 N) (= (+ (* 3 M) q) p)), 80533#(or (< 1 N) (= q p)), 80537#(and (or (< 0 N) (= p (+ M q))) (or (not (< 1 N)) (< 2 N) (= (+ (* 2 M) p) (+ M q)))), 80546#(or (= (+ (* 2 M) p) q) (< 4 N) (<= N 3)), 80535#(or (< 0 N) (= p (+ M q))), 80542#(and (or (< 0 N) (= (+ (* 2 M) q) p)) (or (not (< 1 N)) (< 2 N) (= (+ (* 2 M) q) (+ (* 2 M) p)))), 80532#(or (< 0 N) (= q p)), 80557#(and (or (< 4 N) (<= N 3) (= q p)) (or (< 4 N) (= p 0) (<= N 3))), 80554#(and (or (= p (* M 4)) (< 1 N)) (or (< 1 N) (= q 0))), 80552#(and (or (< 0 N) (= q 0)) (or (< 0 N) (= p (* M 4)))), 80556#(and (or (not (< 1 N)) (< 2 N) (= (* 2 M) p)) (or (not (< 1 N)) (< 2 N) (= (+ (* 2 M) q) p))), 80544#(or (< 4 N) (= q (+ p (* M 4))) (<= N 3)), 80549#(and (or (not (< 1 N)) (< 2 N) (= (+ (* 3 M) q) (+ (* 2 M) p))) (or (< 0 N) (= (+ (* 3 M) q) p)))] [2022-03-15 21:32:50,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 21:32:50,054 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:50,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 21:32:50,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1459, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 21:32:50,055 INFO L87 Difference]: Start difference. First operand 3003 states and 11619 transitions. Second operand has 38 states, 37 states have (on average 2.891891891891892) internal successors, (107), 37 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:53,825 INFO L93 Difference]: Finished difference Result 5877 states and 21611 transitions. [2022-03-15 21:32:53,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-03-15 21:32:53,825 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.891891891891892) internal successors, (107), 37 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:32:53,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:53,839 INFO L225 Difference]: With dead ends: 5877 [2022-03-15 21:32:53,839 INFO L226 Difference]: Without dead ends: 5870 [2022-03-15 21:32:53,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2990 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1495, Invalid=9425, Unknown=0, NotChecked=0, Total=10920 [2022-03-15 21:32:53,842 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 571 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 4173 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 4502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 4173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:53,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [571 Valid, 37 Invalid, 4502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 4173 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 21:32:53,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5870 states. [2022-03-15 21:32:53,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5870 to 4112. [2022-03-15 21:32:53,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4112 states, 4111 states have (on average 3.9265385550960836) internal successors, (16142), 4111 states have internal predecessors, (16142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4112 states to 4112 states and 16142 transitions. [2022-03-15 21:32:54,010 INFO L78 Accepts]: Start accepts. Automaton has 4112 states and 16142 transitions. Word has length 19 [2022-03-15 21:32:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:54,011 INFO L470 AbstractCegarLoop]: Abstraction has 4112 states and 16142 transitions. [2022-03-15 21:32:54,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.891891891891892) internal successors, (107), 37 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 4112 states and 16142 transitions. [2022-03-15 21:32:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:32:54,020 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:54,020 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:54,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 21:32:54,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:54,236 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:32:54,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:54,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1927849488, now seen corresponding path program 11 times [2022-03-15 21:32:54,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:54,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856255467] [2022-03-15 21:32:54,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:54,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:54,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:54,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856255467] [2022-03-15 21:32:54,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856255467] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:54,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120810243] [2022-03-15 21:32:54,270 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:32:54,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:54,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:54,280 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:54,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 21:32:54,300 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:32:54,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:32:54,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:32:54,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:54,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:54,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:54,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120810243] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:54,435 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:54,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 13 [2022-03-15 21:32:54,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [348973931] [2022-03-15 21:32:54,435 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:54,436 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:54,440 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 131 transitions. [2022-03-15 21:32:54,440 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:55,269 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [94929#(and (or (<= L 1) (<= N 2) (< 3 N)) (or (<= N 0) (< 1 N) (<= L 1))), 94935#(or (<= L 3) (not (< 0 N)) (< 1 N)), 94915#(and (or (<= N 0) (< 1 N)) (or (<= N 2) (< 3 N))), 94926#(or (<= N 0) (<= L 2)), 94912#(or (< 1 N) (<= L 2)), 94931#(or (<= L 0) (<= N 2) (< 3 N)), 94923#(or (not (< 0 N)) (<= L 1)), 94909#(< 1 N), 94916#(or (<= N 2) (< 3 N)), 94933#(or (<= N 2) (< 3 N) (<= L 2)), 94920#(or (<= L 2) (< 3 L)), 94917#(< 0 L), 94930#(and (or (<= N 2) (< 3 N) (<= L 2)) (or (<= N 0) (< 1 N) (<= L 2))), 94937#(or (<= L 3) (<= N 2) (< 3 N)), 94918#(or (< 1 L) (<= L 0)), 94913#(not (< 0 N)), 94919#(or (< 2 L) (<= L 1)), 94911#(or (< 1 N) (<= L 1)), 94936#(and (or (<= L 3) (<= N 0) (< 1 N)) (or (<= L 3) (<= N 2) (< 3 N))), 94921#(or (<= L 3) (< 4 L)), 94925#(or (<= N 0) (< 1 N) (<= L 1)), 94934#(or (<= L 3) (not (< 0 N))), 94932#(or (<= L 1) (<= N 2) (< 3 N)), 94922#(or (not (< 0 N)) (<= L 0)), 94914#(or (not (< 0 N)) (< 1 N)), 94894#(or (<= L 3) (< 1 N)), 94910#(or (<= L 0) (< 1 N)), 94928#(and (or (<= L 0) (<= N 2) (< 3 N)) (or (<= N 0) (<= L 0) (< 1 N))), 94927#(or (<= N 0) (< 1 N) (<= L 2)), 94924#(or (<= N 0) (<= L 0) (< 1 N))] [2022-03-15 21:32:55,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 21:32:55,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:55,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 21:32:55,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1453, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 21:32:55,270 INFO L87 Difference]: Start difference. First operand 4112 states and 16142 transitions. Second operand has 38 states, 38 states have (on average 2.763157894736842) internal successors, (105), 37 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 21:32:56,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:56,593 INFO L93 Difference]: Finished difference Result 4754 states and 17858 transitions. [2022-03-15 21:32:56,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-03-15 21:32:56,594 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.763157894736842) internal successors, (105), 37 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 19 [2022-03-15 21:32:56,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:56,603 INFO L225 Difference]: With dead ends: 4754 [2022-03-15 21:32:56,603 INFO L226 Difference]: Without dead ends: 4650 [2022-03-15 21:32:56,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2988 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1954, Invalid=8348, Unknown=0, NotChecked=0, Total=10302 [2022-03-15 21:32:56,604 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 337 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:56,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 1 Invalid, 1584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:32:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4650 states. [2022-03-15 21:32:56,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4650 to 4116. [2022-03-15 21:32:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4116 states, 4115 states have (on average 3.922721749696233) internal successors, (16142), 4115 states have internal predecessors, (16142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:56,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 16142 transitions. [2022-03-15 21:32:56,692 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 16142 transitions. Word has length 19 [2022-03-15 21:32:56,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:56,693 INFO L470 AbstractCegarLoop]: Abstraction has 4116 states and 16142 transitions. [2022-03-15 21:32:56,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.763157894736842) internal successors, (105), 37 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 21:32:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 16142 transitions. [2022-03-15 21:32:56,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:32:56,701 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:56,701 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:56,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 21:32:56,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 21:32:56,905 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:32:56,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:56,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1543183960, now seen corresponding path program 12 times [2022-03-15 21:32:56,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:56,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755504459] [2022-03-15 21:32:56,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:56,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:56,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:56,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755504459] [2022-03-15 21:32:56,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755504459] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:56,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048664266] [2022-03-15 21:32:56,934 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:32:56,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:56,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:56,935 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:56,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 21:32:56,962 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:32:56,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:32:56,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:32:56,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:57,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:57,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048664266] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:57,185 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:57,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 21 [2022-03-15 21:32:57,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [49750713] [2022-03-15 21:32:57,185 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:57,186 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:57,190 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 148 transitions. [2022-03-15 21:32:57,191 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:58,345 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [108184#(and (or (< 2 N) (not (< 0 N)) (<= L N)) (or (< 0 N) (<= L (+ N 1)))), 108173#(or (not (< 0 N)) (< 1 N)), 108193#(and (or (< 4 N) (<= N 2) (<= (+ 2 L) N)) (or (<= N 0) (< 1 N) (<= L 1))), 108194#(and (or (< 4 N) (<= N 2) (<= (+ L 1) N)) (or (<= N 0) (< 1 N) (<= L 2))), 108175#(or (< 1 L) (<= L 0)), 108182#(or (< 2 N) (not (< 0 N)) (<= (+ L 1) N)), 108199#(or (<= N 2) (< 3 N)), 108200#(or (< 4 N) (<= N 2) (<= (+ 3 L) N)), 108180#(or (< 1 N) (<= L N)), 108181#(and (or (< 0 N) (<= L N)) (or (< 2 N) (not (< 0 N)) (<= (+ L 1) N))), 108203#(or (<= N 2) (<= L N)), 108198#(or (<= L 3) (< 1 N) (< 4 L)), 108178#(or (< 2 L) (<= L 1)), 108190#(or (< 2 N) (<= L (+ N 1)) (<= N 0)), 108177#(or (< 1 L) (<= L 0) (< 1 N)), 108183#(or (<= L (+ N 1)) (< 1 N)), 108176#(or (< 0 L) (< 1 N)), 108188#(or (<= L (+ 2 N)) (< 1 N)), 108172#(< 1 N), 108179#(or (< 2 L) (< 1 N) (<= L 1)), 108191#(and (or (not (< 2 N)) (< 3 N)) (or (<= N 0) (< 1 N))), 108189#(and (or (< 0 N) (<= L (+ 2 N))) (or (< 2 N) (not (< 0 N)) (<= L (+ N 1)))), 108201#(or (< 4 N) (<= N 2) (<= (+ 2 L) N)), 108185#(or (< 2 N) (<= N 0) (<= L N)), 108197#(or (<= L 3) (< 4 L)), 108202#(or (< 4 N) (<= N 2) (<= (+ L 1) N)), 108187#(or (< 1 N) (<= L 2) (< 3 L)), 108192#(and (or (< 4 N) (<= N 2) (<= (+ 3 L) N)) (or (<= N 0) (<= L 0) (< 1 N))), 108196#(and (or (<= L 3) (<= N 0) (< 1 N)) (or (<= N 2) (<= L N))), 108195#(or (<= L (+ 2 N)) (not (< 0 N))), 108186#(or (<= L 2) (< 3 L)), 108174#(< 0 L)] [2022-03-15 21:32:58,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 21:32:58,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:58,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 21:32:58,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=2449, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 21:32:58,347 INFO L87 Difference]: Start difference. First operand 4116 states and 16142 transitions. Second operand has 40 states, 40 states have (on average 2.875) internal successors, (115), 39 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:06,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:33:06,116 INFO L93 Difference]: Finished difference Result 8655 states and 31088 transitions. [2022-03-15 21:33:06,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 277 states. [2022-03-15 21:33:06,116 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 39 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 19 [2022-03-15 21:33:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:33:06,135 INFO L225 Difference]: With dead ends: 8655 [2022-03-15 21:33:06,135 INFO L226 Difference]: Without dead ends: 8469 [2022-03-15 21:33:06,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38799 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=15446, Invalid=85360, Unknown=0, NotChecked=0, Total=100806 [2022-03-15 21:33:06,142 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1191 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 2918 mSolverCounterSat, 853 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 3771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 853 IncrementalHoareTripleChecker+Valid, 2918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:33:06,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1191 Valid, 1 Invalid, 3771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [853 Valid, 2918 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 21:33:06,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8469 states. [2022-03-15 21:33:06,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8469 to 5752. [2022-03-15 21:33:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5752 states, 5751 states have (on average 3.958963658494175) internal successors, (22768), 5751 states have internal predecessors, (22768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5752 states to 5752 states and 22768 transitions. [2022-03-15 21:33:06,340 INFO L78 Accepts]: Start accepts. Automaton has 5752 states and 22768 transitions. Word has length 19 [2022-03-15 21:33:06,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:33:06,340 INFO L470 AbstractCegarLoop]: Abstraction has 5752 states and 22768 transitions. [2022-03-15 21:33:06,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 39 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:06,340 INFO L276 IsEmpty]: Start isEmpty. Operand 5752 states and 22768 transitions. [2022-03-15 21:33:06,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:33:06,351 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:33:06,351 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:33:06,369 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 21:33:06,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-15 21:33:06,555 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:33:06,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:33:06,556 INFO L85 PathProgramCache]: Analyzing trace with hash -673472044, now seen corresponding path program 13 times [2022-03-15 21:33:06,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:33:06,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049998769] [2022-03-15 21:33:06,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:33:06,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:33:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:33:06,591 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:06,592 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:33:06,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049998769] [2022-03-15 21:33:06,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049998769] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:33:06,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275224496] [2022-03-15 21:33:06,592 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:33:06,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:06,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:33:06,593 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 21:33:06,594 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 21:33:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:33:06,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:33:06,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:33:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:06,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:33:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:06,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275224496] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:33:06,758 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:33:06,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 15 [2022-03-15 21:33:06,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [722172061] [2022-03-15 21:33:06,759 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:33:06,759 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:33:06,763 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 125 transitions. [2022-03-15 21:33:06,763 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:33:07,314 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [129019#(or (not (< 1 N)) (< 2 N)), 129028#(or (<= (+ 2 N) L) (<= L 1)), 129020#(or (< 4 N) (<= N 3)), 129030#(or (< 1 L) (<= L 0) (< 1 N)), 129024#(< 0 L), 129025#(or (< 1 L) (<= L 0)), 129031#(or (< 2 L) (< 1 N) (<= L 1)), 129032#(and (or (not (< 0 N)) (<= N (+ 2 L))) (or (not (< 0 N)) (not (<= N 1)))), 129033#(and (or (not (< 0 N)) (<= N (+ L 1))) (or (not (< 0 N)) (not (<= N 1)))), 129021#(or (not (< 1 N)) (<= N (+ 2 L))), 129029#(or (< 0 L) (< 1 N)), 129034#(and (or (= (+ (* (- 1) L) N) 0) (not (< 0 N))) (or (not (< 0 N)) (not (<= N 1)))), 129022#(or (not (< 1 N)) (<= N (+ L 1))), 129017#(< 1 N), 129026#(or (<= L 0) (<= (+ N 1) L)), 129023#(or (= N L) (not (< 1 N))), 129018#(or (not (< 0 N)) (< 1 N)), 129027#(or (< 2 L) (<= L 1))] [2022-03-15 21:33:07,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 21:33:07,314 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:33:07,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 21:33:07,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=884, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:33:07,315 INFO L87 Difference]: Start difference. First operand 5752 states and 22768 transitions. Second operand has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:33:08,370 INFO L93 Difference]: Finished difference Result 11372 states and 42782 transitions. [2022-03-15 21:33:08,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-15 21:33:08,370 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:33:08,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:33:08,397 INFO L225 Difference]: With dead ends: 11372 [2022-03-15 21:33:08,397 INFO L226 Difference]: Without dead ends: 11332 [2022-03-15 21:33:08,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2175 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1533, Invalid=5607, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 21:33:08,398 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 320 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:33:08,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 1 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:33:08,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11332 states. [2022-03-15 21:33:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11332 to 7055. [2022-03-15 21:33:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7055 states, 7054 states have (on average 3.9359228806351005) internal successors, (27764), 7054 states have internal predecessors, (27764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7055 states to 7055 states and 27764 transitions. [2022-03-15 21:33:08,581 INFO L78 Accepts]: Start accepts. Automaton has 7055 states and 27764 transitions. Word has length 19 [2022-03-15 21:33:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:33:08,581 INFO L470 AbstractCegarLoop]: Abstraction has 7055 states and 27764 transitions. [2022-03-15 21:33:08,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 7055 states and 27764 transitions. [2022-03-15 21:33:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:33:08,594 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:33:08,595 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:33:08,610 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 21:33:08,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 21:33:08,808 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:33:08,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:33:08,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1343928408, now seen corresponding path program 14 times [2022-03-15 21:33:08,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:33:08,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727507082] [2022-03-15 21:33:08,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:33:08,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:33:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:33:08,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:08,836 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:33:08,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727507082] [2022-03-15 21:33:08,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727507082] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:33:08,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539933922] [2022-03-15 21:33:08,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:33:08,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:08,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:33:08,838 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 21:33:08,839 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 21:33:08,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:33:08,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:33:08,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:33:08,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:33:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:08,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:33:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:09,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539933922] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:33:09,055 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:33:09,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2022-03-15 21:33:09,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1271429747] [2022-03-15 21:33:09,056 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:33:09,056 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:33:09,060 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 133 transitions. [2022-03-15 21:33:09,061 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:33:09,798 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [154752#(<= L 1), 154759#(or (not (< 0 N)) (<= (+ 2 L) N)), 154750#(or (<= L 2) (< 3 L)), 154747#(< 0 L), 154764#(or (not (< 0 N)) (<= (+ L 1) N)), 154748#(or (< 1 L) (<= L 0)), 154751#(or (<= L 3) (< 4 L)), 154753#(<= L 2), 154761#(or (not (< 1 N)) (<= (+ 3 L) N)), 154760#(or (not (< 1 N)) (< 3 N)), 154756#(< 3 N), 154765#(or (= (+ (* (- 1) L) N) 0) (not (< 1 N))), 154755#(< 1 N), 154767#(or (<= L 0) (<= L N)), 154758#(or (not (< 0 N)) (<= (+ 3 L) N)), 154762#(or (not (< 1 N)) (<= (+ 2 L) N)), 154769#(or (<= L (+ 2 N)) (<= L 2)), 154754#(<= L 3), 154768#(or (<= L (+ N 1)) (<= L 1)), 154766#(or (= (+ (* (- 1) L) N) 0) (not (< 0 N))), 154749#(or (< 2 L) (<= L 1)), 154757#(or (not (< 0 N)) (< 3 N)), 154763#(or (not (< 1 N)) (<= (+ L 1) N))] [2022-03-15 21:33:09,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 21:33:09,799 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:33:09,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 21:33:09,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1419, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 21:33:09,799 INFO L87 Difference]: Start difference. First operand 7055 states and 27764 transitions. Second operand has 30 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 29 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:33:11,128 INFO L93 Difference]: Finished difference Result 10019 states and 37986 transitions. [2022-03-15 21:33:11,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 21:33:11,128 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 29 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:33:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:33:11,151 INFO L225 Difference]: With dead ends: 10019 [2022-03-15 21:33:11,151 INFO L226 Difference]: Without dead ends: 9794 [2022-03-15 21:33:11,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2514 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1218, Invalid=6092, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 21:33:11,152 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 339 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:33:11,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 1 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:33:11,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9794 states. [2022-03-15 21:33:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9794 to 8474. [2022-03-15 21:33:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8474 states, 8473 states have (on average 3.9360321019709668) internal successors, (33350), 8473 states have internal predecessors, (33350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8474 states to 8474 states and 33350 transitions. [2022-03-15 21:33:11,333 INFO L78 Accepts]: Start accepts. Automaton has 8474 states and 33350 transitions. Word has length 19 [2022-03-15 21:33:11,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:33:11,333 INFO L470 AbstractCegarLoop]: Abstraction has 8474 states and 33350 transitions. [2022-03-15 21:33:11,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 29 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:11,333 INFO L276 IsEmpty]: Start isEmpty. Operand 8474 states and 33350 transitions. [2022-03-15 21:33:11,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:33:11,349 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:33:11,349 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:33:11,365 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 21:33:11,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:11,562 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:33:11,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:33:11,562 INFO L85 PathProgramCache]: Analyzing trace with hash 365530032, now seen corresponding path program 15 times [2022-03-15 21:33:11,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:33:11,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445721024] [2022-03-15 21:33:11,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:33:11,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:33:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:33:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:33:11,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:33:11,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445721024] [2022-03-15 21:33:11,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445721024] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:33:11,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749746346] [2022-03-15 21:33:11,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:33:11,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:11,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:33:11,604 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 21:33:11,635 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 21:33:11,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:33:11,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:33:11,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:33:11,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:33:11,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:11,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:33:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:11,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749746346] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:33:11,773 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:33:11,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 19 [2022-03-15 21:33:11,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1444557398] [2022-03-15 21:33:11,773 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:33:11,774 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:33:11,779 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 170 transitions. [2022-03-15 21:33:11,779 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:33:12,558 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [181984#(or (not (< 0 N)) (<= (+ L 1) N)), 181971#(<= 4 N), 181985#(or (= (+ (* (- 1) L) N) 0) (not (< 0 N))), 181958#(or (< 1 L) (<= L 0)), 181973#(or (not (< 1 N)) (<= (+ 3 L) N)), 181974#(or (not (< 1 N)) (<= (+ 2 L) N)), 181967#(or (< 0 L) (<= 1 N)), 181980#(or (<= L (+ N 1)) (<= L 1)), 181966#(or (<= L 3) (< 1 N) (< 4 L)), 181982#(or (not (< 1 N)) (<= (+ L 1) N)), 181964#(or (< 2 L) (< 1 N) (<= L 1)), 181977#(or (not (< 0 N)) (<= (+ 2 L) N)), 181961#(or (<= L 3) (< 4 L)), 181960#(or (<= L 2) (< 3 L)), 181969#(or (< 0 N) (< 2 L) (<= L 1)), 181965#(or (< 1 N) (<= L 2) (< 3 L)), 181963#(or (< 1 L) (<= L 0) (< 1 N)), 181970#(or (< 0 N) (<= L 2) (< 3 L)), 181976#(or (not (< 0 N)) (<= (+ 3 L) N)), 181972#(or (not (< 1 N)) (<= 4 N)), 181959#(or (< 2 L) (<= L 1)), 181975#(or (not (< 0 N)) (<= 4 N)), 181981#(or (<= L (+ 2 N)) (<= L 2)), 181983#(or (= (+ (* (- 1) L) N) 0) (not (< 1 N))), 181957#(< 0 L), 181968#(or (< 0 N) (< 1 L) (<= L 0)), 181978#(or (< 0 N) (<= L 3) (< 4 L)), 181979#(or (<= L 0) (<= L N)), 181962#(or (< 0 L) (< 1 N))] [2022-03-15 21:33:12,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 21:33:12,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:33:12,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 21:33:12,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1901, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 21:33:12,559 INFO L87 Difference]: Start difference. First operand 8474 states and 33350 transitions. Second operand has 37 states, 37 states have (on average 3.3783783783783785) internal successors, (125), 36 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:33:15,589 INFO L93 Difference]: Finished difference Result 10662 states and 40620 transitions. [2022-03-15 21:33:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-03-15 21:33:15,589 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.3783783783783785) internal successors, (125), 36 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:33:15,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:33:15,613 INFO L225 Difference]: With dead ends: 10662 [2022-03-15 21:33:15,613 INFO L226 Difference]: Without dead ends: 10657 [2022-03-15 21:33:15,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 53 SyntacticMatches, 15 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7370 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3277, Invalid=17893, Unknown=0, NotChecked=0, Total=21170 [2022-03-15 21:33:15,614 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 619 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:33:15,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [619 Valid, 1 Invalid, 2664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:33:15,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10657 states. [2022-03-15 21:33:15,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10657 to 7381. [2022-03-15 21:33:15,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7381 states, 7380 states have (on average 3.9092140921409215) internal successors, (28850), 7380 states have internal predecessors, (28850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7381 states to 7381 states and 28850 transitions. [2022-03-15 21:33:15,787 INFO L78 Accepts]: Start accepts. Automaton has 7381 states and 28850 transitions. Word has length 19 [2022-03-15 21:33:15,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:33:15,787 INFO L470 AbstractCegarLoop]: Abstraction has 7381 states and 28850 transitions. [2022-03-15 21:33:15,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.3783783783783785) internal successors, (125), 36 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:15,787 INFO L276 IsEmpty]: Start isEmpty. Operand 7381 states and 28850 transitions. [2022-03-15 21:33:15,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:33:15,800 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:33:15,800 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:33:15,815 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 21:33:16,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 21:33:16,016 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:33:16,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:33:16,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1019562842, now seen corresponding path program 16 times [2022-03-15 21:33:16,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:33:16,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149808363] [2022-03-15 21:33:16,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:33:16,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:33:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:33:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:16,064 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:33:16,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149808363] [2022-03-15 21:33:16,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149808363] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:33:16,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116097364] [2022-03-15 21:33:16,064 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:33:16,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:16,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:33:16,065 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 21:33:16,084 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 21:33:16,108 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:33:16,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:33:16,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:33:16,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:33:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:16,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:33:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:16,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116097364] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:33:16,298 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:33:16,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2022-03-15 21:33:16,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [467984273] [2022-03-15 21:33:16,298 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:33:16,299 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:33:16,303 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 170 transitions. [2022-03-15 21:33:16,304 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:33:17,197 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [207741#(or (< 0 N) (< 2 L) (<= L 1)), 207752#(or (not (< 0 N)) (<= (+ L 1) N)), 207736#(< 0 L), 207744#(or (not (< 0 N)) (<= (+ 3 L) N)), 207762#(or (< 0 N) (<= L 2) (< 3 L)), 207759#(or (< 2 L) (< 1 N) (<= L 1)), 207761#(or (< 1 N) (<= L 2) (< 3 L)), 207743#(or (not (< 0 N)) (<= 4 N)), 207751#(or (not (< 1 N)) (<= (+ L 1) N)), 207757#(or (< 0 L) (<= 3 N)), 207745#(or (not (< 0 N)) (<= (+ 2 L) N)), 207738#(or (< 2 L) (<= L 1)), 207746#(or (not (< 1 N)) (<= 4 N)), 207739#(or (< 0 L) (<= 1 N)), 207740#(or (< 0 N) (< 1 L) (<= L 0)), 207750#(or (<= L 3) (< 4 L)), 207756#(or (< 1 L) (<= L 0) (< 1 N)), 207758#(or (<= 3 N) (< 1 L) (<= L 0)), 207765#(or (<= L 3) (< 1 N) (< 4 L)), 207754#(or (= (+ (* (- 1) L) N) 0) (not (< 0 N))), 207766#(or (<= 3 N) (<= L 3) (< 4 L)), 207737#(or (< 1 L) (<= L 0)), 207755#(or (< 0 L) (< 1 N)), 207747#(or (not (< 1 N)) (<= (+ 3 L) N)), 207763#(or (<= 3 N) (<= L 2) (< 3 L)), 207753#(or (= (+ (* (- 1) L) N) 0) (not (< 1 N))), 207748#(or (not (< 1 N)) (<= (+ 2 L) N)), 207760#(or (<= 3 N) (< 2 L) (<= L 1)), 207749#(or (<= L 2) (< 3 L)), 207742#(< 1 N), 207764#(or (< 0 N) (<= L 3) (< 4 L))] [2022-03-15 21:33:17,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 21:33:17,198 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:33:17,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 21:33:17,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=2112, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:33:17,199 INFO L87 Difference]: Start difference. First operand 7381 states and 28850 transitions. Second operand has 40 states, 40 states have (on average 3.15) internal successors, (126), 39 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:33:20,389 INFO L93 Difference]: Finished difference Result 10289 states and 38977 transitions. [2022-03-15 21:33:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2022-03-15 21:33:20,390 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.15) internal successors, (126), 39 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:33:20,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:33:20,413 INFO L225 Difference]: With dead ends: 10289 [2022-03-15 21:33:20,413 INFO L226 Difference]: Without dead ends: 10266 [2022-03-15 21:33:20,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 53 SyntacticMatches, 10 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14808 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=5738, Invalid=34062, Unknown=0, NotChecked=0, Total=39800 [2022-03-15 21:33:20,415 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 641 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 701 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 3053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 701 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:33:20,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [641 Valid, 1 Invalid, 3053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [701 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:33:20,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10266 states. [2022-03-15 21:33:20,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10266 to 7572. [2022-03-15 21:33:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7572 states, 7571 states have (on average 3.9107119270902126) internal successors, (29608), 7571 states have internal predecessors, (29608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7572 states to 7572 states and 29608 transitions. [2022-03-15 21:33:20,584 INFO L78 Accepts]: Start accepts. Automaton has 7572 states and 29608 transitions. Word has length 19 [2022-03-15 21:33:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:33:20,584 INFO L470 AbstractCegarLoop]: Abstraction has 7572 states and 29608 transitions. [2022-03-15 21:33:20,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.15) internal successors, (126), 39 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 7572 states and 29608 transitions. [2022-03-15 21:33:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:33:20,601 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:33:20,601 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:33:20,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-03-15 21:33:20,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 21:33:20,819 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:33:20,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:33:20,819 INFO L85 PathProgramCache]: Analyzing trace with hash 994485720, now seen corresponding path program 17 times [2022-03-15 21:33:20,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:33:20,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454184022] [2022-03-15 21:33:20,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:33:20,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:33:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:33:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:20,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:33:20,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454184022] [2022-03-15 21:33:20,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454184022] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:33:20,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012441084] [2022-03-15 21:33:20,925 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:33:20,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:20,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:33:20,927 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 21:33:20,927 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 21:33:20,948 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:33:20,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:33:20,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:33:20,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:33:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:21,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:33:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:21,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012441084] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:33:21,287 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:33:21,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-03-15 21:33:21,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [665461613] [2022-03-15 21:33:21,287 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:33:21,288 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:33:21,291 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 125 transitions. [2022-03-15 21:33:21,291 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:33:22,642 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [233647#(and (or (<= q p) (< 1 L) (not (< 0 L))) (or (<= p q) (< 1 L) (not (< 0 L))) (or (< 1 L) (not (< 0 L)) (<= N 1))), 233645#(and (or (not (< 0 N)) (<= N (+ L 1))) (or (not (< 0 N)) (<= q (+ M p))) (or (not (< 0 N)) (<= 2 N)) (or (<= (+ M p) q) (not (< 0 N)))), 233639#(and (or (< 1 L) (< q (+ p 1)) (not (< 0 L))) (or (<= p q) (< 1 L) (not (< 0 L)))), 233643#(and (or (not (< 0 N)) (<= q (+ (* 2 M) p))) (or (not (< 0 N)) (<= 2 N)) (<= N 2) (or (not (< 0 N)) (<= (+ (* 2 M) p) q))), 233638#(and (or (< 0 L) (< q (+ M p 1))) (or (<= (+ M p) q) (< 0 L))), 233640#(and (or (< 2 L) (not (< 1 L)) (< (+ M q) (+ p 1))) (or (< 0 N) (< 2 L) (not (< 1 L))) (or (< 2 L) (<= p (+ M q)) (not (< 1 L)))), 233630#(or (< 0 L) (= q p)), 233642#(and (or (< 2 L) (<= p (+ M q)) (not (< 1 L)) (< 1 N)) (or (< 2 L) (not (< 1 L)) (< 1 N) (< (+ M q) (+ p 1))) (or (< 0 N) (< 2 L) (<= L 1))), 233636#(and (or (< 1 L) (< q (+ p 1)) (not (< 0 L))) (or (< 0 N) (< 1 L) (not (< 0 L))) (or (<= p q) (< 1 L) (not (< 0 L)))), 233641#(and (or (< 2 L) (not (< 1 L)) (< (+ M q) (+ p 1))) (or (< 2 L) (<= p (+ M q)) (not (< 1 L)))), 233634#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 233652#(and (or (<= q p) (not (< 1 N))) (or (<= p q) (not (< 1 N))) (or (= N L) (not (< 1 N)))), 233635#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 233631#(and (or (< 0 L) (< q (+ M p 1))) (or (< 0 L) (< 0 N)) (or (<= (+ M p) q) (< 0 L))), 233650#(and (or (< 2 L) (not (< 1 L)) (<= N 1)) (or (< 2 L) (<= p (+ M q)) (not (< 1 L))) (or (< 2 L) (not (< 1 L)) (<= (+ M q) p))), 233648#(and (or (not (< 1 N)) (<= (+ (* 2 M) p) q)) (or (not (< 1 N)) (<= q (+ (* 2 M) p))) (<= N 2)), 233644#(and (or (not (< 0 N)) (<= q (+ (* 2 M) p))) (or (not (< 0 N)) (<= N (+ 2 L))) (or (not (< 0 N)) (<= 2 N)) (or (not (< 0 N)) (<= (+ (* 2 M) p) q))), 233633#(and (or (< 0 L) (< q (+ M p 1)) (< 1 N)) (or (<= (+ M p) q) (< 0 L) (< 1 N)) (or (< 0 L) (< 0 N))), 233637#(and (or (< 0 N) (< 1 L) (not (< 0 L))) (or (< 1 L) (< q (+ p 1)) (< 1 N) (not (< 0 L))) (or (<= p q) (< 1 L) (< 1 N) (not (< 0 L)))), 233632#(and (< 0 N) (or (< q (+ M p 1)) (< 1 N)) (or (<= (+ M p) q) (< 1 N))), 233651#(and (or (not (< 1 N)) (<= q (+ M p))) (or (<= (+ M p) q) (not (< 1 N))) (or (not (< 1 N)) (<= N (+ L 1)))), 233653#(and (or (<= q p) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N)) (or (= N L) (not (< 0 N))) (or (<= p q) (not (< 0 N)))), 233646#(and (or (< 0 L) (<= q (+ M p))) (or (< 0 L) (<= N 1)) (or (<= (+ M p) q) (< 0 L))), 233649#(and (or (not (< 1 N)) (<= (+ (* 2 M) p) q)) (or (not (< 1 N)) (<= N (+ 2 L))) (or (not (< 1 N)) (<= q (+ (* 2 M) p))))] [2022-03-15 21:33:22,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:33:22,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:33:22,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:33:22,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1934, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 21:33:22,643 INFO L87 Difference]: Start difference. First operand 7572 states and 29608 transitions. Second operand has 35 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 34 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:33:37,401 INFO L93 Difference]: Finished difference Result 13922 states and 49648 transitions. [2022-03-15 21:33:37,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2022-03-15 21:33:37,402 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 34 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:33:37,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:33:37,435 INFO L225 Difference]: With dead ends: 13922 [2022-03-15 21:33:37,435 INFO L226 Difference]: Without dead ends: 13702 [2022-03-15 21:33:37,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22166 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=6528, Invalid=53742, Unknown=0, NotChecked=0, Total=60270 [2022-03-15 21:33:37,439 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 889 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 3669 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 4262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 3669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:33:37,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [889 Valid, 3 Invalid, 4262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 3669 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 21:33:37,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13702 states. [2022-03-15 21:33:37,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13702 to 7652. [2022-03-15 21:33:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7652 states, 7651 states have (on average 3.9086393935433277) internal successors, (29905), 7651 states have internal predecessors, (29905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7652 states to 7652 states and 29905 transitions. [2022-03-15 21:33:37,668 INFO L78 Accepts]: Start accepts. Automaton has 7652 states and 29905 transitions. Word has length 19 [2022-03-15 21:33:37,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:33:37,668 INFO L470 AbstractCegarLoop]: Abstraction has 7652 states and 29905 transitions. [2022-03-15 21:33:37,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 34 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 7652 states and 29905 transitions. [2022-03-15 21:33:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:33:37,680 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:33:37,681 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:33:37,697 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 21:33:37,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:37,897 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:33:37,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:33:37,897 INFO L85 PathProgramCache]: Analyzing trace with hash 795237904, now seen corresponding path program 18 times [2022-03-15 21:33:37,898 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:33:37,898 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138753060] [2022-03-15 21:33:37,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:33:37,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:33:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:33:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:38,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:33:38,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138753060] [2022-03-15 21:33:38,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138753060] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:33:38,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646108200] [2022-03-15 21:33:38,037 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:33:38,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:38,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:33:38,038 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 21:33:38,039 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 21:33:38,063 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:33:38,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:33:38,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:33:38,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:33:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:38,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:33:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:38,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646108200] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:33:38,517 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:33:38,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-03-15 21:33:38,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [137645900] [2022-03-15 21:33:38,517 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:33:38,518 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:33:38,523 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 136 transitions. [2022-03-15 21:33:38,523 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:33:40,024 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [263423#(and (or (not (< 1 N)) (<= 0 q)) (or (not (< 1 N)) (= p 0)) (or (= N L) (not (< 1 N))) (or (not (< 1 N)) (<= q 0))), 263419#(and (or (< 4 N) (= (+ (* 3 M) p) q) (<= N 2)) (or (< 2 N) (not (< 0 N)) (= q (+ M p)))), 263427#(and (or (<= q M) (not (< 0 N))) (or (not (< 0 N)) (<= N (+ L 1))) (or (not (< 0 N)) (<= M q)) (or (= p 0) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N))), 263414#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 263413#(or (< 1 L) (= p (+ M q)) (< 1 N) (not (< 0 L))), 263366#(or (< 0 L) (= q p)), 263417#(and (or (< 1 N) (= q p)) (or (= (+ (* 2 M) p) q) (not (< 1 N)) (< 3 N))), 263426#(and (or (<= (* 2 M) q) (not (< 0 N))) (or (not (< 0 N)) (<= N (+ 2 L))) (or (<= q (* 2 M)) (not (< 0 N))) (or (= p 0) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N))), 263416#(or (<= 4 L) (<= L 1) (= (+ (* 2 M) q) p)), 263425#(and (or (not (< 0 L)) (= (+ M p) (+ M q))) (or (not (< 0 L)) (<= N L)) (or (not (<= N 0)) (not (< 0 L)))), 263411#(or (< 1 N) (= q p)), 263432#(and (or (= p 0) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N)) (or (= N L) (not (< 0 N))) (or (<= 0 q) (not (< 0 N))) (or (not (< 0 N)) (<= q 0))), 263431#(and (or (not (< 1 L)) (<= (+ N 1) L)) (or (not (< 1 L)) (= (+ (* 2 M) q) (+ M p)))), 263421#(and (or (not (< 1 N)) (<= (* 2 M) q)) (or (not (< 1 N)) (<= N (+ 2 L))) (or (not (< 1 N)) (= p 0)) (or (not (< 1 N)) (<= q (* 2 M)))), 263415#(or (< 2 L) (< 1 N) (<= L 1) (= (+ (* 2 M) q) p)), 263420#(and (or (= (+ (* 2 M) p) q) (not (< 1 N)) (< 3 N)) (or (< 5 N) (= q (+ p (* M 4))) (<= N 3))), 263430#(and (or (not (< 0 L)) (= (+ M p) (+ M q))) (or (not (< 0 L)) (<= N L))), 263429#(and (or (not (< 1 L)) (<= (+ N 1) L)) (or (not (< 1 L)) (= (+ (* 2 M) q) (+ M p))) (or (not (<= N 0)) (not (< 1 L)))), 263409#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 263424#(and (or (not (< 0 L)) (<= (+ N 1) L)) (or (= p (+ M q)) (not (< 0 L)))), 263428#(and (or (not (< 1 L)) (= (+ (* 2 M) q) p)) (or (<= (+ 2 N) L) (not (< 1 L)))), 263410#(or (= p (+ M q)) (<= 3 L) (not (< 0 L))), 263422#(and (or (not (< 1 N)) (= p 0)) (or (not (< 1 N)) (<= q M)) (or (not (< 1 N)) (<= M q)) (or (not (< 1 N)) (<= N (+ L 1)))), 263412#(or (< 0 L) (< 1 N) (= q p)), 263418#(and (or (< 0 N) (= q p)) (or (< 4 N) (= (+ (* 3 M) p) q) (<= N 2)) (or (< 2 N) (not (< 0 N)) (= q (+ M p))))] [2022-03-15 21:33:40,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:33:40,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:33:40,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:33:40,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1903, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 21:33:40,025 INFO L87 Difference]: Start difference. First operand 7652 states and 29905 transitions. Second operand has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 35 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 21:33:49,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:33:49,451 INFO L93 Difference]: Finished difference Result 16870 states and 59217 transitions. [2022-03-15 21:33:49,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-03-15 21:33:49,451 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 35 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 19 [2022-03-15 21:33:49,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:33:49,500 INFO L225 Difference]: With dead ends: 16870 [2022-03-15 21:33:49,500 INFO L226 Difference]: Without dead ends: 16558 [2022-03-15 21:33:49,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18845 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=7169, Invalid=44133, Unknown=0, NotChecked=0, Total=51302 [2022-03-15 21:33:49,503 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1024 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 3877 mSolverCounterSat, 656 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 4533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 656 IncrementalHoareTripleChecker+Valid, 3877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:33:49,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1024 Valid, 19 Invalid, 4533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [656 Valid, 3877 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 21:33:49,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16558 states. [2022-03-15 21:33:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16558 to 8749. [2022-03-15 21:33:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8749 states, 8748 states have (on average 3.898491083676269) internal successors, (34104), 8748 states have internal predecessors, (34104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8749 states to 8749 states and 34104 transitions. [2022-03-15 21:33:49,735 INFO L78 Accepts]: Start accepts. Automaton has 8749 states and 34104 transitions. Word has length 19 [2022-03-15 21:33:49,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:33:49,735 INFO L470 AbstractCegarLoop]: Abstraction has 8749 states and 34104 transitions. [2022-03-15 21:33:49,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 35 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 21:33:49,735 INFO L276 IsEmpty]: Start isEmpty. Operand 8749 states and 34104 transitions. [2022-03-15 21:33:49,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:33:49,749 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:33:49,749 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:33:49,765 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 21:33:49,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:49,951 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:33:49,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:33:49,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1690432302, now seen corresponding path program 6 times [2022-03-15 21:33:49,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:33:49,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199215208] [2022-03-15 21:33:49,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:33:49,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:33:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:33:50,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:50,003 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:33:50,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199215208] [2022-03-15 21:33:50,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199215208] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:33:50,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992649692] [2022-03-15 21:33:50,004 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:33:50,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:50,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:33:50,005 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 21:33:50,006 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 21:33:50,026 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:33:50,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:33:50,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:33:50,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:33:50,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:50,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:33:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:50,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992649692] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:33:50,185 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:33:50,186 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 16 [2022-03-15 21:33:50,186 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1423828727] [2022-03-15 21:33:50,186 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:33:50,186 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:33:50,190 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 119 transitions. [2022-03-15 21:33:50,190 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:33:50,904 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [298294#(or (< 2 L) (< 1 N) (<= L 1)), 298301#(or (not (< 0 N)) (<= N (+ L 1))), 298296#(and (or (not (<= N 0)) (<= L 1)) (or (<= L 1) (<= (+ N 1) L))), 298286#(< 0 L), 298303#(or (<= L 0) (<= N L)), 298292#(or (<= L 0) (<= (+ N 1) L)), 298300#(or (not (< 0 N)) (<= N (+ 2 L))), 298304#(or (<= L 1) (<= (+ N 1) L)), 298287#(or (< 1 L) (<= L 0)), 298302#(or (= N L) (not (< 0 N))), 298288#(or (< 2 L) (<= L 1)), 298290#(or (< 0 L) (< 1 N)), 298291#(or (< 1 L) (<= L 0) (< 1 N)), 298297#(or (not (< 0 N)) (< 1 N)), 298299#(or (not (< 2 N)) (< 3 N)), 298293#(and (or (<= L 0) (<= N L)) (or (not (<= N 0)) (<= L 0))), 298295#(or (<= (+ 2 N) L) (<= L 1)), 298298#(or (not (< 1 N)) (< 2 N)), 298289#(< 1 N)] [2022-03-15 21:33:50,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:33:50,905 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:33:50,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:33:50,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1050, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:33:50,905 INFO L87 Difference]: Start difference. First operand 8749 states and 34104 transitions. Second operand has 28 states, 28 states have (on average 3.142857142857143) internal successors, (88), 27 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:33:54,736 INFO L93 Difference]: Finished difference Result 14082 states and 51428 transitions. [2022-03-15 21:33:54,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2022-03-15 21:33:54,737 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.142857142857143) internal successors, (88), 27 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 19 [2022-03-15 21:33:54,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:33:54,769 INFO L225 Difference]: With dead ends: 14082 [2022-03-15 21:33:54,769 INFO L226 Difference]: Without dead ends: 14012 [2022-03-15 21:33:54,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11544 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5364, Invalid=26142, Unknown=0, NotChecked=0, Total=31506 [2022-03-15 21:33:54,771 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 684 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 586 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 586 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:33:54,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [684 Valid, 1 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [586 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:33:54,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14012 states. [2022-03-15 21:33:54,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14012 to 8772. [2022-03-15 21:33:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8772 states, 8771 states have (on average 3.816782578953369) internal successors, (33477), 8771 states have internal predecessors, (33477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 33477 transitions. [2022-03-15 21:33:54,990 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 33477 transitions. Word has length 19 [2022-03-15 21:33:54,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:33:54,990 INFO L470 AbstractCegarLoop]: Abstraction has 8772 states and 33477 transitions. [2022-03-15 21:33:54,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.142857142857143) internal successors, (88), 27 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 33477 transitions. [2022-03-15 21:33:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:33:55,005 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:33:55,005 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:33:55,021 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 21:33:55,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:55,221 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:33:55,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:33:55,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1936374813, now seen corresponding path program 7 times [2022-03-15 21:33:55,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:33:55,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621295185] [2022-03-15 21:33:55,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:33:55,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:33:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:33:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:55,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:33:55,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621295185] [2022-03-15 21:33:55,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621295185] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:33:55,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806887914] [2022-03-15 21:33:55,257 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:33:55,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:55,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:33:55,258 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 21:33:55,258 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 21:33:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:33:55,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 21:33:55,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:33:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:55,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:33:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:55,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806887914] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:33:55,406 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:33:55,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 19 [2022-03-15 21:33:55,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [974650131] [2022-03-15 21:33:55,406 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:33:55,407 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:33:55,413 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 171 transitions. [2022-03-15 21:33:55,413 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:33:56,139 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 42 new interpolants: [330369#(or (< 0 N) (<= L 3)), 330386#(or (< 4 N) (<= L 2) (<= N 3)), 330367#(or (< 0 N) (<= L 1)), 330372#(and (or (< 0 N) (<= L 1)) (or (not (< 1 N)) (< 2 N) (<= L 1))), 330366#(or (< 0 N) (<= L 0)), 330358#(or (< 1 L) (<= L 0) (< 1 N)), 330374#(and (or (not (< 1 N)) (< 2 N) (<= L 3)) (or (< 0 N) (<= L 3))), 330377#(or (<= L 4) (< 1 N)), 330368#(or (< 0 N) (<= L 2)), 330364#(or (< 1 N) (<= L 2)), 330352#(< 0 L), 330359#(or (< 2 L) (< 1 N) (<= L 1)), 330370#(and (< 0 N) (or (not (< 1 N)) (< 2 N))), 330324#(or (< 0 N) (<= L 4)), 330357#(or (<= L 3) (< 4 L)), 330379#(or (< 2 N) (<= L 0) (<= N 1)), 330355#(or (< 2 L) (<= L 1)), 330360#(or (< 1 N) (<= L 2) (< 3 L)), 330335#(or (not (< 1 N)) (< 2 N) (<= L 4)), 330371#(and (or (not (< 1 N)) (< 2 N) (<= L 0)) (or (< 0 N) (<= L 0))), 330385#(or (< 4 N) (<= L 1) (<= N 3)), 330356#(or (<= L 2) (< 3 L)), 330380#(or (not (< 1 N)) (< 2 N) (<= L 1)), 330378#(or (not (< 1 N)) (< 2 N)), 330383#(or (< 4 N) (<= N 3)), 330331#(or (and (< 0 N) (or (not (< 1 N)) (< 2 N))) (<= L 4)), 330350#(< 1 N), 330375#(or (<= L 4) (< 5 L)), 330384#(or (< 4 N) (<= L 0) (<= N 3)), 330354#(or (< 1 L) (<= L 0)), 330373#(and (or (< 0 N) (<= L 2)) (or (not (< 1 N)) (< 2 N) (<= L 2))), 330381#(or (not (< 1 N)) (< 2 N) (<= L 2)), 330382#(or (not (< 1 N)) (< 2 N) (<= L 3)), 330365#(or (<= L 3) (< 1 N)), 330351#(< 0 N), 330376#(or (<= L 4) (< 5 L) (< 1 N)), 330363#(or (< 1 N) (<= L 1)), 330353#(or (< 0 L) (< 1 N)), 330387#(or (< 4 N) (<= L 3) (<= N 3)), 330361#(or (<= L 3) (< 1 N) (< 4 L)), 330362#(or (<= L 0) (< 1 N)), 330388#(or (< 4 N) (<= L 4) (<= N 3))] [2022-03-15 21:33:56,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 21:33:56,139 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:33:56,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 21:33:56,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=2877, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 21:33:56,140 INFO L87 Difference]: Start difference. First operand 8772 states and 33477 transitions. Second operand has 52 states, 52 states have (on average 2.7115384615384617) internal successors, (141), 51 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:34:01,543 INFO L93 Difference]: Finished difference Result 12063 states and 43468 transitions. [2022-03-15 21:34:01,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states. [2022-03-15 21:34:01,544 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.7115384615384617) internal successors, (141), 51 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:34:01,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:34:01,575 INFO L225 Difference]: With dead ends: 12063 [2022-03-15 21:34:01,575 INFO L226 Difference]: Without dead ends: 11826 [2022-03-15 21:34:01,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30308 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=11636, Invalid=66484, Unknown=0, NotChecked=0, Total=78120 [2022-03-15 21:34:01,578 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1031 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 2214 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 2214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:34:01,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1031 Valid, 1 Invalid, 2948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 2214 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:34:01,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2022-03-15 21:34:01,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 9071. [2022-03-15 21:34:01,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9071 states, 9070 states have (on average 3.813120176405733) internal successors, (34585), 9070 states have internal predecessors, (34585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9071 states to 9071 states and 34585 transitions. [2022-03-15 21:34:01,821 INFO L78 Accepts]: Start accepts. Automaton has 9071 states and 34585 transitions. Word has length 20 [2022-03-15 21:34:01,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:34:01,822 INFO L470 AbstractCegarLoop]: Abstraction has 9071 states and 34585 transitions. [2022-03-15 21:34:01,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.7115384615384617) internal successors, (141), 51 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:01,822 INFO L276 IsEmpty]: Start isEmpty. Operand 9071 states and 34585 transitions. [2022-03-15 21:34:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:34:01,837 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:34:01,837 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:34:01,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-03-15 21:34:02,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:02,043 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:34:02,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:34:02,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1575584917, now seen corresponding path program 19 times [2022-03-15 21:34:02,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:34:02,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708687533] [2022-03-15 21:34:02,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:34:02,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:34:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:34:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:02,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:34:02,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708687533] [2022-03-15 21:34:02,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708687533] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:34:02,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241497151] [2022-03-15 21:34:02,103 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:34:02,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:02,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:34:02,104 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 21:34:02,105 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 21:34:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:34:02,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:34:02,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:34:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:02,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:34:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:02,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241497151] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:34:02,315 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:34:02,315 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2022-03-15 21:34:02,315 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [333545312] [2022-03-15 21:34:02,315 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:34:02,316 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:34:02,320 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 133 transitions. [2022-03-15 21:34:02,321 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:34:03,149 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [361193#(and (or (< 4 N) (<= N (+ 2 L)) (<= N 2)) (or (<= N 0) (< 1 N) (<= N L))), 361178#(or (< 2 L) (<= L 1)), 361188#(or (< 2 N) (not (< 0 N)) (<= N (+ L 1))), 361183#(or (< 1 N) (<= (+ N 1) L)), 361189#(or (< 2 N) (not (< 0 N)) (<= N L)), 361200#(or (<= N 2) (<= N L)), 361190#(or (< 2 N) (not (< 0 N)) (<= (+ N 1) L)), 361181#(and (or (< 0 N) (<= N L)) (or (< 2 N) (<= N (+ L 1)))), 361192#(and (or (<= N (+ L 1)) (<= N 0) (< 1 N)) (or (<= N (+ 3 L)) (< 4 N) (<= N 2))), 361182#(or (< 1 L) (<= L 0) (< 1 N)), 361179#(or (<= L 2) (< 3 L)), 361171#(< 1 N), 361177#(or (< 1 L) (<= L 0)), 361175#(< 0 L), 361174#(or (< 4 N) (<= N 3)), 361195#(or (<= N (+ 3 L)) (< 4 N) (<= N 2)), 361180#(or (< 1 N) (<= N L)), 361196#(or (< 4 N) (<= N (+ 2 L)) (<= N 2)), 361184#(and (or (< 2 N) (<= N L)) (or (< 0 N) (<= (+ N 1) L))), 361173#(or (< 2 N) (<= N 1)), 361176#(or (< 0 L) (< 1 N)), 361172#(or (not (< 0 N)) (< 1 N)), 361198#(or (<= (+ 2 N) L) (not (< 0 N))), 361191#(or (< 1 N) (<= L 2) (< 3 L)), 361186#(or (<= (+ 2 N) L) (< 1 N)), 361197#(or (< 4 N) (<= N (+ L 1)) (<= N 2)), 361194#(and (or (<= N 0) (< 1 N) (<= (+ N 1) L)) (or (< 4 N) (<= N (+ L 1)) (<= N 2))), 361187#(and (or (< 0 N) (<= (+ 2 N) L)) (or (< 2 N) (<= (+ N 1) L))), 361185#(or (< 2 L) (< 1 N) (<= L 1)), 361199#(and (or (<= (+ 2 N) L) (not (< 0 N)) (< 1 N)) (or (<= N 2) (<= N L)))] [2022-03-15 21:34:03,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 21:34:03,149 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:34:03,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 21:34:03,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=2020, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:34:03,150 INFO L87 Difference]: Start difference. First operand 9071 states and 34585 transitions. Second operand has 40 states, 40 states have (on average 2.675) internal successors, (107), 39 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:34:07,471 INFO L93 Difference]: Finished difference Result 20644 states and 77087 transitions. [2022-03-15 21:34:07,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2022-03-15 21:34:07,472 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.675) internal successors, (107), 39 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:34:07,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:34:07,522 INFO L225 Difference]: With dead ends: 20644 [2022-03-15 21:34:07,522 INFO L226 Difference]: Without dead ends: 20592 [2022-03-15 21:34:07,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17449 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=7942, Invalid=36790, Unknown=0, NotChecked=0, Total=44732 [2022-03-15 21:34:07,526 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 710 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 552 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 552 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:34:07,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [710 Valid, 1 Invalid, 2520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [552 Valid, 1968 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:34:07,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20592 states. [2022-03-15 21:34:07,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20592 to 13103. [2022-03-15 21:34:07,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13103 states, 13102 states have (on average 3.8639139062738512) internal successors, (50625), 13102 states have internal predecessors, (50625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13103 states to 13103 states and 50625 transitions. [2022-03-15 21:34:07,904 INFO L78 Accepts]: Start accepts. Automaton has 13103 states and 50625 transitions. Word has length 20 [2022-03-15 21:34:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:34:07,904 INFO L470 AbstractCegarLoop]: Abstraction has 13103 states and 50625 transitions. [2022-03-15 21:34:07,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.675) internal successors, (107), 39 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 13103 states and 50625 transitions. [2022-03-15 21:34:07,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:34:07,925 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:34:07,925 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:34:07,942 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 21:34:08,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-03-15 21:34:08,136 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:34:08,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:34:08,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1942996407, now seen corresponding path program 20 times [2022-03-15 21:34:08,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:34:08,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244458776] [2022-03-15 21:34:08,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:34:08,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:34:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:34:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:08,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:34:08,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244458776] [2022-03-15 21:34:08,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244458776] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:34:08,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404598376] [2022-03-15 21:34:08,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:34:08,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:08,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:34:08,202 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 21:34:08,203 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 21:34:08,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:34:08,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:34:08,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 21:34:08,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:34:08,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:08,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:34:08,401 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:08,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404598376] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:34:08,401 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:34:08,401 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2022-03-15 21:34:08,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1004866461] [2022-03-15 21:34:08,402 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:34:08,403 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:34:08,408 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 152 transitions. [2022-03-15 21:34:08,408 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:34:09,234 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [408523#(or (< 2 L) (<= L 1)), 408519#(or (< 1 L) (<= L 0)), 408514#(or (< 0 L) (< 1 N)), 408535#(and (or (not (< 0 N)) (<= N (+ L 1)) (< 1 N)) (or (< 2 N) (not (< 0 N)) (<= N (+ 2 L))) (or (<= N (+ 3 L)) (< 4 N) (not (< 0 N)))), 408530#(or (< 4 N) (<= N (+ L 1)) (<= L 1)), 408526#(or (< 2 N) (<= L 1) (<= (+ N 1) L)), 408525#(or (not (< 0 N)) (< 2 L) (< 1 N) (<= L 1)), 408522#(or (< 2 N) (<= L 0) (<= N L)), 408524#(or (< 2 L) (< 1 N) (<= L 1)), 408518#(and (or (< 0 N) (<= N L)) (or (< 2 N) (<= N (+ L 1)))), 408527#(or (< 4 N) (<= N 3)), 408515#(or (not (< 0 N)) (< 1 N)), 408520#(or (< 1 L) (<= L 0) (< 1 N)), 408532#(and (<= L (+ 2 N)) (or (<= (+ 2 N) L) (< 1 N)) (or (not (< 1 N)) (<= L N)) (<= N L)), 408513#(< 0 L), 408536#(or (< 1 N) (<= L 2) (< 3 L)), 408521#(or (< 1 L) (not (< 0 N)) (<= L 0) (< 1 N)), 408512#(< 1 N), 408529#(or (< 4 N) (<= N (+ 2 L)) (<= L 0)), 408517#(or (< 2 N) (<= N 1)), 408528#(and (or (< 0 N) (<= N L)) (or (<= N (+ 3 L)) (< 4 N)) (or (<= N (+ L 1)) (< 1 N)) (or (< 2 N) (<= N (+ 2 L)))), 408533#(and (or (<= N (+ 3 L)) (< 4 N) (not (< 1 N))) (or (not (< 1 N)) (< 2 N) (<= N (+ 2 L)))), 408534#(and (or (not (< 1 N)) (<= N L)) (or (not (< 1 N)) (<= L N))), 408516#(or (< 1 N) (<= N L)), 408531#(or (<= L 2) (< 3 L)), 408537#(and (or (<= N 1) (<= L N)) (or (<= (+ 2 N) L) (not (< 0 N)) (< 1 N)) (or (<= L (+ 2 N)) (not (< 0 N))) (or (not (< 0 N)) (<= N L)))] [2022-03-15 21:34:09,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:34:09,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:34:09,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:34:09,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=1773, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 21:34:09,235 INFO L87 Difference]: Start difference. First operand 13103 states and 50625 transitions. Second operand has 36 states, 36 states have (on average 3.138888888888889) internal successors, (113), 35 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:34:14,939 INFO L93 Difference]: Finished difference Result 23041 states and 87284 transitions. [2022-03-15 21:34:14,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2022-03-15 21:34:14,939 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.138888888888889) internal successors, (113), 35 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:34:14,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:34:15,004 INFO L225 Difference]: With dead ends: 23041 [2022-03-15 21:34:15,005 INFO L226 Difference]: Without dead ends: 23027 [2022-03-15 21:34:15,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18012 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=8460, Invalid=37980, Unknown=0, NotChecked=0, Total=46440 [2022-03-15 21:34:15,008 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 902 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 801 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 801 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:34:15,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [902 Valid, 1 Invalid, 2328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [801 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:34:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23027 states. [2022-03-15 21:34:15,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23027 to 15404. [2022-03-15 21:34:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15404 states, 15403 states have (on average 3.8623644744530288) internal successors, (59492), 15403 states have internal predecessors, (59492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15404 states to 15404 states and 59492 transitions. [2022-03-15 21:34:15,482 INFO L78 Accepts]: Start accepts. Automaton has 15404 states and 59492 transitions. Word has length 20 [2022-03-15 21:34:15,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:34:15,482 INFO L470 AbstractCegarLoop]: Abstraction has 15404 states and 59492 transitions. [2022-03-15 21:34:15,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.138888888888889) internal successors, (113), 35 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:15,482 INFO L276 IsEmpty]: Start isEmpty. Operand 15404 states and 59492 transitions. [2022-03-15 21:34:15,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:34:15,584 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:34:15,584 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:34:15,602 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 21:34:15,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:15,800 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:34:15,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:34:15,800 INFO L85 PathProgramCache]: Analyzing trace with hash 785719515, now seen corresponding path program 21 times [2022-03-15 21:34:15,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:34:15,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622450339] [2022-03-15 21:34:15,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:34:15,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:34:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:34:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:15,848 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:34:15,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622450339] [2022-03-15 21:34:15,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622450339] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:34:15,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443063623] [2022-03-15 21:34:15,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:34:15,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:15,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:34:15,850 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 21:34:15,851 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 21:34:15,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 21:34:15,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:34:15,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:34:15,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:34:15,936 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:15,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:34:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:16,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443063623] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:34:16,013 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:34:16,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 20 [2022-03-15 21:34:16,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1005220224] [2022-03-15 21:34:16,013 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:34:16,014 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:34:16,019 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 166 transitions. [2022-03-15 21:34:16,019 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:34:16,771 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [462864#(or (< 1 L) (<= L 0)), 462873#(<= N 3), 462867#(or (< 0 L) (< 1 N)), 462870#(or (<= L 2) (< 3 L)), 462887#(and (or (= (+ (* (- 1) L) N) 0) (not (< 0 N))) (or (not (< 0 N)) (not (<= N 1)))), 462876#(and (or (= (+ (* (- 1) L) N) 0) (< 1 N)) (or (not (< 1 N)) (= (+ (- 2) (* (- 1) L) N) 0))), 462868#(or (< 1 L) (<= L 0) (< 1 N)), 462871#(or (< 1 N) (<= L 2) (< 3 L)), 462879#(or (<= L 0) (<= (+ N 1) L)), 462882#(and (or (<= L (+ 2 N)) (<= L 0)) (or (<= (+ 2 N) L) (<= L 0))), 462865#(or (< 2 L) (<= L 1)), 462885#(and (or (= (+ 2 L) N) (<= N 1)) (or (= (+ (* (- 1) L) N) 0) (not (< 0 N)) (< 1 N))), 462878#(or (= N (+ L 1)) (<= N 1)), 462884#(and (or (not (< 0 N)) (<= N (+ L 1)) (< 1 N)) (or (<= 3 N) (<= N 1)) (or (<= N (+ 3 L)) (not (< 0 N)))), 462874#(and (<= N (+ 3 L)) (or (not (< 1 N)) (<= 3 N)) (<= 1 N) (or (<= N (+ L 1)) (< 1 N))), 462872#(<= N 1), 462883#(or (= N L) (not (< 1 N))), 462869#(or (< 2 L) (< 1 N) (<= L 1)), 462881#(or (<= (+ 3 N) L) (<= L 2)), 462880#(or (<= (+ 2 N) L) (<= L 1)), 462886#(and (or (not (< 0 N)) (<= N (+ L 1))) (or (not (< 0 N)) (<= (+ L 1) N)) (or (not (< 0 N)) (not (<= N 1)))), 462877#(or (= (+ 2 L) N) (not (< 1 N))), 462875#(and (or (not (< 1 N)) (<= 3 N)) (or (<= N (+ 3 L)) (not (< 1 N)))), 462866#(< 1 N), 462863#(< 0 L)] [2022-03-15 21:34:16,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 21:34:16,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:34:16,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 21:34:16,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=1788, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:34:16,773 INFO L87 Difference]: Start difference. First operand 15404 states and 59492 transitions. Second operand has 34 states, 34 states have (on average 3.4705882352941178) internal successors, (118), 33 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:34:21,579 INFO L93 Difference]: Finished difference Result 31234 states and 117823 transitions. [2022-03-15 21:34:21,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2022-03-15 21:34:21,579 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.4705882352941178) internal successors, (118), 33 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:34:21,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:34:21,674 INFO L225 Difference]: With dead ends: 31234 [2022-03-15 21:34:21,674 INFO L226 Difference]: Without dead ends: 31137 [2022-03-15 21:34:21,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21176 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7755, Invalid=46301, Unknown=0, NotChecked=0, Total=54056 [2022-03-15 21:34:21,679 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 890 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 2721 mSolverCounterSat, 1224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 3945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1224 IncrementalHoareTripleChecker+Valid, 2721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:34:21,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [890 Valid, 1 Invalid, 3945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1224 Valid, 2721 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 21:34:21,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31137 states. [2022-03-15 21:34:22,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31137 to 25053. [2022-03-15 21:34:22,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25053 states, 25052 states have (on average 3.8456011496088136) internal successors, (96340), 25052 states have internal predecessors, (96340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25053 states to 25053 states and 96340 transitions. [2022-03-15 21:34:22,400 INFO L78 Accepts]: Start accepts. Automaton has 25053 states and 96340 transitions. Word has length 20 [2022-03-15 21:34:22,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:34:22,400 INFO L470 AbstractCegarLoop]: Abstraction has 25053 states and 96340 transitions. [2022-03-15 21:34:22,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.4705882352941178) internal successors, (118), 33 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:22,401 INFO L276 IsEmpty]: Start isEmpty. Operand 25053 states and 96340 transitions. [2022-03-15 21:34:22,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:34:22,436 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:34:22,436 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:34:22,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-03-15 21:34:22,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:22,649 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:34:22,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:34:22,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1783258667, now seen corresponding path program 22 times [2022-03-15 21:34:22,650 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:34:22,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133764363] [2022-03-15 21:34:22,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:34:22,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:34:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:34:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:22,787 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:34:22,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133764363] [2022-03-15 21:34:22,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133764363] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:34:22,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943781478] [2022-03-15 21:34:22,788 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:34:22,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:22,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:34:22,789 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 21:34:22,790 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 21:34:22,813 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:34:22,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:34:22,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 21:34:22,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:34:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:22,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:34:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:23,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943781478] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:34:23,484 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:34:23,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 21:34:23,484 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1959920981] [2022-03-15 21:34:23,484 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:34:23,485 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:34:23,489 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 135 transitions. [2022-03-15 21:34:23,489 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:34:25,554 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [544759#(and (or (not (< 0 N)) (<= q (* 3 M))) (or (<= (* 3 M) q) (not (< 0 N))) (or (<= 3 N) (not (< 0 N))) (or (= p 0) (not (< 0 N))) (<= N 3)), 544748#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 544754#(and (or (not (< 2 L)) (<= N 0) (< 3 L)) (or (not (< 2 L)) (= (+ (* 3 M) q) p) (< 3 L))), 544744#(or (< 0 L) (= q p)), 544765#(and (or (not (< 1 N)) (<= 0 q)) (or (not (< 1 N)) (= p 0)) (or (= N L) (not (< 1 N))) (or (not (< 1 N)) (<= q 0))), 544753#(or (= (+ (* 3 M) q) p) (<= L 2) (< 3 L)), 544749#(and (or (< 2 L) (not (< 1 L)) (<= N 0)) (or (< 2 L) (not (< 1 L)) (= (+ (* 2 M) q) p))), 544752#(and (or (< 2 L) (not (< 1 L)) (<= N 2)) (or (<= p q) (< 2 L) (not (< 1 L))) (or (< 2 L) (not (< 1 L)) (< q (+ p 1))) (or (<= 2 N) (< 2 L) (not (< 1 L)))), 544755#(and (or (not (< 2 L)) (< 3 L) (< (+ M q) (+ p 1))) (or (not (< 2 L)) (<= p (+ M q)) (< 3 L)) (or (not (< 2 L)) (<= N 2) (< 3 L)) (or (not (< 2 L)) (<= 2 N) (< 3 L))), 544756#(and (or (not (< 1 N)) (<= 3 N)) (or (not (< 1 N)) (= p 0)) (or (not (< 1 N)) (<= q (* 3 M))) (<= N 3) (or (not (< 1 N)) (<= (* 3 M) q))), 544757#(and (or (not (< 1 N)) (<= 3 N)) (or (not (< 1 N)) (= p 0)) (or (not (< 1 N)) (<= q (* 3 M))) (or (<= N (+ 3 L)) (not (< 1 N))) (or (not (< 1 N)) (<= (* 3 M) q))), 544761#(and (or (not (< 0 N)) (<= q (* 3 M))) (or (<= (* 3 M) q) (not (< 0 N))) (or (<= 3 N) (not (< 0 N))) (or (<= N (+ 3 L)) (not (< 0 N))) (or (= p 0) (not (< 0 N)))), 544760#(and (or (not (< 1 N)) (= p 0)) (or (not (< 1 N)) (<= q M)) (or (not (< 1 N)) (<= (+ L 1) N)) (or (not (< 1 N)) (<= M q)) (or (not (< 1 N)) (<= N (+ L 1)))), 544746#(and (or (< 0 L) (= q p)) (or (< 0 L) (<= N 0))), 544745#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 544747#(and (or (< 1 L) (<= N 0) (not (< 0 L))) (or (< 1 L) (= p (+ M q)) (not (< 0 L)))), 544751#(and (or (<= (+ M p) q) (< 1 L) (not (< 0 L))) (or (< 1 L) (not (< 0 L)) (<= N 2)) (or (< 1 L) (<= 2 N) (not (< 0 L))) (or (< 1 L) (< q (+ M p 1)) (not (< 0 L)))), 544750#(and (or (< 0 L) (<= 2 N)) (or (< 0 L) (<= N 2)) (or (< 0 L) (< q (+ (* 2 M) p 1))) (or (< 0 L) (<= (+ (* 2 M) p) q))), 544763#(and (or (<= q M) (not (< 0 N))) (or (not (< 0 N)) (<= N (+ L 1))) (or (not (< 0 N)) (<= (+ L 1) N)) (or (not (< 0 N)) (<= M q)) (or (= p 0) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N))), 544764#(and (or (= p 0) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N)) (or (= N L) (not (< 0 N))) (or (<= 0 q) (not (< 0 N))) (or (not (< 0 N)) (<= q 0))), 544762#(and (or (not (< 0 N)) (<= (+ 2 L) N)) (or (<= (* 2 M) q) (not (< 0 N))) (or (not (< 0 N)) (<= N (+ 2 L))) (or (<= q (* 2 M)) (not (< 0 N))) (or (= p 0) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N))), 544758#(and (or (not (< 1 N)) (<= (* 2 M) q)) (or (not (< 1 N)) (<= N (+ 2 L))) (or (not (< 1 N)) (= p 0)) (or (not (< 1 N)) (<= q (* 2 M))) (or (not (< 1 N)) (<= (+ 2 L) N)))] [2022-03-15 21:34:25,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:34:25,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:34:25,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:34:25,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1957, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 21:34:25,557 INFO L87 Difference]: Start difference. First operand 25053 states and 96340 transitions. Second operand has 33 states, 32 states have (on average 3.125) internal successors, (100), 32 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:28,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:34:28,625 INFO L93 Difference]: Finished difference Result 30758 states and 116376 transitions. [2022-03-15 21:34:28,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-15 21:34:28,625 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.125) internal successors, (100), 32 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:34:28,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:34:28,725 INFO L225 Difference]: With dead ends: 30758 [2022-03-15 21:34:28,725 INFO L226 Difference]: Without dead ends: 30720 [2022-03-15 21:34:28,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2288 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1308, Invalid=8004, Unknown=0, NotChecked=0, Total=9312 [2022-03-15 21:34:28,726 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 658 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 2058 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 2058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:34:28,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [658 Valid, 15 Invalid, 2413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 2058 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:34:28,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30720 states. [2022-03-15 21:34:29,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30720 to 25085. [2022-03-15 21:34:29,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25085 states, 25084 states have (on average 3.844243342369638) internal successors, (96429), 25084 states have internal predecessors, (96429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25085 states to 25085 states and 96429 transitions. [2022-03-15 21:34:29,491 INFO L78 Accepts]: Start accepts. Automaton has 25085 states and 96429 transitions. Word has length 20 [2022-03-15 21:34:29,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:34:29,491 INFO L470 AbstractCegarLoop]: Abstraction has 25085 states and 96429 transitions. [2022-03-15 21:34:29,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.125) internal successors, (100), 32 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:29,491 INFO L276 IsEmpty]: Start isEmpty. Operand 25085 states and 96429 transitions. [2022-03-15 21:34:29,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:34:29,523 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:34:29,524 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:34:29,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-03-15 21:34:29,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 21:34:29,739 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:34:29,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:34:29,741 INFO L85 PathProgramCache]: Analyzing trace with hash -798808307, now seen corresponding path program 23 times [2022-03-15 21:34:29,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:34:29,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850527029] [2022-03-15 21:34:29,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:34:29,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:34:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:34:29,811 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:29,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:34:29,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850527029] [2022-03-15 21:34:29,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850527029] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:34:29,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426173073] [2022-03-15 21:34:29,814 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:34:29,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:29,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:34:29,815 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 21:34:29,816 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 21:34:29,838 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:34:29,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:34:29,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 21:34:29,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:34:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:29,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:34:30,073 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:30,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426173073] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:34:30,074 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:34:30,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2022-03-15 21:34:30,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1478277880] [2022-03-15 21:34:30,074 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:34:30,075 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:34:30,081 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 166 transitions. [2022-03-15 21:34:30,081 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:34:31,246 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [625949#(or (< 0 N) (< 2 L) (<= L 1)), 625930#(< 0 L), 625941#(or (< 0 L) (< 1 N)), 625939#(and (or (= (+ (* (- 1) L) N) 0) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N))), 625948#(or (< 2 L) (< 1 N) (<= L 1)), 625943#(and (or (< 0 L) (<= 1 N)) (or (< 0 L) (<= N 1))), 625953#(or (< 0 N) (<= L 2) (< 3 L)), 625955#(and (or (<= L 2) (<= 1 N) (< 3 L)) (or (<= N 1) (<= L 2) (< 3 L))), 625937#(and (or (not (< 0 N)) (<= (+ 2 L) N)) (or (not (< 0 N)) (<= N (+ 2 L))) (or (not (< 0 N)) (<= 2 N))), 625934#(and (<= 3 N) (<= N 3)), 625931#(or (< 1 L) (<= L 0)), 625958#(and (or (not (< 1 N)) (<= N (+ 2 L))) (or (not (< 1 N)) (<= (+ 2 L) N))), 625932#(or (< 2 L) (<= L 1)), 625945#(or (< 0 N) (< 1 L) (<= L 0)), 625961#(and (or (not (< 1 N)) (<= (+ L 1) N)) (or (not (< 1 N)) (<= N (+ L 1)))), 625940#(< 1 N), 625960#(and (or (<= N 2) (<= L 2) (< 3 L)) (or (<= 2 N) (<= L 2) (< 3 L))), 625947#(and (or (< 1 L) (<= L 0) (<= 1 N)) (or (< 1 L) (<= L 0) (<= N 1))), 625963#(and (or (<= 2 N) (<= L 1)) (or (<= L 1) (<= N L))), 625962#(or (= (+ (* (- 1) L) N) 0) (not (< 1 N))), 625964#(and (or (<= (+ N 1) L) (<= L 2)) (or (<= 2 N) (<= L 2))), 625942#(or (< 0 L) (<= 1 N)), 625954#(or (< 1 N) (<= L 2) (< 3 L)), 625951#(and (or (< 1 L) (<= 2 N) (<= L 0)) (or (< 1 L) (<= L 0) (<= N 2))), 625959#(and (or (<= 2 N) (<= L 0)) (or (<= N (+ L 1)) (<= L 0))), 625944#(and (or (< 0 L) (<= 2 N)) (or (< 0 L) (<= N 2))), 625957#(and (or (not (< 1 N)) (<= 3 N)) (or (<= N (+ 3 L)) (not (< 1 N)))), 625935#(and (or (<= 3 N) (not (< 0 N))) (<= N 3)), 625956#(and (or (not (< 1 N)) (<= 3 N)) (<= N 3)), 625938#(and (or (not (< 0 N)) (<= N (+ L 1))) (or (not (< 0 N)) (<= (+ L 1) N)) (or (not (< 0 N)) (<= 2 N))), 625946#(or (< 1 L) (<= L 0) (< 1 N)), 625950#(and (or (< 2 L) (<= L 1) (<= N 1)) (or (< 2 L) (<= L 1) (<= 1 N))), 625933#(or (<= L 2) (< 3 L)), 625936#(and (or (<= 3 N) (not (< 0 N))) (or (<= N (+ 3 L)) (not (< 0 N)))), 625952#(and (or (< 2 L) (<= L 1) (<= N 2)) (or (<= 2 N) (< 2 L) (<= L 1)))] [2022-03-15 21:34:31,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 21:34:31,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:34:31,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 21:34:31,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=2753, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 21:34:31,247 INFO L87 Difference]: Start difference. First operand 25085 states and 96429 transitions. Second operand has 46 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 45 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:34:36,307 INFO L93 Difference]: Finished difference Result 44115 states and 164406 transitions. [2022-03-15 21:34:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2022-03-15 21:34:36,308 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 45 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:34:36,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:34:36,458 INFO L225 Difference]: With dead ends: 44115 [2022-03-15 21:34:36,458 INFO L226 Difference]: Without dead ends: 44096 [2022-03-15 21:34:36,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20737 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7045, Invalid=47945, Unknown=0, NotChecked=0, Total=54990 [2022-03-15 21:34:36,460 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 894 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 3822 mSolverCounterSat, 956 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 4778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 956 IncrementalHoareTripleChecker+Valid, 3822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:34:36,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [894 Valid, 9 Invalid, 4778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [956 Valid, 3822 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 21:34:36,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44096 states. [2022-03-15 21:34:37,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44096 to 26796. [2022-03-15 21:34:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26796 states, 26795 states have (on average 3.8498600485165144) internal successors, (103157), 26795 states have internal predecessors, (103157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:37,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26796 states to 26796 states and 103157 transitions. [2022-03-15 21:34:37,475 INFO L78 Accepts]: Start accepts. Automaton has 26796 states and 103157 transitions. Word has length 20 [2022-03-15 21:34:37,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:34:37,476 INFO L470 AbstractCegarLoop]: Abstraction has 26796 states and 103157 transitions. [2022-03-15 21:34:37,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 45 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand 26796 states and 103157 transitions. [2022-03-15 21:34:37,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:34:37,513 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:34:37,513 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:34:37,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 21:34:37,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 21:34:37,729 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:34:37,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:34:37,730 INFO L85 PathProgramCache]: Analyzing trace with hash -930556243, now seen corresponding path program 24 times [2022-03-15 21:34:37,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:34:37,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884667681] [2022-03-15 21:34:37,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:34:37,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:34:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:34:37,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:37,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:34:37,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884667681] [2022-03-15 21:34:37,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884667681] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:34:37,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724779002] [2022-03-15 21:34:37,906 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:34:37,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:37,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:34:37,907 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 21:34:37,908 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 21:34:37,928 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:34:37,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:34:37,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:34:37,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:34:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:38,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:34:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:38,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724779002] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:34:38,507 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:34:38,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2022-03-15 21:34:38,508 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [99632445] [2022-03-15 21:34:38,508 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:34:38,509 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:34:38,514 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 139 transitions. [2022-03-15 21:34:38,514 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:34:40,501 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [724172#(or (= (+ (* 3 M) q) p) (<= L 2) (< 3 L)), 724178#(and (or (< 1 L) (not (<= N 1)) (not (< 0 L))) (or (< 1 L) (= (+ M p (* (- 1) q)) 0) (not (< 0 L))) (or (< 1 L) (not (< 0 L)) (<= N 2))), 724176#(and (or (not (< 2 L)) (<= N 0) (< 3 L)) (or (not (< 2 L)) (= (+ (* 3 M) q) p) (< 3 L))), 724179#(and (or (< 2 L) (not (< 1 L)) (not (<= N 1))) (or (< 2 L) (not (< 1 L)) (<= N 2)) (or (< 2 L) (not (< 1 L)) (= (+ p (* (- 1) q)) 0))), 724169#(or (< 0 L) (= q p)), 724182#(and (or (< 0 L) (<= N 2)) (or (< 0 L) (not (< 1 N)) (= (+ (* 2 M) p (* (- 1) q)) 0))), 724190#(and (or (not (< 0 N)) (<= q (* 3 M))) (or (<= (* 3 M) q) (not (< 0 N))) (or (= p 0) (not (< 0 N))) (<= N 3)), 724180#(and (or (not (< 2 L)) (< 3 L) (= (+ p (* (- 1) q) (* (- 1) M)) 0)) (or (not (< 2 L)) (not (<= N 1)) (< 3 L)) (or (not (< 2 L)) (<= N 2) (< 3 L))), 724170#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 724184#(and (or (< 2 L) (<= L 1) (<= N 2)) (or (not (< 1 N)) (< 2 L) (not (< 1 L)) (= (+ p (* (- 1) q)) 0))), 724174#(and (or (< 1 L) (<= N 0) (not (< 0 L))) (or (< 1 L) (= p (+ M q)) (not (< 0 L)))), 724185#(and (or (not (< 2 L)) (not (< 1 N)) (< 3 L) (= (+ p (* (- 1) q) (* (- 1) M)) 0)) (or (<= N 2) (<= L 2) (< 3 L))), 724181#(and (or (= (+ (* 2 M) p) q) (not (< 1 N))) (<= N 2)), 724188#(and (or (< 2 L) (not (< 1 L)) (<= N 2)) (or (< 2 L) (not (< 1 L)) (= (+ p (* (- 1) q)) 0))), 724189#(and (or (not (< 2 L)) (< 3 L) (= (+ p (* (- 1) q) (* (- 1) M)) 0)) (or (not (< 2 L)) (<= N 2) (< 3 L))), 724186#(and (or (< 0 L) (<= N 2)) (or (< 0 L) (= (+ (* 2 M) p (* (- 1) q)) 0))), 724193#(and (or (<= q M) (not (< 0 N))) (or (not (< 0 N)) (<= N (+ L 1))) (or (not (< 0 N)) (<= M q)) (or (= p 0) (not (< 0 N)))), 724175#(and (or (< 2 L) (not (< 1 L)) (<= N 0)) (or (< 2 L) (not (< 1 L)) (= (+ (* 2 M) q) p))), 724194#(and (or (= p 0) (not (< 0 N))) (or (= N L) (not (< 0 N))) (or (<= 0 q) (not (< 0 N))) (or (not (< 0 N)) (<= q 0))), 724191#(and (or (not (< 0 N)) (<= q (* 3 M))) (or (<= (* 3 M) q) (not (< 0 N))) (or (<= N (+ 3 L)) (not (< 0 N))) (or (= p 0) (not (< 0 N)))), 724192#(and (or (<= (* 2 M) q) (not (< 0 N))) (or (not (< 0 N)) (<= N (+ 2 L))) (or (<= q (* 2 M)) (not (< 0 N))) (or (= p 0) (not (< 0 N)))), 724177#(and (or (< 0 L) (<= N 2)) (or (< 0 L) (not (<= N 1))) (or (< 0 L) (= (+ (* 2 M) p (* (- 1) q)) 0))), 724187#(and (or (< 1 L) (= (+ M p (* (- 1) q)) 0) (not (< 0 L))) (or (< 1 L) (not (< 0 L)) (<= N 2))), 724171#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 724183#(and (or (not (< 1 N)) (< 1 L) (= (+ M p (* (- 1) q)) 0) (not (< 0 L))) (or (< 1 L) (not (< 0 L)) (<= N 2))), 724173#(and (or (< 0 L) (= q p)) (or (< 0 L) (<= N 0)))] [2022-03-15 21:34:40,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 21:34:40,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:34:40,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 21:34:40,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=2355, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 21:34:40,502 INFO L87 Difference]: Start difference. First operand 26796 states and 103157 transitions. Second operand has 38 states, 37 states have (on average 2.810810810810811) internal successors, (104), 37 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 21:34:49,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:34:49,280 INFO L93 Difference]: Finished difference Result 45358 states and 168496 transitions. [2022-03-15 21:34:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-03-15 21:34:49,281 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.810810810810811) internal successors, (104), 37 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 20 [2022-03-15 21:34:49,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:34:49,598 INFO L225 Difference]: With dead ends: 45358 [2022-03-15 21:34:49,599 INFO L226 Difference]: Without dead ends: 45336 [2022-03-15 21:34:49,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11764 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=6337, Invalid=28445, Unknown=0, NotChecked=0, Total=34782 [2022-03-15 21:34:49,607 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 1313 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 653 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 653 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:34:49,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1313 Valid, 5 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [653 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 21:34:49,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45336 states. [2022-03-15 21:34:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45336 to 26878. [2022-03-15 21:34:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26878 states, 26877 states have (on average 3.8506157681288835) internal successors, (103493), 26877 states have internal predecessors, (103493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26878 states to 26878 states and 103493 transitions. [2022-03-15 21:34:50,649 INFO L78 Accepts]: Start accepts. Automaton has 26878 states and 103493 transitions. Word has length 20 [2022-03-15 21:34:50,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:34:50,649 INFO L470 AbstractCegarLoop]: Abstraction has 26878 states and 103493 transitions. [2022-03-15 21:34:50,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.810810810810811) internal successors, (104), 37 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 21:34:50,649 INFO L276 IsEmpty]: Start isEmpty. Operand 26878 states and 103493 transitions. [2022-03-15 21:34:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:34:50,686 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:34:50,686 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:34:50,704 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 21:34:50,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 21:34:50,889 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:34:50,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:34:50,890 INFO L85 PathProgramCache]: Analyzing trace with hash -549800721, now seen corresponding path program 7 times [2022-03-15 21:34:50,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:34:50,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135080234] [2022-03-15 21:34:50,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:34:50,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:34:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:34:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:51,049 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:34:51,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135080234] [2022-03-15 21:34:51,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135080234] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:34:51,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144577890] [2022-03-15 21:34:51,049 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:34:51,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:51,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:34:51,055 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 21:34:51,055 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 21:34:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:34:51,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 21:34:51,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:34:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:34:51,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:34:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:34:51,489 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144577890] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:34:51,489 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:34:51,489 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2022-03-15 21:34:51,489 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [97802929] [2022-03-15 21:34:51,489 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:34:51,490 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:34:51,495 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 143 transitions. [2022-03-15 21:34:51,495 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:34:52,505 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [823719#(and (< 0 N) (or (< 1 N) (= (+ (* 2 M) q) p))), 823711#(and (or (not (< 0 N)) (<= q (* 3 M))) (or (<= (* 3 M) q) (not (< 0 N))) (or (= p 0) (not (< 0 N)))), 823716#(and (< 0 N) (or (= p (+ M q)) (< 1 N))), 823714#(= (+ (* 2 M) q) p), 823718#(and (< 0 N) (= (+ (* 2 M) q) p)), 823720#(and (or (<= (* 2 M) q) (not (< 0 N))) (or (<= q (* 2 M)) (not (< 0 N))) (or (= p 0) (not (< 0 N)))), 823710#(= p (+ M q)), 823722#(and (or (not (< 0 N)) (= q 0)) (or (= p 0) (not (< 0 N)))), 823713#(and (< 0 N) (or (< 1 N) (= q p))), 823721#(and (or (<= q M) (not (< 0 N))) (or (not (< 0 N)) (<= M q)) (or (= p 0) (not (< 0 N)))), 823603#(and (< 0 N) (= q p)), 823717#(= (+ (* 3 M) q) p), 823712#(and (< 0 N) (or (< q (+ M p 1)) (< 1 N)) (or (<= (+ M p) q) (< 1 N))), 823715#(and (< 0 N) (= p (+ M q)))] [2022-03-15 21:34:52,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 21:34:52,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:34:52,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 21:34:52,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2022-03-15 21:34:52,506 INFO L87 Difference]: Start difference. First operand 26878 states and 103493 transitions. Second operand has 26 states, 25 states have (on average 3.48) internal successors, (87), 25 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:54,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:34:54,114 INFO L93 Difference]: Finished difference Result 32695 states and 124093 transitions. [2022-03-15 21:34:54,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 21:34:54,115 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.48) internal successors, (87), 25 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 21:34:54,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:34:54,233 INFO L225 Difference]: With dead ends: 32695 [2022-03-15 21:34:54,233 INFO L226 Difference]: Without dead ends: 32620 [2022-03-15 21:34:54,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 60 SyntacticMatches, 19 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=270, Invalid=2180, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:34:54,234 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 2469 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 2535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:34:54,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 51 Invalid, 2535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2469 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:34:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32620 states. [2022-03-15 21:34:54,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32620 to 28608. [2022-03-15 21:34:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28608 states, 28607 states have (on average 3.851400006991296) internal successors, (110177), 28607 states have internal predecessors, (110177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:55,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28608 states to 28608 states and 110177 transitions. [2022-03-15 21:34:55,114 INFO L78 Accepts]: Start accepts. Automaton has 28608 states and 110177 transitions. Word has length 20 [2022-03-15 21:34:55,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:34:55,114 INFO L470 AbstractCegarLoop]: Abstraction has 28608 states and 110177 transitions. [2022-03-15 21:34:55,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.48) internal successors, (87), 25 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:55,114 INFO L276 IsEmpty]: Start isEmpty. Operand 28608 states and 110177 transitions. [2022-03-15 21:34:55,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:34:55,158 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:34:55,158 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:34:55,176 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 21:34:55,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 21:34:55,375 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:34:55,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:34:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash 261595712, now seen corresponding path program 8 times [2022-03-15 21:34:55,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:34:55,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22283232] [2022-03-15 21:34:55,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:34:55,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:34:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:34:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:55,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:34:55,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22283232] [2022-03-15 21:34:55,428 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22283232] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:34:55,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024115988] [2022-03-15 21:34:55,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:34:55,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:55,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:34:55,430 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 21:34:55,431 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 21:34:55,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:34:55,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:34:55,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 21:34:55,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:34:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:55,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:34:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:55,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024115988] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:34:55,558 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:34:55,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 19 [2022-03-15 21:34:55,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2043292331] [2022-03-15 21:34:55,558 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:34:55,559 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:34:55,565 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 174 transitions. [2022-03-15 21:34:55,565 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:34:57,122 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 46 new interpolants: [913836#(or (<= N 5) (<= 3 L) (< 6 N)), 913765#(< 0 L), 913827#(or (not (< 1 N)) (< 2 N) (<= 2 L)), 913839#(or (<= 4 L) (< 1 N)), 913826#(and (or (< 0 N) (<= 2 L)) (or (not (< 1 N)) (< 2 N) (<= 2 L))), 913846#(or (< 0 N) (<= 5 L)), 913829#(or (<= N 5) (<= 2 L) (< 6 N)), 913820#(or (not (< 1 N)) (< 2 N)), 913825#(or (<= 2 L) (< 1 N)), 913852#(or (<= L 3) (< 1 N) (< 4 L)), 913854#(and (or (not (< 1 N)) (< 2 N) (<= 6 L)) (or (< 0 N) (<= 6 L))), 913822#(or (<= N 5) (< 6 N)), 913843#(or (<= N 5) (<= 4 L) (< 6 N)), 913855#(or (<= N 5) (<= 5 L) (< 6 N)), 913842#(or (< 4 N) (<= 4 L) (<= N 3)), 913857#(or (< 4 N) (<= 6 L) (<= N 3)), 913818#(< 1 N), 913830#(or (< 0 N) (<= 3 L)), 913837#(or (< 0 N) (<= 4 L)), 913849#(or (not (< 1 N)) (< 2 N) (<= 5 L)), 913841#(or (not (< 1 N)) (< 2 N) (<= 4 L)), 913834#(or (not (< 1 N)) (< 2 N) (<= 3 L)), 913847#(and (or (< 0 N) (<= 5 L)) (or (not (< 1 N)) (< 2 N) (<= 5 L))), 913835#(or (< 4 N) (<= 3 L) (<= N 3)), 913814#(or (< 1 L) (<= L 0)), 913816#(or (<= L 2) (< 3 L)), 913821#(or (< 4 N) (<= N 3)), 913851#(or (< 0 N) (<= 6 L)), 913824#(or (< 0 L) (< 1 N)), 913850#(or (< 4 N) (<= 5 L) (<= N 3)), 913817#(< 0 N), 913833#(and (or (not (< 1 N)) (< 2 N) (<= 3 L)) (or (< 0 N) (<= 3 L))), 913856#(or (not (< 1 N)) (< 2 N) (<= 6 L)), 913828#(or (< 4 N) (<= 2 L) (<= N 3)), 913823#(or (< 0 N) (<= 2 L)), 913815#(or (< 2 L) (<= L 1)), 913840#(and (or (< 0 N) (<= 4 L)) (or (not (< 1 N)) (< 2 N) (<= 4 L))), 913831#(or (< 1 L) (<= L 0) (< 1 N)), 913819#(and (< 0 N) (or (not (< 1 N)) (< 2 N))), 913832#(or (<= 3 L) (< 1 N)), 913853#(or (<= 6 L) (< 1 N)), 913858#(or (<= N 5) (<= 6 L) (< 6 N)), 913848#(or (<= L 3) (< 4 L)), 913845#(or (<= 5 L) (< 1 N)), 913838#(or (< 2 L) (< 1 N) (<= L 1)), 913844#(or (< 1 N) (<= L 2) (< 3 L))] [2022-03-15 21:34:57,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 21:34:57,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:34:57,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 21:34:57,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=3441, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 21:34:57,123 INFO L87 Difference]: Start difference. First operand 28608 states and 110177 transitions. Second operand has 58 states, 58 states have (on average 2.603448275862069) internal successors, (151), 57 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 21:35:09,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:09,131 INFO L93 Difference]: Finished difference Result 44529 states and 167387 transitions. [2022-03-15 21:35:09,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 397 states. [2022-03-15 21:35:09,132 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.603448275862069) internal successors, (151), 57 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 21 [2022-03-15 21:35:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:09,408 INFO L225 Difference]: With dead ends: 44529 [2022-03-15 21:35:09,408 INFO L226 Difference]: Without dead ends: 44482 [2022-03-15 21:35:09,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 439 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84438 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=32666, Invalid=161374, Unknown=0, NotChecked=0, Total=194040 [2022-03-15 21:35:09,440 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1374 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 2776 mSolverCounterSat, 978 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 3754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 978 IncrementalHoareTripleChecker+Valid, 2776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:09,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1374 Valid, 1 Invalid, 3754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [978 Valid, 2776 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 21:35:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44482 states. [2022-03-15 21:35:10,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44482 to 31056. [2022-03-15 21:35:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31056 states, 31055 states have (on average 3.85052326517469) internal successors, (119578), 31055 states have internal predecessors, (119578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31056 states to 31056 states and 119578 transitions. [2022-03-15 21:35:10,519 INFO L78 Accepts]: Start accepts. Automaton has 31056 states and 119578 transitions. Word has length 21 [2022-03-15 21:35:10,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:10,519 INFO L470 AbstractCegarLoop]: Abstraction has 31056 states and 119578 transitions. [2022-03-15 21:35:10,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.603448275862069) internal successors, (151), 57 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 21:35:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 31056 states and 119578 transitions. [2022-03-15 21:35:10,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:35:10,564 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:10,564 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:10,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-03-15 21:35:10,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:10,767 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:10,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2103259984, now seen corresponding path program 25 times [2022-03-15 21:35:10,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:10,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830195840] [2022-03-15 21:35:10,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:10,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:10,824 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:10,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:10,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830195840] [2022-03-15 21:35:10,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830195840] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:10,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113130907] [2022-03-15 21:35:10,824 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:35:10,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:10,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:10,826 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 21:35:10,826 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 21:35:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:10,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 21:35:10,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:10,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:11,240 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:11,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113130907] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:11,240 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:11,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-03-15 21:35:11,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [584021634] [2022-03-15 21:35:11,241 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:11,241 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:11,247 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 157 transitions. [2022-03-15 21:35:11,247 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:12,502 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [1021402#(or (<= L 3) (< 4 L)), 1021412#(or (< 5 N) (<= N (+ L 4)) (<= N 3)), 1021427#(and (or (<= (+ 3 N) L) (< 1 N)) (or (<= (+ N 1) L) (< 3 N))), 1021430#(or (<= (+ 2 N) L) (not (< 1 N)) (< 3 N)), 1021418#(or (< 2 L) (< 1 N) (<= L 1)), 1021431#(or (< 5 N) (<= N (+ L 1)) (not (< 3 N))), 1021400#(or (< 2 L) (<= L 1)), 1021419#(or (<= (+ 2 N) L) (< 1 N)), 1021432#(or (< 5 N) (<= N 3) (<= N L)), 1021413#(or (< 1 L) (<= L 0) (< 1 N)), 1021423#(or (< 1 N) (<= L 2) (< 3 L)), 1021415#(and (or (<= N (+ L 1)) (< 3 N)) (or (< 1 N) (<= (+ N 1) L))), 1021428#(and (or (<= (+ 2 N) L) (< 3 N)) (or (<= (+ N 4) L) (< 1 N))), 1021404#(or (not (< 0 N)) (< 1 N)), 1021417#(or (<= N (+ 3 L)) (< 5 N) (not (< 3 N))), 1021426#(or (<= (+ N 4) L) (< 1 N)), 1021422#(or (< 5 N) (<= N (+ 2 L)) (<= N 3)), 1021403#(< 1 N), 1021416#(or (not (< 1 N)) (<= N (+ L 1)) (< 3 N)), 1021405#(and (or (not (< 2 N)) (< 3 N)) (or (<= N 0) (< 1 N))), 1021408#(or (< 0 L) (< 1 N)), 1021411#(or (not (< 1 N)) (<= N (+ 2 L)) (< 3 N)), 1021414#(or (< 1 N) (<= (+ N 1) L)), 1021401#(or (<= L 2) (< 3 L)), 1021406#(or (<= N 2) (< 3 N)), 1021407#(or (< 5 N) (<= N 4)), 1021420#(and (or (<= (+ 2 N) L) (< 1 N)) (or (< 3 N) (<= N L))), 1021398#(< 0 L), 1021410#(and (or (< 1 N) (<= N L)) (or (<= N (+ 2 L)) (< 3 N))), 1021399#(or (< 1 L) (<= L 0)), 1021429#(or (not (< 1 N)) (<= (+ N 1) L) (< 3 N)), 1021409#(or (< 1 N) (<= N L)), 1021425#(or (<= L 3) (< 1 N) (< 4 L)), 1021424#(or (<= (+ 3 N) L) (< 1 N)), 1021421#(or (not (< 1 N)) (< 3 N) (<= N L))] [2022-03-15 21:35:12,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 21:35:12,503 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:12,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 21:35:12,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=2871, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 21:35:12,504 INFO L87 Difference]: Start difference. First operand 31056 states and 119578 transitions. Second operand has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 45 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:20,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:20,568 INFO L93 Difference]: Finished difference Result 114055 states and 441455 transitions. [2022-03-15 21:35:20,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2022-03-15 21:35:20,569 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 45 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:35:20,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:21,266 INFO L225 Difference]: With dead ends: 114055 [2022-03-15 21:35:21,266 INFO L226 Difference]: Without dead ends: 114018 [2022-03-15 21:35:21,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33513 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=14450, Invalid=63670, Unknown=0, NotChecked=0, Total=78120 [2022-03-15 21:35:21,270 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1048 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 2056 mSolverCounterSat, 862 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 862 IncrementalHoareTripleChecker+Valid, 2056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:21,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1048 Valid, 1 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [862 Valid, 2056 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 21:35:21,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114018 states. [2022-03-15 21:35:23,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114018 to 63726. [2022-03-15 21:35:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63726 states, 63725 states have (on average 3.8585641428010984) internal successors, (245887), 63725 states have internal predecessors, (245887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63726 states to 63726 states and 245887 transitions. [2022-03-15 21:35:24,236 INFO L78 Accepts]: Start accepts. Automaton has 63726 states and 245887 transitions. Word has length 21 [2022-03-15 21:35:24,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:24,236 INFO L470 AbstractCegarLoop]: Abstraction has 63726 states and 245887 transitions. [2022-03-15 21:35:24,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 45 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 63726 states and 245887 transitions. [2022-03-15 21:35:24,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:35:24,306 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:24,306 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:24,324 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 21:35:24,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 21:35:24,522 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:35:24,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:24,522 INFO L85 PathProgramCache]: Analyzing trace with hash 400655354, now seen corresponding path program 26 times [2022-03-15 21:35:24,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:24,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066890709] [2022-03-15 21:35:24,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:24,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:24,915 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:24,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:24,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066890709] [2022-03-15 21:35:24,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066890709] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:24,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951626497] [2022-03-15 21:35:24,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:35:24,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:24,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:24,917 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 21:35:24,918 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 21:35:24,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:35:24,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:35:24,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:35:24,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:25,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:25,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951626497] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:25,592 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:25,592 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2022-03-15 21:35:25,592 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [137493145] [2022-03-15 21:35:25,592 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:25,593 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:25,598 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 157 transitions. [2022-03-15 21:35:25,598 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:28,234 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [1263541#(and (or (< 1 N) (= (+ (* 2 M) q) p)) (or (<= (+ 2 N) L) (< 1 N)) (or (not (< 1 N)) (= (+ (* 2 M) q) (+ (* 2 M) p)) (< 3 N)) (or (< 3 N) (<= N L))), 1263543#(and (or (= (+ (* 2 M) p) q) (not (< 1 N)) (< 3 N)) (or (not (< 1 N)) (<= N (+ 2 L)) (< 3 N))), 1263538#(and (or (< 1 N) (= q p)) (or (< 1 N) (<= N L)) (or (= (+ (* 2 M) p) q) (not (< 1 N)) (< 3 N)) (or (<= N (+ 2 L)) (< 3 N))), 1263566#(and (or (< 5 N) (<= N (+ L 1)) (<= N 3)) (or (< 5 N) (= (+ (* 3 M) q) (+ p (* M 4))) (not (< 3 N)))), 1263549#(and (or (< 5 N) (= q (+ p (* M 4))) (not (< 3 N))) (or (< 5 N) (<= N (+ L 4)) (not (< 3 N)))), 1263564#(and (or (not (< 1 N)) (<= (+ N 1) L) (< 3 N)) (or (not (< 1 N)) (= p (+ M q)) (< 3 N))), 1263536#(and (or (= p (+ M q)) (< 1 N)) (or (< 1 N) (<= (+ N 1) L))), 1263567#(and (or (<= N 1) (< 3 N) (= (+ (* 2 M) q) p)) (or (<= (+ 2 N) L) (not (< 0 N)) (< 3 N)) (or (not (< 0 N)) (= (+ q (* M 4)) p) (< 1 N)) (or (not (< 0 N)) (<= (+ N 4) L) (< 1 N)) (or (= (* 2 M) p) (<= N 1) (< 3 N)) (or (not (< 0 N)) (< 1 N) (= q 0))), 1263535#(and (or (< 1 N) (= q p)) (or (< 1 N) (<= N L))), 1263568#(and (or (< 5 N) (= p 0) (<= N 3)) (or (= (+ q (* M 4)) (+ p (* M 4))) (< 5 N) (not (< 3 N))) (or (< 5 N) (<= N 3) (<= N L))), 1263548#(and (or (< 5 N) (<= N 4)) (or (< 5 N) (= q (+ p (* M 4))) (<= N 3))), 1263553#(and (or (< 5 N) (<= N (+ 2 L)) (<= N 3)) (or (< 5 N) (not (< 3 N)) (= (+ (* 2 M) q) (+ p (* M 4))))), 1263540#(and (or (< 1 N) (= (+ (* 2 M) q) p)) (or (<= (+ 2 N) L) (< 1 N))), 1263554#(or (< 0 L) (= q p)), 1263561#(and (or (not (< 0 N)) (<= (+ N 1) L) (< 3 N)) (or (not (< 0 N)) (<= (+ 3 N) L) (< 1 N)) (or (= p (+ M q)) (<= N 1) (< 3 N)) (or (= (+ (* 3 M) q) p) (not (< 0 N)) (< 1 N))), 1263550#(and (or (<= N (+ 3 L)) (< 5 N) (<= N 3)) (or (< 5 N) (= (+ M q) (+ p (* M 4))) (not (< 3 N)))), 1263552#(and (or (not (< 0 N)) (< 3 N) (<= N L)) (or (<= (+ 2 N) L) (not (< 0 N)) (< 1 N)) (or (not (< 0 N)) (< 1 N) (= (+ (* 2 M) q) p)) (or (<= N 1) (< 3 N) (= q p))), 1263546#(and (or (not (< 0 N)) (< 1 N) (= q p)) (or (not (< 0 N)) (<= N (+ 2 L)) (< 3 N)) (or (< 0 L) (not (< 0 N)) (< 1 N)) (or (= (+ (* 2 M) p) q) (<= N 1) (< 3 N))), 1263558#(or (<= L 3) (= (+ q (* M 4)) p) (< 4 L)), 1263560#(and (or (not (< 1 N)) (= (+ (* 3 M) q) (+ (* 2 M) p)) (< 3 N)) (or (<= (+ 3 N) L) (< 1 N)) (or (= (+ (* 3 M) q) p) (< 1 N)) (or (<= (+ N 1) L) (< 3 N))), 1263559#(and (or (<= (+ 3 N) L) (< 1 N)) (or (= (+ (* 3 M) q) p) (< 1 N))), 1263547#(and (or (not (< 0 N)) (< 1 N) (<= (+ N 1) L)) (or (= p (+ M q)) (not (< 0 N)) (< 1 N)) (or (not (< 0 N)) (<= N (+ L 1)) (< 3 N)) (or (= (+ (* 2 M) p) (+ M q)) (<= N 1) (< 3 N))), 1263556#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 1263542#(and (or (= (+ (* 2 M) p) q) (not (< 1 N)) (< 3 N)) (or (<= N 2) (< 3 N))), 1263551#(and (or (not (< 1 N)) (< 3 N) (<= N L)) (or (not (< 1 N)) (< 3 N) (= (+ M p) (+ M q)))), 1263539#(and (or (= p (+ M q)) (< 1 N)) (or (<= N (+ L 1)) (< 3 N)) (or (not (< 1 N)) (= (+ (* 2 M) p) (+ M q)) (< 3 N)) (or (< 1 N) (<= (+ N 1) L))), 1263545#(and (or (= (+ (* 2 M) p) q) (not (< 0 N)) (< 3 N)) (or (<= N 2) (< 3 N)) (or (not (< 0 N)) (< 1 N))), 1263555#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 1263544#(and (or (not (< 1 N)) (= q (+ M p)) (< 3 N)) (or (not (< 1 N)) (<= N (+ L 1)) (< 3 N))), 1263562#(and (or (<= (+ N 4) L) (< 1 N)) (or (= p (* M 4)) (< 1 N)) (or (< 1 N) (= q 0))), 1263565#(and (or (not (< 1 N)) (< 3 N) (= (+ (* 2 M) q) p)) (or (<= (+ 2 N) L) (not (< 1 N)) (< 3 N)) (or (not (< 1 N)) (= (* 2 M) p) (< 3 N))), 1263537#(and (or (< 1 N) (= q p)) (or (= (+ (* 2 M) p) q) (not (< 1 N)) (< 3 N)) (or (<= N 0) (< 1 N)) (or (<= N 2) (< 3 N))), 1263534#(and (or (< 1 N) (= q p)) (or (<= N 0) (< 1 N))), 1263569#(and (or (not (< 1 N)) (= q 0)) (or (not (< 1 N)) (<= (* 2 M) p)) (or (<= (+ 2 N) L) (not (< 1 N))) (or (not (< 1 N)) (<= p (* 2 M)))), 1263557#(or (= (+ (* 3 M) q) p) (<= L 2) (< 3 L)), 1263563#(and (or (= (+ q (* M 4)) (+ (* 2 M) p)) (not (< 1 N)) (< 3 N)) (or (<= (+ 2 N) L) (< 3 N)) (or (<= (+ N 4) L) (< 1 N)) (or (= p (* M 4)) (< 1 N)) (or (not (< 1 N)) (= (+ (* 2 M) p) (* M 4)) (< 3 N)) (or (< 1 N) (= q 0)))] [2022-03-15 21:35:28,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-15 21:35:28,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:28,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-15 21:35:28,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=3802, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 21:35:28,235 INFO L87 Difference]: Start difference. First operand 63726 states and 245887 transitions. Second operand has 49 states, 48 states have (on average 2.6875) internal successors, (129), 48 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:58,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:58,993 INFO L93 Difference]: Finished difference Result 82103 states and 302018 transitions. [2022-03-15 21:35:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 313 states. [2022-03-15 21:35:58,994 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.6875) internal successors, (129), 48 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:35:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:59,319 INFO L225 Difference]: With dead ends: 82103 [2022-03-15 21:35:59,319 INFO L226 Difference]: Without dead ends: 81948 [2022-03-15 21:35:59,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49944 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=12959, Invalid=117001, Unknown=0, NotChecked=0, Total=129960 [2022-03-15 21:35:59,325 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1670 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 7360 mSolverCounterSat, 932 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 8292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 932 IncrementalHoareTripleChecker+Valid, 7360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:59,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1670 Valid, 3 Invalid, 8292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [932 Valid, 7360 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-03-15 21:35:59,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81948 states. [2022-03-15 21:36:01,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81948 to 64793. [2022-03-15 21:36:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64793 states, 64792 states have (on average 3.8566952710211138) internal successors, (249883), 64792 states have internal predecessors, (249883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64793 states to 64793 states and 249883 transitions. [2022-03-15 21:36:02,374 INFO L78 Accepts]: Start accepts. Automaton has 64793 states and 249883 transitions. Word has length 21 [2022-03-15 21:36:02,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:36:02,374 INFO L470 AbstractCegarLoop]: Abstraction has 64793 states and 249883 transitions. [2022-03-15 21:36:02,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.6875) internal successors, (129), 48 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 64793 states and 249883 transitions. [2022-03-15 21:36:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:36:02,440 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:36:02,440 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:36:02,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-03-15 21:36:02,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-15 21:36:02,655 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:36:02,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:36:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash 960440920, now seen corresponding path program 27 times [2022-03-15 21:36:02,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:36:02,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004677301] [2022-03-15 21:36:02,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:36:02,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:36:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:36:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:02,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:36:02,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004677301] [2022-03-15 21:36:02,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004677301] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:36:02,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559563666] [2022-03-15 21:36:02,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:36:02,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:02,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:36:02,852 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 21:36:02,863 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 21:36:02,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:36:02,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:36:02,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:36:02,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:36:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:03,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:36:03,559 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:03,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559563666] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:36:03,559 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:36:03,559 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-03-15 21:36:03,559 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1871422954] [2022-03-15 21:36:03,559 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:36:03,560 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:36:03,567 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 194 transitions. [2022-03-15 21:36:03,567 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:36:06,173 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [1476022#(and (or (= (+ (* 2 M) q) (+ (* 2 M) p)) (<= N 1)) (or (not (< 0 N)) (<= N L)) (or (not (< 0 N)) (< 1 N))), 1476003#(or (= (+ (* 3 M) q) p) (<= 4 L) (<= L 2)), 1476000#(or (< 0 L) (< 1 N) (= q p)), 1476030#(and (or (not (< 3 N)) (= q 0)) (or (not (< 3 N)) (<= N L)) (or (= (+ q (* M 4)) (+ p (* M 4))) (not (< 3 N)))), 1476024#(and (or (not (< 3 N)) (= (+ (* 2 M) q) (+ p (* M 4)))) (or (<= N (+ 2 L)) (<= N 3))), 1476011#(and (or (not (< 1 N)) (<= N (+ 2 L))) (or (= (+ (* 2 M) p) q) (not (< 1 N)))), 1476020#(and (or (= (+ (* 3 M) q) p) (not (< 1 L))) (or (<= (+ 3 N) L) (not (< 1 L)))), 1476029#(and (or (= (+ (* 3 M) q) (+ p (* M 4))) (not (< 3 N))) (or (<= N (+ L 1)) (<= N 3))), 1476010#(and (or (< 1 N) (= q p)) (or (< 1 N) (<= N L)) (or (= (+ (* 2 M) p) q) (not (< 1 N))) (<= N (+ 2 L))), 1476013#(and (or (not (< 0 N)) (< 1 N) (= q (+ M p))) (or (= (+ (* 2 M) p) q) (< 2 N) (<= N 1)) (or (< 4 N) (= (+ (* 3 M) p) q) (<= N 2))), 1475999#(or (< 1 N) (= q p)), 1476002#(or (<= 3 L) (< 1 N) (<= L 1) (= (+ (* 2 M) q) p)), 1476014#(and (or (not (< 0 N)) (< 1 N) (<= N L)) (or (not (< 0 N)) (< 1 N) (= q p)) (or (= (+ (* 2 M) p) q) (<= N 1)) (or (not (< 0 N)) (<= N (+ 2 L)))), 1476009#(and (or (= (+ (* 2 M) p) q) (not (< 1 N)) (< 2 N)) (or (< 4 N) (= (+ (* 3 M) p) q) (<= N 2))), 1476006#(or (<= L 3) (= (+ q (* M 4)) p) (<= 5 L) (< 1 N)), 1475997#(or (= p (+ M q)) (<= 2 L) (not (< 0 L))), 1476026#(and (or (= (+ q (* M 4)) (+ (* 2 M) p)) (<= N 1)) (or (not (< 0 N)) (= q 0)) (or (<= (+ 2 N) L) (not (< 0 N))) (or (not (< 0 N)) (< 1 N))), 1476023#(and (or (not (< 1 N)) (<= N L)) (or (not (< 1 N)) (= (+ (* 2 M) q) (+ (* 2 M) p)))), 1476028#(and (or (not (< 1 N)) (= q 0)) (or (not (< 1 N)) (<= (* 2 M) p)) (or (<= (+ 2 N) L) (not (< 1 N))) (or (not (< 1 N)) (<= p (* 2 M)))), 1476008#(and (or (< 0 N) (= q p)) (or (not (< 0 N)) (< 1 N) (= q (+ M p))) (or (= (+ (* 2 M) p) q) (not (< 1 N)) (< 2 N)) (or (< 4 N) (= (+ (* 3 M) p) q) (<= N 2))), 1476015#(and (or (not (< 0 N)) (<= N (+ L 1))) (or (= (+ (* 2 M) p) (+ M q)) (<= N 1)) (or (not (< 0 N)) (< 1 N))), 1476007#(and (or (< 0 N) (= q p)) (or (< 2 N) (not (< 0 N)) (= q (+ M p)))), 1476001#(or (< 1 L) (= p (+ M q)) (< 1 N) (not (< 0 L))), 1476021#(and (or (not (< 2 L)) (<= (+ N 4) L)) (or (not (< 2 L)) (= (+ q (* M 4)) p))), 1476012#(and (or (not (< 1 N)) (= (+ (* 2 M) p) (+ M q))) (or (not (< 1 N)) (<= N (+ L 1)))), 1476027#(and (or (not (< 1 N)) (<= (+ N 1) L)) (or (not (< 1 N)) (= (+ (* 3 M) q) (+ (* 2 M) p)))), 1476004#(or (= (+ (* 3 M) q) p) (<= 4 L) (< 1 N) (<= L 2)), 1476019#(and (or (<= (+ 2 N) L) (not (< 0 L))) (or (not (< 0 L)) (= (+ (* 2 M) q) p))), 1476016#(and (or (<= N 4) (= (+ p (* 5 M)) q) (< 6 N)) (or (< 4 N) (= q (+ p (* M 4))) (not (< 3 N)))), 1476025#(and (or (not (< 0 N)) (<= (+ N 1) L)) (or (= (+ (* 3 M) q) (+ (* 2 M) p)) (<= N 1)) (or (not (< 0 N)) (< 1 N))), 1475998#(or (<= 3 L) (<= L 1) (= (+ (* 2 M) q) p)), 1476017#(and (or (= q (+ p (* M 4))) (not (< 3 N))) (or (<= N (+ L 4)) (not (< 3 N)))), 1476018#(and (or (<= N (+ 3 L)) (<= N 3)) (or (= (+ M q) (+ p (* M 4))) (not (< 3 N)))), 1476005#(or (<= L 3) (= (+ q (* M 4)) p) (<= 5 L))] [2022-03-15 21:36:06,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 21:36:06,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:36:06,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 21:36:06,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=3188, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 21:36:06,174 INFO L87 Difference]: Start difference. First operand 64793 states and 249883 transitions. Second operand has 47 states, 46 states have (on average 3.130434782608696) internal successors, (144), 46 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:28,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:36:28,707 INFO L93 Difference]: Finished difference Result 103251 states and 378740 transitions. [2022-03-15 21:36:28,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2022-03-15 21:36:28,708 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.130434782608696) internal successors, (144), 46 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:36:28,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:36:29,368 INFO L225 Difference]: With dead ends: 103251 [2022-03-15 21:36:29,368 INFO L226 Difference]: Without dead ends: 102286 [2022-03-15 21:36:29,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 62 SyntacticMatches, 9 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34494 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=13419, Invalid=78693, Unknown=0, NotChecked=0, Total=92112 [2022-03-15 21:36:29,373 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1671 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 6072 mSolverCounterSat, 961 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1671 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 7033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 961 IncrementalHoareTripleChecker+Valid, 6072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:36:29,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1671 Valid, 17 Invalid, 7033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [961 Valid, 6072 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 21:36:29,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102286 states. [2022-03-15 21:36:32,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102286 to 72566. [2022-03-15 21:36:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72566 states, 72565 states have (on average 3.8505064424998277) internal successors, (279412), 72565 states have internal predecessors, (279412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72566 states to 72566 states and 279412 transitions. [2022-03-15 21:36:32,703 INFO L78 Accepts]: Start accepts. Automaton has 72566 states and 279412 transitions. Word has length 21 [2022-03-15 21:36:32,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:36:32,703 INFO L470 AbstractCegarLoop]: Abstraction has 72566 states and 279412 transitions. [2022-03-15 21:36:32,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.130434782608696) internal successors, (144), 46 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:32,704 INFO L276 IsEmpty]: Start isEmpty. Operand 72566 states and 279412 transitions. [2022-03-15 21:36:32,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:36:32,837 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:36:32,838 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:36:32,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-03-15 21:36:33,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-03-15 21:36:33,052 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:36:33,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:36:33,053 INFO L85 PathProgramCache]: Analyzing trace with hash -2013117520, now seen corresponding path program 28 times [2022-03-15 21:36:33,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:36:33,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305885478] [2022-03-15 21:36:33,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:36:33,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:36:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:36:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:33,154 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:36:33,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305885478] [2022-03-15 21:36:33,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305885478] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:36:33,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527649931] [2022-03-15 21:36:33,154 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:36:33,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:33,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:36:33,155 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 21:36:33,157 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 21:36:33,180 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:36:33,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:36:33,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 21:36:33,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:36:33,450 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:33,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:36:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:33,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527649931] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:36:33,682 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:36:33,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 24 [2022-03-15 21:36:33,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1811608405] [2022-03-15 21:36:33,682 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:36:33,683 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:36:33,689 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 194 transitions. [2022-03-15 21:36:33,689 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:36:34,730 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 39 new interpolants: [1725084#(or (<= (+ 2 N) L) (not (< 1 N))), 1725067#(and (or (not (< 0 N)) (<= (+ N 1) L)) (or (not (< 0 N)) (<= 2 N))), 1725055#(or (<= N 2) (<= 4 N)), 1725048#(or (< 1 L) (<= L 0)), 1725081#(or (< 0 N) (<= L 3) (< 4 L)), 1725078#(and (or (<= L 2) (<= 1 N)) (or (<= (+ 2 N) L) (<= L 2))), 1725058#(and (or (not (< 0 N)) (<= 2 N)) (or (<= N 2) (<= 4 N))), 1725060#(and (or (not (< 0 N)) (<= N (+ L 1))) (or (not (< 0 N)) (<= 2 N))), 1725071#(or (< 1 L) (<= L 0) (< 1 N)), 1725080#(or (<= L 3) (< 1 N) (< 4 L)), 1725076#(and (or (<= L 0) (<= N L)) (or (<= L 0) (<= 1 N))), 1725054#(and (or (not (< 2 N)) (<= 4 N)) (<= 2 N)), 1725049#(or (< 2 L) (<= L 1)), 1725064#(and (or (not (< 0 N)) (<= N L)) (or (not (< 0 N)) (<= 2 N))), 1725083#(and (or (<= (+ 2 N) L) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N))), 1725073#(or (<= L 2) (< 3 L)), 1725056#(or (not (< 1 N)) (<= N (+ 2 L))), 1725053#(and (or (not (< 1 N)) (<= 3 N)) (<= 1 N)), 1725077#(and (or (<= L 1) (<= 1 N)) (or (<= L 1) (<= (+ N 1) L))), 1725065#(or (not (< 1 N)) (<= N L)), 1725066#(or (<= N (+ 2 L)) (<= N 3)), 1725074#(or (< 1 N) (<= L 2) (< 3 L)), 1725047#(< 0 L), 1725057#(or (not (< 1 N)) (<= N (+ L 1))), 1725052#(< 1 N), 1725051#(or (< 0 N) (< 2 L) (<= L 1)), 1725079#(or (<= L 3) (< 4 L)), 1725059#(and (or (not (< 0 N)) (<= N (+ 2 L))) (or (not (< 0 N)) (<= 2 N))), 1725085#(or (<= N 3) (<= N L)), 1725072#(or (< 2 L) (< 1 N) (<= L 1)), 1725061#(or (<= N 4) (<= 6 N)), 1725070#(or (< 0 L) (< 1 N)), 1725082#(and (or (<= L 3) (<= (+ 3 N) L)) (or (<= L 3) (<= 1 N))), 1725069#(or (<= N (+ L 1)) (<= N 3)), 1725075#(or (< 0 N) (<= L 2) (< 3 L)), 1725062#(or (<= N (+ L 4)) (<= N 3)), 1725063#(or (<= N (+ 3 L)) (<= N 3)), 1725050#(or (<= 2 L) (<= L 0) (<= 1 N)), 1725068#(or (not (< 1 N)) (<= (+ N 1) L))] [2022-03-15 21:36:34,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 21:36:34,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:36:34,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 21:36:34,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=3397, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 21:36:34,732 INFO L87 Difference]: Start difference. First operand 72566 states and 279412 transitions. Second operand has 52 states, 52 states have (on average 2.8846153846153846) internal successors, (150), 51 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:46,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:36:46,278 INFO L93 Difference]: Finished difference Result 156041 states and 608392 transitions. [2022-03-15 21:36:46,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 379 states. [2022-03-15 21:36:46,278 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.8846153846153846) internal successors, (150), 51 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:36:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:36:47,216 INFO L225 Difference]: With dead ends: 156041 [2022-03-15 21:36:47,217 INFO L226 Difference]: Without dead ends: 155960 [2022-03-15 21:36:47,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 59 SyntacticMatches, 10 SemanticMatches, 411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71622 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=24807, Invalid=145349, Unknown=0, NotChecked=0, Total=170156 [2022-03-15 21:36:47,239 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1493 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 3054 mSolverCounterSat, 1230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 4284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1230 IncrementalHoareTripleChecker+Valid, 3054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:36:47,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1493 Valid, 1 Invalid, 4284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1230 Valid, 3054 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 21:36:47,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155960 states. [2022-03-15 21:36:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155960 to 87695. [2022-03-15 21:36:51,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87695 states, 87694 states have (on average 3.8971309325609504) internal successors, (341755), 87694 states have internal predecessors, (341755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87695 states to 87695 states and 341755 transitions. [2022-03-15 21:36:51,916 INFO L78 Accepts]: Start accepts. Automaton has 87695 states and 341755 transitions. Word has length 21 [2022-03-15 21:36:51,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:36:51,916 INFO L470 AbstractCegarLoop]: Abstraction has 87695 states and 341755 transitions. [2022-03-15 21:36:51,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.8846153846153846) internal successors, (150), 51 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:51,916 INFO L276 IsEmpty]: Start isEmpty. Operand 87695 states and 341755 transitions. [2022-03-15 21:36:52,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:36:52,266 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:36:52,266 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:36:52,283 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 21:36:52,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:52,475 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:36:52,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:36:52,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2129197316, now seen corresponding path program 29 times [2022-03-15 21:36:52,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:36:52,476 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730820545] [2022-03-15 21:36:52,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:36:52,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:36:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:36:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:52,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:36:52,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730820545] [2022-03-15 21:36:52,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730820545] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:36:52,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307328312] [2022-03-15 21:36:52,602 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:36:52,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:52,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:36:52,603 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 21:36:52,604 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 21:36:52,628 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:36:52,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:36:52,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:36:52,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:36:52,758 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:52,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:36:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:52,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307328312] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:36:52,960 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:36:52,960 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2022-03-15 21:36:52,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [248351928] [2022-03-15 21:36:52,961 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:36:52,962 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:36:52,967 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 157 transitions. [2022-03-15 21:36:52,967 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:36:55,465 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [2057358#(and (or (not (< 0 N)) (< q (+ M p 1))) (or (<= (+ M p) q) (not (< 0 N)))), 2057361#(and (or (not (< 1 N)) (< 2 N) (<= (+ (* 2 M) p) q)) (or (not (< 1 N)) (< 2 N) (< q (+ (* 2 M) p 1)))), 2057371#(and (or (< 4 N) (<= (+ (* 3 M) p) q) (<= N 3)) (or (< 4 N) (<= N 3) (<= q (+ (* 3 M) p)))), 2057255#(and (<= (+ (* 3 M) q) p) (<= p (+ (* 3 M) q))), 2057360#(and (or (not (< 0 N)) (< q (+ M p 1)) (< 1 N)) (or (<= (+ M p) q) (not (< 0 N)) (< 1 N))), 2057383#(and (or (<= p 0) (<= N 2)) (or (<= N 2) (= q 0)) (or (<= 0 p) (<= N 2))), 2057378#(= p (+ M q)), 2057369#(and (or (<= p q) (not (< 1 N)) (< 2 N)) (or (<= q p) (not (< 1 N)) (< 2 N))), 2057381#(and (or (not (< 0 N)) (<= (* 2 M) p)) (or (not (< 0 N)) (= q 0)) (or (not (< 0 N)) (<= p (* 2 M)))), 2057245#(= (+ (* 2 M) q) p), 2057379#(and (<= (+ q (* M 4)) p) (<= p (+ q (* M 4)))), 2057359#(and (< 0 N) (or (< q (+ M p 1)) (< 1 N)) (or (<= (+ M p) q) (< 1 N))), 2057370#(and (or (< 4 N) (< q (+ p (* M 4) 1)) (<= N 3)) (or (< 4 N) (<= (+ p (* M 4)) q) (<= N 3))), 2057372#(and (or (< 4 N) (<= q (+ (* 2 M) p)) (not (< 3 N))) (or (< 4 N) (not (< 3 N)) (<= (+ (* 2 M) p) q))), 2057382#(and (or (<= p 0) (<= N 2)) (or (not (< 0 N)) (< 1 N) (<= (* 2 M) p)) (or (not (< 0 N)) (<= p (* 2 M)) (< 1 N)) (or (<= N 2) (= q 0)) (or (not (< 0 N)) (< 1 N) (= q 0)) (or (<= 0 p) (<= N 2))), 2057374#(and (or (not (< 0 N)) (<= (+ (* 2 M) q) p)) (or (<= p (+ (* 2 M) q)) (not (< 0 N)))), 2057373#(and (< 0 N) (or (<= p (+ (* 2 M) q)) (< 1 N)) (or (<= (+ (* 2 M) q) p) (< 1 N))), 2057367#(and (< 0 N) (or (<= p (+ M q)) (< 1 N)) (or (<= (+ M q) p) (< 1 N))), 2057364#(and (or (<= p q) (not (< 0 N)) (< 1 N)) (or (<= q p) (not (< 0 N)) (< 1 N))), 2057377#(and (or (< 4 N) (not (< 3 N)) (<= q (+ M p))) (or (<= (+ M p) q) (< 4 N) (not (< 3 N)))), 2057362#(and (or (<= p q) (< 1 N)) (< 0 N) (or (<= q p) (< 1 N))), 2057376#(and (or (not (< 1 N)) (< 2 N) (<= (+ M q) p)) (or (not (< 1 N)) (< 2 N) (<= p (+ M q)))), 2057365#(and (or (< 2 N) (<= N 1) (<= q (+ M p))) (or (<= (+ M p) q) (< 2 N) (<= N 1))), 2057380#(and (< 0 N) (or (<= (* 3 M) p) (< 1 N)) (or (<= p (* 3 M)) (< 1 N)) (or (< 1 N) (= q 0))), 2057368#(and (or (not (< 0 N)) (<= p (+ M q)) (< 1 N)) (or (not (< 0 N)) (<= (+ M q) p) (< 1 N))), 2057366#(and (or (not (< 0 N)) (<= (+ M q) p)) (or (not (< 0 N)) (<= p (+ M q)))), 2057363#(and (or (<= q p) (not (< 0 N))) (or (<= p q) (not (< 0 N)))), 2057375#(and (or (<= p (+ (* 2 M) q)) (not (< 0 N)) (< 1 N)) (or (not (< 0 N)) (<= (+ (* 2 M) q) p) (< 1 N)))] [2022-03-15 21:36:55,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 21:36:55,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:36:55,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 21:36:55,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2047, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 21:36:55,466 INFO L87 Difference]: Start difference. First operand 87695 states and 341755 transitions. Second operand has 41 states, 40 states have (on average 2.825) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:00,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:37:00,584 INFO L93 Difference]: Finished difference Result 105767 states and 409078 transitions. [2022-03-15 21:37:00,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-03-15 21:37:00,584 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.825) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:37:00,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:37:01,068 INFO L225 Difference]: With dead ends: 105767 [2022-03-15 21:37:01,068 INFO L226 Difference]: Without dead ends: 105675 [2022-03-15 21:37:01,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 56 SyntacticMatches, 14 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2982 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1352, Invalid=9568, Unknown=0, NotChecked=0, Total=10920 [2022-03-15 21:37:01,069 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 397 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 4548 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 4818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 4548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:37:01,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 53 Invalid, 4818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 4548 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 21:37:01,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105675 states. [2022-03-15 21:37:04,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105675 to 99396. [2022-03-15 21:37:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99396 states, 99395 states have (on average 3.9072387947079834) internal successors, (388360), 99395 states have internal predecessors, (388360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:04,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99396 states to 99396 states and 388360 transitions. [2022-03-15 21:37:04,965 INFO L78 Accepts]: Start accepts. Automaton has 99396 states and 388360 transitions. Word has length 21 [2022-03-15 21:37:04,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:37:04,965 INFO L470 AbstractCegarLoop]: Abstraction has 99396 states and 388360 transitions. [2022-03-15 21:37:04,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.825) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 99396 states and 388360 transitions. [2022-03-15 21:37:05,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:37:05,326 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:37:05,326 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:37:05,342 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 21:37:05,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:37:05,542 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:37:05,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:37:05,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1360807688, now seen corresponding path program 30 times [2022-03-15 21:37:05,543 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:37:05,543 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285200216] [2022-03-15 21:37:05,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:37:05,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:37:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:37:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:05,620 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:37:05,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285200216] [2022-03-15 21:37:05,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285200216] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:37:05,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050865137] [2022-03-15 21:37:05,620 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:37:05,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:37:05,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:37:05,622 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 21:37:05,623 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 21:37:05,643 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 21:37:05,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:37:05,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 21:37:05,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:37:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:05,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:37:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:05,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050865137] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:37:05,869 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:37:05,869 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 23 [2022-03-15 21:37:05,869 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1439919553] [2022-03-15 21:37:05,869 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:37:05,870 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:37:05,876 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 174 transitions. [2022-03-15 21:37:05,876 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:37:07,045 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [2362226#(and (or (< 0 N) (<= (+ 2 N) L)) (<= (+ N 1) L)), 2362203#(or (<= 4 L) (<= L 2)), 2362217#(or (<= N (+ L 4)) (<= N 2)), 2362205#(or (<= 1 L) (< 1 N)), 2362214#(and (or (< 0 N) (<= N (+ L 1))) (<= N (+ 2 L))), 2362204#(< 1 N), 2362202#(or (<= 3 L) (<= L 1)), 2362210#(or (<= L 3) (<= 5 L) (< 1 N)), 2362201#(or (<= 2 L) (<= L 0)), 2362225#(or (<= N (+ 2 L)) (<= N 2)), 2362230#(and (or (<= (+ 2 N) L) (not (< 0 N)) (< 1 N)) (or (<= N 2) (<= N L))), 2362211#(not (< 1 N)), 2362231#(or (<= N (+ L 1)) (<= N 2)), 2362223#(or (not (< 0 N)) (<= N L)), 2362221#(or (<= N (+ 3 L)) (<= N 2)), 2362207#(or (<= 3 L) (< 1 N) (<= L 1)), 2362219#(or (not (< 0 N)) (<= N (+ L 1))), 2362208#(or (<= 4 L) (< 1 N) (<= L 2)), 2362215#(or (not (< 0 N)) (<= N (+ 2 L))), 2362220#(and (or (not (< 0 N)) (<= N (+ L 1)) (< 1 N)) (or (<= N (+ 3 L)) (<= N 2))), 2362227#(or (not (< 0 N)) (<= (+ N 1) L)), 2362213#(<= N 4), 2362209#(or (<= L 3) (<= 5 L)), 2362206#(or (<= 2 L) (<= L 0) (< 1 N)), 2362232#(or (<= N 2) (<= N L)), 2362212#(<= N 2), 2362229#(or (<= (+ 2 N) L) (not (< 0 N))), 2362216#(and (or (<= N (+ L 4)) (<= N 2)) (or (not (< 0 N)) (<= N (+ 2 L)) (< 1 N))), 2362218#(and (or (< 0 N) (<= N L)) (<= N (+ L 1))), 2362228#(and (or (<= N (+ L 1)) (<= N 2)) (or (not (< 0 N)) (< 1 N) (<= (+ N 1) L))), 2362222#(and (or (< 0 N) (<= (+ N 1) L)) (<= N L)), 2362224#(and (or (not (< 0 N)) (< 1 N) (<= N L)) (or (<= N (+ 2 L)) (<= N 2)))] [2022-03-15 21:37:07,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 21:37:07,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:37:07,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 21:37:07,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=2404, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 21:37:07,046 INFO L87 Difference]: Start difference. First operand 99396 states and 388360 transitions. Second operand has 43 states, 43 states have (on average 2.9767441860465116) internal successors, (128), 42 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:37:11,989 INFO L93 Difference]: Finished difference Result 210102 states and 828667 transitions. [2022-03-15 21:37:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-03-15 21:37:11,990 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.9767441860465116) internal successors, (128), 42 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:37:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:37:13,354 INFO L225 Difference]: With dead ends: 210102 [2022-03-15 21:37:13,354 INFO L226 Difference]: Without dead ends: 210057 [2022-03-15 21:37:13,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 60 SyntacticMatches, 12 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9280 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=5564, Invalid=20518, Unknown=0, NotChecked=0, Total=26082 [2022-03-15 21:37:13,358 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 724 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 630 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 630 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:37:13,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [724 Valid, 1 Invalid, 2458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [630 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:37:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210057 states. [2022-03-15 21:37:20,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210057 to 172949. [2022-03-15 21:37:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172949 states, 172948 states have (on average 3.9145581330804635) internal successors, (677015), 172948 states have internal predecessors, (677015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172949 states to 172949 states and 677015 transitions. [2022-03-15 21:37:21,381 INFO L78 Accepts]: Start accepts. Automaton has 172949 states and 677015 transitions. Word has length 21 [2022-03-15 21:37:21,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:37:21,381 INFO L470 AbstractCegarLoop]: Abstraction has 172949 states and 677015 transitions. [2022-03-15 21:37:21,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.9767441860465116) internal successors, (128), 42 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 172949 states and 677015 transitions. [2022-03-15 21:37:21,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:37:21,521 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:37:21,521 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:37:21,539 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 21:37:21,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-03-15 21:37:21,737 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:37:21,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:37:21,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2083187250, now seen corresponding path program 31 times [2022-03-15 21:37:21,738 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:37:21,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591538509] [2022-03-15 21:37:21,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:37:21,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:37:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:37:22,128 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:22,128 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:37:22,128 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591538509] [2022-03-15 21:37:22,128 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591538509] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:37:22,128 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727603102] [2022-03-15 21:37:22,128 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:37:22,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:37:22,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:37:22,129 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 21:37:22,132 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 21:37:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:37:22,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:37:22,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:37:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:22,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:37:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:22,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727603102] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:37:22,663 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:37:22,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2022-03-15 21:37:22,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [515549826] [2022-03-15 21:37:22,664 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:37:22,665 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:37:22,671 INFO L252 McrAutomatonBuilder]: Finished intersection with 101 states and 196 transitions. [2022-03-15 21:37:22,671 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:37:25,289 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [2918616#(and (or (not (< 0 N)) (<= p (+ M q)) (< 1 N)) (or (<= (+ M p) q) (<= N 1)) (or (<= N 1) (<= (+ L 1) N)) (or (not (< 0 N)) (<= (+ M q) p) (< 1 N)) (or (<= N 1) (<= q (+ M p))) (or (not (< 0 N)) (<= L (+ N 1)))), 2918602#(and (<= q (+ p (* M 4))) (<= (+ p (* M 4)) q) (<= 4 N)), 2918613#(and (or (<= q (+ p (* M 4))) (not (< 0 N))) (or (not (< 0 N)) (<= 4 N)) (or (not (< 0 N)) (<= (+ p (* M 4)) q))), 2918621#(or (<= L 3) (= (+ q (* M 4)) p) (< 4 L)), 2918609#(and (or (not (< 1 N)) (<= (+ 3 L) N)) (or (not (< 1 N)) (<= (+ (* 3 M) p) q)) (or (not (< 1 N)) (<= q (+ (* 3 M) p)))), 2918611#(and (or (not (< 1 N)) (<= q (+ M p))) (or (<= (+ M p) q) (not (< 1 N))) (or (not (< 1 N)) (<= (+ L 1) N))), 2918622#(or (<= L 3) (= (+ q (* M 4)) p) (< 1 N) (< 4 L)), 2918596#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 2918599#(or (< 0 L) (< 1 N) (= q p)), 2918608#(and (or (not (< 1 N)) (<= (+ p (* M 4)) q)) (or (not (< 1 N)) (<= 4 N)) (or (not (< 1 N)) (<= q (+ p (* M 4))))), 2918603#(and (or (not (< 1 N)) (<= (+ 3 L) N)) (or (< 1 N) (<= q (+ M p))) (or (<= (+ M p) q) (< 1 N)) (or (not (< 1 N)) (<= (+ (* 3 M) p) q)) (or (not (< 1 N)) (<= q (+ (* 3 M) p))) (<= (+ L 1) N)), 2918629#(and (or (<= L 2) (< (+ (* 2 M) q) (+ p 1))) (or (<= p (+ (* 2 M) q)) (<= L 2))), 2918614#(and (or (not (< 0 N)) (< 1 N) (<= q (+ M p))) (or (<= (+ M p) q) (not (< 0 N)) (< 1 N)) (or (not (< 0 N)) (<= L 0) (<= 4 N)) (or (<= (+ (* 3 M) p) q) (<= N 1)) (or (<= N 1) (<= q (+ (* 3 M) p))) (or (<= N 1) (<= (+ 3 L) N))), 2918624#(and (or (< 1 L) (< q (+ p 1)) (not (< 0 L))) (or (< 0 N) (< 1 L) (not (< 0 L))) (or (<= p q) (< 1 L) (not (< 0 L)))), 2918604#(and (or (<= p q) (< 1 N)) (or (not (< 1 N)) (<= (+ (* 2 M) p) q)) (or (not (< 1 N)) (<= q (+ (* 2 M) p))) (or (<= q p) (< 1 N)) (or (not (< 1 N)) (<= (+ 2 L) N)) (<= L N)), 2918600#(or (< 1 L) (= p (+ M q)) (< 1 N) (not (< 0 L))), 2918628#(and (or (<= p (+ M q)) (<= L 1)) (or (<= L 1) (< (+ M q) (+ p 1)))), 2918598#(or (< 1 N) (= q p)), 2918610#(and (or (not (< 1 N)) (<= (+ (* 2 M) p) q)) (or (not (< 1 N)) (<= q (+ (* 2 M) p))) (or (not (< 1 N)) (<= (+ 2 L) N))), 2918631#(and (or (not (< 1 N)) (= q 0)) (or (not (< 1 N)) (<= 0 p)) (or (= N L) (not (< 1 N))) (or (not (< 1 N)) (<= p 0))), 2918557#(and (or (not (< 0 N)) (and (< q (+ (* 2 M) p 1)) (<= (+ (* 2 M) p) q))) (or (< 0 N) (and (<= (+ M p) q) (< q (+ M p 1))))), 2918623#(and (or (< 0 L) (< q (+ M p 1))) (or (< 0 L) (< 0 N)) (or (<= (+ M p) q) (< 0 L))), 2918617#(and (or (<= N 1) (<= L N)) (or (<= 0 p) (<= N 1)) (or (not (< 0 N)) (= q 0)) (or (not (< 0 N)) (< 1 N) (<= (* 2 M) p)) (or (<= L (+ 2 N)) (not (< 0 N))) (or (<= p 0) (<= N 1)) (or (not (< 0 N)) (<= p (* 2 M)) (< 1 N))), 2918594#(or (< 0 L) (= q p)), 2918618#(and (or (not (< 1 N)) (= q 0)) (or (not (< 1 N)) (<= 0 p)) (or (not (< 1 N)) (<= p 0)) (or (not (< 1 N)) (<= L N))), 2918625#(and (or (< 2 L) (not (< 1 L)) (< (+ M q) (+ p 1))) (or (< 0 N) (< 2 L) (not (< 1 L))) (or (< 2 L) (<= p (+ M q)) (not (< 1 L)))), 2918612#(and (or (<= (+ p (* M 4)) q) (<= N 2)) (or (not (< 0 N)) (< 1 N) (<= (+ (* 2 M) p) q)) (or (< 2 N) (<= (+ (* 3 M) p) q) (<= N 1)) (or (< q (+ p (* M 4) 1)) (<= N 2)) (or (< 2 N) (<= N 1) (< q (+ (* 3 M) p 1))) (or (not (< 0 N)) (< q (+ (* 2 M) p 1)) (< 1 N))), 2918605#(and (or (<= p (+ M q)) (< 1 N)) (or (not (< 1 N)) (<= q (+ M p))) (or (<= (+ M p) q) (not (< 1 N))) (<= L (+ N 1)) (or (not (< 1 N)) (<= (+ L 1) N)) (or (<= (+ M q) p) (< 1 N))), 2918607#(and (or (<= (+ p (* M 4)) q) (<= N 2)) (or (< q (+ p (* M 4) 1)) (<= N 2)) (or (not (< 1 N)) (< 2 N) (< q (+ (* 3 M) p 1))) (or (not (< 1 N)) (< 2 N) (<= (+ (* 3 M) p) q))), 2918632#(and (or (<= L 3) (<= p (+ (* 3 M) q))) (or (< (+ (* 3 M) q) (+ p 1)) (<= L 3))), 2918606#(and (or (<= p (* 2 M)) (< 1 N)) (<= L (+ 2 N)) (or (< 1 N) (<= (* 2 M) p)) (or (not (< 1 N)) (<= 0 p)) (or (not (< 1 N)) (<= p 0)) (= q 0) (or (not (< 1 N)) (<= L N))), 2918601#(and (or (<= (+ p (* M 4)) q) (<= N 2)) (or (not (< 0 N)) (< 1 N) (<= (+ (* 2 M) p) q)) (or (<= (+ M p) q) (< 0 N)) (or (< q (+ p (* M 4) 1)) (<= N 2)) (or (not (< 1 N)) (< 2 N) (< q (+ (* 3 M) p 1))) (or (< 0 N) (< q (+ M p 1))) (or (not (< 1 N)) (< 2 N) (<= (+ (* 3 M) p) q)) (or (not (< 0 N)) (< q (+ (* 2 M) p 1)) (< 1 N))), 2918630#(and (or (< (+ (* 3 M) q) (+ p 1)) (not (< 3 L)) (< 4 L)) (or (< 0 N) (not (< 3 L)) (< 4 L)) (or (not (< 3 L)) (< 4 L) (<= p (+ (* 3 M) q)))), 2918619#(or (< 2 L) (< 1 N) (<= L 1) (= (+ (* 2 M) q) p)), 2918597#(or (= (+ (* 3 M) q) p) (<= L 2) (< 3 L)), 2918620#(or (= (+ (* 3 M) q) p) (< 1 N) (<= L 2) (< 3 L)), 2918615#(and (or (<= N 1) (<= (+ (* 2 M) p) q)) (or (not (< 0 N)) (<= L N)) (or (<= p q) (not (< 0 N)) (< 1 N)) (or (<= N 1) (<= (+ 2 L) N)) (or (<= q p) (not (< 0 N)) (< 1 N)) (or (<= q (+ (* 2 M) p)) (<= N 1))), 2918595#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 2918627#(and (or (< q (+ p 1)) (<= L 0)) (or (<= p q) (<= L 0))), 2918626#(and (or (not (< 2 L)) (< (+ (* 2 M) q) (+ p 1)) (< 3 L)) (or (not (< 2 L)) (<= p (+ (* 2 M) q)) (< 3 L)) (or (< 0 N) (not (< 2 L)) (< 3 L)))] [2022-03-15 21:37:25,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 21:37:25,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:37:25,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 21:37:25,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=3713, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 21:37:25,291 INFO L87 Difference]: Start difference. First operand 172949 states and 677015 transitions. Second operand has 52 states, 51 states have (on average 2.9411764705882355) internal successors, (150), 51 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:38:01,768 INFO L93 Difference]: Finished difference Result 235724 states and 890023 transitions. [2022-03-15 21:38:01,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 360 states. [2022-03-15 21:38:01,768 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.9411764705882355) internal successors, (150), 51 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:38:01,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:38:03,600 INFO L225 Difference]: With dead ends: 235724 [2022-03-15 21:38:03,601 INFO L226 Difference]: Without dead ends: 235376 [2022-03-15 21:38:03,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 397 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61618 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=14756, Invalid=144046, Unknown=0, NotChecked=0, Total=158802 [2022-03-15 21:38:03,612 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 1024 mSDsluCounter, 1644 mSDsCounter, 0 mSdLazyCounter, 10187 mSolverCounterSat, 944 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 11131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 944 IncrementalHoareTripleChecker+Valid, 10187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:38:03,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1024 Valid, 24 Invalid, 11131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [944 Valid, 10187 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-03-15 21:38:03,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235376 states. [2022-03-15 21:38:11,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235376 to 185916. [2022-03-15 21:38:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185916 states, 185915 states have (on average 3.9034935319904256) internal successors, (725718), 185915 states have internal predecessors, (725718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185916 states to 185916 states and 725718 transitions. [2022-03-15 21:38:12,773 INFO L78 Accepts]: Start accepts. Automaton has 185916 states and 725718 transitions. Word has length 21 [2022-03-15 21:38:12,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:38:12,773 INFO L470 AbstractCegarLoop]: Abstraction has 185916 states and 725718 transitions. [2022-03-15 21:38:12,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.9411764705882355) internal successors, (150), 51 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 185916 states and 725718 transitions. [2022-03-15 21:38:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:38:12,930 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:38:12,930 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:38:12,947 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 21:38:13,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-15 21:38:13,131 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:38:13,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:38:13,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1262937962, now seen corresponding path program 32 times [2022-03-15 21:38:13,133 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:38:13,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570893014] [2022-03-15 21:38:13,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:38:13,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:38:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:13,195 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:38:13,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570893014] [2022-03-15 21:38:13,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570893014] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:38:13,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048564066] [2022-03-15 21:38:13,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:38:13,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:13,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:38:13,197 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 21:38:13,199 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 21:38:13,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:38:13,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:38:13,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 21:38:13,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:38:13,600 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:13,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:38:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:13,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048564066] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:38:13,734 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:38:13,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 23 [2022-03-15 21:38:13,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [218689610] [2022-03-15 21:38:13,734 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:38:13,735 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:38:13,741 INFO L252 McrAutomatonBuilder]: Finished intersection with 101 states and 196 transitions. [2022-03-15 21:38:13,741 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:38:15,069 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [3527028#(and (or (<= N 1) (<= L N)) (or (<= (+ 2 N) L) (not (< 0 N)) (< 1 N)) (or (<= L (+ 2 N)) (not (< 0 N))) (or (not (< 0 N)) (<= N L))), 3527013#(and (or (<= N (+ 2 L)) (< 1 N)) (or (< 0 N) (<= N (+ L 1))) (<= N (+ L 4)) (or (<= N (+ 3 L)) (< 2 N))), 3527025#(and (<= L (+ 2 N)) (or (<= (+ 2 N) L) (< 1 N)) (or (not (< 1 N)) (<= L N)) (<= N L)), 3527006#(or (< 4 N) (not (< 2 N))), 3527011#(or (<= 1 L) (< 1 N)), 3527018#(and (or (not (< 1 N)) (<= N (+ L 4))) (or (<= N (+ 3 L)) (not (< 1 N)) (< 2 N))), 3527003#(< 1 N), 3527012#(or (<= 2 L) (<= L 0) (< 1 N)), 3527007#(or (<= N 4) (< 6 N)), 3527022#(or (<= N (+ 2 L)) (<= L 0)), 3527017#(or (<= 3 L) (< 1 N) (<= L 1)), 3527027#(or (<= 4 L) (< 1 N) (<= L 2)), 3527020#(or (<= L 3) (<= 5 L)), 3527014#(or (<= N (+ 3 L)) (<= (+ L 1) 0)), 3527023#(or (<= L 1) (<= (+ N 1) L)), 3527024#(or (<= N (+ L 1)) (<= L 1)), 3527019#(or (<= 4 L) (<= L 2)), 3527005#(or (not (< 1 N)) (< 3 N)), 3527026#(and (or (not (< 1 N)) (<= N L)) (or (not (< 1 N)) (<= L N))), 3527029#(or (<= L 3) (<= 5 L) (< 1 N)), 3527009#(or (<= N (+ L 1)) (<= (+ L 1) 0)), 3527004#(< 3 N), 3527008#(and (or (< 0 N) (<= N (+ L 1))) (<= N (+ 2 L))), 3527016#(or (<= 3 L) (<= L 1)), 3527021#(or (<= L 0) (<= N L)), 3527010#(or (<= 2 L) (<= L 0)), 3527015#(and (or (not (< 0 N)) (<= N (+ L 4))) (or (<= N (+ 3 L)) (< 2 N) (not (< 0 N))) (or (not (< 0 N)) (<= N (+ 2 L)) (< 1 N)))] [2022-03-15 21:38:15,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 21:38:15,070 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:38:15,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 21:38:15,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=2140, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:38:15,071 INFO L87 Difference]: Start difference. First operand 185916 states and 725718 transitions. Second operand has 38 states, 38 states have (on average 3.5) internal successors, (133), 37 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:38:22,426 INFO L93 Difference]: Finished difference Result 283506 states and 1119622 transitions. [2022-03-15 21:38:22,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2022-03-15 21:38:22,426 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.5) internal successors, (133), 37 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:38:22,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:38:24,281 INFO L225 Difference]: With dead ends: 283506 [2022-03-15 21:38:24,281 INFO L226 Difference]: Without dead ends: 283391 [2022-03-15 21:38:24,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 71 SyntacticMatches, 12 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11002 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=7051, Invalid=24455, Unknown=0, NotChecked=0, Total=31506 [2022-03-15 21:38:24,282 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 915 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 837 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 837 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:38:24,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [915 Valid, 1 Invalid, 2295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [837 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:38:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283391 states. [2022-03-15 21:38:31,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283391 to 103147. [2022-03-15 21:38:31,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103147 states, 103146 states have (on average 3.970323618947899) internal successors, (409523), 103146 states have internal predecessors, (409523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103147 states to 103147 states and 409523 transitions. [2022-03-15 21:38:32,166 INFO L78 Accepts]: Start accepts. Automaton has 103147 states and 409523 transitions. Word has length 21 [2022-03-15 21:38:32,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:38:32,166 INFO L470 AbstractCegarLoop]: Abstraction has 103147 states and 409523 transitions. [2022-03-15 21:38:32,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.5) internal successors, (133), 37 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:32,166 INFO L276 IsEmpty]: Start isEmpty. Operand 103147 states and 409523 transitions. [2022-03-15 21:38:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:38:32,248 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:38:32,248 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:38:32,266 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 21:38:32,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-03-15 21:38:32,467 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:38:32,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:38:32,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1504576072, now seen corresponding path program 33 times [2022-03-15 21:38:32,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:38:32,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611794416] [2022-03-15 21:38:32,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:38:32,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:38:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:32,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:38:32,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611794416] [2022-03-15 21:38:32,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611794416] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:38:32,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136814176] [2022-03-15 21:38:32,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:38:32,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:32,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:38:32,587 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 21:38:32,587 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 21:38:32,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:38:32,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:38:32,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:38:32,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:38:33,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:33,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:38:33,451 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:33,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136814176] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:38:33,452 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:38:33,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-03-15 21:38:33,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [169397839] [2022-03-15 21:38:33,452 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:38:33,453 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:38:33,459 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 179 transitions. [2022-03-15 21:38:33,459 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:38:36,405 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [4017243#(and (or (< 2 L) (not (< 1 L)) (< (+ M q) (+ p 1))) (or (< 0 N) (< 2 L) (not (< 1 L))) (or (< 2 L) (<= p (+ M q)) (not (< 1 L)))), 4017253#(and (or (< 0 N) (< 1 L) (not (< 0 L))) (or (< 1 L) (< q (+ p 1)) (< 1 N) (not (< 0 L))) (or (<= p q) (< 1 L) (< 1 N) (not (< 0 L)))), 4017242#(and (or (< 1 L) (< q (+ p 1)) (not (< 0 L))) (or (< 0 N) (< 1 L) (not (< 0 L))) (or (<= p q) (< 1 L) (not (< 0 L)))), 4017245#(and (or (not (< 1 N)) (<= (+ 3 L) N)) (or (not (< 1 N)) (<= (+ (* 3 M) p) q)) (or (not (< 1 N)) (<= q (+ (* 3 M) p)))), 4017257#(and (or (< 1 L) (< q (+ p 1)) (not (< 0 L))) (or (<= p q) (< 1 L) (not (< 0 L)))), 4017264#(and (or (<= 3 N) (< 2 L) (not (< 1 L))) (or (<= (+ M p) q) (< 2 L) (not (< 1 L))) (or (< 2 L) (not (< 1 L)) (<= q (+ M p)))), 4017233#(or (< 0 L) (= q p)), 4017261#(and (or (< (+ (* 3 M) q) (+ p 1)) (not (< 3 L)) (< 1 N) (< 4 L)) (or (not (< 3 L)) (< 1 N) (< 4 L) (<= p (+ (* 3 M) q))) (or (< 0 N) (<= L 3) (< 4 L))), 4017235#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 4017247#(or (= (+ (* 3 M) q) p) (<= L 2) (< 3 L)), 4017267#(and (or (not (< 1 N)) (<= q (+ M p))) (or (<= (+ M p) q) (not (< 1 N))) (or (not (< 1 N)) (<= (+ L 1) N))), 4017259#(and (or (not (< 2 L)) (< (+ (* 2 M) q) (+ p 1)) (< 3 L)) (or (not (< 2 L)) (<= p (+ (* 2 M) q)) (< 3 L))), 4017262#(and (or (< 0 L) (<= (+ (* 3 M) p) q)) (or (< 0 L) (<= 3 N)) (or (< 0 L) (<= q (+ (* 3 M) p)))), 4017256#(and (or (< 0 L) (< q (+ M p 1))) (or (<= (+ M p) q) (< 0 L))), 4017250#(and (or (< (+ (* 3 M) q) (+ p 1)) (not (< 3 L)) (< 4 L)) (or (< 0 N) (not (< 3 L)) (< 4 L)) (or (not (< 3 L)) (< 4 L) (<= p (+ (* 3 M) q)))), 4017238#(and (or (not (< 0 N)) (<= (+ 2 L) N)) (or (not (< 0 N)) (<= q (+ (* 2 M) p))) (or (not (< 0 N)) (<= 2 N)) (or (not (< 0 N)) (<= (+ (* 2 M) p) q))), 4017252#(and (or (< 0 L) (< q (+ M p 1)) (< 1 N)) (or (<= (+ M p) q) (< 0 L) (< 1 N)) (or (< 0 L) (< 0 N))), 4017246#(and (or (not (< 1 N)) (<= (+ (* 2 M) p) q)) (or (not (< 1 N)) (<= q (+ (* 2 M) p))) (or (not (< 1 N)) (<= (+ 2 L) N))), 4017260#(and (or (< (+ (* 3 M) q) (+ p 1)) (not (< 3 L)) (< 4 L)) (or (not (< 3 L)) (< 4 L) (<= p (+ (* 3 M) q)))), 4017255#(and (or (< 0 N) (<= L 2) (< 3 L)) (or (not (< 2 L)) (< 1 N) (< (+ (* 2 M) q) (+ p 1)) (< 3 L)) (or (not (< 2 L)) (<= p (+ (* 2 M) q)) (< 1 N) (< 3 L))), 4017236#(and (or (<= q (+ p (* M 4))) (not (< 0 N))) (or (not (< 0 N)) (<= 4 N)) (or (not (< 0 N)) (<= (+ p (* M 4)) q))), 4017263#(and (or (<= 3 N) (< 1 L) (not (< 0 L))) (or (< 1 L) (not (< 0 L)) (<= (+ (* 2 M) p) q)) (or (< 1 L) (<= q (+ (* 2 M) p)) (not (< 0 L)))), 4017251#(and (< 0 N) (or (< q (+ M p 1)) (< 1 N)) (or (<= (+ M p) q) (< 1 N))), 4017237#(and (or (not (< 0 N)) (<= (+ 3 L) N)) (or (not (< 0 N)) (<= q (+ (* 3 M) p))) (or (not (< 0 N)) (<= 2 N)) (or (not (< 0 N)) (<= (+ (* 3 M) p) q))), 4017268#(and (or (<= q p) (not (< 1 N))) (or (<= p q) (not (< 1 N))) (or (= N L) (not (< 1 N)))), 4017241#(and (or (< 0 L) (< q (+ M p 1))) (or (< 0 L) (< 0 N)) (or (<= (+ M p) q) (< 0 L))), 4017239#(and (or (not (< 0 N)) (<= (+ L 1) N)) (or (not (< 0 N)) (<= q (+ M p))) (or (not (< 0 N)) (<= 2 N)) (or (<= (+ M p) q) (not (< 0 N)))), 4017254#(and (or (< 2 L) (<= p (+ M q)) (not (< 1 L)) (< 1 N)) (or (< 2 L) (not (< 1 L)) (< 1 N) (< (+ M q) (+ p 1))) (or (< 0 N) (< 2 L) (<= L 1))), 4017240#(and (or (<= q p) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N)) (or (= N L) (not (< 0 N))) (or (<= p q) (not (< 0 N)))), 4017234#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 4017244#(and (or (not (< 1 N)) (<= (+ p (* M 4)) q)) (or (not (< 1 N)) (<= 4 N)) (or (not (< 1 N)) (<= q (+ p (* M 4))))), 4017249#(or (<= L 3) (= (+ q (* M 4)) p) (< 4 L)), 4017258#(and (or (< 2 L) (not (< 1 L)) (< (+ M q) (+ p 1))) (or (< 2 L) (<= p (+ M q)) (not (< 1 L)))), 4017266#(and (or (not (< 3 L)) (<= (+ M q) p) (< 4 L)) (or (<= 3 N) (not (< 3 L)) (< 4 L)) (or (not (< 3 L)) (<= p (+ M q)) (< 4 L))), 4017265#(and (or (not (< 2 L)) (<= 3 N) (< 3 L)) (or (<= p q) (not (< 2 L)) (< 3 L)) (or (not (< 2 L)) (<= q p) (< 3 L))), 4017248#(and (or (not (< 2 L)) (< (+ (* 2 M) q) (+ p 1)) (< 3 L)) (or (not (< 2 L)) (<= p (+ (* 2 M) q)) (< 3 L)) (or (< 0 N) (not (< 2 L)) (< 3 L)))] [2022-03-15 21:38:36,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-15 21:38:36,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:38:36,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-15 21:38:36,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=3474, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 21:38:36,406 INFO L87 Difference]: Start difference. First operand 103147 states and 409523 transitions. Second operand has 48 states, 47 states have (on average 2.9361702127659575) internal successors, (138), 47 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:14,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:14,332 INFO L93 Difference]: Finished difference Result 134462 states and 511563 transitions. [2022-03-15 21:39:14,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 378 states. [2022-03-15 21:39:14,333 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.9361702127659575) internal successors, (138), 47 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:39:14,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:14,913 INFO L225 Difference]: With dead ends: 134462 [2022-03-15 21:39:14,913 INFO L226 Difference]: Without dead ends: 134242 [2022-03-15 21:39:14,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 406 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63568 ImplicationChecksByTransitivity, 34.3s TimeCoverageRelationStatistics Valid=12582, Invalid=153474, Unknown=0, NotChecked=0, Total=166056 [2022-03-15 21:39:14,920 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 1043 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 8697 mSolverCounterSat, 1007 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 9704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1007 IncrementalHoareTripleChecker+Valid, 8697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:14,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1043 Valid, 25 Invalid, 9704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1007 Valid, 8697 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-03-15 21:39:15,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134242 states. [2022-03-15 21:39:18,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134242 to 103694. [2022-03-15 21:39:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103694 states, 103693 states have (on average 3.96880213707772) internal successors, (411537), 103693 states have internal predecessors, (411537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103694 states to 103694 states and 411537 transitions. [2022-03-15 21:39:19,200 INFO L78 Accepts]: Start accepts. Automaton has 103694 states and 411537 transitions. Word has length 21 [2022-03-15 21:39:19,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:19,200 INFO L470 AbstractCegarLoop]: Abstraction has 103694 states and 411537 transitions. [2022-03-15 21:39:19,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.9361702127659575) internal successors, (138), 47 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:19,200 INFO L276 IsEmpty]: Start isEmpty. Operand 103694 states and 411537 transitions. [2022-03-15 21:39:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:39:19,623 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:19,623 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:19,639 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 21:39:19,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:19,824 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:39:19,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:19,825 INFO L85 PathProgramCache]: Analyzing trace with hash -724400520, now seen corresponding path program 34 times [2022-03-15 21:39:19,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:19,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742654163] [2022-03-15 21:39:19,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:19,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:19,950 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:19,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742654163] [2022-03-15 21:39:19,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742654163] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:19,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688766241] [2022-03-15 21:39:19,950 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:39:19,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:19,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:19,951 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 21:39:19,953 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 21:39:19,980 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:39:19,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:19,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:39:19,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:20,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:20,511 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:20,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688766241] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:20,511 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:20,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2022-03-15 21:39:20,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [173513792] [2022-03-15 21:39:20,511 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:20,512 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:20,519 INFO L252 McrAutomatonBuilder]: Finished intersection with 101 states and 196 transitions. [2022-03-15 21:39:20,519 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:22,993 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [4359985#(and (or (not (< 0 N)) (<= (+ 2 L) N)) (or (<= (* 2 M) q) (not (< 0 N))) (or (<= q (* 2 M)) (not (< 0 N))) (or (= p 0) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N))), 4359957#(or (< 0 L) (= q p)), 4359962#(or (< 0 L) (< 1 N) (= q p)), 4359960#(and (or (not (< 0 N)) (<= 4 N)) (or (not (< 0 N)) (<= (* M 4) q)) (or (<= q (* M 4)) (not (< 0 N))) (or (= p 0) (not (< 0 N)))), 4359982#(and (or (not (< 1 N)) (= p 0)) (or (not (< 1 N)) (<= q M)) (or (not (< 1 N)) (<= (+ L 1) N)) (or (not (< 1 N)) (<= M q))), 4359966#(and (or (<= (+ M p) q) (< 1 L) (not (< 0 L))) (or (< 1 L) (<= 2 N) (not (< 0 L))) (or (< 1 L) (< q (+ M p 1)) (not (< 0 L)))), 4359965#(and (or (< 0 L) (<= 2 N)) (or (< 0 L) (< q (+ (* 2 M) p 1))) (or (< 0 L) (<= (+ (* 2 M) p) q))), 4359964#(or (< 2 L) (< 1 N) (<= L 1) (= (+ (* 2 M) q) p)), 4359974#(and (or (not (< 2 L)) (<= 3 N) (< 3 L)) (or (<= p q) (not (< 2 L)) (< 3 L)) (or (not (< 2 L)) (<= q p) (< 3 L))), 4359981#(and (or (not (< 1 N)) (<= (* 2 M) q)) (or (not (< 1 N)) (= p 0)) (or (not (< 1 N)) (<= q (* 2 M))) (or (not (< 1 N)) (<= (+ 2 L) N))), 4359973#(and (or (<= 3 N) (< 2 L) (not (< 1 L))) (or (<= (+ M p) q) (< 2 L) (not (< 1 L))) (or (< 2 L) (not (< 1 L)) (<= q (+ M p)))), 4359980#(and (or (not (< 1 N)) (<= (+ 3 L) N)) (or (not (< 1 N)) (= p 0)) (or (not (< 1 N)) (<= q (* 3 M))) (or (not (< 1 N)) (<= (* 3 M) q))), 4359967#(and (or (<= p q) (< 2 L) (not (< 1 L))) (or (< 2 L) (not (< 1 L)) (< q (+ p 1))) (or (<= 2 N) (< 2 L) (not (< 1 L)))), 4359959#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 4359977#(and (or (not (< 3 L)) (<= 2 N) (< 4 L)) (or (not (< 3 L)) (< 4 L) (< (+ (* 2 M) q) (+ p 1))) (or (<= p (+ (* 2 M) q)) (not (< 3 L)) (< 4 L))), 4359976#(or (<= L 3) (= (+ q (* M 4)) p) (< 1 N) (< 4 L)), 4359978#(and (or (not (< 3 L)) (<= (+ M q) p) (< 4 L)) (or (<= 3 N) (not (< 3 L)) (< 4 L)) (or (not (< 3 L)) (<= p (+ M q)) (< 4 L))), 4359975#(or (<= L 3) (= (+ q (* M 4)) p) (< 4 L)), 4359979#(and (or (not (< 1 N)) (= p 0)) (or (not (< 1 N)) (<= 4 N)) (or (not (< 1 N)) (<= (* M 4) q)) (or (not (< 1 N)) (<= q (* M 4)))), 4359963#(or (< 1 L) (= p (+ M q)) (< 1 N) (not (< 0 L))), 4359968#(or (= (+ (* 3 M) q) p) (<= L 2) (< 3 L)), 4359983#(and (or (not (< 1 N)) (<= 0 q)) (or (not (< 1 N)) (= p 0)) (or (= N L) (not (< 1 N))) (or (not (< 1 N)) (<= q 0))), 4359969#(or (= (+ (* 3 M) q) p) (< 1 N) (<= L 2) (< 3 L)), 4359961#(or (< 1 N) (= q p)), 4359972#(and (or (<= 3 N) (< 1 L) (not (< 0 L))) (or (< 1 L) (not (< 0 L)) (<= (+ (* 2 M) p) q)) (or (< 1 L) (<= q (+ (* 2 M) p)) (not (< 0 L)))), 4359987#(and (or (= p 0) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N)) (or (= N L) (not (< 0 N))) (or (<= 0 q) (not (< 0 N))) (or (not (< 0 N)) (<= q 0))), 4359958#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 4359986#(and (or (<= q M) (not (< 0 N))) (or (not (< 0 N)) (<= (+ L 1) N)) (or (not (< 0 N)) (<= M q)) (or (= p 0) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N))), 4359971#(and (or (< 0 L) (<= (+ (* 3 M) p) q)) (or (< 0 L) (<= 3 N)) (or (< 0 L) (<= q (+ (* 3 M) p)))), 4359984#(and (or (not (< 0 N)) (<= q (* 3 M))) (or (<= (* 3 M) q) (not (< 0 N))) (or (not (< 0 N)) (<= (+ 3 L) N)) (or (= p 0) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N))), 4359970#(and (or (not (< 2 L)) (< 3 L) (< (+ M q) (+ p 1))) (or (not (< 2 L)) (<= p (+ M q)) (< 3 L)) (or (not (< 2 L)) (<= 2 N) (< 3 L)))] [2022-03-15 21:39:22,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 21:39:22,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:22,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 21:39:22,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2884, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 21:39:22,994 INFO L87 Difference]: Start difference. First operand 103694 states and 411537 transitions. Second operand has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 41 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:32,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:32,903 INFO L93 Difference]: Finished difference Result 128035 states and 491022 transitions. [2022-03-15 21:39:32,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2022-03-15 21:39:32,903 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 41 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:39:32,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:33,560 INFO L225 Difference]: With dead ends: 128035 [2022-03-15 21:39:33,561 INFO L226 Difference]: Without dead ends: 128014 [2022-03-15 21:39:33,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13338 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=3844, Invalid=37976, Unknown=0, NotChecked=0, Total=41820 [2022-03-15 21:39:33,562 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 686 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 4466 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 4910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 4466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:33,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [686 Valid, 18 Invalid, 4910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 4466 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 21:39:33,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128014 states. [2022-03-15 21:39:37,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128014 to 103743. [2022-03-15 21:39:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103743 states, 103742 states have (on average 3.968489136511731) internal successors, (411699), 103742 states have internal predecessors, (411699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103743 states to 103743 states and 411699 transitions. [2022-03-15 21:39:38,039 INFO L78 Accepts]: Start accepts. Automaton has 103743 states and 411699 transitions. Word has length 21 [2022-03-15 21:39:38,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:38,039 INFO L470 AbstractCegarLoop]: Abstraction has 103743 states and 411699 transitions. [2022-03-15 21:39:38,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 41 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:38,040 INFO L276 IsEmpty]: Start isEmpty. Operand 103743 states and 411699 transitions. [2022-03-15 21:39:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:39:38,137 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:38,137 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:38,153 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 21:39:38,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:38,353 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:39:38,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:38,354 INFO L85 PathProgramCache]: Analyzing trace with hash 279799408, now seen corresponding path program 35 times [2022-03-15 21:39:38,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:38,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955919037] [2022-03-15 21:39:38,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:38,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:38,498 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:38,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955919037] [2022-03-15 21:39:38,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955919037] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:38,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920592384] [2022-03-15 21:39:38,498 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:39:38,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:38,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:38,499 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:39:38,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 21:39:38,525 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:39:38,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:38,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:39:38,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:39:38,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:39:38,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920592384] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:38,848 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:38,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2022-03-15 21:39:38,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [389368187] [2022-03-15 21:39:38,849 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:38,850 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:38,855 INFO L252 McrAutomatonBuilder]: Finished intersection with 89 states and 161 transitions. [2022-03-15 21:39:38,855 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:40,130 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [4695960#(and (< 1 N) (= q (+ M p))), 4695950#(= (+ (* 3 M) q) p), 4695948#(= (+ (* 2 M) q) p), 4695954#(and (< 0 N) (or (= p (+ M q)) (< 1 N))), 4695962#(and (= p (+ M q)) (< 1 N)), 4695964#(and (or (not (< 0 N)) (<= q (* 3 M))) (or (<= (* 3 M) q) (not (< 0 N))) (or (= p 0) (not (< 0 N)))), 4695959#(and (= (+ (* 2 M) p) q) (< 1 N)), 4695951#(and (< 0 N) (= (+ (* 2 M) q) p)), 4695967#(and (or (not (< 0 N)) (= q 0)) (or (= p 0) (not (< 0 N)))), 4695968#(and (<= q (+ (* 2 M) p)) (<= (+ (* 2 M) p) q)), 4695958#(and (< 0 N) (or (= (+ (* 3 M) q) p) (< 1 N))), 4695966#(and (or (<= q M) (not (< 0 N))) (or (not (< 0 N)) (<= M q)) (or (= p 0) (not (< 0 N)))), 4695961#(and (< 1 N) (= q p)), 4695956#(= (+ q (* M 4)) p), 4695953#(and (< 0 N) (or (< 1 N) (= q p))), 4695957#(and (< 0 N) (= (+ (* 3 M) q) p)), 4695949#(and (< 0 N) (= p (+ M q))), 4695963#(and (or (not (< 0 N)) (<= (* M 4) q)) (or (<= q (* M 4)) (not (< 0 N))) (or (= p 0) (not (< 0 N)))), 4695952#(and (< 0 N) (or (< q (+ M p 1)) (< 1 N)) (or (<= (+ M p) q) (< 1 N))), 4695955#(and (< 0 N) (or (< 1 N) (= (+ (* 2 M) q) p))), 4695830#(and (< 0 N) (= q p)), 4695965#(and (or (<= (* 2 M) q) (not (< 0 N))) (or (<= q (* 2 M)) (not (< 0 N))) (or (= p 0) (not (< 0 N)))), 4695947#(= p (+ M q))] [2022-03-15 21:39:40,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:39:40,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:40,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:39:40,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1729, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 21:39:40,132 INFO L87 Difference]: Start difference. First operand 103743 states and 411699 transitions. Second operand has 36 states, 35 states have (on average 3.1714285714285713) internal successors, (111), 35 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:43,605 INFO L93 Difference]: Finished difference Result 115679 states and 454190 transitions. [2022-03-15 21:39:43,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 21:39:43,606 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.1714285714285713) internal successors, (111), 35 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:39:43,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:44,128 INFO L225 Difference]: With dead ends: 115679 [2022-03-15 21:39:44,128 INFO L226 Difference]: Without dead ends: 115616 [2022-03-15 21:39:44,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 59 SyntacticMatches, 17 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=441, Invalid=4389, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 21:39:44,133 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 213 mSDsluCounter, 1844 mSDsCounter, 0 mSdLazyCounter, 4992 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 5095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 4992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:44,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 83 Invalid, 5095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 4992 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 21:39:44,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115616 states. [2022-03-15 21:39:47,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115616 to 109773. [2022-03-15 21:39:47,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109773 states, 109772 states have (on average 3.962185256713916) internal successors, (434937), 109772 states have internal predecessors, (434937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109773 states to 109773 states and 434937 transitions. [2022-03-15 21:39:48,479 INFO L78 Accepts]: Start accepts. Automaton has 109773 states and 434937 transitions. Word has length 21 [2022-03-15 21:39:48,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:48,480 INFO L470 AbstractCegarLoop]: Abstraction has 109773 states and 434937 transitions. [2022-03-15 21:39:48,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.1714285714285713) internal successors, (111), 35 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 109773 states and 434937 transitions. [2022-03-15 21:39:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:39:48,614 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:48,614 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:48,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-15 21:39:48,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:48,829 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:39:48,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:48,829 INFO L85 PathProgramCache]: Analyzing trace with hash -675018834, now seen corresponding path program 36 times [2022-03-15 21:39:48,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:48,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787477362] [2022-03-15 21:39:48,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:48,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:48,983 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:48,983 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:48,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787477362] [2022-03-15 21:39:48,983 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787477362] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:48,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086733677] [2022-03-15 21:39:48,983 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:39:48,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:48,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:48,984 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:39:48,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-15 21:39:49,006 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:39:49,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:49,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:39:49,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:49,139 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:49,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:49,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086733677] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:49,468 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:49,468 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2022-03-15 21:39:49,468 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [639686074] [2022-03-15 21:39:49,468 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:49,469 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:49,475 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 163 transitions. [2022-03-15 21:39:49,475 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:52,628 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [5031406#(and (or (not (< 1 N)) (<= 3 N)) (or (not (< 1 N)) (<= (+ (* 3 M) p) q)) (or (not (< 1 N)) (<= q (+ (* 3 M) p)))), 5031415#(and (or (not (< 1 N)) (not (< 3 L)) (<= p (+ M q)) (< 4 L)) (or (not (< 1 N)) (<= 3 N) (not (< 3 L)) (< 4 L)) (or (not (< 1 N)) (not (< 3 L)) (<= (+ M q) p) (< 4 L))), 5031398#(or (= (+ (* 3 M) q) p) (<= L 2) (< 3 L)), 5031416#(and (or (<= q M) (not (< 0 N))) (or (not (< 0 N)) (<= (+ L 1) N)) (or (not (< 0 N)) (<= M q)) (or (= p 0) (not (< 0 N)))), 5031410#(and (or (not (< 2 L)) (<= q p) (not (< 1 N)) (< 3 L)) (or (<= p q) (not (< 2 L)) (not (< 1 N)) (< 3 L)) (or (not (< 2 L)) (not (< 1 N)) (<= 3 N) (< 3 L))), 5031397#(and (or (< 2 L) (not (< 1 L)) (< (+ M q) (+ p 1))) (or (< 2 L) (not (< 1 L)) (<= 1 N)) (or (< 2 L) (<= p (+ M q)) (not (< 1 L)))), 5031404#(and (or (<= 3 N) (< 2 L) (not (< 1 L))) (or (<= (+ M p) q) (< 2 L) (not (< 1 L))) (or (< 2 L) (not (< 1 L)) (<= q (+ M p)))), 5031395#(and (or (< 0 L) (< q (+ M p 1))) (or (< 0 L) (<= 1 N)) (or (<= (+ M p) q) (< 0 L))), 5031413#(and (or (not (< 0 N)) (<= q (* 3 M))) (or (<= (* 3 M) q) (not (< 0 N))) (or (not (< 0 N)) (<= (+ 3 L) N)) (or (= p 0) (not (< 0 N)))), 5031399#(and (or (not (< 2 L)) (< (+ (* 2 M) q) (+ p 1)) (< 3 L)) (or (not (< 2 L)) (<= 1 N) (< 3 L)) (or (not (< 2 L)) (<= p (+ (* 2 M) q)) (< 3 L))), 5031402#(and (or (< 0 L) (<= (+ (* 3 M) p) q)) (or (< 0 L) (<= 3 N)) (or (< 0 L) (<= q (+ (* 3 M) p)))), 5031408#(and (or (not (< 1 N)) (< 1 L) (<= q (+ (* 2 M) p)) (not (< 0 L))) (or (not (< 1 N)) (< 1 L) (not (< 0 L)) (<= (+ (* 2 M) p) q)) (or (not (< 1 N)) (<= 3 N) (< 1 L) (not (< 0 L)))), 5031411#(and (or (not (< 3 L)) (<= (+ M q) p) (< 4 L)) (or (<= 3 N) (not (< 3 L)) (< 4 L)) (or (not (< 3 L)) (<= p (+ M q)) (< 4 L))), 5031417#(and (or (not (< 0 N)) (= q 0)) (or (= p 0) (not (< 0 N))) (or (= N L) (not (< 0 N)))), 5031396#(and (or (< 1 L) (< q (+ p 1)) (not (< 0 L))) (or (<= p q) (< 1 L) (not (< 0 L))) (or (< 1 L) (not (< 0 L)) (<= 1 N))), 5031401#(and (or (< (+ (* 3 M) q) (+ p 1)) (not (< 3 L)) (< 4 L)) (or (not (< 3 L)) (< 4 L) (<= 1 N)) (or (not (< 3 L)) (< 4 L) (<= p (+ (* 3 M) q)))), 5031403#(and (or (<= 3 N) (< 1 L) (not (< 0 L))) (or (< 1 L) (not (< 0 L)) (<= (+ (* 2 M) p) q)) (or (< 1 L) (<= q (+ (* 2 M) p)) (not (< 0 L)))), 5031412#(and (or (not (< 0 N)) (<= 4 N)) (or (not (< 0 N)) (<= (* M 4) q)) (or (<= q (* M 4)) (not (< 0 N))) (or (= p 0) (not (< 0 N)))), 5031409#(and (or (not (< 1 N)) (<= 3 N) (< 2 L) (not (< 1 L))) (or (<= (+ M p) q) (not (< 1 N)) (< 2 L) (not (< 1 L))) (or (not (< 1 N)) (< 2 L) (not (< 1 L)) (<= q (+ M p)))), 5031407#(and (or (< 0 L) (not (< 1 N)) (<= (+ (* 3 M) p) q)) (or (< 0 L) (not (< 1 N)) (<= 3 N)) (or (< 0 L) (not (< 1 N)) (<= q (+ (* 3 M) p)))), 5031393#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 5031414#(and (or (not (< 0 N)) (<= (+ 2 L) N)) (or (<= (* 2 M) q) (not (< 0 N))) (or (<= q (* 2 M)) (not (< 0 N))) (or (= p 0) (not (< 0 N)))), 5031405#(and (or (not (< 2 L)) (<= 3 N) (< 3 L)) (or (<= p q) (not (< 2 L)) (< 3 L)) (or (not (< 2 L)) (<= q p) (< 3 L))), 5031392#(or (< 0 L) (= q p)), 5031394#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 5031400#(or (<= L 3) (= (+ q (* M 4)) p) (< 4 L))] [2022-03-15 21:39:52,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 21:39:52,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:52,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 21:39:52,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2457, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 21:39:52,629 INFO L87 Difference]: Start difference. First operand 109773 states and 434937 transitions. Second operand has 37 states, 36 states have (on average 3.2222222222222223) internal successors, (116), 36 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:06,463 INFO L93 Difference]: Finished difference Result 114047 states and 447712 transitions. [2022-03-15 21:40:06,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2022-03-15 21:40:06,464 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.2222222222222223) internal successors, (116), 36 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:40:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:07,083 INFO L225 Difference]: With dead ends: 114047 [2022-03-15 21:40:07,083 INFO L226 Difference]: Without dead ends: 114014 [2022-03-15 21:40:07,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12505 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=3952, Invalid=35054, Unknown=0, NotChecked=0, Total=39006 [2022-03-15 21:40:07,086 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 787 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 4365 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 4693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 4365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:07,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [787 Valid, 13 Invalid, 4693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 4365 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 21:40:07,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114014 states. [2022-03-15 21:40:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114014 to 109804. [2022-03-15 21:40:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109804 states, 109803 states have (on average 3.961858965602033) internal successors, (435024), 109803 states have internal predecessors, (435024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109804 states to 109804 states and 435024 transitions. [2022-03-15 21:40:10,788 INFO L78 Accepts]: Start accepts. Automaton has 109804 states and 435024 transitions. Word has length 21 [2022-03-15 21:40:10,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:10,788 INFO L470 AbstractCegarLoop]: Abstraction has 109804 states and 435024 transitions. [2022-03-15 21:40:10,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.2222222222222223) internal successors, (116), 36 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 109804 states and 435024 transitions. [2022-03-15 21:40:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:40:11,211 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:11,212 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:11,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-15 21:40:11,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-03-15 21:40:11,427 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:40:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:11,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1059974960, now seen corresponding path program 37 times [2022-03-15 21:40:11,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:11,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984420115] [2022-03-15 21:40:11,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:11,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:11,560 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:11,560 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:11,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984420115] [2022-03-15 21:40:11,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984420115] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:11,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511121212] [2022-03-15 21:40:11,560 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:40:11,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:11,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:11,561 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:40:11,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-15 21:40:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:11,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:40:11,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:11,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:12,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511121212] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:12,111 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:12,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2022-03-15 21:40:12,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1856423976] [2022-03-15 21:40:12,111 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:12,112 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:12,119 INFO L252 McrAutomatonBuilder]: Finished intersection with 103 states and 200 transitions. [2022-03-15 21:40:12,119 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:15,141 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [5365536#(and (or (not (< 2 L)) (<= q p) (not (< 1 N)) (< 3 L)) (or (<= p q) (not (< 2 L)) (not (< 1 N)) (< 3 L)) (or (not (< 2 L)) (not (< 1 N)) (<= 3 N) (< 3 L))), 5365522#(and (or (<= 3 N) (< 1 L) (not (< 0 L))) (or (< 1 L) (not (< 0 L)) (<= (+ (* 2 M) p) q)) (or (< 1 L) (<= q (+ (* 2 M) p)) (not (< 0 L)))), 5365533#(and (or (not (< 3 L)) (<= 2 N) (< 4 L)) (or (not (< 3 L)) (< 4 L) (< (+ (* 2 M) q) (+ p 1))) (or (<= p (+ (* 2 M) q)) (not (< 3 L)) (< 4 L))), 5365535#(and (or (not (< 1 N)) (<= 3 N) (< 2 L) (not (< 1 L))) (or (<= (+ M p) q) (not (< 1 N)) (< 2 L) (not (< 1 L))) (or (not (< 1 N)) (< 2 L) (not (< 1 L)) (<= q (+ M p)))), 5365524#(or (= (+ (* 3 M) q) p) (<= L 2) (< 3 L)), 5365541#(and (or (<= q M) (not (< 0 N))) (or (not (< 0 N)) (<= (+ L 1) N)) (or (not (< 0 N)) (<= M q)) (or (= p 0) (not (< 0 N)))), 5365515#(or (< 0 L) (< 1 N) (= q p)), 5365513#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 5365526#(and (or (not (< 2 L)) (< 3 L) (< (+ M q) (+ p 1))) (or (not (< 2 L)) (<= p (+ M q)) (< 3 L)) (or (not (< 2 L)) (<= 2 N) (< 3 L))), 5365514#(or (< 1 N) (= q p)), 5365523#(and (or (<= 3 N) (< 2 L) (not (< 1 L))) (or (<= (+ M p) q) (< 2 L) (not (< 1 L))) (or (< 2 L) (not (< 1 L)) (<= q (+ M p)))), 5365525#(or (= (+ (* 3 M) q) p) (< 1 N) (<= L 2) (< 3 L)), 5365532#(and (or (not (< 1 N)) (< 1 L) (<= q (+ (* 2 M) p)) (not (< 0 L))) (or (not (< 1 N)) (< 1 L) (not (< 0 L)) (<= (+ (* 2 M) p) q)) (or (not (< 1 N)) (<= 3 N) (< 1 L) (not (< 0 L)))), 5365512#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 5365531#(and (or (< 0 L) (not (< 1 N)) (<= (+ (* 3 M) p) q)) (or (< 0 L) (not (< 1 N)) (<= 3 N)) (or (< 0 L) (not (< 1 N)) (<= q (+ (* 3 M) p)))), 5365527#(and (or (not (< 2 L)) (<= 3 N) (< 3 L)) (or (<= p q) (not (< 2 L)) (< 3 L)) (or (not (< 2 L)) (<= q p) (< 3 L))), 5365542#(and (or (not (< 0 N)) (= q 0)) (or (= p 0) (not (< 0 N))) (or (= N L) (not (< 0 N)))), 5365538#(and (or (not (< 0 N)) (<= 4 N)) (or (not (< 0 N)) (<= (* M 4) q)) (or (<= q (* M 4)) (not (< 0 N))) (or (= p 0) (not (< 0 N)))), 5365520#(and (or (<= p q) (< 2 L) (not (< 1 L))) (or (< 2 L) (not (< 1 L)) (< q (+ p 1))) (or (<= 2 N) (< 2 L) (not (< 1 L)))), 5365511#(or (< 0 L) (= q p)), 5365529#(or (<= L 3) (= (+ q (* M 4)) p) (< 1 N) (< 4 L)), 5365539#(and (or (not (< 0 N)) (<= q (* 3 M))) (or (<= (* 3 M) q) (not (< 0 N))) (or (not (< 0 N)) (<= (+ 3 L) N)) (or (= p 0) (not (< 0 N)))), 5365528#(or (<= L 3) (= (+ q (* M 4)) p) (< 4 L)), 5365519#(and (or (<= (+ M p) q) (< 1 L) (not (< 0 L))) (or (< 1 L) (<= 2 N) (not (< 0 L))) (or (< 1 L) (< q (+ M p 1)) (not (< 0 L)))), 5365517#(or (< 2 L) (< 1 N) (<= L 1) (= (+ (* 2 M) q) p)), 5365530#(and (or (not (< 1 N)) (<= 3 N)) (or (not (< 1 N)) (<= (+ (* 3 M) p) q)) (or (not (< 1 N)) (<= q (+ (* 3 M) p)))), 5365534#(and (or (not (< 3 L)) (<= (+ M q) p) (< 4 L)) (or (<= 3 N) (not (< 3 L)) (< 4 L)) (or (not (< 3 L)) (<= p (+ M q)) (< 4 L))), 5365518#(and (or (< 0 L) (<= 2 N)) (or (< 0 L) (< q (+ (* 2 M) p 1))) (or (< 0 L) (<= (+ (* 2 M) p) q))), 5365516#(or (< 1 L) (= p (+ M q)) (< 1 N) (not (< 0 L))), 5365521#(and (or (< 0 L) (<= (+ (* 3 M) p) q)) (or (< 0 L) (<= 3 N)) (or (< 0 L) (<= q (+ (* 3 M) p)))), 5365540#(and (or (not (< 0 N)) (<= (+ 2 L) N)) (or (<= (* 2 M) q) (not (< 0 N))) (or (<= q (* 2 M)) (not (< 0 N))) (or (= p 0) (not (< 0 N)))), 5365537#(and (or (not (< 1 N)) (not (< 3 L)) (<= p (+ M q)) (< 4 L)) (or (not (< 1 N)) (<= 3 N) (not (< 3 L)) (< 4 L)) (or (not (< 1 N)) (not (< 3 L)) (<= (+ M q) p) (< 4 L)))] [2022-03-15 21:40:15,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 21:40:15,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:15,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 21:40:15,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=2994, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 21:40:15,142 INFO L87 Difference]: Start difference. First operand 109804 states and 435024 transitions. Second operand has 43 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 42 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:30,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:30,830 INFO L93 Difference]: Finished difference Result 137572 states and 525431 transitions. [2022-03-15 21:40:30,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2022-03-15 21:40:30,830 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 42 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:40:30,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:31,471 INFO L225 Difference]: With dead ends: 137572 [2022-03-15 21:40:31,472 INFO L226 Difference]: Without dead ends: 137551 [2022-03-15 21:40:31,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23631 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=6157, Invalid=61183, Unknown=0, NotChecked=0, Total=67340 [2022-03-15 21:40:31,474 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 872 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 4913 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 4913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:31,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [872 Valid, 30 Invalid, 5406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [493 Valid, 4913 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 21:40:31,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137551 states. [2022-03-15 21:40:35,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137551 to 109806. [2022-03-15 21:40:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109806 states, 109805 states have (on average 3.9619416237876237) internal successors, (435041), 109805 states have internal predecessors, (435041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109806 states to 109806 states and 435041 transitions. [2022-03-15 21:40:36,119 INFO L78 Accepts]: Start accepts. Automaton has 109806 states and 435041 transitions. Word has length 21 [2022-03-15 21:40:36,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:36,120 INFO L470 AbstractCegarLoop]: Abstraction has 109806 states and 435041 transitions. [2022-03-15 21:40:36,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 42 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 109806 states and 435041 transitions. [2022-03-15 21:40:36,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:40:36,234 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:36,234 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:36,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-03-15 21:40:36,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-03-15 21:40:36,447 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:40:36,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:36,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1327398283, now seen corresponding path program 38 times [2022-03-15 21:40:36,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:36,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314156293] [2022-03-15 21:40:36,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:36,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:36,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:36,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314156293] [2022-03-15 21:40:36,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314156293] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:36,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253506963] [2022-03-15 21:40:36,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:40:36,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:36,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:36,588 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:40:36,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-15 21:40:36,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:40:36,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:36,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 21:40:36,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:36,747 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:36,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:36,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253506963] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:36,970 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:36,970 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2022-03-15 21:40:36,970 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [531692812] [2022-03-15 21:40:36,970 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:36,971 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:36,977 INFO L252 McrAutomatonBuilder]: Finished intersection with 99 states and 181 transitions. [2022-03-15 21:40:36,977 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:40,779 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [5723320#(= p (+ q (* 5 M))), 5723161#(= (+ (* 2 M) q) p), 5723294#(and (or (<= p (+ (* 2 M) q)) (not (< 0 N)) (< 1 N)) (or (not (< 0 N)) (<= (+ (* 2 M) q) p) (< 1 N))), 5723316#(and (or (not (< 0 N)) (< 1 N) (<= (* M 4) p)) (or (<= N 2) (<= (* 2 M) p) (< 3 N)) (or (not (< 0 N)) (< 1 N) (<= p (+ q (* M 4)))) (or (<= N 2) (< 3 N) (= q 0)) (or (<= p (* 2 M)) (<= N 2) (< 3 N)) (or (not (< 0 N)) (< 1 N) (= q 0))), 5723319#(= (+ (* 3 M) q) p), 5723292#(and (< 0 N) (or (<= p (+ (* 2 M) q)) (< 1 N)) (or (<= (+ (* 2 M) q) p) (< 1 N))), 5723284#(and (or (<= q p) (not (< 0 N))) (or (<= p q) (not (< 0 N)))), 5723297#(and (or (<= (+ M p) q) (<= N 2) (< 3 N)) (or (not (< 0 N)) (<= p (+ M q)) (< 1 N)) (or (<= N 2) (< 3 N) (<= q (+ M p))) (or (not (< 0 N)) (<= (+ M q) p) (< 1 N))), 5723303#(and (or (< 5 N) (<= N 4) (<= (+ p (* 5 M)) q)) (or (< 5 N) (<= N 4) (< q (+ p (* 5 M) 1)))), 5723305#(and (or (< 5 N) (<= N 4) (<= q (+ (* 3 M) p))) (or (< 5 N) (<= N 4) (<= (+ (* 3 M) p) q))), 5723299#(and (or (<= (+ (* 3 M) p) q) (<= N 2) (< 3 N)) (or (<= N 2) (< q (+ (* 3 M) p 1)) (< 3 N))), 5723295#(and (or (not (< 0 N)) (< q (+ M p 1)) (< 1 N)) (or (<= (+ M p) q) (not (< 0 N)) (< 1 N)) (or (<= (+ (* 3 M) p) q) (<= N 2) (< 3 N)) (or (<= N 2) (< q (+ (* 3 M) p 1)) (< 3 N))), 5723169#(= (+ q (* M 4)) p), 5723296#(and (or (<= p q) (not (< 0 N)) (< 1 N)) (or (< q (+ (* 2 M) p 1)) (<= N 2) (< 3 N)) (or (<= N 2) (< 3 N) (<= (+ (* 2 M) p) q)) (or (<= q p) (not (< 0 N)) (< 1 N))), 5723293#(and (or (not (< 0 N)) (<= (+ (* 2 M) q) p)) (or (<= p (+ (* 2 M) q)) (not (< 0 N)))), 5723317#(and (or (<= N 2) (<= (* 2 M) p) (< 3 N)) (or (<= N 2) (< 3 N) (= q 0)) (or (<= p (* 2 M)) (<= N 2) (< 3 N))), 5723306#(and (or (< 5 N) (<= N 4) (<= q (+ (* 2 M) p))) (or (< 5 N) (<= N 4) (<= (+ (* 2 M) p) q))), 5723304#(and (or (< 5 N) (<= N 4) (<= (+ p (* M 4)) q)) (or (< 5 N) (<= N 4) (< q (+ p (* M 4) 1)))), 5723291#(and (or (not (< 0 N)) (<= p (+ M q)) (< 1 N)) (or (not (< 0 N)) (<= (+ M q) p) (< 1 N))), 5723286#(and (or (<= p q) (< 1 N)) (< 0 N) (or (<= q p) (< 1 N))), 5723283#(and (or (not (< 0 N)) (< q (+ M p 1))) (or (<= (+ M p) q) (not (< 0 N)))), 5723315#(and (or (not (< 0 N)) (<= p (* M 4)) (< 1 N)) (or (not (< 0 N)) (< 1 N) (<= (* M 4) p)) (or (not (< 0 N)) (< 1 N) (= q 0))), 5723307#(and (or (not (< 0 N)) (<= p (+ (* 3 M) q))) (or (<= (+ (* 3 M) q) p) (not (< 0 N)))), 5723300#(and (or (< q (+ (* 2 M) p 1)) (<= N 2) (< 3 N)) (or (<= N 2) (< 3 N) (<= (+ (* 2 M) p) q))), 5723311#(and (or (<= p (+ M q)) (<= N 2) (< 3 N)) (or (<= (+ M q) p) (<= N 2) (< 3 N))), 5723309#(and (or (<= (+ (* 3 M) q) p) (not (< 0 N)) (< 1 N)) (or (not (< 0 N)) (< 1 N) (<= p (+ (* 3 M) q)))), 5723285#(and (< 0 N) (or (< q (+ M p 1)) (< 1 N)) (or (<= (+ M p) q) (< 1 N))), 5723313#(and (< 0 N) (or (<= p (* M 4)) (< 1 N)) (or (< 1 N) (<= (* M 4) p)) (or (< 1 N) (= q 0))), 5723314#(and (or (not (< 0 N)) (<= p (* M 4))) (or (not (< 0 N)) (= q 0)) (or (not (< 0 N)) (<= (* M 4) p))), 5723287#(and (or (not (< 0 N)) (< q (+ M p 1)) (< 1 N)) (or (<= (+ M p) q) (not (< 0 N)) (< 1 N))), 5723298#(and (or (<= p (+ (* 2 M) q)) (not (< 0 N)) (< 1 N)) (or (not (< 0 N)) (<= (+ (* 2 M) q) p) (< 1 N)) (or (<= q p) (<= N 2) (< 3 N)) (or (<= p q) (<= N 2) (< 3 N))), 5723301#(and (or (<= (+ M p) q) (<= N 2) (< 3 N)) (or (<= N 2) (< 3 N) (<= q (+ M p)))), 5723318#(= p (+ M q)), 5723321#(and (or (< 5 N) (<= N 4) (<= 0 p)) (or (< 5 N) (<= N 4) (= q 0)) (or (< 5 N) (<= N 4) (<= p 0))), 5723290#(and (or (not (< 0 N)) (<= (+ M q) p)) (or (not (< 0 N)) (<= p (+ M q)))), 5723289#(and (< 0 N) (or (<= p (+ M q)) (< 1 N)) (or (<= (+ M q) p) (< 1 N))), 5723308#(and (< 0 N) (or (<= (+ (* 3 M) q) p) (< 1 N)) (or (< 1 N) (<= p (+ (* 3 M) q)))), 5723288#(and (or (<= p q) (not (< 0 N)) (< 1 N)) (or (<= q p) (not (< 0 N)) (< 1 N))), 5723302#(and (or (<= q p) (<= N 2) (< 3 N)) (or (<= p q) (<= N 2) (< 3 N))), 5723310#(and (or (<= p (+ M q)) (<= N 2) (< 3 N)) (or (<= (+ (* 3 M) q) p) (not (< 0 N)) (< 1 N)) (or (not (< 0 N)) (< 1 N) (<= p (+ (* 3 M) q))) (or (<= (+ M q) p) (<= N 2) (< 3 N))), 5723312#(and (or (< 5 N) (<= N 4) (<= q (+ M p))) (or (<= (+ M p) q) (< 5 N) (<= N 4)))] [2022-03-15 21:40:40,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-15 21:40:40,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:40,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-15 21:40:40,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=3855, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 21:40:40,780 INFO L87 Difference]: Start difference. First operand 109806 states and 435041 transitions. Second operand has 55 states, 54 states have (on average 2.611111111111111) internal successors, (141), 54 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:49,454 INFO L93 Difference]: Finished difference Result 124133 states and 489374 transitions. [2022-03-15 21:40:49,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-15 21:40:49,471 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.611111111111111) internal successors, (141), 54 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 21:40:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:50,022 INFO L225 Difference]: With dead ends: 124133 [2022-03-15 21:40:50,023 INFO L226 Difference]: Without dead ends: 124085 [2022-03-15 21:40:50,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3405 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1467, Invalid=12105, Unknown=0, NotChecked=0, Total=13572 [2022-03-15 21:40:50,024 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 531 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 7713 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 7970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 7713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:50,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [531 Valid, 89 Invalid, 7970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 7713 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-03-15 21:40:50,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124085 states. [2022-03-15 21:40:53,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124085 to 116260. [2022-03-15 21:40:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116260 states, 116259 states have (on average 3.977188862797719) internal successors, (462384), 116259 states have internal predecessors, (462384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116260 states to 116260 states and 462384 transitions. [2022-03-15 21:40:54,543 INFO L78 Accepts]: Start accepts. Automaton has 116260 states and 462384 transitions. Word has length 22 [2022-03-15 21:40:54,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:54,543 INFO L470 AbstractCegarLoop]: Abstraction has 116260 states and 462384 transitions. [2022-03-15 21:40:54,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.611111111111111) internal successors, (141), 54 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:54,543 INFO L276 IsEmpty]: Start isEmpty. Operand 116260 states and 462384 transitions. [2022-03-15 21:40:54,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:40:54,735 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:54,735 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:54,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-03-15 21:40:54,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:54,951 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:40:54,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:54,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1429430409, now seen corresponding path program 39 times [2022-03-15 21:40:54,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:54,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298641491] [2022-03-15 21:40:54,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:54,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:55,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:55,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298641491] [2022-03-15 21:40:55,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298641491] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:55,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588831873] [2022-03-15 21:40:55,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:40:55,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:55,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:55,188 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:40:55,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-15 21:40:55,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:40:55,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:55,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 21:40:55,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:55,498 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:55,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:56,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588831873] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:56,040 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:56,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 28 [2022-03-15 21:40:56,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2102945462] [2022-03-15 21:40:56,041 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:56,042 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:56,048 INFO L252 McrAutomatonBuilder]: Finished intersection with 99 states and 181 transitions. [2022-03-15 21:40:56,048 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:00,459 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [6080235#(or (< 0 L) (= q p)), 6080245#(and (or (<= 3 N) (<= N 1)) (or (not (< 0 N)) (< q (+ M p 1)) (< 1 N)) (or (<= (+ M p) q) (not (< 0 N)) (< 1 N)) (or (<= (+ (* 3 M) p) q) (<= N 1) (< 3 N)) (or (<= N 1) (< q (+ (* 3 M) p 1)) (< 3 N))), 6080270#(and (or (< 5 N) (<= p 0) (not (< 3 N))) (or (< 5 N) (<= 0 p) (not (< 3 N))) (or (< 5 N) (not (< 3 N)) (= q 0)) (or (< 5 N) (not (< 3 N)) (<= L N))), 6080255#(and (or (<= L (+ N 1)) (< 1 N)) (or (<= p (+ M q)) (< 1 N)) (or (not (< 1 N)) (< 3 N) (<= q (+ M p))) (or (<= (+ M p) q) (not (< 1 N)) (< 3 N)) (or (not (< 1 N)) (< 3 N) (<= (+ L 1) N)) (or (<= (+ M q) p) (< 1 N))), 6080265#(and (or (not (< 1 N)) (<= p (+ M q)) (< 3 N)) (or (not (< 1 N)) (<= L (+ N 1)) (< 3 N)) (or (not (< 1 N)) (<= (+ M q) p) (< 3 N))), 6080258#(and (or (<= p (* M 4)) (< 1 N)) (or (not (< 1 N)) (<= p (* 2 M)) (< 3 N)) (or (not (< 1 N)) (<= (* 2 M) p) (< 3 N)) (or (not (< 1 N)) (<= L (+ 2 N)) (< 3 N)) (or (< 3 N) (= q 0)) (or (<= L (+ N 4)) (< 1 N)) (or (< 1 N) (<= (* M 4) p))), 6080269#(and (or (not (< 1 N)) (<= p (* 2 M)) (< 3 N)) (or (not (< 1 N)) (<= (* 2 M) p) (< 3 N)) (or (not (< 1 N)) (<= L (+ 2 N)) (< 3 N)) (or (not (< 1 N)) (< 3 N) (= q 0))), 6080243#(and (or (<= p q) (< 1 N)) (or (< 1 N) (<= L N)) (or (<= q p) (< 1 N))), 6080241#(and (or (< q (+ M p 1)) (< 1 N)) (<= 1 N) (or (<= (+ M p) q) (< 1 N))), 6080257#(and (or (<= (+ (* 3 M) q) p) (< 1 N)) (or (not (< 1 N)) (<= p (+ M q)) (< 3 N)) (or (not (< 1 N)) (<= L (+ N 1)) (< 3 N)) (or (< 1 N) (<= p (+ (* 3 M) q))) (or (<= L (+ 3 N)) (< 1 N)) (or (not (< 1 N)) (<= (+ M q) p) (< 3 N))), 6080252#(and (or (<= L (+ 2 N)) (< 1 N)) (or (<= p (+ (* 2 M) q)) (< 1 N)) (or (<= (+ (* 2 M) q) p) (< 1 N))), 6080247#(and (or (not (< 1 N)) (<= 3 N)) (or (not (< 1 N)) (< q (+ (* 3 M) p 1)) (< 3 N)) (or (not (< 1 N)) (<= (+ (* 3 M) p) q) (< 3 N))), 6080244#(and (or (<= p q) (< 1 N)) (or (< 1 N) (<= L N)) (or (not (< 1 N)) (<= q (+ (* 2 M) p)) (< 3 N)) (or (not (< 1 N)) (< 3 N) (<= (+ 2 L) N)) (or (<= q p) (< 1 N)) (or (not (< 1 N)) (< 3 N) (<= (+ (* 2 M) p) q))), 6080246#(and (or (<= q (+ (* 2 M) p)) (<= N 1) (< 3 N)) (or (<= N 1) (< 3 N) (<= (+ 2 L) N)) (or (<= p q) (not (< 0 N)) (< 1 N)) (or (not (< 0 N)) (< 1 N) (<= L N)) (or (<= N 1) (< 3 N) (<= (+ (* 2 M) p) q)) (or (<= q p) (not (< 0 N)) (< 1 N))), 6080249#(and (or (<= 5 N) (not (< 3 N))) (or (< 5 N) (<= (+ p (* 5 M)) q) (not (< 3 N))) (or (< 5 N) (< q (+ p (* 5 M) 1)) (not (< 3 N)))), 6080253#(and (or (<= (+ (* 3 M) q) p) (< 1 N)) (or (< 1 N) (<= p (+ (* 3 M) q))) (or (<= L (+ 3 N)) (< 1 N))), 6080268#(and (or (< 5 N) (not (< 3 N)) (<= q (+ M p))) (or (< 5 N) (not (< 3 N)) (<= (+ L 1) N)) (or (<= (+ M p) q) (< 5 N) (not (< 3 N)))), 6080238#(or (= (+ (* 3 M) q) p) (<= L 2) (< 3 L)), 6080237#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 6080263#(and (or (not (< 1 N)) (< 3 N) (<= q (+ M p))) (or (<= (+ M p) q) (not (< 1 N)) (< 3 N)) (or (not (< 1 N)) (< 3 N) (<= (+ L 1) N))), 6080236#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 6080250#(and (or (< 5 N) (<= (+ L 4) N) (not (< 3 N))) (or (< 5 N) (<= q (+ p (* M 4))) (not (< 3 N))) (or (< 5 N) (<= (+ p (* M 4)) q) (not (< 3 N)))), 6080248#(and (or (not (< 1 N)) (<= q (+ (* 2 M) p)) (< 3 N)) (or (not (< 1 N)) (< 3 N) (<= (+ 2 L) N)) (or (not (< 1 N)) (< 3 N) (<= (+ (* 2 M) p) q))), 6080261#(and (or (<= L (+ 3 N)) (not (< 0 N)) (< 1 N)) (or (<= (+ (* 3 M) q) p) (not (< 0 N)) (< 1 N)) (or (not (< 0 N)) (< 1 N) (<= p (+ (* 3 M) q))) (or (<= p (+ M q)) (<= N 1) (< 3 N)) (or (<= L (+ N 1)) (<= N 1) (< 3 N)) (or (<= (+ M q) p) (<= N 1) (< 3 N))), 6080260#(and (or (<= p (+ (* 2 M) q)) (not (< 0 N)) (< 1 N)) (or (not (< 0 N)) (<= (+ (* 2 M) q) p) (< 1 N)) (or (<= L (+ 2 N)) (not (< 0 N)) (< 1 N)) (or (<= q p) (<= N 1) (< 3 N)) (or (<= N 1) (< 3 N) (<= L N)) (or (<= p q) (<= N 1) (< 3 N))), 6080262#(and (or (not (< 0 N)) (<= p (* M 4)) (< 1 N)) (or (not (< 0 N)) (< 1 N) (<= (* M 4) p)) (or (<= L (+ 2 N)) (<= N 1) (< 3 N)) (or (not (< 0 N)) (< 3 N) (= q 0)) (or (<= p (* 2 M)) (<= N 1) (< 3 N)) (or (<= N 1) (<= (* 2 M) p) (< 3 N)) (or (<= L (+ N 4)) (not (< 0 N)) (< 1 N))), 6080264#(and (or (<= p q) (not (< 1 N)) (< 3 N)) (or (<= q p) (not (< 1 N)) (< 3 N)) (or (not (< 1 N)) (< 3 N) (<= L N))), 6080271#(and (or (not (< 1 N)) (= q 0)) (or (not (< 1 N)) (<= (* 2 M) p)) (or (not (< 1 N)) (<= p (* 2 M))) (or (not (< 1 N)) (<= L (+ 2 N)))), 6080267#(and (or (< 5 N) (not (< 3 N)) (<= (+ 2 L) N)) (or (< 5 N) (<= q (+ (* 2 M) p)) (not (< 3 N))) (or (< 5 N) (not (< 3 N)) (<= (+ (* 2 M) p) q))), 6080259#(and (or (not (< 0 N)) (<= p (+ M q)) (< 1 N)) (or (<= N 1) (< 3 N) (<= (+ L 1) N)) (or (<= N 1) (< 3 N) (<= q (+ M p))) (or (not (< 0 N)) (<= L (+ N 1)) (< 1 N)) (or (not (< 0 N)) (<= (+ M q) p) (< 1 N)) (or (<= (+ M p) q) (<= N 1) (< 3 N))), 6080239#(or (<= L 3) (= (+ q (* M 4)) p) (< 4 L)), 6080240#(or (= p (+ q (* 5 M))) (<= L 4) (< 5 L)), 6080242#(and (or (not (< 1 N)) (<= 3 N)) (or (< q (+ M p 1)) (< 1 N)) (or (not (< 1 N)) (< q (+ (* 3 M) p 1)) (< 3 N)) (or (not (< 1 N)) (<= (+ (* 3 M) p) q) (< 3 N)) (<= 1 N) (or (<= (+ M p) q) (< 1 N))), 6080251#(and (or (<= L (+ N 1)) (< 1 N)) (or (<= p (+ M q)) (< 1 N)) (or (<= (+ M q) p) (< 1 N))), 6080256#(and (or (<= p q) (not (< 1 N)) (< 3 N)) (or (<= q p) (not (< 1 N)) (< 3 N)) (or (<= L (+ 2 N)) (< 1 N)) (or (not (< 1 N)) (< 3 N) (<= L N)) (or (<= p (+ (* 2 M) q)) (< 1 N)) (or (<= (+ (* 2 M) q) p) (< 1 N))), 6080254#(and (or (<= p (* M 4)) (< 1 N)) (or (<= L (+ N 4)) (< 1 N)) (or (< 1 N) (<= (* M 4) p)) (or (< 1 N) (= q 0))), 6080266#(and (or (< 5 N) (not (< 3 N)) (<= q (+ (* 3 M) p))) (or (< 5 N) (not (< 3 N)) (<= (+ 3 L) N)) (or (< 5 N) (not (< 3 N)) (<= (+ (* 3 M) p) q)))] [2022-03-15 21:41:00,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 21:41:00,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:00,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 21:41:00,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=4130, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 21:41:00,460 INFO L87 Difference]: Start difference. First operand 116260 states and 462384 transitions. Second operand has 50 states, 49 states have (on average 2.857142857142857) internal successors, (140), 49 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:47,545 INFO L93 Difference]: Finished difference Result 127555 states and 499259 transitions. [2022-03-15 21:41:47,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 300 states. [2022-03-15 21:41:47,546 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.857142857142857) internal successors, (140), 49 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 21:41:47,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:48,416 INFO L225 Difference]: With dead ends: 127555 [2022-03-15 21:41:48,416 INFO L226 Difference]: Without dead ends: 127109 [2022-03-15 21:41:48,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40491 ImplicationChecksByTransitivity, 43.2s TimeCoverageRelationStatistics Valid=10461, Invalid=104799, Unknown=0, NotChecked=0, Total=115260 [2022-03-15 21:41:48,421 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 1098 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 11338 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 11338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:48,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1098 Valid, 30 Invalid, 11869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 11338 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-03-15 21:41:48,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127109 states. [2022-03-15 21:41:52,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127109 to 119533. [2022-03-15 21:41:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119533 states, 119532 states have (on average 3.973371147475153) internal successors, (474945), 119532 states have internal predecessors, (474945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119533 states to 119533 states and 474945 transitions. [2022-03-15 21:41:53,189 INFO L78 Accepts]: Start accepts. Automaton has 119533 states and 474945 transitions. Word has length 22 [2022-03-15 21:41:53,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:53,189 INFO L470 AbstractCegarLoop]: Abstraction has 119533 states and 474945 transitions. [2022-03-15 21:41:53,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.857142857142857) internal successors, (140), 49 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 119533 states and 474945 transitions. [2022-03-15 21:41:53,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:41:53,317 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:53,317 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:53,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-03-15 21:41:53,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-03-15 21:41:53,532 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:41:53,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:53,533 INFO L85 PathProgramCache]: Analyzing trace with hash -20279635, now seen corresponding path program 40 times [2022-03-15 21:41:53,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:53,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491273733] [2022-03-15 21:41:53,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:53,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:53,710 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:53,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491273733] [2022-03-15 21:41:53,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491273733] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:53,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281491675] [2022-03-15 21:41:53,710 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:41:53,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:53,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:53,711 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:41:53,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-03-15 21:41:53,734 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:41:53,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:53,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 21:41:53,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:53,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:54,742 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:54,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281491675] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:54,743 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:54,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 24 [2022-03-15 21:41:54,743 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [512365142] [2022-03-15 21:41:54,743 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:54,744 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:54,752 INFO L252 McrAutomatonBuilder]: Finished intersection with 114 states and 224 transitions. [2022-03-15 21:41:54,752 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:58,068 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 38 new interpolants: [6447615#(and (or (not (< 1 N)) (<= (+ M q) p)) (or (not (< 1 N)) (<= L (+ N 1))) (or (not (< 1 N)) (<= p (+ M q)))), 6447614#(and (or (<= 3 N) (not (< 0 N))) (or (not (< 0 N)) (<= q (+ (* 3 M) p))) (or (not (< 0 N)) (<= (+ (* 3 M) p) q))), 6447591#(and (or (not (< 1 N)) (<= 3 N)) (or (< q (+ M p 1)) (< 1 N)) (or (not (< 1 N)) (< q (+ (* 3 M) p 1))) (<= 1 N) (or (<= (+ M p) q) (< 1 N)) (or (not (< 1 N)) (<= (+ (* 3 M) p) q))), 6447626#(and (or (not (< 3 N)) (= q 0)) (or (not (< 3 N)) (<= L N)) (or (<= p 0) (not (< 3 N))) (or (<= 0 p) (not (< 3 N)))), 6447593#(and (or (not (< 1 N)) (<= (+ (* 2 M) p) q)) (or (not (< 1 N)) (<= q (+ (* 2 M) p))) (or (not (< 1 N)) (<= (+ 2 L) N))), 6447603#(or (= (+ (* 3 M) q) p) (<= L 2) (< 3 L)), 6447600#(or (< 1 L) (= p (+ M q)) (< 1 N) (not (< 0 L))), 6447599#(or (< 0 L) (< 1 N) (= q p)), 6447622#(and (or (not (< 0 N)) (<= (* 2 M) p)) (or (not (< 0 N)) (= q 0)) (or (not (< 0 N)) (<= p (* 2 M))) (or (<= L (+ 2 N)) (not (< 0 N))) (or (not (< 0 N)) (not (<= N 1)))), 6447598#(or (< 1 N) (= q p)), 6447609#(and (or (<= L 1) (<= 1 N)) (or (<= p (+ M q)) (<= L 1)) (or (<= L 1) (< (+ M q) (+ p 1)))), 6447619#(and (or (not (< 0 N)) (<= (+ L 1) N)) (or (not (< 0 N)) (<= q (+ M p))) (or (<= (+ M p) q) (not (< 0 N))) (or (not (< 0 N)) (not (<= N 1)))), 6447597#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 6447595#(and (or (<= q p) (not (< 1 N))) (or (<= p q) (not (< 1 N))) (or (not (< 1 N)) (<= L N))), 6447624#(and (or (not (< 3 N)) (<= (+ 2 L) N)) (or (not (< 3 N)) (<= (+ (* 2 M) p) q)) (or (<= q (+ (* 2 M) p)) (not (< 3 N)))), 6447610#(and (or (<= L 2) (<= 1 N)) (or (<= L 2) (< (+ (* 2 M) q) (+ p 1))) (or (<= p (+ (* 2 M) q)) (<= L 2))), 6447596#(or (< 0 L) (= q p)), 6447628#(and (or (<= L 4) (<= 1 N)) (or (<= L 4) (<= p (+ q (* M 4)))) (or (< (+ q (* M 4)) (+ p 1)) (<= L 4))), 6447623#(and (or (not (< 3 N)) (<= (+ 3 L) N)) (or (not (< 3 N)) (<= (+ (* 3 M) p) q)) (or (not (< 3 N)) (<= q (+ (* 3 M) p)))), 6447612#(and (or (<= 3 N) (<= N 1)) (or (not (< 0 N)) (< q (+ M p 1)) (< 1 N)) (or (<= (+ M p) q) (not (< 0 N)) (< 1 N)) (or (<= (+ (* 3 M) p) q) (<= N 1)) (or (<= N 1) (< q (+ (* 3 M) p 1)))), 6447604#(or (<= L 3) (= (+ q (* M 4)) p) (< 4 L)), 6447608#(and (or (< q (+ p 1)) (<= L 0)) (or (<= p q) (<= L 0)) (or (<= L 0) (<= 1 N))), 6447617#(and (or (not (< 0 N)) (<= (+ 2 L) N)) (or (not (< 0 N)) (<= q (+ (* 2 M) p))) (or (not (< 0 N)) (<= (+ (* 2 M) p) q)) (or (not (< 0 N)) (not (<= N 1)))), 6447594#(and (or (not (< 1 N)) (<= q (+ M p))) (or (<= (+ M p) q) (not (< 1 N))) (or (not (< 1 N)) (<= (+ L 1) N))), 6447620#(and (or (<= q p) (not (< 0 N))) (or (not (< 0 N)) (<= L N)) (or (not (< 0 N)) (not (<= N 1))) (or (<= p q) (not (< 0 N)))), 6447625#(and (or (<= (+ M p) q) (not (< 3 N))) (or (not (< 3 N)) (<= (+ L 1) N)) (or (not (< 3 N)) (<= q (+ M p)))), 6447607#(or (<= L 3) (= (+ q (* M 4)) p) (< 1 N) (< 4 L)), 6447602#(or (< 2 L) (< 1 N) (<= L 1) (= (+ (* 2 M) q) p)), 6447606#(or (= (+ (* 3 M) q) p) (< 1 N) (<= L 2) (< 3 L)), 6447616#(and (or (not (< 1 N)) (= q 0)) (or (not (< 1 N)) (<= (* 2 M) p)) (or (not (< 1 N)) (<= p (* 2 M))) (or (not (< 1 N)) (<= L (+ 2 N)))), 6447627#(or (= p (+ q (* 5 M))) (<= L 4) (< 5 L) (< 1 N)), 6447605#(or (= p (+ q (* 5 M))) (<= L 4) (< 5 L)), 6447613#(and (or (<= 5 N) (not (< 3 N))) (or (< q (+ p (* 5 M) 1)) (not (< 3 N))) (or (<= (+ p (* 5 M)) q) (not (< 3 N)))), 6447621#(and (or (not (< 0 N)) (<= (+ M q) p)) (or (not (< 0 N)) (not (<= N 1))) (or (not (< 0 N)) (<= p (+ M q))) (or (not (< 0 N)) (<= L (+ N 1)))), 6447592#(and (or (not (< 1 N)) (<= 3 N)) (or (not (< 1 N)) (< q (+ (* 3 M) p 1))) (or (not (< 1 N)) (<= (+ (* 3 M) p) q))), 6447618#(and (or (<= (+ L 4) N) (not (< 3 N))) (or (<= q (+ p (* M 4))) (not (< 3 N))) (or (<= (+ p (* M 4)) q) (not (< 3 N)))), 6447611#(and (or (<= L 3) (<= p (+ (* 3 M) q))) (or (<= L 3) (<= 1 N)) (or (< (+ (* 3 M) q) (+ p 1)) (<= L 3))), 6447601#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p))] [2022-03-15 21:41:58,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 21:41:58,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:58,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 21:41:58,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=3719, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 21:41:58,069 INFO L87 Difference]: Start difference. First operand 119533 states and 474945 transitions. Second operand has 51 states, 50 states have (on average 3.26) internal successors, (163), 50 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:48,188 INFO L93 Difference]: Finished difference Result 181052 states and 683864 transitions. [2022-03-15 21:42:48,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 447 states. [2022-03-15 21:42:48,188 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 3.26) internal successors, (163), 50 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 21:42:48,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:49,106 INFO L225 Difference]: With dead ends: 181052 [2022-03-15 21:42:49,106 INFO L226 Difference]: Without dead ends: 180414 [2022-03-15 21:42:49,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 75 SyntacticMatches, 7 SemanticMatches, 480 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91160 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=21855, Invalid=209987, Unknown=0, NotChecked=0, Total=231842 [2022-03-15 21:42:49,116 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1283 mSDsluCounter, 1693 mSDsCounter, 0 mSdLazyCounter, 12262 mSolverCounterSat, 839 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 13101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 839 IncrementalHoareTripleChecker+Valid, 12262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:49,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1283 Valid, 11 Invalid, 13101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [839 Valid, 12262 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-03-15 21:42:49,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180414 states. [2022-03-15 21:42:54,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180414 to 125854. [2022-03-15 21:42:54,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125854 states, 125853 states have (on average 3.9572834974136493) internal successors, (498036), 125853 states have internal predecessors, (498036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125854 states to 125854 states and 498036 transitions. [2022-03-15 21:42:55,541 INFO L78 Accepts]: Start accepts. Automaton has 125854 states and 498036 transitions. Word has length 22 [2022-03-15 21:42:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:55,541 INFO L470 AbstractCegarLoop]: Abstraction has 125854 states and 498036 transitions. [2022-03-15 21:42:55,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.26) internal successors, (163), 50 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 125854 states and 498036 transitions. [2022-03-15 21:42:55,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:42:55,728 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:55,728 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:55,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-03-15 21:42:55,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-03-15 21:42:55,943 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:55,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:55,944 INFO L85 PathProgramCache]: Analyzing trace with hash 628501623, now seen corresponding path program 41 times [2022-03-15 21:42:55,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:55,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592727689] [2022-03-15 21:42:55,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:55,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:56,124 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:56,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592727689] [2022-03-15 21:42:56,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592727689] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:56,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295355031] [2022-03-15 21:42:56,124 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:42:56,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:56,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:56,125 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:42:56,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-03-15 21:42:56,149 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 21:42:56,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:56,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 21:42:56,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:56,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:57,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295355031] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:57,076 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:57,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-03-15 21:42:57,076 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1715392779] [2022-03-15 21:42:57,076 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:57,077 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:57,085 INFO L252 McrAutomatonBuilder]: Finished intersection with 114 states and 224 transitions. [2022-03-15 21:42:57,085 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:43:00,389 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [6881395#(or (< 0 L) (= q p)), 6881387#(and (or (not (< 1 N)) (<= q (+ M p))) (or (<= (+ M p) q) (not (< 1 N))) (or (not (< 1 N)) (<= (+ L 1) N))), 6881390#(and (or (<= (+ L 4) N) (not (< 3 N))) (or (<= q (+ p (* M 4))) (not (< 3 N))) (or (<= (+ p (* M 4)) q) (not (< 3 N)))), 6881412#(and (or (not (< 3 L)) (<= 2 N) (< 4 L)) (or (not (< 3 L)) (= (+ p (* (- 2) M) (* (- 1) q)) 0) (< 4 L))), 6881408#(and (or (< 0 L) (<= 2 N)) (or (< 0 L) (= (+ (* 2 M) p (* (- 1) q)) 0))), 6881413#(and (or (not (< 0 N)) (<= (+ M q) p)) (or (not (< 0 N)) (<= 2 N)) (or (not (< 0 N)) (<= p (+ M q))) (or (not (< 0 N)) (<= L (+ N 1)))), 6881403#(or (< 2 L) (< 1 N) (<= L 1) (= (+ (* 2 M) q) p)), 6881409#(and (or (< 1 L) (= (+ M p (* (- 1) q)) 0) (not (< 0 L))) (or (< 1 L) (<= 2 N) (not (< 0 L)))), 6881398#(or (= (+ (* 3 M) q) p) (<= L 2) (< 3 L)), 6881383#(and (or (not (< 0 N)) (<= (+ L 1) N)) (or (not (< 0 N)) (<= q (+ M p))) (or (not (< 0 N)) (<= 2 N)) (or (<= (+ M p) q) (not (< 0 N)))), 6881401#(or (< 0 L) (< 1 N) (= q p)), 6881406#(or (= p (+ q (* 5 M))) (<= L 4) (< 5 L)), 6881397#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 6881392#(and (or (not (< 3 N)) (<= (+ 2 L) N)) (or (not (< 3 N)) (<= (+ (* 2 M) p) q)) (or (<= q (+ (* 2 M) p)) (not (< 3 N)))), 6881411#(and (or (not (< 2 L)) (< 3 L) (= (+ p (* (- 1) q) (* (- 1) M)) 0)) (or (not (< 2 L)) (<= 2 N) (< 3 L))), 6881393#(and (or (not (< 1 N)) (<= (+ M q) p)) (or (not (< 1 N)) (<= L (+ N 1))) (or (not (< 1 N)) (<= p (+ M q)))), 6881384#(and (or (<= q p) (not (< 0 N))) (or (not (< 0 N)) (<= L N)) (or (not (< 0 N)) (<= 2 N)) (or (<= p q) (not (< 0 N)))), 6881388#(and (or (<= q p) (not (< 1 N))) (or (<= p q) (not (< 1 N))) (or (not (< 1 N)) (<= L N))), 6881386#(and (or (not (< 1 N)) (<= (+ (* 2 M) p) q)) (or (not (< 1 N)) (<= q (+ (* 2 M) p))) (or (not (< 1 N)) (<= (+ 2 L) N))), 6881381#(and (or (<= 3 N) (not (< 0 N))) (or (not (< 0 N)) (<= q (+ (* 3 M) p))) (or (not (< 0 N)) (<= (+ (* 3 M) p) q))), 6881404#(or (= (+ (* 3 M) q) p) (< 1 N) (<= L 2) (< 3 L)), 6881396#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 6881415#(and (or (not (< 0 N)) (<= (* 2 M) p)) (or (not (< 0 N)) (= q 0)) (or (not (< 0 N)) (<= p (* 2 M))) (or (<= L (+ 2 N)) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N))), 6881405#(or (<= L 3) (= (+ q (* M 4)) p) (< 1 N) (< 4 L)), 6881407#(or (= p (+ q (* 5 M))) (<= L 4) (< 5 L) (< 1 N)), 6881400#(or (< 1 N) (= q p)), 6881391#(and (or (not (< 3 N)) (<= (+ 3 L) N)) (or (not (< 3 N)) (<= (+ (* 3 M) p) q)) (or (not (< 3 N)) (<= q (+ (* 3 M) p)))), 6881394#(and (or (not (< 1 N)) (= q 0)) (or (not (< 1 N)) (<= (* 2 M) p)) (or (not (< 1 N)) (<= p (* 2 M))) (or (not (< 1 N)) (<= L (+ 2 N)))), 6881417#(and (or (<= 2 N) (< 5 L) (not (< 4 L))) (or (= (+ p (* (- 1) q) (* M (- 3))) 0) (< 5 L) (not (< 4 L)))), 6881399#(or (<= L 3) (= (+ q (* M 4)) p) (< 4 L)), 6881382#(and (or (not (< 0 N)) (<= (+ 2 L) N)) (or (not (< 0 N)) (<= q (+ (* 2 M) p))) (or (not (< 0 N)) (<= 2 N)) (or (not (< 0 N)) (<= (+ (* 2 M) p) q))), 6881410#(and (or (< 2 L) (not (< 1 L)) (= (+ p (* (- 1) q)) 0)) (or (<= 2 N) (< 2 L) (not (< 1 L)))), 6881416#(and (or (not (< 3 N)) (= q 0)) (or (not (< 3 N)) (<= L N)) (or (<= p 0) (not (< 3 N))) (or (<= 0 p) (not (< 3 N)))), 6881385#(and (or (not (< 1 N)) (<= 3 N)) (or (not (< 1 N)) (<= (+ (* 3 M) p) q)) (or (not (< 1 N)) (<= q (+ (* 3 M) p)))), 6881414#(and (or (<= (+ M p) q) (not (< 3 N))) (or (not (< 3 N)) (<= (+ L 1) N)) (or (not (< 3 N)) (<= q (+ M p)))), 6881402#(or (< 1 L) (= p (+ M q)) (< 1 N) (not (< 0 L))), 6881389#(and (or (<= 5 N) (<= N 3)) (or (<= (+ p (* 5 M)) q) (<= N 3)) (or (<= N 3) (<= q (+ p (* 5 M)))))] [2022-03-15 21:43:00,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 21:43:00,390 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:43:00,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 21:43:00,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=4029, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 21:43:00,390 INFO L87 Difference]: Start difference. First operand 125854 states and 498036 transitions. Second operand has 50 states, 49 states have (on average 3.2653061224489797) internal successors, (160), 49 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:41,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:43:41,198 INFO L93 Difference]: Finished difference Result 168669 states and 640459 transitions. [2022-03-15 21:43:41,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 369 states. [2022-03-15 21:43:41,199 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 3.2653061224489797) internal successors, (160), 49 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 21:43:41,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:43:41,987 INFO L225 Difference]: With dead ends: 168669 [2022-03-15 21:43:41,987 INFO L226 Difference]: Without dead ends: 168609 [2022-03-15 21:43:41,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 403 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60537 ImplicationChecksByTransitivity, 36.0s TimeCoverageRelationStatistics Valid=14775, Invalid=148845, Unknown=0, NotChecked=0, Total=163620 [2022-03-15 21:43:41,993 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 1264 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 9927 mSolverCounterSat, 746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 10673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 746 IncrementalHoareTripleChecker+Valid, 9927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:43:41,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1264 Valid, 15 Invalid, 10673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [746 Valid, 9927 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-03-15 21:43:42,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168609 states. [2022-03-15 21:43:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168609 to 125812. [2022-03-15 21:43:46,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125812 states, 125811 states have (on average 3.9577143493017304) internal successors, (497924), 125811 states have internal predecessors, (497924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125812 states to 125812 states and 497924 transitions. [2022-03-15 21:43:47,823 INFO L78 Accepts]: Start accepts. Automaton has 125812 states and 497924 transitions. Word has length 22 [2022-03-15 21:43:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:47,824 INFO L470 AbstractCegarLoop]: Abstraction has 125812 states and 497924 transitions. [2022-03-15 21:43:47,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.2653061224489797) internal successors, (160), 49 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:47,824 INFO L276 IsEmpty]: Start isEmpty. Operand 125812 states and 497924 transitions. [2022-03-15 21:43:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:43:47,970 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:47,970 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:47,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-03-15 21:43:48,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:48,184 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:43:48,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:48,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1527471139, now seen corresponding path program 42 times [2022-03-15 21:43:48,185 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:48,185 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813431561] [2022-03-15 21:43:48,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:48,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:48,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:48,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813431561] [2022-03-15 21:43:48,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813431561] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:48,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408259162] [2022-03-15 21:43:48,395 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:43:48,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:48,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:48,396 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:43:48,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-03-15 21:43:48,423 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 21:43:48,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:43:48,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 21:43:48,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:48,546 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:43:48,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:48,734 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:43:48,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408259162] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:48,734 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:48,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 24 [2022-03-15 21:43:48,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [864644107] [2022-03-15 21:43:48,734 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:48,735 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:48,743 INFO L252 McrAutomatonBuilder]: Finished intersection with 115 states and 226 transitions. [2022-03-15 21:43:48,743 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:43:51,451 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [7302561#(or (= p (+ q (* 5 M))) (<= L 4) (< 5 L)), 7302539#(or (< 1 N) (= q p)), 7302560#(or (< 1 L) (= p (+ M q)) (< 1 N) (not (< 0 L))), 7302549#(and (or (<= N 4) (<= (+ 2 L) 0) (<= (+ p (* M 4)) q)) (or (<= q (+ p (* M 4))) (<= N 4) (<= (+ 2 L) 0))), 7302543#(or (<= N 4) (= (+ p (* 5 M)) q) (< 6 N)), 7302556#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 7302551#(and (or (<= (+ M p) q) (<= (+ L 1) 0) (not (< 2 N))) (or (<= (+ L 1) 0) (not (< 2 N)) (<= q (+ M p)))), 7302542#(or (< 4 N) (= (+ (* 3 M) p) q) (<= N 2)), 7302578#(and (or (not (< 0 N)) (<= p (+ M q)) (< 1 N)) (or (<= (+ M p) q) (<= N 1)) (or (<= N 1) (<= (+ L 1) N)) (or (not (< 0 N)) (<= (+ M q) p) (< 1 N)) (or (<= N 1) (<= q (+ M p))) (or (not (< 0 N)) (<= L (+ N 1)))), 7302541#(or (= (+ (* 2 M) p) q) (not (< 1 N)) (< 3 N)), 7302567#(and (or (not (< 1 N)) (= q 0)) (or (not (< 1 N)) (<= 0 p)) (or (not (< 1 N)) (<= p 0)) (or (not (< 1 N)) (<= L N))), 7302569#(or (= p (+ M q)) (<= L 0)), 7302544#(or (= (+ (* 2 M) p) q) (not (< 1 N))), 7302553#(and (or (not (< 1 N)) (<= (+ M q) p) (<= L 0)) (or (not (< 1 N)) (<= p (+ M q)) (<= L 0))), 7302566#(and (or (not (< 1 N)) (<= q (+ M p))) (or (<= (+ M p) q) (not (< 1 N))) (or (not (< 1 N)) (<= (+ L 1) N))), 7302574#(or (<= L 3) (= (+ q (* M 4)) p) (< 1 N) (< 4 L)), 7302557#(or (= (+ (* 3 M) q) p) (<= L 2) (< 3 L)), 7302573#(or (= (+ (* 3 M) q) p) (< 1 N) (<= L 2) (< 3 L)), 7302558#(or (<= L 3) (= (+ q (* M 4)) p) (< 4 L)), 7302570#(and (or (<= (+ (* 3 M) q) p) (<= L 2)) (or (<= L 2) (<= p (+ (* 3 M) q)))), 7302568#(and (or (not (< 1 N)) (= q 0)) (or (not (< 1 N)) (<= 0 p)) (or (= N L) (not (< 1 N))) (or (not (< 1 N)) (<= p 0))), 7302552#(and (or (<= (+ L 1) 0) (<= (+ (* 3 M) p) q) (not (< 4 N))) (or (<= (+ L 1) 0) (not (< 4 N)) (<= q (+ (* 3 M) p)))), 7302565#(and (or (<= p (* 2 M)) (< 1 N)) (<= L (+ 2 N)) (or (< 1 N) (<= (* 2 M) p)) (or (not (< 1 N)) (<= 0 p)) (or (not (< 1 N)) (<= p 0)) (= q 0) (or (not (< 1 N)) (<= L N))), 7302540#(and (or (< 1 N) (= q p)) (or (= (+ (* 2 M) p) q) (not (< 1 N)) (< 3 N))), 7302554#(or (< 0 L) (= q p)), 7302545#(or (= (+ (* 3 M) p) q) (<= N 2)), 7302546#(or (<= N 4) (= (+ p (* 5 M)) q)), 7302559#(or (< 0 L) (< 1 N) (= q p)), 7302576#(and (or (<= p (+ q (* 5 M))) (<= L 4)) (or (<= L 4) (<= (+ q (* 5 M)) p))), 7302564#(and (or (<= p (+ M q)) (< 1 N)) (or (not (< 1 N)) (<= q (+ M p))) (or (<= (+ M p) q) (not (< 1 N))) (<= L (+ N 1)) (or (not (< 1 N)) (<= (+ L 1) N)) (or (<= (+ M q) p) (< 1 N))), 7302572#(or (< 2 L) (< 1 N) (<= L 1) (= (+ (* 2 M) q) p)), 7302547#(and (or (not (< 1 N)) (<= (+ 2 L) 0) (<= q (+ M p))) (or (<= (+ M p) q) (not (< 1 N)) (<= (+ 2 L) 0))), 7302575#(or (= p (+ q (* 5 M))) (<= L 4) (< 5 L) (< 1 N)), 7302555#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 7302579#(and (or (<= N 1) (<= L N)) (or (<= 0 p) (<= N 1)) (or (not (< 0 N)) (= q 0)) (or (not (< 0 N)) (< 1 N) (<= (* 2 M) p)) (or (<= L (+ 2 N)) (not (< 0 N))) (or (<= p 0) (<= N 1)) (or (not (< 0 N)) (<= p (* 2 M)) (< 1 N))), 7302550#(and (or (<= p q) (not (< 1 N)) (<= (+ L 1) 0)) (or (<= q p) (not (< 1 N)) (<= (+ L 1) 0))), 7302548#(and (or (<= (+ 2 L) 0) (<= q (+ (* 2 M) p)) (<= N 2)) (or (<= (+ 2 L) 0) (<= N 2) (<= (+ (* 2 M) p) q))), 7302562#(and (or (<= p q) (not (< 0 L)) (<= N 2)) (or (<= q p) (not (< 0 L)) (<= N 2))), 7302563#(and (or (<= N 4) (not (< 0 L)) (<= (+ (* 2 M) p) q)) (or (<= N 4) (<= q (+ (* 2 M) p)) (not (< 0 L)))), 7302577#(and (or (<= (+ (* 3 M) q) p) (<= L 2)) (or (<= L 2) (<= p (+ (* 3 M) q))) (or (not (<= N 1)) (<= L 2))), 7302571#(and (or (<= L 3) (<= (+ q (* M 4)) p)) (or (<= L 3) (<= p (+ q (* M 4)))))] [2022-03-15 21:43:51,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 21:43:51,451 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:43:51,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 21:43:51,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=4054, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 21:43:51,452 INFO L87 Difference]: Start difference. First operand 125812 states and 497924 transitions. Second operand has 54 states, 53 states have (on average 3.0377358490566038) internal successors, (161), 53 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 21:44:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:07,389 INFO L93 Difference]: Finished difference Result 198527 states and 770007 transitions. [2022-03-15 21:44:07,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 251 states. [2022-03-15 21:44:07,402 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 3.0377358490566038) internal successors, (161), 53 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 22 [2022-03-15 21:44:07,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:09,120 INFO L225 Difference]: With dead ends: 198527 [2022-03-15 21:44:09,120 INFO L226 Difference]: Without dead ends: 198492 [2022-03-15 21:44:09,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29467 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=8242, Invalid=73840, Unknown=0, NotChecked=0, Total=82082 [2022-03-15 21:44:09,124 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 903 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 7155 mSolverCounterSat, 768 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 7923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 768 IncrementalHoareTripleChecker+Valid, 7155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:09,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [903 Valid, 38 Invalid, 7923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [768 Valid, 7155 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 21:44:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198492 states. [2022-03-15 21:44:15,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198492 to 162573. [2022-03-15 21:44:15,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162573 states, 162572 states have (on average 3.9963831410082915) internal successors, (649700), 162572 states have internal predecessors, (649700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162573 states to 162573 states and 649700 transitions. [2022-03-15 21:44:16,721 INFO L78 Accepts]: Start accepts. Automaton has 162573 states and 649700 transitions. Word has length 22 [2022-03-15 21:44:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:16,721 INFO L470 AbstractCegarLoop]: Abstraction has 162573 states and 649700 transitions. [2022-03-15 21:44:16,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 3.0377358490566038) internal successors, (161), 53 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 21:44:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 162573 states and 649700 transitions. [2022-03-15 21:44:16,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:44:16,920 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:16,920 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:16,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-03-15 21:44:17,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:17,138 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:17,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:17,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1844717453, now seen corresponding path program 43 times [2022-03-15 21:44:17,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:17,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727411135] [2022-03-15 21:44:17,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:17,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:44:17,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:17,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727411135] [2022-03-15 21:44:17,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727411135] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:17,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328275563] [2022-03-15 21:44:17,179 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:44:17,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:17,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:17,180 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:44:17,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-03-15 21:44:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:17,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:44:17,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:44:17,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:44:17,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328275563] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:17,451 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:17,451 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 22 [2022-03-15 21:44:17,451 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [887350117] [2022-03-15 21:44:17,810 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:17,811 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:17,818 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 206 transitions. [2022-03-15 21:44:17,819 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:19,187 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [7826854#(<= 5 N), 7826852#(or (<= L 3) (< 1 N) (< 4 L)), 7826862#(or (not (< 1 N)) (<= 5 N)), 7826869#(or (= (+ (* (- 1) L) N) 0) (not (< 1 N))), 7826858#(or (not (< 0 N)) (<= (+ 2 L) N)), 7826857#(or (not (< 0 N)) (<= (+ 3 L) N)), 7826851#(or (< 1 N) (<= L 2) (< 3 L)), 7826861#(or (<= L 1) (<= L N)), 7826844#(or (< 1 L) (<= L 0)), 7826860#(or (<= L 0) (<= (+ L 1) N)), 7826856#(or (<= (+ L 4) N) (not (< 0 N))), 7826864#(or (<= L 3) (<= L (+ 2 N))), 7826859#(or (not (< 0 N)) (<= (+ L 1) N)), 7826865#(or (not (< 1 N)) (<= (+ L 4) N)), 7826866#(or (not (< 1 N)) (<= (+ 3 L) N)), 7826848#(or (<= L 4) (< 5 L)), 7826846#(or (<= L 2) (< 3 L)), 7826853#(or (<= L 4) (< 5 L) (< 1 N)), 7826850#(or (< 2 L) (< 1 N) (<= L 1)), 7826867#(or (not (< 1 N)) (<= (+ 2 L) N)), 7826847#(or (<= L 3) (< 4 L)), 7826849#(or (< 1 L) (<= L 0) (< 1 N)), 7826842#(< 0 L), 7826870#(or (= (+ (* (- 1) L) N) 0) (not (< 0 N))), 7826863#(or (<= L (+ N 1)) (<= L 2)), 7826845#(or (< 2 L) (<= L 1)), 7826855#(or (<= 5 N) (not (< 0 N))), 7826868#(or (not (< 1 N)) (<= (+ L 1) N)), 7826843#(or (< 0 L) (< 1 N))] [2022-03-15 21:44:19,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 21:44:19,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:19,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 21:44:19,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=2161, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 21:44:19,188 INFO L87 Difference]: Start difference. First operand 162573 states and 649700 transitions. Second operand has 38 states, 38 states have (on average 3.6315789473684212) internal successors, (138), 37 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:23,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:23,598 INFO L93 Difference]: Finished difference Result 189442 states and 755897 transitions. [2022-03-15 21:44:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-03-15 21:44:23,599 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.6315789473684212) internal successors, (138), 37 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 21:44:23,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:24,665 INFO L225 Difference]: With dead ends: 189442 [2022-03-15 21:44:24,665 INFO L226 Difference]: Without dead ends: 189373 [2022-03-15 21:44:24,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 75 SyntacticMatches, 15 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5713 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2706, Invalid=14064, Unknown=0, NotChecked=0, Total=16770 [2022-03-15 21:44:24,666 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 491 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 2253 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 2253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:24,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 1 Invalid, 2675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 2253 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:44:25,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189373 states. [2022-03-15 21:44:30,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189373 to 172267. [2022-03-15 21:44:31,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172267 states, 172266 states have (on average 4.012242694437672) internal successors, (691173), 172266 states have internal predecessors, (691173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172267 states to 172267 states and 691173 transitions. [2022-03-15 21:44:32,871 INFO L78 Accepts]: Start accepts. Automaton has 172267 states and 691173 transitions. Word has length 22 [2022-03-15 21:44:32,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:32,871 INFO L470 AbstractCegarLoop]: Abstraction has 172267 states and 691173 transitions. [2022-03-15 21:44:32,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.6315789473684212) internal successors, (138), 37 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:32,871 INFO L276 IsEmpty]: Start isEmpty. Operand 172267 states and 691173 transitions. [2022-03-15 21:44:33,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:44:33,073 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:33,073 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:33,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-03-15 21:44:33,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-03-15 21:44:33,282 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:33,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:33,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1924400017, now seen corresponding path program 44 times [2022-03-15 21:44:33,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:33,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715441030] [2022-03-15 21:44:33,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:33,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:44:33,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:33,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715441030] [2022-03-15 21:44:33,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715441030] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:33,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934403645] [2022-03-15 21:44:33,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:44:33,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:33,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:33,336 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:44:33,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-03-15 21:44:33,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:44:33,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:44:33,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 21:44:33,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:33,469 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:33,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:33,622 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:33,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934403645] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:33,623 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:33,623 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 24 [2022-03-15 21:44:33,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [276814756] [2022-03-15 21:44:33,623 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:33,624 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:33,632 INFO L252 McrAutomatonBuilder]: Finished intersection with 115 states and 226 transitions. [2022-03-15 21:44:33,632 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:35,241 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [8361169#(or (<= L 3) (< 1 N) (< 4 L)), 8361173#(or (not (< 1 N)) (<= (+ L 4) N)), 8361185#(or (not (< 0 N)) (<= (+ 3 L) N)), 8361170#(or (<= L 4) (< 5 L)), 8361167#(or (<= L 3) (< 4 L)), 8361187#(or (<= L 4) (< 5 L) (< 1 N)), 8361181#(or (< 0 N) (<= L 4) (< 5 L)), 8361183#(or (<= 5 N) (not (< 0 N))), 8361175#(or (not (< 1 N)) (<= (+ 2 L) N)), 8361188#(or (not (< 0 N)) (<= (+ L 1) N)), 8361163#(or (< 2 L) (< 1 N) (<= L 1)), 8361174#(or (not (< 1 N)) (<= (+ 3 L) N)), 8361166#(or (<= L 2) (< 3 L)), 8361160#(or (< 0 L) (< 1 N)), 8361182#(or (<= L 0) (<= (+ L 1) N)), 8361179#(or (< 0 N) (<= L 2) (< 3 L)), 8361165#(or (< 0 N) (< 1 L) (<= L 0)), 8361191#(or (<= L (+ N 1)) (<= L 2)), 8361164#(or (< 0 L) (<= 1 N)), 8361177#(or (= (+ (* (- 1) L) N) 0) (not (< 1 N))), 8361186#(or (not (< 0 N)) (<= (+ 2 L) N)), 8361178#(or (< 0 N) (< 2 L) (<= L 1)), 8361176#(or (not (< 1 N)) (<= (+ L 1) N)), 8361171#(<= 5 N), 8361192#(or (<= L 3) (<= L (+ 2 N))), 8361162#(or (< 2 L) (<= L 1)), 8361172#(or (not (< 1 N)) (<= 5 N)), 8361189#(or (= (+ (* (- 1) L) N) 0) (not (< 0 N))), 8361190#(or (<= L 1) (<= L N)), 8361161#(or (< 1 L) (<= L 0) (< 1 N)), 8361184#(or (<= (+ L 4) N) (not (< 0 N))), 8361159#(or (< 1 L) (<= L 0)), 8361168#(or (< 1 N) (<= L 2) (< 3 L)), 8361180#(or (< 0 N) (<= L 3) (< 4 L)), 8361158#(< 0 L)] [2022-03-15 21:44:35,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 21:44:35,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:35,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 21:44:35,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=659, Invalid=2881, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 21:44:35,242 INFO L87 Difference]: Start difference. First operand 172267 states and 691173 transitions. Second operand has 45 states, 45 states have (on average 3.533333333333333) internal successors, (159), 44 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:40,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:40,549 INFO L93 Difference]: Finished difference Result 192386 states and 772564 transitions. [2022-03-15 21:44:40,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2022-03-15 21:44:40,549 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.533333333333333) internal successors, (159), 44 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 21:44:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:41,995 INFO L225 Difference]: With dead ends: 192386 [2022-03-15 21:44:41,995 INFO L226 Difference]: Without dead ends: 192356 [2022-03-15 21:44:41,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 72 SyntacticMatches, 18 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14964 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=6061, Invalid=34541, Unknown=0, NotChecked=0, Total=40602 [2022-03-15 21:44:41,997 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 663 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 2695 mSolverCounterSat, 762 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 3457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 762 IncrementalHoareTripleChecker+Valid, 2695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:41,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [663 Valid, 1 Invalid, 3457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [762 Valid, 2695 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:44:42,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192356 states. [2022-03-15 21:44:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192356 to 176487. [2022-03-15 21:44:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176487 states, 176486 states have (on average 4.016783200933785) internal successors, (708906), 176486 states have internal predecessors, (708906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176487 states to 176487 states and 708906 transitions. [2022-03-15 21:44:49,787 INFO L78 Accepts]: Start accepts. Automaton has 176487 states and 708906 transitions. Word has length 22 [2022-03-15 21:44:49,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:49,787 INFO L470 AbstractCegarLoop]: Abstraction has 176487 states and 708906 transitions. [2022-03-15 21:44:49,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.533333333333333) internal successors, (159), 44 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand 176487 states and 708906 transitions. [2022-03-15 21:44:50,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:44:50,530 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:50,530 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:50,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-03-15 21:44:50,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:50,744 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:50,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:50,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1021059387, now seen corresponding path program 45 times [2022-03-15 21:44:50,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:50,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020509260] [2022-03-15 21:44:50,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:50,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:50,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:50,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020509260] [2022-03-15 21:44:50,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020509260] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:50,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388495006] [2022-03-15 21:44:50,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:44:50,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:50,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:50,935 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:44:50,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-03-15 21:44:50,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 21:44:50,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:44:50,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 21:44:50,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:44:51,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:44:51,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388495006] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:51,409 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:51,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-03-15 21:44:51,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [52435113] [2022-03-15 21:44:51,409 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:51,410 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:51,418 INFO L252 McrAutomatonBuilder]: Finished intersection with 115 states and 226 transitions. [2022-03-15 21:44:51,418 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:54,395 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [8907013#(or (= p (+ q (* 5 M))) (<= L 4) (< 5 L) (< 1 N)), 8907024#(and (or (<= q p) (not (< 1 N))) (or (<= p q) (not (< 1 N))) (or (= N L) (not (< 1 N)))), 8907031#(and (or (< 1 L) (not (< 0 L)) (<= q (+ (* 3 M) p))) (or (< 1 L) (<= (+ (* 3 M) p) q) (not (< 0 L))) (or (< 1 L) (not (< 0 L)) (<= 4 N))), 8907022#(and (or (not (< 1 N)) (<= (+ (* 2 M) p) q)) (or (not (< 1 N)) (<= q (+ (* 2 M) p))) (or (not (< 1 N)) (<= (+ 2 L) N))), 8907010#(and (or (not (< 3 L)) (< 1 N) (< 4 L)) (or (not (< 3 L)) (< 4 L) (< (+ (* 2 M) q) (+ p 1))) (or (<= p (+ (* 2 M) q)) (not (< 3 L)) (< 4 L))), 8907021#(and (or (not (< 1 N)) (<= (+ 3 L) N)) (or (not (< 1 N)) (<= (+ (* 3 M) p) q)) (or (not (< 1 N)) (<= q (+ (* 3 M) p)))), 8907004#(or (<= L 3) (= (+ q (* M 4)) p) (< 4 L)), 8907029#(and (or (not (< 0 N)) (<= (+ L 1) N)) (or (not (< 0 N)) (<= q (+ M p))) (or (not (< 0 N)) (<= 2 N)) (or (<= (+ M p) q) (not (< 0 N)))), 8907018#(and (or (not (< 3 L)) (< 4 L) (< (+ (* 2 M) q) (+ p 1))) (or (<= p (+ (* 2 M) q)) (not (< 3 L)) (< 4 L))), 8907007#(and (or (< 1 L) (< 1 N) (not (< 0 L))) (or (<= (+ M p) q) (< 1 L) (not (< 0 L))) (or (< 1 L) (< q (+ M p 1)) (not (< 0 L)))), 8907019#(and (or (not (< 1 N)) (<= 5 N)) (or (not (< 1 N)) (<= (+ p (* 5 M)) q)) (or (not (< 1 N)) (<= q (+ p (* 5 M))))), 8907016#(and (or (<= p q) (< 2 L) (not (< 1 L))) (or (< 2 L) (not (< 1 L)) (< q (+ p 1)))), 8907027#(and (or (not (< 0 N)) (<= (+ 3 L) N)) (or (not (< 0 N)) (<= q (+ (* 3 M) p))) (or (not (< 0 N)) (<= 2 N)) (or (not (< 0 N)) (<= (+ (* 3 M) p) q))), 8907034#(and (or (not (< 3 L)) (< 4 L) (<= 4 N)) (or (<= p q) (not (< 3 L)) (< 4 L)) (or (<= q p) (not (< 3 L)) (< 4 L))), 8907037#(and (or (<= (+ M q) p) (< 5 L) (not (< 4 L))) (or (< 5 L) (not (< 4 L)) (<= 4 N)) (or (<= p (+ M q)) (< 5 L) (not (< 4 L)))), 8907008#(and (or (< 2 L) (not (< 1 L)) (< 1 N)) (or (<= p q) (< 2 L) (not (< 1 L))) (or (< 2 L) (not (< 1 L)) (< q (+ p 1)))), 8906996#(or (< 1 L) (= p (+ M q)) (not (< 0 L))), 8907017#(and (or (not (< 2 L)) (< 3 L) (< (+ M q) (+ p 1))) (or (not (< 2 L)) (<= p (+ M q)) (< 3 L))), 8907003#(or (= (+ (* 3 M) q) p) (< 1 N) (<= L 2) (< 3 L)), 8907015#(and (or (<= (+ M p) q) (< 1 L) (not (< 0 L))) (or (< 1 L) (< q (+ M p 1)) (not (< 0 L)))), 8907001#(or (< 2 L) (< 1 N) (<= L 1) (= (+ (* 2 M) q) p)), 8906998#(or (< 1 N) (= q p)), 8907000#(or (< 1 L) (= p (+ M q)) (< 1 N) (not (< 0 L))), 8907011#(or (= p (+ q (* 5 M))) (<= L 4) (< 5 L)), 8907026#(and (or (<= q (+ p (* M 4))) (not (< 0 N))) (or (<= (+ L 4) N) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N)) (or (not (< 0 N)) (<= (+ p (* M 4)) q))), 8907025#(and (or (< 0 L) (<= (+ p (* M 4)) q)) (or (< 0 L) (<= q (+ p (* M 4)))) (or (< 0 L) (<= 4 N))), 8907023#(and (or (not (< 1 N)) (<= q (+ M p))) (or (<= (+ M p) q) (not (< 1 N))) (or (not (< 1 N)) (<= (+ L 1) N))), 8906999#(or (< 0 L) (< 1 N) (= q p)), 8907032#(and (or (<= q (+ (* 2 M) p)) (< 2 L) (not (< 1 L))) (or (< 2 L) (not (< 1 L)) (<= 4 N)) (or (< 2 L) (not (< 1 L)) (<= (+ (* 2 M) p) q))), 8907012#(and (or (not (< 0 N)) (<= q (+ p (* 5 M)))) (or (<= 5 N) (not (< 0 N))) (or (not (< 0 N)) (<= (+ p (* 5 M)) q))), 8906995#(or (< 0 L) (= q p)), 8907009#(and (or (not (< 2 L)) (< 3 L) (< (+ M q) (+ p 1))) (or (not (< 2 L)) (< 1 N) (< 3 L)) (or (not (< 2 L)) (<= p (+ M q)) (< 3 L))), 8907002#(or (= (+ (* 3 M) q) p) (<= L 2) (< 3 L)), 8906997#(or (< 2 L) (<= L 1) (= (+ (* 2 M) q) p)), 8907035#(and (or (< 5 L) (< 1 N) (not (< 4 L))) (or (< 5 L) (not (< 4 L)) (<= p (+ (* 3 M) q))) (or (< (+ (* 3 M) q) (+ p 1)) (< 5 L) (not (< 4 L)))), 8907028#(and (or (not (< 0 N)) (<= (+ 2 L) N)) (or (not (< 0 N)) (<= q (+ (* 2 M) p))) (or (not (< 0 N)) (<= 2 N)) (or (not (< 0 N)) (<= (+ (* 2 M) p) q))), 8907030#(and (or (<= q p) (not (< 0 N))) (or (not (< 0 N)) (<= 2 N)) (or (= N L) (not (< 0 N))) (or (<= p q) (not (< 0 N)))), 8907033#(and (or (<= (+ M p) q) (not (< 2 L)) (< 3 L)) (or (not (< 2 L)) (<= q (+ M p)) (< 3 L)) (or (not (< 2 L)) (< 3 L) (<= 4 N))), 8907036#(and (or (< 5 L) (not (< 4 L)) (<= p (+ (* 3 M) q))) (or (< (+ (* 3 M) q) (+ p 1)) (< 5 L) (not (< 4 L)))), 8907005#(or (<= L 3) (= (+ q (* M 4)) p) (< 1 N) (< 4 L)), 8907020#(and (or (not (< 1 N)) (<= (+ p (* M 4)) q)) (or (not (< 1 N)) (<= (+ L 4) N)) (or (not (< 1 N)) (<= q (+ p (* M 4))))), 8907014#(and (or (< 0 L) (< q (+ (* 2 M) p 1))) (or (< 0 L) (<= (+ (* 2 M) p) q))), 8907006#(and (or (< 0 L) (< 1 N)) (or (< 0 L) (< q (+ (* 2 M) p 1))) (or (< 0 L) (<= (+ (* 2 M) p) q)))] [2022-03-15 21:44:54,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-15 21:44:54,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:54,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-15 21:44:54,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=4641, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 21:44:54,396 INFO L87 Difference]: Start difference. First operand 176487 states and 708906 transitions. Second operand has 56 states, 55 states have (on average 3.036363636363636) internal successors, (167), 55 states have internal predecessors, (167), 0 states have call successors, (0), 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 21:45:02,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-03-15 21:45:02,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7685 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2199, Invalid=24533, Unknown=0, NotChecked=0, Total=26732 [2022-03-15 21:45:02,114 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 475 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 3034 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 3391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 3034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:02,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 10 Invalid, 3391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 3034 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 21:45:02,115 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 21:45:02,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-03-15 21:45:02,141 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 21:45:02,141 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:45:02,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2022-03-15 21:45:02,316 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (176487states) and FLOYD_HOARE automaton (currently 106 states, 56 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 164 known predicates. [2022-03-15 21:45:02,317 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 21:45:02,317 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 21:45:02,317 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 21:45:02,319 INFO L732 BasicCegarLoop]: Path program histogram: [45, 8, 7, 1, 1] [2022-03-15 21:45:02,320 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 21:45:02,320 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 21:45:02,322 INFO L202 PluginConnector]: Adding new model mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 09:45:02 BasicIcfg [2022-03-15 21:45:02,322 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 21:45:02,322 INFO L158 Benchmark]: Toolchain (without parser) took 805777.91ms. Allocated memory was 185.6MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 146.9MB in the beginning and 7.0GB in the end (delta: -6.8GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-03-15 21:45:02,322 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 185.6MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 21:45:02,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.60ms. Allocated memory is still 185.6MB. Free memory was 146.9MB in the beginning and 145.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:45:02,322 INFO L158 Benchmark]: Boogie Preprocessor took 13.30ms. Allocated memory is still 185.6MB. Free memory was 145.3MB in the beginning and 144.4MB in the end (delta: 967.3kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:45:02,323 INFO L158 Benchmark]: RCFGBuilder took 241.91ms. Allocated memory is still 185.6MB. Free memory was 144.3MB in the beginning and 135.2MB in the end (delta: 9.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 21:45:02,323 INFO L158 Benchmark]: TraceAbstraction took 805495.03ms. Allocated memory was 185.6MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 134.7MB in the beginning and 7.0GB in the end (delta: -6.8GB). Peak memory consumption was 989.1MB. Max. memory is 8.0GB. [2022-03-15 21:45:02,323 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.15ms. Allocated memory is still 185.6MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.60ms. Allocated memory is still 185.6MB. Free memory was 146.9MB in the beginning and 145.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.30ms. Allocated memory is still 185.6MB. Free memory was 145.3MB in the beginning and 144.4MB in the end (delta: 967.3kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 241.91ms. Allocated memory is still 185.6MB. Free memory was 144.3MB in the beginning and 135.2MB in the end (delta: 9.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 805495.03ms. Allocated memory was 185.6MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 134.7MB in the beginning and 7.0GB in the end (delta: -6.8GB). Peak memory consumption was 989.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 27 PlacesAfterwards, 26 TransitionsBefore, 20 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 224 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 159, positive: 141, positive conditional: 0, positive unconditional: 141, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 69, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 159, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 69, unknown conditional: 0, unknown unconditional: 69] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - 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: 59]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (176487states) and FLOYD_HOARE automaton (currently 106 states, 56 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 164 known predicates. - TimeoutResultAtElement [Line: 52]: 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 (176487states) and FLOYD_HOARE automaton (currently 106 states, 56 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 164 known predicates. - TimeoutResultAtElement [Line: 52]: 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 (176487states) and FLOYD_HOARE automaton (currently 106 states, 56 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 164 known predicates. - TimeoutResultAtElement [Line: 53]: 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 (176487states) and FLOYD_HOARE automaton (currently 106 states, 56 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 164 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 39 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 805.4s, OverallIterations: 62, TraceHistogramMax: 5, PathProgramHistogramMax: 45, EmptinessCheckTime: 4.9s, AutomataDifference: 553.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40444 SdHoareTripleChecker+Valid, 74.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40444 mSDsluCounter, 821 SdHoareTripleChecker+Invalid, 63.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37616 mSDsCounter, 29610 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 193628 IncrementalHoareTripleChecker+Invalid, 223238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29610 mSolverCounterUnsat, 204 mSDtfsCounter, 193628 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14380 GetRequests, 3270 SyntacticMatches, 359 SemanticMatches, 10750 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038902 ImplicationChecksByTransitivity, 457.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185916occurred in iteration=48, InterpolantAutomatonStates: 9134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 118.6s AutomataMinimizationTime, 61 MinimizatonAttempts, 845002 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 24.5s InterpolantComputationTime, 2294 NumberOfCodeBlocks, 2294 NumberOfCodeBlocksAsserted, 211 NumberOfCheckSat, 3236 ConstructedInterpolants, 40 QuantifiedInterpolants, 29636 SizeOfPredicates, 94 NumberOfNonLiveVariables, 3778 ConjunctsInSsa, 913 ConjunctsInUnsatCore, 178 InterpolantComputations, 4 PerfectInterpolantSequences, 380/2080 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