/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/mult-flipped-dist.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:42:50,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:42:50,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:42:50,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:42:50,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:42:50,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:42:50,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:42:50,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:42:50,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:42:50,290 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:42:50,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:42:50,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:42:50,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:42:50,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:42:50,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:42:50,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:42:50,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:42:50,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:42:50,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:42:50,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:42:50,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:42:50,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:42:50,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:42:50,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:42:50,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:42:50,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:42:50,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:42:50,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:42:50,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:42:50,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:42:50,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:42:50,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:42:50,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:42:50,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:42:50,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:42:50,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:42:50,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:42:50,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:42:50,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:42:50,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:42:50,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:42:50,319 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 20:42:50,348 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:42:50,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:42:50,350 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:42:50,350 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:42:50,350 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:42:50,350 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:42:50,350 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:42:50,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:42:50,350 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:42:50,351 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:42:50,351 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:42:50,351 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:42:50,351 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:42:50,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:42:50,352 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:42:50,352 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:42:50,352 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:42:50,352 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:42:50,352 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:42:50,352 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:42:50,352 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:42:50,352 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:42:50,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:42:50,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:42:50,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:42:50,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:42:50,353 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:42:50,353 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:42:50,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:42:50,353 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:42:50,353 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:42:50,353 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:42:50,354 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 20:42:50,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:42:50,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:42:50,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:42:50,576 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 20:42:50,578 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 20:42:50,579 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/mult-flipped-dist.wvr.bpl [2022-03-15 20:42:50,580 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/mult-flipped-dist.wvr.bpl' [2022-03-15 20:42:50,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:42:50,603 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 20:42:50,604 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:42:50,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:42:50,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:42:50,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:50" (1/1) ... [2022-03-15 20:42:50,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:50" (1/1) ... [2022-03-15 20:42:50,622 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 20:42:50,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:42:50,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:42:50,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:42:50,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:42:50,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:50" (1/1) ... [2022-03-15 20:42:50,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:50" (1/1) ... [2022-03-15 20:42:50,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:50" (1/1) ... [2022-03-15 20:42:50,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:50" (1/1) ... [2022-03-15 20:42:50,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:50" (1/1) ... [2022-03-15 20:42:50,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:50" (1/1) ... [2022-03-15 20:42:50,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:50" (1/1) ... [2022-03-15 20:42:50,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:42:50,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:42:50,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:42:50,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:42:50,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:50" (1/1) ... [2022-03-15 20:42:50,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:42:50,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:50,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 20:42:50,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 20:42:50,717 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 20:42:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 20:42:50,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 20:42:50,717 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 20:42:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 20:42:50,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 20:42:50,717 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 20:42:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:42:50,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:42:50,717 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 20:42:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 20:42:50,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 20:42:50,718 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 20:42:50,750 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:42:50,751 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:42:50,834 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:42:50,843 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:42:50,843 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 20:42:50,844 INFO L202 PluginConnector]: Adding new model mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:42:50 BoogieIcfgContainer [2022-03-15 20:42:50,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:42:50,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:42:50,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:42:50,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:42:50,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:50" (1/2) ... [2022-03-15 20:42:50,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431efe65 and model type mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:42:50, skipping insertion in model container [2022-03-15 20:42:50,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:42:50" (2/2) ... [2022-03-15 20:42:50,855 INFO L111 eAbstractionObserver]: Analyzing ICFG mult-flipped-dist.wvr.bpl [2022-03-15 20:42:50,860 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:42:50,860 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:42:50,860 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 20:42:50,860 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:42:50,897 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 20:42:50,941 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:42:50,948 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:42:50,948 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 20:42:50,958 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:42:50,968 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 76 flow [2022-03-15 20:42:50,970 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 76 flow [2022-03-15 20:42:50,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 76 flow [2022-03-15 20:42:50,998 INFO L129 PetriNetUnfolder]: 3/23 cut-off events. [2022-03-15 20:42:50,998 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 20:42:51,003 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 20:42:51,005 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 20:42:51,132 INFO L131 LiptonReduction]: Checked pairs total: 96 [2022-03-15 20:42:51,133 INFO L133 LiptonReduction]: Total number of compositions: 9 [2022-03-15 20:42:51,138 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 20:42:51,147 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:42:51,160 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:51,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:51,161 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:51,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:51,164 INFO L85 PathProgramCache]: Analyzing trace with hash -366006867, now seen corresponding path program 1 times [2022-03-15 20:42:51,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:51,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626374969] [2022-03-15 20:42:51,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:51,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:51,370 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:51,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626374969] [2022-03-15 20:42:51,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626374969] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:42:51,371 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:42:51,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 20:42:51,372 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [991490052] [2022-03-15 20:42:51,373 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:51,378 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:51,393 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 20:42:51,394 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:51,833 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:42:51,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:42:51,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:51,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:42:51,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:42:51,853 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 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 20:42:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:51,882 INFO L93 Difference]: Finished difference Result 45 states and 117 transitions. [2022-03-15 20:42:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:42:51,884 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 20:42:51,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:51,892 INFO L225 Difference]: With dead ends: 45 [2022-03-15 20:42:51,892 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 20:42:51,897 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 20:42:51,900 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 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 20:42:51,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:42:51,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 20:42:51,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 20:42:51,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.7) internal successors, (108), 40 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-03-15 20:42:51,928 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 108 transitions. Word has length 11 [2022-03-15 20:42:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:51,928 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 108 transitions. [2022-03-15 20:42:51,929 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 20:42:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 108 transitions. [2022-03-15 20:42:51,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:42:51,930 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:51,931 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:51,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:42:51,931 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:51,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:51,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1639390560, now seen corresponding path program 1 times [2022-03-15 20:42:51,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:51,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673447204] [2022-03-15 20:42:51,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:51,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:51,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:51,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673447204] [2022-03-15 20:42:51,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673447204] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:51,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986969463] [2022-03-15 20:42:51,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:51,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:51,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:51,990 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:52,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 20:42:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:52,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 20:42:52,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:52,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:52,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986969463] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:52,126 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:52,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-03-15 20:42:52,127 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1712547383] [2022-03-15 20:42:52,127 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:52,128 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:52,130 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 20:42:52,130 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:52,359 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [288#(or (<= c i_1) (< i_2 c) (< (+ i_1 1) c)), 286#(or (<= c i_1) (< (+ i_1 1) c)), 285#(< i_1 c), 287#(or (<= (+ i_2 1) c) (< i_1 c))] [2022-03-15 20:42:52,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:42:52,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:52,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:42:52,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:42:52,360 INFO L87 Difference]: Start difference. First operand 41 states and 108 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:52,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:52,526 INFO L93 Difference]: Finished difference Result 105 states and 262 transitions. [2022-03-15 20:42:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:42:52,527 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:42:52,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:52,528 INFO L225 Difference]: With dead ends: 105 [2022-03-15 20:42:52,528 INFO L226 Difference]: Without dead ends: 105 [2022-03-15 20:42:52,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:42:52,529 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 60 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:52,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 1 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:52,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-03-15 20:42:52,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 63. [2022-03-15 20:42:52,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 2.903225806451613) internal successors, (180), 62 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 180 transitions. [2022-03-15 20:42:52,537 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 180 transitions. Word has length 12 [2022-03-15 20:42:52,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:52,537 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 180 transitions. [2022-03-15 20:42:52,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:52,537 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 180 transitions. [2022-03-15 20:42:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:42:52,538 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:52,538 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:52,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 20:42:52,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:52,754 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:52,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:52,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1516493596, now seen corresponding path program 1 times [2022-03-15 20:42:52,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:52,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523743930] [2022-03-15 20:42:52,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:52,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:52,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:52,797 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:52,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523743930] [2022-03-15 20:42:52,797 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523743930] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:42:52,797 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:42:52,797 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 20:42:52,798 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1448641834] [2022-03-15 20:42:52,798 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:52,799 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:52,802 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 20:42:52,802 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:53,045 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [543#(or (< i_1 c) (<= c i_3)), 540#(or (< (+ i_3 1) c) (<= c i_3)), 535#(< i_2 c), 542#(or (< i_2 c) (<= c i_3)), 536#(< i_3 c), 537#(or (< i_3 c) (< i_2 c)), 538#(< i_1 c), 545#(and (or (< i_1 c) (= (+ (* (- 1) i_3) i_2) 0)) (or (<= c i_2) (< i_1 c))), 544#(or (< i_2 c) (< i_1 c) (<= c i_3)), 539#(or (< i_2 c) (< i_1 c)), 541#(or (< i_2 c) (< (+ i_3 1) c) (<= c i_3))] [2022-03-15 20:42:53,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:42:53,046 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:53,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:42:53,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:42:53,047 INFO L87 Difference]: Start difference. First operand 63 states and 180 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:53,270 INFO L93 Difference]: Finished difference Result 69 states and 175 transitions. [2022-03-15 20:42:53,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 20:42:53,270 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:42:53,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:53,271 INFO L225 Difference]: With dead ends: 69 [2022-03-15 20:42:53,271 INFO L226 Difference]: Without dead ends: 55 [2022-03-15 20:42:53,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:42:53,272 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 114 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:53,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 1 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:42:53,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-03-15 20:42:53,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-03-15 20:42:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.7962962962962963) internal successors, (151), 54 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 151 transitions. [2022-03-15 20:42:53,277 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 151 transitions. Word has length 12 [2022-03-15 20:42:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:53,277 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 151 transitions. [2022-03-15 20:42:53,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 151 transitions. [2022-03-15 20:42:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:42:53,278 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:53,278 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:53,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 20:42:53,278 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:53,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:53,278 INFO L85 PathProgramCache]: Analyzing trace with hash -178752373, now seen corresponding path program 1 times [2022-03-15 20:42:53,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:53,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703635391] [2022-03-15 20:42:53,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:53,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:53,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:53,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703635391] [2022-03-15 20:42:53,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703635391] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:53,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677287708] [2022-03-15 20:42:53,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:53,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:53,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:53,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:53,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 20:42:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:53,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:42:53,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:53,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:53,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677287708] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:53,568 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:53,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 8 [2022-03-15 20:42:53,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [962537738] [2022-03-15 20:42:53,569 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:53,570 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:53,575 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 110 transitions. [2022-03-15 20:42:53,575 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:54,580 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [831#(and (<= (+ x_2 x_1) x_3) (< x_3 (+ x_2 x_1 1)) (<= 0 x_1) (<= x_1 0)), 829#(and (<= (+ x_3 b) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 b))), 830#(and (<= (+ x_2 x_1 b a) x_3) (< x_3 (+ x_2 x_1 b a 1))), 827#(and (< x_3 (+ x_2 x_1 a 1)) (<= (+ x_2 x_1 a) x_3)), 828#(and (<= (+ x_2 x_1 b) x_3) (< x_3 (+ x_2 x_1 b 1))), 814#(and (<= (+ x_3 a) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 a)))] [2022-03-15 20:42:54,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:42:54,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:54,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:42:54,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:42:54,581 INFO L87 Difference]: Start difference. First operand 55 states and 151 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:54,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:54,875 INFO L93 Difference]: Finished difference Result 200 states and 543 transitions. [2022-03-15 20:42:54,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:42:54,876 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:42:54,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:54,877 INFO L225 Difference]: With dead ends: 200 [2022-03-15 20:42:54,877 INFO L226 Difference]: Without dead ends: 196 [2022-03-15 20:42:54,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:42:54,878 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:54,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 1 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:42:54,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-03-15 20:42:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 118. [2022-03-15 20:42:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 3.2051282051282053) internal successors, (375), 117 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 375 transitions. [2022-03-15 20:42:54,891 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 375 transitions. Word has length 14 [2022-03-15 20:42:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:54,891 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 375 transitions. [2022-03-15 20:42:54,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 375 transitions. [2022-03-15 20:42:54,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:42:54,895 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:54,895 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:54,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:55,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 20:42:55,117 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:55,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:55,117 INFO L85 PathProgramCache]: Analyzing trace with hash -379091976, now seen corresponding path program 2 times [2022-03-15 20:42:55,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:55,119 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244700454] [2022-03-15 20:42:55,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:55,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:55,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:55,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244700454] [2022-03-15 20:42:55,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244700454] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:55,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629496346] [2022-03-15 20:42:55,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:42:55,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:55,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:55,187 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:55,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 20:42:55,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:42:55,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:55,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:42:55,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:55,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:55,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:55,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629496346] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:55,292 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:55,292 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-03-15 20:42:55,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2080985452] [2022-03-15 20:42:55,293 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:55,294 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:55,299 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 141 transitions. [2022-03-15 20:42:55,299 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:56,160 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [1372#(and (or (<= c i_1) (= (+ (* (- 1) i_2) x_2) 0) (< (+ i_1 1) c)) (or (<= (+ 2 x_2) c) (<= c i_1) (< (+ i_1 1) c))), 1373#(and (or (= (+ (* (- 1) i_2) x_2) 0) (<= c (+ i_1 1)) (< (+ 2 i_1) c)) (or (<= (+ 2 x_2) c) (<= c (+ i_1 1)) (< (+ 2 i_1) c))), 1362#(< i_1 c), 1361#(or (<= (+ 2 i_2) c) (<= c i_2)), 1363#(or (<= (+ i_2 1) c) (< i_1 c)), 1364#(or (<= (+ 2 i_2) c) (<= c i_2) (< i_1 c)), 1367#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 1369#(or (< (+ i_2 1) c) (<= c i_1) (<= c i_2) (< (+ i_1 1) c)), 1368#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (< i_2 c)), 1366#(or (<= c i_1) (< i_2 c) (< (+ i_1 1) c)), 1370#(or (< (+ i_2 1) c) (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c i_2)), 1371#(and (or (= (+ (* (- 1) i_2) x_2) 0) (< i_1 c)) (or (<= (+ 2 x_2) c) (< i_1 c))), 1365#(or (<= c i_1) (< (+ i_1 1) c))] [2022-03-15 20:42:56,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 20:42:56,161 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:56,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 20:42:56,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:42:56,161 INFO L87 Difference]: Start difference. First operand 118 states and 375 transitions. Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:56,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:56,784 INFO L93 Difference]: Finished difference Result 268 states and 927 transitions. [2022-03-15 20:42:56,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 20:42:56,784 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:42:56,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:56,786 INFO L225 Difference]: With dead ends: 268 [2022-03-15 20:42:56,786 INFO L226 Difference]: Without dead ends: 268 [2022-03-15 20:42:56,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 56 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=422, Invalid=1470, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:42:56,787 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 120 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:56,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 1 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:42:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-03-15 20:42:56,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 227. [2022-03-15 20:42:56,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 3.6991150442477876) internal successors, (836), 226 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 836 transitions. [2022-03-15 20:42:56,816 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 836 transitions. Word has length 15 [2022-03-15 20:42:56,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:56,816 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 836 transitions. [2022-03-15 20:42:56,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:56,817 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 836 transitions. [2022-03-15 20:42:56,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:42:56,817 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:56,817 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:56,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:57,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:57,031 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:57,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:57,032 INFO L85 PathProgramCache]: Analyzing trace with hash 61618697, now seen corresponding path program 3 times [2022-03-15 20:42:57,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:57,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773263665] [2022-03-15 20:42:57,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:57,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:57,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:57,090 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:57,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773263665] [2022-03-15 20:42:57,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773263665] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:57,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742410549] [2022-03-15 20:42:57,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:42:57,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:57,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:57,091 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:57,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 20:42:57,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 20:42:57,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:57,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:42:57,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:57,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:57,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742410549] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:57,180 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:57,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-03-15 20:42:57,180 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [167041709] [2022-03-15 20:42:57,180 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:57,181 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:57,186 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 147 transitions. [2022-03-15 20:42:57,186 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:58,015 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [2247#(and (or (<= c i_1) (= (+ (* (- 1) i_2) x_2) 0) (< (+ i_1 1) c)) (or (<= c i_1) (<= c (+ i_2 1)) (< (+ i_1 1) c))), 2238#(or (< i_2 c) (< i_1 c)), 2243#(or (<= c i_1) (< (+ 2 i_2) c) (<= c (+ i_2 1)) (< (+ i_1 1) c)), 2236#(< i_1 c), 2233#(< i_2 c), 2235#(or (< (+ 2 i_2) c) (<= c (+ i_2 1))), 2245#(or (<= c i_1) (<= c i_2) (< (+ i_1 1) c)), 2234#(or (< (+ i_2 1) c) (<= c i_2)), 2246#(and (or (= (+ (* (- 1) i_2) x_2) 0) (< i_1 c)) (or (<= c (+ x_2 1)) (< i_1 c))), 2244#(or (<= c i_2) (< i_1 c)), 2241#(or (< (+ 2 i_2) c) (<= c (+ i_2 1)) (< i_1 c)), 2242#(or (< (+ i_2 1) c) (<= c i_1) (<= c i_2) (< (+ i_1 1) c)), 2239#(or (<= c i_1) (< i_2 c) (< (+ i_1 1) c)), 2237#(or (<= c i_1) (< (+ i_1 1) c)), 2240#(or (< (+ i_2 1) c) (<= c i_2) (< i_1 c))] [2022-03-15 20:42:58,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 20:42:58,015 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:58,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 20:42:58,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:42:58,016 INFO L87 Difference]: Start difference. First operand 227 states and 836 transitions. Second operand has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 20 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:58,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:58,482 INFO L93 Difference]: Finished difference Result 369 states and 1225 transitions. [2022-03-15 20:42:58,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 20:42:58,482 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 20 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:42:58,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:58,484 INFO L225 Difference]: With dead ends: 369 [2022-03-15 20:42:58,484 INFO L226 Difference]: Without dead ends: 363 [2022-03-15 20:42:58,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=322, Invalid=1238, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 20:42:58,485 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 214 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:58,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 1 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:42:58,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-03-15 20:42:58,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 269. [2022-03-15 20:42:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 3.58955223880597) internal successors, (962), 268 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 962 transitions. [2022-03-15 20:42:58,496 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 962 transitions. Word has length 15 [2022-03-15 20:42:58,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:58,496 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 962 transitions. [2022-03-15 20:42:58,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 20 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 962 transitions. [2022-03-15 20:42:58,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:42:58,497 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:58,497 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:58,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:58,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:58,713 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:42:58,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:58,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1268551682, now seen corresponding path program 4 times [2022-03-15 20:42:58,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:58,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277141019] [2022-03-15 20:42:58,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:58,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:58,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:58,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:58,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277141019] [2022-03-15 20:42:58,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277141019] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:58,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83750171] [2022-03-15 20:42:58,760 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:42:58,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:58,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:58,761 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:58,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 20:42:58,784 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:42:58,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:58,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:42:58,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:58,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:58,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83750171] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:58,845 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:58,845 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-03-15 20:42:58,845 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [440265318] [2022-03-15 20:42:58,845 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:58,846 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:58,851 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 141 transitions. [2022-03-15 20:42:58,851 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:59,480 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [3284#(or (< i_1 c) (<= c i_3)), 3288#(or (<= c i_1) (<= c (+ i_3 1)) (< (+ i_1 1) c)), 3281#(< i_1 c), 3282#(or (<= c i_1) (< (+ i_1 1) c)), 3290#(and (or (<= c i_1) (<= c (+ i_3 1)) (< (+ i_1 1) c)) (or (<= c i_1) (= (+ (* (- 1) i_3) x_2) 0) (< (+ i_1 1) c))), 3286#(or (<= c i_1) (<= c i_3) (< (+ i_1 1) c)), 3285#(or (< (+ 2 i_3) c) (<= c (+ i_3 1))), 3283#(or (< (+ i_3 1) c) (<= c i_3)), 3280#(< i_3 c), 3287#(or (<= c (+ i_3 1)) (< i_1 c)), 3289#(and (or (= (+ (* (- 1) i_3) x_2) 0) (< i_1 c)) (or (<= c (+ i_3 1)) (< i_1 c)))] [2022-03-15 20:42:59,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 20:42:59,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:59,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 20:42:59,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:42:59,481 INFO L87 Difference]: Start difference. First operand 269 states and 962 transitions. Second operand has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:59,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:59,788 INFO L93 Difference]: Finished difference Result 440 states and 1530 transitions. [2022-03-15 20:42:59,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 20:42:59,788 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:42:59,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:59,790 INFO L225 Difference]: With dead ends: 440 [2022-03-15 20:42:59,790 INFO L226 Difference]: Without dead ends: 415 [2022-03-15 20:42:59,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:42:59,791 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 104 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:59,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 1 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:42:59,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-03-15 20:42:59,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 310. [2022-03-15 20:42:59,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 3.766990291262136) internal successors, (1164), 309 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:59,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 1164 transitions. [2022-03-15 20:42:59,800 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 1164 transitions. Word has length 15 [2022-03-15 20:42:59,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:59,800 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 1164 transitions. [2022-03-15 20:42:59,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:59,800 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 1164 transitions. [2022-03-15 20:42:59,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:42:59,801 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:59,801 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:59,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 20:43:00,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:00,015 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:00,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:00,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1853941700, now seen corresponding path program 5 times [2022-03-15 20:43:00,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:00,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628948580] [2022-03-15 20:43:00,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:00,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:00,088 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 20:43:00,088 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:00,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628948580] [2022-03-15 20:43:00,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628948580] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:00,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151801045] [2022-03-15 20:43:00,089 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:43:00,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:00,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:00,091 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:00,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 20:43:00,121 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:43:00,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:00,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:43:00,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:00,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:00,196 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151801045] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:00,196 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:00,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-03-15 20:43:00,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [398923531] [2022-03-15 20:43:00,197 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:00,198 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:00,204 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 189 transitions. [2022-03-15 20:43:00,204 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:01,259 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [4485#(and (or (<= c i_1) (<= (+ 2 i_3) c) (< (+ i_1 1) c)) (or (<= c i_1) (= (+ (* (- 1) i_3) x_2) 0) (< (+ i_1 1) c))), 4476#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 4479#(or (<= c i_1) (< i_3 c) (< (+ i_1 1) c)), 4482#(or (<= c i_1) (<= (+ 2 i_3) c) (< (+ i_1 1) c)), 4478#(or (< i_3 c) (< i_1 c)), 4486#(and (or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (= i_3 x_2)) (or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= (+ 2 i_3) c))), 4474#(< i_1 c), 4477#(or (<= (+ 2 i_3) c) (<= c i_3)), 4483#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= (+ 2 i_3) c)), 4480#(or (<= (+ 2 i_3) c) (< i_1 c)), 4481#(or (< i_3 c) (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 4484#(and (or (<= (+ 2 i_3) c) (< i_1 c)) (or (= (+ (* (- 1) i_3) x_2) 0) (< i_1 c))), 4475#(or (<= c i_1) (< (+ i_1 1) c))] [2022-03-15 20:43:01,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:43:01,259 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:01,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:43:01,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:43:01,260 INFO L87 Difference]: Start difference. First operand 310 states and 1164 transitions. Second operand has 20 states, 20 states have (on average 3.8) internal successors, (76), 19 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:01,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:01,820 INFO L93 Difference]: Finished difference Result 622 states and 2182 transitions. [2022-03-15 20:43:01,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 20:43:01,820 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 19 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:43:01,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:01,823 INFO L225 Difference]: With dead ends: 622 [2022-03-15 20:43:01,824 INFO L226 Difference]: Without dead ends: 619 [2022-03-15 20:43:01,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 76 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=426, Invalid=1466, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:43:01,825 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 135 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:01,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 1 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:43:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-03-15 20:43:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 466. [2022-03-15 20:43:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 3.806451612903226) internal successors, (1770), 465 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:01,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1770 transitions. [2022-03-15 20:43:01,837 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1770 transitions. Word has length 16 [2022-03-15 20:43:01,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:01,837 INFO L470 AbstractCegarLoop]: Abstraction has 466 states and 1770 transitions. [2022-03-15 20:43:01,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 19 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1770 transitions. [2022-03-15 20:43:01,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:43:01,839 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:01,839 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:01,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 20:43:02,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:02,051 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:02,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:02,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1655891093, now seen corresponding path program 6 times [2022-03-15 20:43:02,053 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:02,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925638923] [2022-03-15 20:43:02,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:02,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:43:02,089 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:02,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925638923] [2022-03-15 20:43:02,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925638923] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:02,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664730458] [2022-03-15 20:43:02,090 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:43:02,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:02,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:02,091 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:02,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 20:43:02,130 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:43:02,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:02,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:43:02,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:43:02,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:02,186 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:43:02,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664730458] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:02,187 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:02,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2022-03-15 20:43:02,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [109077250] [2022-03-15 20:43:02,190 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:02,191 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:02,201 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 172 transitions. [2022-03-15 20:43:02,201 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:03,018 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [6184#(or (< i_2 c) (< i_1 c)), 6192#(or (< (+ i_2 1) c) (<= c i_1) (<= c i_2) (< (+ i_1 1) c)), 6189#(or (< (+ i_2 1) c) (<= c i_2)), 6188#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (< i_2 c)), 6183#(< i_1 c), 6197#(or (<= c i_2) (<= (+ 2 i_2) i_1)), 6190#(or (<= (+ 3 i_2) c) (<= c i_2)), 6191#(or (< (+ i_2 1) c) (<= c i_2) (< i_1 c)), 6186#(or (<= c i_1) (< i_2 c) (< (+ i_1 1) c)), 6196#(or (< (+ i_2 1) c) (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c i_2)), 6193#(or (< (+ i_2 1) c) (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c i_2)), 6110#(< i_2 c), 6187#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 6185#(or (<= c i_1) (< (+ i_1 1) c)), 6194#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c)), 6198#(or (<= c i_2) (<= (+ i_2 1) i_1)), 6195#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (< i_2 c))] [2022-03-15 20:43:03,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 20:43:03,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:03,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 20:43:03,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:43:03,019 INFO L87 Difference]: Start difference. First operand 466 states and 1770 transitions. Second operand has 24 states, 24 states have (on average 4.0) internal successors, (96), 23 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:03,948 INFO L93 Difference]: Finished difference Result 1216 states and 4053 transitions. [2022-03-15 20:43:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 20:43:03,948 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.0) internal successors, (96), 23 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:43:03,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:03,954 INFO L225 Difference]: With dead ends: 1216 [2022-03-15 20:43:03,954 INFO L226 Difference]: Without dead ends: 1216 [2022-03-15 20:43:03,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=867, Invalid=2793, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 20:43:03,956 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 368 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:03,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 1 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:43:03,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2022-03-15 20:43:03,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 667. [2022-03-15 20:43:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 3.7762762762762763) internal successors, (2515), 666 states have internal predecessors, (2515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:03,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2515 transitions. [2022-03-15 20:43:03,978 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 2515 transitions. Word has length 16 [2022-03-15 20:43:03,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:03,979 INFO L470 AbstractCegarLoop]: Abstraction has 667 states and 2515 transitions. [2022-03-15 20:43:03,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.0) internal successors, (96), 23 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:03,979 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 2515 transitions. [2022-03-15 20:43:03,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:43:03,981 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:03,981 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:04,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 20:43:04,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:04,200 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:04,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:04,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1659813267, now seen corresponding path program 7 times [2022-03-15 20:43:04,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:04,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498287746] [2022-03-15 20:43:04,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:04,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:04,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:04,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498287746] [2022-03-15 20:43:04,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498287746] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:04,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833295782] [2022-03-15 20:43:04,304 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:43:04,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:04,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:04,305 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:04,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 20:43:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:04,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 20:43:04,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:04,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:04,595 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:04,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833295782] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:04,595 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:04,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2022-03-15 20:43:04,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [924614243] [2022-03-15 20:43:04,596 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:04,597 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:04,607 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 242 transitions. [2022-03-15 20:43:04,607 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:06,361 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [8947#(and (<= (+ x_2 x_1) (+ (* 2 b) x_3)) (<= (+ (* 2 b) x_3) (+ x_2 x_1))), 8930#(and (<= (+ x_3 a) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 a))), 8940#(and (<= (+ x_2 x_1 b) x_3) (< x_3 (+ x_2 x_1 b 1))), 8949#(and (< x_3 (+ (* 2 b) x_2 x_1 (* 2 a) 1)) (<= (+ (* 2 b) x_2 x_1 (* 2 a)) x_3)), 8946#(and (<= (+ x_2 x_1 a) (+ x_3 b)) (<= (+ x_3 b) (+ x_2 x_1 a))), 8950#(and (<= (+ x_2 x_1) x_3) (< x_3 (+ x_2 x_1 1)) (<= 0 x_1) (<= x_1 0)), 8920#(and (<= (+ x_2 x_1) (+ x_3 (* 2 a))) (<= (+ x_3 (* 2 a)) (+ x_2 x_1))), 8944#(and (<= (+ (* 2 b) x_3 a) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ (* 2 b) x_3 a))), 8948#(and (<= (+ (* 2 b) x_2 x_1 a) x_3) (< x_3 (+ (* 2 b) x_2 x_1 a 1))), 8941#(and (<= (+ (* 2 b) x_2 x_1) x_3) (< x_3 (+ (* 2 b) x_2 x_1 1))), 8937#(and (< x_3 (+ x_2 x_1 a 1)) (<= (+ x_2 x_1 a) x_3)), 8943#(and (<= (+ x_2 x_1 b a) x_3) (< x_3 (+ x_2 x_1 b a 1))), 8938#(and (< x_3 (+ x_2 x_1 (* 2 a) 1)) (<= (+ x_2 x_1 (* 2 a)) x_3)), 8939#(and (<= (+ x_3 b) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 b))), 8942#(and (<= (+ x_3 a) (+ x_2 x_1 b)) (<= (+ x_2 x_1 b) (+ x_3 a))), 8945#(and (< x_3 (+ x_2 x_1 b (* 2 a) 1)) (<= (+ x_2 x_1 b (* 2 a)) x_3))] [2022-03-15 20:43:06,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:43:06,361 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:06,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:43:06,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=915, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:43:06,362 INFO L87 Difference]: Start difference. First operand 667 states and 2515 transitions. Second operand has 25 states, 24 states have (on average 4.333333333333333) internal successors, (104), 24 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:07,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:07,984 INFO L93 Difference]: Finished difference Result 1542 states and 5127 transitions. [2022-03-15 20:43:07,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 20:43:07,985 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.333333333333333) internal successors, (104), 24 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 17 [2022-03-15 20:43:07,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:07,992 INFO L225 Difference]: With dead ends: 1542 [2022-03-15 20:43:07,992 INFO L226 Difference]: Without dead ends: 1532 [2022-03-15 20:43:07,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 89 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=915, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:43:07,993 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 100 mSDsluCounter, 2531 mSDsCounter, 0 mSdLazyCounter, 4313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 4314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:07,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 1 Invalid, 4314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4313 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 20:43:07,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2022-03-15 20:43:08,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 907. [2022-03-15 20:43:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 3.8940397350993377) internal successors, (3528), 906 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 3528 transitions. [2022-03-15 20:43:08,026 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 3528 transitions. Word has length 17 [2022-03-15 20:43:08,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:08,026 INFO L470 AbstractCegarLoop]: Abstraction has 907 states and 3528 transitions. [2022-03-15 20:43:08,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.333333333333333) internal successors, (104), 24 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:08,027 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 3528 transitions. [2022-03-15 20:43:08,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:43:08,029 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:08,029 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:08,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 20:43:08,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 20:43:08,244 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:08,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2091909234, now seen corresponding path program 8 times [2022-03-15 20:43:08,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:08,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319126496] [2022-03-15 20:43:08,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:08,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:43:08,306 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:08,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319126496] [2022-03-15 20:43:08,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319126496] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:08,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341022753] [2022-03-15 20:43:08,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:43:08,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:08,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:08,309 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:08,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 20:43:08,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:43:08,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:08,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:43:08,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:08,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 20:43:08,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 20:43:08,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341022753] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:08,375 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:08,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2022-03-15 20:43:08,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1565233198] [2022-03-15 20:43:08,375 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:08,376 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:08,384 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 203 transitions. [2022-03-15 20:43:08,384 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:09,423 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [12413#(or (< (+ i_2 1) c) (<= c i_2)), 12422#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (< i_2 c)), 12421#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (< i_2 c)), 12424#(or (< (+ i_2 1) c) (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c i_2)), 12433#(or (< i_2 c) (<= c (+ 3 i_1)) (< (+ i_1 4) c)), 12427#(or (< i_2 c) (<= (+ c 1) i_1)), 12420#(or (<= c i_1) (< i_2 c) (< (+ i_1 1) c)), 12416#(or (< (+ i_2 1) c) (<= c i_2) (< i_1 c)), 12418#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 12434#(or (< (+ i_2 1) c) (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c i_2)), 12414#(< i_1 c), 12419#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c)), 12415#(or (< i_2 c) (< i_1 c)), 12431#(or (< (+ i_2 1) c) (<= c i_1) (<= c i_2)), 12432#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c)), 12417#(or (<= c i_1) (< (+ i_1 1) c)), 12425#(or (< (+ i_2 1) c) (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c i_2)), 12428#(or (<= c i_1) (< i_2 c)), 12423#(or (< (+ i_2 1) c) (<= c i_1) (<= c i_2) (< (+ i_1 1) c)), 12430#(or (< (+ i_2 1) c) (<= c i_2) (<= (+ c 1) i_1)), 12412#(< i_2 c), 12426#(or (< i_2 c) (<= (+ 2 c) i_1)), 12429#(or (< (+ i_2 1) c) (<= (+ 2 c) i_1) (<= c i_2))] [2022-03-15 20:43:09,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 20:43:09,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:09,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 20:43:09,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=787, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:43:09,424 INFO L87 Difference]: Start difference. First operand 907 states and 3528 transitions. Second operand has 31 states, 31 states have (on average 3.774193548387097) internal successors, (117), 30 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:10,413 INFO L93 Difference]: Finished difference Result 1866 states and 6950 transitions. [2022-03-15 20:43:10,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 20:43:10,413 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.774193548387097) internal successors, (117), 30 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:43:10,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:10,422 INFO L225 Difference]: With dead ends: 1866 [2022-03-15 20:43:10,423 INFO L226 Difference]: Without dead ends: 1850 [2022-03-15 20:43:10,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1327 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=914, Invalid=3916, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 20:43:10,425 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 459 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:10,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 1 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:43:10,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2022-03-15 20:43:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1146. [2022-03-15 20:43:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1145 states have (on average 3.9179039301310046) internal successors, (4486), 1145 states have internal predecessors, (4486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 4486 transitions. [2022-03-15 20:43:10,464 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 4486 transitions. Word has length 17 [2022-03-15 20:43:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:10,465 INFO L470 AbstractCegarLoop]: Abstraction has 1146 states and 4486 transitions. [2022-03-15 20:43:10,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.774193548387097) internal successors, (117), 30 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 4486 transitions. [2022-03-15 20:43:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:43:10,469 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:10,469 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:10,493 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 20:43:10,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:10,687 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:10,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:10,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1651190351, now seen corresponding path program 9 times [2022-03-15 20:43:10,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:10,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433296168] [2022-03-15 20:43:10,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:10,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:10,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:10,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433296168] [2022-03-15 20:43:10,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433296168] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:10,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117452528] [2022-03-15 20:43:10,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:43:10,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:10,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:10,764 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:10,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 20:43:10,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:43:10,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:10,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:43:10,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:10,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:10,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117452528] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:10,851 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:10,851 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 20:43:10,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [982517277] [2022-03-15 20:43:10,851 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:10,852 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:10,865 INFO L252 McrAutomatonBuilder]: Finished intersection with 132 states and 304 transitions. [2022-03-15 20:43:10,865 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:12,372 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [16785#(< i_1 c), 16786#(or (< i_2 c) (< i_1 c)), 16800#(or (<= c i_1) (<= c (+ 2 i_2)) (< (+ 3 i_2) c) (< (+ i_1 1) c)), 16784#(or (< (+ i_2 1) c) (<= c i_2)), 16809#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ i_2 1))), 16794#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 16803#(or (<= c i_1) (<= c i_2) (< (+ i_1 1) c)), 16795#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (< i_2 c)), 16798#(or (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 16802#(or (<= c i_2) (< i_1 c)), 16808#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c i_2)), 16791#(or (<= c i_1) (< i_2 c) (< (+ i_1 1) c)), 16793#(or (<= c i_1) (< (+ 2 i_2) c) (<= c (+ i_2 1)) (< (+ i_1 1) c)), 16804#(or (<= c (+ i_2 1)) (< i_1 c)), 16806#(and (or (= (+ (* (- 1) i_2) x_2) 0) (< i_1 c)) (or (<= c (+ 2 i_2)) (< i_1 c))), 16792#(or (< (+ i_2 1) c) (<= c i_1) (<= c i_2) (< (+ i_1 1) c)), 16810#(and (or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (= i_2 x_2)) (or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 2 i_2)))), 16805#(or (<= c i_1) (<= c (+ i_2 1)) (< (+ i_1 1) c)), 16796#(or (< (+ i_2 1) c) (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c i_2)), 16801#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 16807#(and (or (<= c i_1) (= (+ (* (- 1) i_2) x_2) 0) (< (+ i_1 1) c)) (or (<= c i_1) (<= c (+ 2 i_2)) (< (+ i_1 1) c))), 16783#(< i_2 c), 16799#(or (<= c (+ 2 i_2)) (< i_1 c) (< (+ 3 i_2) c)), 16787#(or (< (+ i_2 1) c) (<= c i_2) (< i_1 c)), 16789#(or (< (+ 2 i_2) c) (<= c (+ i_2 1)) (< i_1 c)), 16797#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 16790#(or (<= c i_1) (< (+ i_1 1) c)), 16788#(or (< (+ 2 i_2) c) (<= c (+ i_2 1)))] [2022-03-15 20:43:12,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 20:43:12,373 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:12,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 20:43:12,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1336, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 20:43:12,373 INFO L87 Difference]: Start difference. First operand 1146 states and 4486 transitions. Second operand has 36 states, 36 states have (on average 3.6944444444444446) internal successors, (133), 35 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 20:43:13,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:13,523 INFO L93 Difference]: Finished difference Result 1733 states and 6378 transitions. [2022-03-15 20:43:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 20:43:13,524 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.6944444444444446) internal successors, (133), 35 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 18 [2022-03-15 20:43:13,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:13,543 INFO L225 Difference]: With dead ends: 1733 [2022-03-15 20:43:13,543 INFO L226 Difference]: Without dead ends: 1703 [2022-03-15 20:43:13,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1102, Invalid=4598, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 20:43:13,545 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 523 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:13,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 1 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:43:13,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2022-03-15 20:43:13,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1298. [2022-03-15 20:43:13,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1297 states have (on average 3.941403238242097) internal successors, (5112), 1297 states have internal predecessors, (5112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 5112 transitions. [2022-03-15 20:43:13,606 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 5112 transitions. Word has length 18 [2022-03-15 20:43:13,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:13,606 INFO L470 AbstractCegarLoop]: Abstraction has 1298 states and 5112 transitions. [2022-03-15 20:43:13,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.6944444444444446) internal successors, (133), 35 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 20:43:13,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 5112 transitions. [2022-03-15 20:43:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:43:13,612 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:13,612 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:13,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 20:43:13,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 20:43:13,838 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:13,839 INFO L85 PathProgramCache]: Analyzing trace with hash 63200860, now seen corresponding path program 10 times [2022-03-15 20:43:13,839 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:13,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698282757] [2022-03-15 20:43:13,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:13,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:43:13,917 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:13,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698282757] [2022-03-15 20:43:13,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698282757] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:13,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072863751] [2022-03-15 20:43:13,917 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:43:13,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:13,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:13,932 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:13,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 20:43:13,957 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:43:13,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:13,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:43:13,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:13,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:14,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072863751] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:14,021 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:14,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2022-03-15 20:43:14,022 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [334464616] [2022-03-15 20:43:14,022 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:14,023 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:14,034 INFO L252 McrAutomatonBuilder]: Finished intersection with 129 states and 295 transitions. [2022-03-15 20:43:14,034 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:15,411 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [21333#(or (<= c i_1) (<= c i_3) (< (+ i_1 1) c)), 21330#(< i_3 c), 21334#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 21329#(or (< i_1 c) (<= c (+ 2 i_3))), 21337#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ i_3 1))), 21338#(or (< (+ 2 i_3) c) (<= c (+ i_3 1))), 21336#(or (<= c i_1) (<= c (+ i_3 1)) (< (+ i_1 1) c)), 21328#(or (<= c (+ i_3 1)) (< i_1 c)), 21331#(or (< (+ i_3 1) c) (<= c i_3)), 21326#(< i_1 c), 21342#(and (or (<= c (+ 2 x_2)) (< i_1 c)) (or (= (+ (* (- 1) i_3) x_2) 0) (< i_1 c))), 21340#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 2 i_3))), 21332#(or (<= c i_1) (< (+ i_1 1) c)), 21341#(or (< (+ 3 i_3) c) (<= c (+ 2 i_3))), 21327#(or (< i_1 c) (<= c i_3)), 21335#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c i_3)), 21344#(and (or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 2 i_3))) (or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (= i_3 x_2))), 21339#(or (<= c i_1) (<= c (+ 2 i_3)) (< (+ i_1 1) c)), 21343#(and (or (<= c i_1) (= (+ (* (- 1) i_3) x_2) 0) (< (+ i_1 1) c)) (or (<= c i_1) (<= c (+ 2 i_3)) (< (+ i_1 1) c)))] [2022-03-15 20:43:15,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 20:43:15,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:15,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 20:43:15,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:43:15,412 INFO L87 Difference]: Start difference. First operand 1298 states and 5112 transitions. Second operand has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 27 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:15,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:15,920 INFO L93 Difference]: Finished difference Result 1922 states and 7108 transitions. [2022-03-15 20:43:15,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 20:43:15,920 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 27 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:43:15,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:15,929 INFO L225 Difference]: With dead ends: 1922 [2022-03-15 20:43:15,929 INFO L226 Difference]: Without dead ends: 1874 [2022-03-15 20:43:15,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=551, Invalid=2205, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 20:43:15,930 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 156 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:15,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 1 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:43:15,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2022-03-15 20:43:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1391. [2022-03-15 20:43:15,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1390 states have (on average 3.9589928057553956) internal successors, (5503), 1390 states have internal predecessors, (5503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 5503 transitions. [2022-03-15 20:43:15,984 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 5503 transitions. Word has length 18 [2022-03-15 20:43:15,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:15,985 INFO L470 AbstractCegarLoop]: Abstraction has 1391 states and 5503 transitions. [2022-03-15 20:43:15,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 27 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 5503 transitions. [2022-03-15 20:43:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:43:15,993 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:15,993 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:16,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 20:43:16,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 20:43:16,212 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:16,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:16,212 INFO L85 PathProgramCache]: Analyzing trace with hash -188457109, now seen corresponding path program 11 times [2022-03-15 20:43:16,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:16,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071644604] [2022-03-15 20:43:16,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:16,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:16,254 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 20:43:16,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:16,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071644604] [2022-03-15 20:43:16,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071644604] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:16,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914329005] [2022-03-15 20:43:16,255 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:43:16,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:16,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:16,265 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:16,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 20:43:16,290 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:43:16,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:16,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:43:16,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:16,345 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:16,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:16,419 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:16,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914329005] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:16,419 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:16,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-03-15 20:43:16,420 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1180896207] [2022-03-15 20:43:16,420 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:16,421 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:16,435 INFO L252 McrAutomatonBuilder]: Finished intersection with 127 states and 290 transitions. [2022-03-15 20:43:16,435 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:17,936 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [26214#(or (< i_2 c) (< (+ i_3 1) c) (<= c i_3)), 26225#(or (<= c (+ 2 i_2)) (< (+ i_3 1) c) (< (+ 3 i_2) c) (<= c i_3)), 26216#(or (< (+ i_2 1) c) (<= c i_2) (< (+ i_3 1) c) (<= c i_3)), 26212#(or (< (+ i_2 1) c) (<= (+ 2 i_3) c) (<= c i_2)), 26227#(or (< (+ 2 i_2) c) (<= (+ 3 i_3) c) (<= c (+ i_2 1))), 26219#(or (< (+ 2 i_2) c) (<= c (+ i_2 1))), 26210#(or (< (+ i_2 1) c) (<= c i_2)), 26215#(or (< i_2 c) (<= (+ 3 i_3) c)), 26228#(or (<= c (+ 2 i_2)) (<= (+ 3 i_3) c) (< (+ 3 i_2) c)), 26169#(< i_3 c), 26220#(or (< i_3 c) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 26208#(or (< i_3 c) (< i_2 c)), 26224#(or (< i_3 c) (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 26217#(or (< (+ i_2 1) c) (<= c i_2) (<= (+ 3 i_3) c)), 26222#(or (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 26229#(or (<= (+ 3 i_3) c) (<= c (+ i_2 1))), 26213#(or (< (+ i_3 1) c) (<= c i_3)), 26207#(< i_2 c), 26230#(or (<= c (+ 2 i_2)) (<= (+ 3 i_3) c)), 26211#(or (< (+ i_2 1) c) (< i_3 c) (<= c i_2)), 26223#(or (< (+ 2 i_2) c) (< (+ i_3 1) c) (<= c (+ i_2 1)) (<= c i_3)), 26221#(or (<= (+ 2 i_3) c) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 26226#(or (<= (+ 2 i_3) c) (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 26218#(or (<= c i_2) (<= (+ 3 i_3) c)), 26209#(or (<= (+ 2 i_3) c) (< i_2 c))] [2022-03-15 20:43:17,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 20:43:17,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:17,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 20:43:17,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:43:17,937 INFO L87 Difference]: Start difference. First operand 1391 states and 5503 transitions. Second operand has 32 states, 32 states have (on average 3.6875) internal successors, (118), 31 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 20:43:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:19,242 INFO L93 Difference]: Finished difference Result 5203 states and 20286 transitions. [2022-03-15 20:43:19,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-15 20:43:19,242 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.6875) internal successors, (118), 31 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 18 [2022-03-15 20:43:19,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:19,289 INFO L225 Difference]: With dead ends: 5203 [2022-03-15 20:43:19,289 INFO L226 Difference]: Without dead ends: 5197 [2022-03-15 20:43:19,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2131 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1564, Invalid=5746, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 20:43:19,292 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 538 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:19,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [538 Valid, 1 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:43:19,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2022-03-15 20:43:19,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 3670. [2022-03-15 20:43:19,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3670 states, 3669 states have (on average 4.284273644044699) internal successors, (15719), 3669 states have internal predecessors, (15719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:19,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 15719 transitions. [2022-03-15 20:43:19,403 INFO L78 Accepts]: Start accepts. Automaton has 3670 states and 15719 transitions. Word has length 18 [2022-03-15 20:43:19,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:19,404 INFO L470 AbstractCegarLoop]: Abstraction has 3670 states and 15719 transitions. [2022-03-15 20:43:19,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.6875) internal successors, (118), 31 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 20:43:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand 3670 states and 15719 transitions. [2022-03-15 20:43:19,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:43:19,414 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:19,414 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:19,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 20:43:19,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 20:43:19,644 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:19,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash 764260827, now seen corresponding path program 12 times [2022-03-15 20:43:19,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:19,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625503710] [2022-03-15 20:43:19,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:19,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:19,688 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 20:43:19,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:19,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625503710] [2022-03-15 20:43:19,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625503710] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:19,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776815968] [2022-03-15 20:43:19,689 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:43:19,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:19,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:19,696 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:19,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 20:43:19,724 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:43:19,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:19,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:43:19,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:19,757 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 20:43:19,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 20:43:19,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776815968] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:19,782 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:19,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 9 [2022-03-15 20:43:19,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [38849467] [2022-03-15 20:43:19,782 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:19,784 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:19,798 INFO L252 McrAutomatonBuilder]: Finished intersection with 150 states and 349 transitions. [2022-03-15 20:43:19,798 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:21,801 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 33 new interpolants: [39012#(or (<= c (+ i_2 1)) (<= c i_3) (<= (+ i_3 4) c)), 38998#(or (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 38999#(<= c (+ 2 i_2)), 39022#(or (<= c (+ 3 i_2)) (<= c i_3) (<= (+ i_3 4) c)), 39010#(or (<= c i_2) (<= c i_3) (<= (+ i_3 4) c)), 39007#(or (< i_2 c) (< (+ i_3 1) c) (<= c i_3)), 39017#(<= c (+ 3 i_2)), 38904#(< i_3 c), 39016#(or (< (+ i_2 4) c) (< i_3 c) (<= c (+ 3 i_2))), 39013#(or (<= c (+ 2 i_2)) (< (+ i_3 1) c) (< (+ 3 i_2) c) (<= c i_3)), 39008#(or (<= c i_3) (<= (+ i_3 4) c)), 39004#(or (<= (+ 3 i_3) c) (<= c (+ i_2 1))), 39018#(or (<= c (+ 3 i_2)) (<= (+ 3 i_3) c)), 39003#(or (< i_3 c) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 39021#(or (< (+ i_2 4) c) (<= c (+ 3 i_2)) (< (+ i_3 1) c) (<= c i_3)), 39001#(or (< (+ i_2 1) c) (< i_3 c) (<= c i_2)), 38992#(or (< (+ i_3 1) c) (<= c i_3)), 39020#(or (<= c i_3) (<= (+ 2 i_3) i_2)), 39009#(or (< (+ i_2 1) c) (<= c i_2) (< (+ i_3 1) c) (<= c i_3)), 39005#(or (< i_3 c) (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 38993#(< i_2 c), 39000#(or (< i_3 c) (< i_2 c)), 38995#(or (< (+ 2 i_2) c) (<= c (+ i_2 1))), 38997#(<= c (+ i_2 1)), 38996#(<= c i_2), 39002#(or (<= c i_2) (<= (+ 3 i_3) c)), 38994#(or (< (+ i_2 1) c) (<= c i_2)), 39006#(or (<= c (+ 2 i_2)) (<= (+ 3 i_3) c)), 39023#(or (<= (+ i_3 1) i_2) (<= c i_3)), 39014#(or (<= c (+ 2 i_2)) (<= c i_3) (<= (+ i_3 4) c)), 39011#(or (< (+ 2 i_2) c) (< (+ i_3 1) c) (<= c (+ i_2 1)) (<= c i_3)), 39015#(or (< (+ i_2 4) c) (<= c (+ 3 i_2))), 39019#(or (<= (+ 3 i_3) i_2) (<= c i_3))] [2022-03-15 20:43:21,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 20:43:21,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:21,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 20:43:21,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=1398, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:43:21,803 INFO L87 Difference]: Start difference. First operand 3670 states and 15719 transitions. Second operand has 41 states, 41 states have (on average 3.5853658536585367) internal successors, (147), 40 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:24,013 INFO L93 Difference]: Finished difference Result 10588 states and 43544 transitions. [2022-03-15 20:43:24,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 20:43:24,013 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.5853658536585367) internal successors, (147), 40 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 20:43:24,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:24,049 INFO L225 Difference]: With dead ends: 10588 [2022-03-15 20:43:24,049 INFO L226 Difference]: Without dead ends: 10326 [2022-03-15 20:43:24,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4229 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2625, Invalid=10257, Unknown=0, NotChecked=0, Total=12882 [2022-03-15 20:43:24,055 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 774 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:24,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [774 Valid, 1 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:43:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10326 states. [2022-03-15 20:43:24,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10326 to 4812. [2022-03-15 20:43:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4811 states have (on average 4.297651215963417) internal successors, (20676), 4811 states have internal predecessors, (20676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 20676 transitions. [2022-03-15 20:43:24,221 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 20676 transitions. Word has length 19 [2022-03-15 20:43:24,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:24,221 INFO L470 AbstractCegarLoop]: Abstraction has 4812 states and 20676 transitions. [2022-03-15 20:43:24,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.5853658536585367) internal successors, (147), 40 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:24,222 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 20676 transitions. [2022-03-15 20:43:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:43:24,233 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:24,233 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:24,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-15 20:43:24,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 20:43:24,455 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:24,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:24,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1548369845, now seen corresponding path program 13 times [2022-03-15 20:43:24,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:24,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227061125] [2022-03-15 20:43:24,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:24,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:24,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:24,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227061125] [2022-03-15 20:43:24,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227061125] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:24,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311941041] [2022-03-15 20:43:24,633 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:43:24,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:24,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:24,634 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:24,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 20:43:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:24,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 20:43:24,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:24,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:25,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311941041] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:25,109 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:25,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 23 [2022-03-15 20:43:25,109 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1537518280] [2022-03-15 20:43:25,109 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:25,110 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:25,128 INFO L252 McrAutomatonBuilder]: Finished intersection with 189 states and 452 transitions. [2022-03-15 20:43:25,128 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:29,272 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [59533#(and (<= (+ x_2 x_1 a) (+ x_3 b)) (<= (+ x_3 b) (+ x_2 x_1 a))), 59544#(and (<= (+ x_2 x_1 b) (+ x_3 (* 2 a))) (<= (+ x_3 (* 2 a)) (+ x_2 x_1 b))), 59528#(and (<= (+ x_2 x_1 a (* 3 b)) x_3) (< x_3 (+ x_2 x_1 a (* 3 b) 1))), 59508#(and (<= (+ x_2 x_1) (+ x_3 (* 2 a))) (<= (+ x_3 (* 2 a)) (+ x_2 x_1))), 59529#(and (<= (+ x_2 x_1 (* 3 b) (* 2 a)) x_3) (< x_3 (+ x_2 x_1 (* 3 b) (* 2 a) 1))), 59523#(and (<= (+ (* 2 b) x_2 x_1 a) x_3) (< x_3 (+ (* 2 b) x_2 x_1 a 1))), 59520#(and (<= (+ (* 2 b) x_2 x_1) x_3) (< x_3 (+ (* 2 b) x_2 x_1 1))), 59512#(and (<= (+ x_3 a) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 a))), 59538#(and (<= (+ x_2 x_1 (* 2 a)) (+ x_3 b)) (<= (+ x_3 b) (+ x_2 x_1 (* 2 a)))), 59524#(and (< x_3 (+ x_2 x_1 (* 2 a) 1)) (<= (+ x_2 x_1 (* 2 a)) x_3)), 59536#(and (<= (+ x_3 a) (+ x_2 x_1 b)) (<= (+ x_2 x_1 b) (+ x_3 a))), 59540#(and (< x_3 (+ x_2 x_1 b 1 (* 3 a))) (<= (+ x_2 x_1 b (* 3 a)) x_3)), 59545#(and (<= (+ x_2 x_1 (* 3 b) (* 3 a)) x_3) (< x_3 (+ x_2 x_1 (* 3 b) 1 (* 3 a)))), 59519#(and (<= (+ x_2 x_1 b) x_3) (< x_3 (+ x_2 x_1 b 1))), 59527#(and (<= (+ x_2 x_1 (* 3 b)) x_3) (< x_3 (+ x_2 x_1 (* 3 b) 1))), 59537#(and (<= (+ x_2 x_1 (* 3 a)) x_3) (< x_3 (+ x_2 x_1 1 (* 3 a)))), 59542#(and (< x_3 (+ (* 2 b) x_2 x_1 1 (* 3 a))) (<= (+ (* 2 b) x_2 x_1 (* 3 a)) x_3)), 59546#(and (<= (+ x_2 x_1) (+ x_3 (* 3 b))) (<= (+ x_3 (* 3 b)) (+ x_2 x_1))), 59530#(and (<= (+ x_3 b) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 b))), 59525#(and (< x_3 (+ x_2 x_1 b (* 2 a) 1)) (<= (+ x_2 x_1 b (* 2 a)) x_3)), 59535#(and (<= (+ x_3 a (* 3 b)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 a (* 3 b)))), 59547#(and (<= (+ x_2 x_1) x_3) (< x_3 (+ x_2 x_1 1)) (<= 0 x_1) (<= x_1 0)), 59522#(and (<= (+ x_2 x_1 b a) x_3) (< x_3 (+ x_2 x_1 b a 1))), 59521#(and (< x_3 (+ x_2 x_1 a 1)) (<= (+ x_2 x_1 a) x_3)), 59526#(and (< x_3 (+ (* 2 b) x_2 x_1 (* 2 a) 1)) (<= (+ (* 2 b) x_2 x_1 (* 2 a)) x_3)), 59539#(and (<= (+ x_2 x_1 a) (+ (* 2 b) x_3)) (<= (+ (* 2 b) x_3) (+ x_2 x_1 a))), 59543#(and (<= (+ x_3 a) (+ (* 2 b) x_2 x_1)) (<= (+ (* 2 b) x_2 x_1) (+ x_3 a))), 59531#(and (<= (+ (* 2 b) x_3 a) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ (* 2 b) x_3 a))), 59498#(and (<= (+ x_2 x_1) (+ x_3 (* 3 a))) (<= (+ x_3 (* 3 a)) (+ x_2 x_1))), 59534#(and (<= (+ x_2 x_1) (+ (* 2 b) x_3)) (<= (+ (* 2 b) x_3) (+ x_2 x_1))), 59541#(and (<= (+ x_2 x_1) (+ x_3 b (* 2 a))) (<= (+ x_3 b (* 2 a)) (+ x_2 x_1))), 59532#(and (<= (+ x_3 (* 3 b) (* 2 a)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 (* 3 b) (* 2 a))))] [2022-03-15 20:43:29,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 20:43:29,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:29,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 20:43:29,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2736, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 20:43:29,273 INFO L87 Difference]: Start difference. First operand 4812 states and 20676 transitions. Second operand has 44 states, 43 states have (on average 4.441860465116279) internal successors, (191), 43 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:34,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:34,136 INFO L93 Difference]: Finished difference Result 10176 states and 40613 transitions. [2022-03-15 20:43:34,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 20:43:34,137 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 4.441860465116279) internal successors, (191), 43 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 20:43:34,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:34,182 INFO L225 Difference]: With dead ends: 10176 [2022-03-15 20:43:34,182 INFO L226 Difference]: Without dead ends: 10147 [2022-03-15 20:43:34,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 148 SyntacticMatches, 16 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=126, Invalid=2736, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 20:43:34,183 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 200 mSDsluCounter, 9451 mSDsCounter, 0 mSdLazyCounter, 15718 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 15720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:34,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 1 Invalid, 15720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15718 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-03-15 20:43:34,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10147 states. [2022-03-15 20:43:34,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10147 to 6008. [2022-03-15 20:43:34,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6008 states, 6007 states have (on average 4.368902946562344) internal successors, (26244), 6007 states have internal predecessors, (26244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6008 states to 6008 states and 26244 transitions. [2022-03-15 20:43:34,432 INFO L78 Accepts]: Start accepts. Automaton has 6008 states and 26244 transitions. Word has length 20 [2022-03-15 20:43:34,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:34,433 INFO L470 AbstractCegarLoop]: Abstraction has 6008 states and 26244 transitions. [2022-03-15 20:43:34,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 4.441860465116279) internal successors, (191), 43 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:34,434 INFO L276 IsEmpty]: Start isEmpty. Operand 6008 states and 26244 transitions. [2022-03-15 20:43:34,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:43:34,451 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:34,451 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:34,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 20:43:34,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:34,667 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:34,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:34,668 INFO L85 PathProgramCache]: Analyzing trace with hash -231823650, now seen corresponding path program 14 times [2022-03-15 20:43:34,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:34,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617548194] [2022-03-15 20:43:34,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:34,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:34,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:34,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617548194] [2022-03-15 20:43:34,707 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617548194] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:34,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74508715] [2022-03-15 20:43:34,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:43:34,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:34,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:34,708 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:34,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 20:43:34,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:43:34,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:34,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:43:34,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 20:43:34,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 20:43:34,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74508715] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:34,828 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:34,828 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 9 [2022-03-15 20:43:34,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1092502708] [2022-03-15 20:43:34,828 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:34,829 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:34,846 INFO L252 McrAutomatonBuilder]: Finished intersection with 171 states and 401 transitions. [2022-03-15 20:43:34,846 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:37,314 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [81866#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 81879#(or (<= c i_1) (< (+ 2 i_2) c) (<= c (+ i_2 1)) (< (+ i_1 1) c)), 81898#(or (<= i_2 i_1) (<= c i_2)), 81892#(or (<= (+ 3 i_2) i_1) (<= c i_2)), 81890#(or (<= c i_2) (<= (+ i_2 4) c)), 81882#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c)), 81865#(or (<= c i_1) (< (+ i_1 1) c)), 81870#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c)), 81868#(or (<= c i_1) (< i_2 c) (< (+ i_1 1) c)), 81881#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 81877#(or (< (+ 2 i_2) c) (<= c (+ i_2 1))), 81893#(or (<= c (+ i_2 1)) (<= (+ i_2 4) i_1)), 81873#(or (< (+ i_2 1) c) (<= c i_2) (< i_1 c)), 81888#(or (< (+ i_2 1) c) (<= c i_2) (< (+ 5 i_1) c) (<= c (+ i_1 4))), 81871#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (< i_2 c)), 81885#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 81889#(or (< (+ 2 i_2) c) (< (+ 5 i_1) c) (<= c (+ i_2 1)) (<= c (+ i_1 4))), 81887#(or (< i_2 c) (< (+ 5 i_1) c) (<= c (+ i_1 4))), 81897#(or (<= c (+ i_2 1)) (<= (+ 2 i_2) i_1)), 81773#(< i_2 c), 81896#(or (<= c i_2) (<= (+ i_2 1) i_1)), 81886#(or (< (+ 5 i_1) c) (<= c (+ i_1 4))), 81895#(or (<= (+ 3 i_2) i_1) (<= c (+ i_2 1))), 81878#(or (< (+ 2 i_2) c) (<= c (+ i_2 1)) (< i_1 c)), 81891#(or (<= (+ 5 i_2) c) (<= c (+ i_2 1))), 81872#(or (< (+ i_2 1) c) (<= c i_2)), 81867#(or (< i_2 c) (< i_1 c)), 81883#(or (< i_2 c) (<= c (+ 3 i_1)) (< (+ i_1 4) c)), 81875#(or (< (+ i_2 1) c) (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c i_2)), 81880#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 81864#(< i_1 c), 81869#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (< i_2 c)), 81884#(or (< (+ i_2 1) c) (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c i_2)), 81899#(or (<= (+ i_2 1) i_1) (<= c (+ i_2 1))), 81876#(or (< (+ i_2 1) c) (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c i_2)), 81874#(or (< (+ i_2 1) c) (<= c i_1) (<= c i_2) (< (+ i_1 1) c)), 81894#(or (<= c i_2) (<= (+ 2 i_2) i_1))] [2022-03-15 20:43:37,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 20:43:37,314 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:37,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 20:43:37,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=1736, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 20:43:37,315 INFO L87 Difference]: Start difference. First operand 6008 states and 26244 transitions. Second operand has 46 states, 46 states have (on average 3.9347826086956523) internal successors, (181), 45 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:40,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:40,775 INFO L93 Difference]: Finished difference Result 17130 states and 68259 transitions. [2022-03-15 20:43:40,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-03-15 20:43:40,776 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.9347826086956523) internal successors, (181), 45 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 20:43:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:40,845 INFO L225 Difference]: With dead ends: 17130 [2022-03-15 20:43:40,845 INFO L226 Difference]: Without dead ends: 17052 [2022-03-15 20:43:40,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4225 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3623, Invalid=11877, Unknown=0, NotChecked=0, Total=15500 [2022-03-15 20:43:40,847 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 824 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:40,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [824 Valid, 1 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:43:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17052 states. [2022-03-15 20:43:41,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17052 to 6582. [2022-03-15 20:43:41,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6582 states, 6581 states have (on average 4.3552651572709316) internal successors, (28662), 6581 states have internal predecessors, (28662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:41,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6582 states to 6582 states and 28662 transitions. [2022-03-15 20:43:41,205 INFO L78 Accepts]: Start accepts. Automaton has 6582 states and 28662 transitions. Word has length 20 [2022-03-15 20:43:41,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:41,205 INFO L470 AbstractCegarLoop]: Abstraction has 6582 states and 28662 transitions. [2022-03-15 20:43:41,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.9347826086956523) internal successors, (181), 45 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:41,205 INFO L276 IsEmpty]: Start isEmpty. Operand 6582 states and 28662 transitions. [2022-03-15 20:43:41,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:43:41,222 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:41,222 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:41,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 20:43:41,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 20:43:41,440 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:41,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:41,441 INFO L85 PathProgramCache]: Analyzing trace with hash -777020354, now seen corresponding path program 15 times [2022-03-15 20:43:41,442 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:41,442 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688102856] [2022-03-15 20:43:41,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:41,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:43:41,580 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:41,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688102856] [2022-03-15 20:43:41,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688102856] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:41,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889479568] [2022-03-15 20:43:41,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:43:41,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:41,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:41,581 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:41,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 20:43:41,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:43:41,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:41,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:43:41,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:41,661 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 20:43:41,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 20:43:41,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889479568] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:41,725 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:41,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 14 [2022-03-15 20:43:41,726 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1341153857] [2022-03-15 20:43:41,726 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:41,728 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:41,759 INFO L252 McrAutomatonBuilder]: Finished intersection with 220 states and 533 transitions. [2022-03-15 20:43:41,759 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:44,309 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [112497#(or (<= c i_1) (< (+ i_1 1) c)), 112487#(< i_1 c), 112492#(< i_3 c), 112488#(or (< i_1 c) (<= c i_3)), 112505#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c i_3)), 112508#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 3 i_3))), 112514#(and (or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (= i_3 x_2)) (or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 3 i_3)))), 112513#(and (or (<= c i_1) (= (+ (* (- 1) i_3) x_2) 0) (< (+ i_1 1) c)) (or (<= c i_1) (<= c (+ 3 i_3)) (< (+ i_1 1) c))), 112499#(or (<= c i_1) (<= c (+ i_3 1)) (< (+ i_1 1) c)), 112491#(or (<= c (+ 3 i_3)) (< i_1 c)), 112504#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c i_3)), 112511#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ 3 i_3))), 112515#(and (or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (= i_3 x_2)) (or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ 3 i_3)))), 112489#(or (<= c (+ i_3 1)) (< i_1 c)), 112494#(or (< (+ 2 i_3) c) (<= c (+ i_3 1))), 112502#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 112510#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ 2 i_3))), 112498#(or (<= c i_1) (<= c i_3) (< (+ i_1 1) c)), 112503#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c)), 112496#(or (< (+ i_3 4) c) (<= c (+ 3 i_3))), 112501#(or (<= c i_1) (<= c (+ 3 i_3)) (< (+ i_1 1) c)), 112493#(or (< (+ i_3 1) c) (<= c i_3)), 112509#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ i_3 1))), 112490#(or (< i_1 c) (<= c (+ 2 i_3))), 112500#(or (<= c i_1) (<= c (+ 2 i_3)) (< (+ i_1 1) c)), 112495#(or (< (+ 3 i_3) c) (<= c (+ 2 i_3))), 112506#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ i_3 1))), 112512#(and (or (<= c (+ 3 x_2)) (< i_1 c)) (or (= (+ (* (- 1) i_3) x_2) 0) (< i_1 c))), 112507#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 2 i_3)))] [2022-03-15 20:43:44,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 20:43:44,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:44,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 20:43:44,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1621, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:43:44,311 INFO L87 Difference]: Start difference. First operand 6582 states and 28662 transitions. Second operand has 40 states, 40 states have (on average 3.85) internal successors, (154), 39 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:45,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:45,491 INFO L93 Difference]: Finished difference Result 10076 states and 42113 transitions. [2022-03-15 20:43:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 20:43:45,492 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.85) internal successors, (154), 39 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 20:43:45,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:45,522 INFO L225 Difference]: With dead ends: 10076 [2022-03-15 20:43:45,522 INFO L226 Difference]: Without dead ends: 9922 [2022-03-15 20:43:45,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1122, Invalid=4730, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 20:43:45,524 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 272 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:45,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 1 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:43:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9922 states. [2022-03-15 20:43:45,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9922 to 7700. [2022-03-15 20:43:45,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7700 states, 7699 states have (on average 4.351863878425769) internal successors, (33505), 7699 states have internal predecessors, (33505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7700 states to 7700 states and 33505 transitions. [2022-03-15 20:43:45,771 INFO L78 Accepts]: Start accepts. Automaton has 7700 states and 33505 transitions. Word has length 21 [2022-03-15 20:43:45,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:45,772 INFO L470 AbstractCegarLoop]: Abstraction has 7700 states and 33505 transitions. [2022-03-15 20:43:45,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.85) internal successors, (154), 39 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 7700 states and 33505 transitions. [2022-03-15 20:43:45,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:43:45,791 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:45,791 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:45,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-15 20:43:46,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 20:43:46,009 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:46,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:46,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2078004522, now seen corresponding path program 16 times [2022-03-15 20:43:46,010 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:46,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641944572] [2022-03-15 20:43:46,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:46,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 20:43:46,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:46,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641944572] [2022-03-15 20:43:46,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641944572] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:46,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103337504] [2022-03-15 20:43:46,053 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:43:46,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:46,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:46,074 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:46,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 20:43:46,099 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:43:46,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:46,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:43:46,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:43:46,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:46,234 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:43:46,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103337504] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:46,234 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:46,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2022-03-15 20:43:46,234 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [295304499] [2022-03-15 20:43:46,235 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:46,236 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:46,267 INFO L252 McrAutomatonBuilder]: Finished intersection with 216 states and 523 transitions. [2022-03-15 20:43:46,267 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:49,520 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [138204#(or (<= c i_1) (< (+ 2 i_3) c) (<= c (+ i_3 1)) (< (+ i_1 1) c)), 138213#(or (<= (+ 3 i_3) c) (< i_1 c)), 138212#(or (<= (+ 2 i_3) c) (< i_1 c)), 138215#(or (<= c i_1) (<= (+ 3 i_3) c) (< (+ i_1 1) c)), 138199#(or (<= c i_1) (< i_3 c) (< (+ i_1 1) c)), 138207#(or (< (+ 2 i_3) c) (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ i_3 1))), 138208#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c)), 138214#(or (<= c i_1) (<= (+ 2 i_3) c) (< (+ i_1 1) c)), 138217#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= (+ 3 i_3) c)), 138201#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 138210#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (< (+ i_3 1) c) (<= c i_3)), 138195#(< i_1 c), 138194#(or (<= (+ 2 i_3) c) (<= c i_3)), 138203#(or (< (+ 2 i_3) c) (<= c (+ i_3 1)) (< i_1 c)), 138211#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (< (+ 2 i_3) c) (<= c (+ i_3 1))), 138219#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= (+ 3 i_3) c)), 138205#(or (< i_3 c) (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 138197#(or (< (+ i_3 1) c) (< i_1 c) (<= c i_3)), 138200#(or (<= c i_1) (< (+ i_3 1) c) (<= c i_3) (< (+ i_1 1) c)), 138206#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (< (+ i_3 1) c) (<= c i_3)), 138209#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (< i_3 c)), 138202#(or (<= c (+ i_3 1)) (<= (+ 3 i_3) c)), 138218#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= (+ 2 i_3) c)), 138196#(or (< i_3 c) (< i_1 c)), 138198#(or (<= c i_1) (< (+ i_1 1) c)), 138216#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= (+ 2 i_3) c))] [2022-03-15 20:43:49,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 20:43:49,520 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:49,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 20:43:49,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:43:49,521 INFO L87 Difference]: Start difference. First operand 7700 states and 33505 transitions. Second operand has 34 states, 34 states have (on average 3.8823529411764706) internal successors, (132), 33 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:50,895 INFO L93 Difference]: Finished difference Result 30868 states and 131369 transitions. [2022-03-15 20:43:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 20:43:50,895 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.8823529411764706) internal successors, (132), 33 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 20:43:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:51,059 INFO L225 Difference]: With dead ends: 30868 [2022-03-15 20:43:51,059 INFO L226 Difference]: Without dead ends: 30868 [2022-03-15 20:43:51,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 191 SyntacticMatches, 10 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1878 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1262, Invalid=6048, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 20:43:51,061 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 325 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:51,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 1 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:43:51,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30868 states. [2022-03-15 20:43:51,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30868 to 18541. [2022-03-15 20:43:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18541 states, 18540 states have (on average 4.646494066882417) internal successors, (86146), 18540 states have internal predecessors, (86146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18541 states to 18541 states and 86146 transitions. [2022-03-15 20:43:51,846 INFO L78 Accepts]: Start accepts. Automaton has 18541 states and 86146 transitions. Word has length 21 [2022-03-15 20:43:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:51,846 INFO L470 AbstractCegarLoop]: Abstraction has 18541 states and 86146 transitions. [2022-03-15 20:43:51,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.8823529411764706) internal successors, (132), 33 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 18541 states and 86146 transitions. [2022-03-15 20:43:51,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:43:51,897 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:51,897 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:51,917 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 20:43:52,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:52,118 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:43:52,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:52,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1388275157, now seen corresponding path program 17 times [2022-03-15 20:43:52,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:52,119 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557844592] [2022-03-15 20:43:52,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:52,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:43:52,199 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:52,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557844592] [2022-03-15 20:43:52,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557844592] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:52,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317997339] [2022-03-15 20:43:52,200 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:43:52,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:52,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:52,209 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:52,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 20:43:52,276 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:43:52,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:52,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:43:52,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 20:43:52,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 20:43:52,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317997339] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:52,407 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:52,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 19 [2022-03-15 20:43:52,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [690071439] [2022-03-15 20:43:52,407 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:52,409 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:52,428 INFO L252 McrAutomatonBuilder]: Finished intersection with 192 states and 454 transitions. [2022-03-15 20:43:52,429 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:55,509 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 49 new interpolants: [206437#(or (<= c i_1) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 206425#(or (< (+ i_2 1) c) (<= (+ 2 c) i_1) (<= c i_2)), 206423#(or (<= c (+ i_1 1)) (< i_2 c)), 206432#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 206424#(or (< (+ i_2 1) c) (<= (+ 3 c) i_1) (<= c i_2)), 206438#(or (<= c (+ 5 i_1)) (< (+ 6 i_1) c)), 206428#(or (< (+ i_2 1) c) (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c i_2)), 206407#(or (< (+ i_2 1) c) (<= c i_1) (<= c i_2) (< (+ i_1 1) c)), 206416#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (< i_2 c)), 206400#(or (< i_2 c) (< i_1 c)), 206399#(< i_1 c), 206435#(or (< (+ 2 i_2) c) (<= c (+ i_2 1)) (<= (+ c 1) i_1)), 206427#(or (< (+ i_2 1) c) (<= c i_2) (<= (+ c 1) i_1)), 206445#(or (< (+ i_2 1) c) (<= c (+ 2 i_1)) (<= c i_2)), 206410#(or (< (+ 2 i_2) c) (<= c (+ i_2 1)) (< i_1 c)), 206441#(or (< i_2 c) (<= c (+ 5 i_1)) (< (+ 6 i_1) c)), 206436#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 206446#(or (<= c (+ 2 i_1)) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 206408#(or (< (+ i_2 1) c) (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c i_2)), 206434#(or (<= (+ 2 c) i_1) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 206403#(or (<= c i_1) (< (+ i_1 1) c)), 206401#(or (< (+ i_2 1) c) (<= c i_2)), 206422#(or (< i_2 c) (< (+ 5 i_1) c) (<= c (+ i_1 4))), 206429#(or (< (+ i_2 1) c) (<= c i_1) (<= c i_2)), 206398#(< i_2 c), 206419#(or (< i_2 c) (<= (+ 2 c) i_1)), 206440#(or (<= c (+ i_1 1)) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 206404#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 206413#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c)), 206442#(or (<= c (+ 2 i_1)) (< i_2 c)), 206439#(or (< (+ 2 i_2) c) (< (+ 5 i_1) c) (<= c (+ i_2 1)) (<= c (+ i_1 4))), 206409#(or (< (+ 2 i_2) c) (<= c (+ i_2 1))), 206412#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 206415#(or (< (+ 5 i_1) c) (<= c (+ i_1 4))), 206420#(or (< i_2 c) (<= (+ c 1) i_1)), 206431#(or (< (+ i_2 1) c) (<= c (+ i_1 1)) (<= c i_2)), 206418#(or (<= (+ 3 c) i_1) (< i_2 c)), 206406#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (< i_2 c)), 206421#(or (<= c i_1) (< i_2 c)), 206426#(or (< (+ i_2 1) c) (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c i_2)), 206405#(or (<= c i_1) (< i_2 c) (< (+ i_1 1) c)), 206402#(or (< (+ i_2 1) c) (<= c i_2) (< i_1 c)), 206430#(or (< (+ i_2 1) c) (<= c i_2) (< (+ 5 i_1) c) (<= c (+ i_1 4))), 206414#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c)), 206411#(or (<= c i_1) (< (+ 2 i_2) c) (<= c (+ i_2 1)) (< (+ i_1 1) c)), 206417#(or (< i_2 c) (<= c (+ 3 i_1)) (< (+ i_1 4) c)), 206444#(or (< (+ 2 i_2) c) (<= c (+ 5 i_1)) (<= c (+ i_2 1)) (< (+ 6 i_1) c)), 206433#(or (<= (+ 3 c) i_1) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 206443#(or (< (+ i_2 1) c) (<= c i_2) (<= c (+ 5 i_1)) (< (+ 6 i_1) c))] [2022-03-15 20:43:55,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 20:43:55,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:55,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 20:43:55,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=623, Invalid=4069, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 20:43:55,511 INFO L87 Difference]: Start difference. First operand 18541 states and 86146 transitions. Second operand has 60 states, 60 states have (on average 3.466666666666667) internal successors, (208), 59 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:00,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:00,901 INFO L93 Difference]: Finished difference Result 111897 states and 495399 transitions. [2022-03-15 20:44:00,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-03-15 20:44:00,902 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 3.466666666666667) internal successors, (208), 59 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 20:44:00,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:01,894 INFO L225 Difference]: With dead ends: 111897 [2022-03-15 20:44:01,894 INFO L226 Difference]: Without dead ends: 111627 [2022-03-15 20:44:01,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10868 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5736, Invalid=27570, Unknown=0, NotChecked=0, Total=33306 [2022-03-15 20:44:01,896 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1821 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 529 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1821 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 529 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:01,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1821 Valid, 1 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [529 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:44:02,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111627 states. [2022-03-15 20:44:04,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111627 to 43169. [2022-03-15 20:44:04,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43169 states, 43168 states have (on average 4.755513343217198) internal successors, (205286), 43168 states have internal predecessors, (205286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43169 states to 43169 states and 205286 transitions. [2022-03-15 20:44:04,996 INFO L78 Accepts]: Start accepts. Automaton has 43169 states and 205286 transitions. Word has length 21 [2022-03-15 20:44:04,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:04,996 INFO L470 AbstractCegarLoop]: Abstraction has 43169 states and 205286 transitions. [2022-03-15 20:44:04,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 3.466666666666667) internal successors, (208), 59 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand 43169 states and 205286 transitions. [2022-03-15 20:44:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 20:44:05,135 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:05,135 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:05,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-03-15 20:44:05,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:05,351 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:44:05,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:05,352 INFO L85 PathProgramCache]: Analyzing trace with hash -902406317, now seen corresponding path program 18 times [2022-03-15 20:44:05,352 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:05,352 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227854353] [2022-03-15 20:44:05,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:05,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:44:05,701 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:05,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227854353] [2022-03-15 20:44:05,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227854353] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:05,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437727744] [2022-03-15 20:44:05,701 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:44:05,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:05,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:05,719 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:44:05,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 20:44:05,791 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 20:44:05,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:05,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:44:05,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:44:05,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:44:05,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437727744] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:05,882 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:05,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-03-15 20:44:05,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1418251952] [2022-03-15 20:44:05,882 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:05,884 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:05,920 INFO L252 McrAutomatonBuilder]: Finished intersection with 259 states and 638 transitions. [2022-03-15 20:44:05,921 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:09,161 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [405068#(or (<= c (+ i_1 1)) (<= (+ c 1) i_2) (< (+ 2 i_1) c)), 405062#(or (<= c i_1) (< (+ i_1 1) c)), 405052#(< i_1 c), 405090#(and (or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (= i_2 x_2)) (or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ 3 i_2)))), 405056#(or (< (+ 2 i_2) c) (<= c (+ i_2 1))), 405064#(or (<= c i_1) (<= c i_2) (< (+ i_1 1) c)), 405065#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c i_2)), 405078#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 3 i_2))), 405055#(or (<= c i_2) (< i_1 c)), 405081#(and (or (<= c i_1) (= (+ (* (- 1) i_2) x_2) 0) (< (+ i_1 1) c)) (or (<= c i_1) (<= c (+ 3 i_2)) (< (+ i_1 1) c))), 404943#(<= c (+ 3 i_2)), 405077#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 2 i_2))), 405071#(or (<= c i_1) (<= c (+ 2 i_2)) (< (+ i_1 1) c)), 405086#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ 2 i_2))), 405082#(and (or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (= i_2 x_2)) (or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 3 i_2)))), 405075#(or (<= c (+ i_2 4)) (< i_1 c)), 405066#(or (<= (+ c 1) i_2) (< i_1 c)), 405070#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ i_2 1))), 405089#(or (<= c (+ i_2 4)) (<= c (+ 2 i_1)) (< (+ 3 i_1) c)), 405053#(< i_2 c), 405061#(or (<= c (+ 3 i_2)) (< i_1 c)), 405057#(or (<= c (+ i_2 1)) (< i_1 c)), 405080#(and (or (= (+ (* (- 1) i_2) x_2) 0) (< i_1 c)) (or (<= c (+ 3 i_2)) (< i_1 c))), 405073#(or (<= c (+ i_2 4)) (< (+ 5 i_2) c)), 405084#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c i_2)), 405079#(or (<= c (+ i_2 4)) (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 405058#(or (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 405067#(or (<= c i_1) (<= (+ c 1) i_2) (< (+ i_1 1) c)), 405088#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= (+ c 1) i_2)), 405069#(or (<= c i_1) (<= c (+ i_2 1)) (< (+ i_1 1) c)), 405059#(or (<= c (+ 2 i_2)) (< i_1 c)), 405072#(or (<= c i_1) (<= c (+ 3 i_2)) (< (+ i_1 1) c)), 405087#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ 3 i_2))), 405083#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c)), 405063#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 405076#(or (<= c (+ i_2 4)) (<= c i_1) (< (+ i_1 1) c)), 405085#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ i_2 1))), 405060#(or (< (+ i_2 4) c) (<= c (+ 3 i_2))), 405054#(or (< (+ i_2 1) c) (<= c i_2)), 405074#(<= c (+ i_2 4))] [2022-03-15 20:44:09,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 20:44:09,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:09,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 20:44:09,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=2534, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 20:44:09,168 INFO L87 Difference]: Start difference. First operand 43169 states and 205286 transitions. Second operand has 51 states, 51 states have (on average 4.627450980392157) internal successors, (236), 50 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:11,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:11,161 INFO L93 Difference]: Finished difference Result 66038 states and 297389 transitions. [2022-03-15 20:44:11,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 20:44:11,162 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 4.627450980392157) internal successors, (236), 50 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 20:44:11,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:11,594 INFO L225 Difference]: With dead ends: 66038 [2022-03-15 20:44:11,594 INFO L226 Difference]: Without dead ends: 65867 [2022-03-15 20:44:11,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1875 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1595, Invalid=6415, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 20:44:11,595 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 475 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:11,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 1 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:44:11,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65867 states. [2022-03-15 20:44:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65867 to 52476. [2022-03-15 20:44:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52476 states, 52475 states have (on average 4.666869938065745) internal successors, (244894), 52475 states have internal predecessors, (244894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52476 states to 52476 states and 244894 transitions. [2022-03-15 20:44:14,159 INFO L78 Accepts]: Start accepts. Automaton has 52476 states and 244894 transitions. Word has length 22 [2022-03-15 20:44:14,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:14,159 INFO L470 AbstractCegarLoop]: Abstraction has 52476 states and 244894 transitions. [2022-03-15 20:44:14,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.627450980392157) internal successors, (236), 50 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:14,160 INFO L276 IsEmpty]: Start isEmpty. Operand 52476 states and 244894 transitions. [2022-03-15 20:44:14,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 20:44:14,318 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:14,318 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:14,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 20:44:14,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:14,531 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:44:14,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:14,532 INFO L85 PathProgramCache]: Analyzing trace with hash -630772591, now seen corresponding path program 19 times [2022-03-15 20:44:14,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:14,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145495734] [2022-03-15 20:44:14,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:14,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 20:44:14,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:14,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145495734] [2022-03-15 20:44:14,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145495734] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:14,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176464228] [2022-03-15 20:44:14,584 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:44:14,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:14,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:14,585 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:44:14,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 20:44:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:14,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:44:14,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:44:14,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:44:14,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176464228] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:14,920 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:14,920 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 19 [2022-03-15 20:44:14,920 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1419907112] [2022-03-15 20:44:14,920 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:14,922 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:14,952 INFO L252 McrAutomatonBuilder]: Finished intersection with 252 states and 618 transitions. [2022-03-15 20:44:14,952 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:17,497 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 57 new interpolants: [576318#(or (< i_3 c) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 576341#(or (<= (+ i_3 1) i_2) (<= c i_3)), 576324#(or (<= c (+ i_3 1)) (<= (+ 5 i_3) c) (<= c (+ i_2 1))), 576309#(or (< i_2 c) (< (+ i_3 1) c) (<= c i_3)), 576349#(or (<= c (+ i_2 4)) (<= c (+ i_3 1)) (<= (+ 5 i_3) c)), 576352#(or (<= c (+ i_3 1)) (<= (+ 2 i_3) i_2)), 576320#(or (<= (+ 3 i_3) c) (<= c (+ i_2 1))), 576312#(or (<= c i_2) (<= c i_3) (<= (+ i_3 4) c)), 576317#(or (<= c (+ i_3 1)) (<= c i_2) (<= (+ 5 i_3) c)), 576334#(<= c (+ 3 i_2)), 576338#(or (<= c (+ i_3 1)) (<= c (+ 3 i_2)) (<= (+ 5 i_3) c)), 576353#(or (<= (+ i_3 1) i_2) (<= c (+ i_3 1))), 576329#(or (<= c (+ 2 i_2)) (<= c i_3) (<= (+ i_3 4) c)), 576302#(or (<= c (+ i_2 4)) (< (+ 5 i_2) c)), 576335#(or (<= c (+ 3 i_2)) (<= (+ 3 i_3) c)), 576311#(or (< (+ i_2 1) c) (<= c i_2) (< (+ i_3 1) c) (<= c i_3)), 576300#(or (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 576332#(or (< (+ i_2 4) c) (< i_3 c) (<= c (+ 3 i_2))), 576345#(or (<= c (+ i_2 4)) (< (+ 2 i_3) c) (<= c (+ i_3 1)) (< (+ 5 i_2) c)), 576322#(or (<= c (+ i_2 1)) (<= c i_3) (<= (+ i_3 4) c)), 576336#(or (<= c (+ 3 i_2)) (<= c i_3) (<= (+ i_3 4) c)), 576328#(or (<= c (+ 2 i_2)) (< (+ i_3 1) c) (< (+ 3 i_2) c) (<= c i_3)), 576306#(<= c i_2), 576308#(or (< (+ i_3 1) c) (<= c i_3)), 576323#(or (< (+ 2 i_3) c) (<= c (+ i_3 1)) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 576343#(or (<= c (+ i_2 4)) (< i_3 c) (< (+ 5 i_2) c)), 576319#(<= c (+ i_2 1)), 576305#(or (< (+ i_2 1) c) (< i_3 c) (<= c i_2)), 576299#(or (< (+ 2 i_2) c) (<= c (+ i_2 1))), 576350#(or (<= c (+ i_3 1)) (<= (+ i_3 4) i_2)), 576315#(or (< (+ i_2 1) c) (< (+ 2 i_3) c) (<= c (+ i_3 1)) (<= c i_2)), 576333#(or (< (+ i_2 4) c) (<= c (+ 3 i_2)) (< (+ i_3 1) c) (<= c i_3)), 576339#(or (<= (+ 3 i_3) i_2) (<= c i_3)), 576325#(<= c (+ 2 i_2)), 576321#(or (< (+ 2 i_2) c) (< (+ i_3 1) c) (<= c (+ i_2 1)) (<= c i_3)), 576330#(or (< (+ 2 i_3) c) (<= c (+ i_3 1)) (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 576348#(or (<= c (+ i_2 4)) (<= c i_3) (<= (+ i_3 4) c)), 576297#(< i_2 c), 576310#(or (<= c i_3) (<= (+ i_3 4) c)), 576314#(or (< (+ 2 i_3) c) (< i_2 c) (<= c (+ i_3 1))), 576327#(or (<= c (+ 2 i_2)) (<= (+ 3 i_3) c)), 576298#(or (< (+ i_2 1) c) (<= c i_2)), 576316#(or (<= c (+ i_3 1)) (<= (+ 5 i_3) c)), 576303#(< i_3 c), 576342#(or (<= i_3 i_2) (<= c i_3)), 576304#(or (< i_3 c) (< i_2 c)), 576307#(or (<= c i_2) (<= (+ 3 i_3) c)), 576331#(or (<= c (+ i_3 1)) (<= c (+ 2 i_2)) (<= (+ 5 i_3) c)), 576351#(or (<= c (+ i_3 1)) (<= (+ 3 i_3) i_2)), 576344#(or (<= c (+ i_2 4)) (< (+ 5 i_2) c) (< (+ i_3 1) c) (<= c i_3)), 576313#(or (< (+ 2 i_3) c) (<= c (+ i_3 1))), 576337#(or (< (+ i_2 4) c) (< (+ 2 i_3) c) (<= c (+ i_3 1)) (<= c (+ 3 i_2))), 576301#(or (< (+ i_2 4) c) (<= c (+ 3 i_2))), 576346#(<= c (+ i_2 4)), 576347#(or (<= c (+ i_2 4)) (<= (+ 3 i_3) c)), 576340#(or (<= c i_3) (<= (+ 2 i_3) i_2)), 576326#(or (< i_3 c) (<= c (+ 2 i_2)) (< (+ 3 i_2) c))] [2022-03-15 20:44:17,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-03-15 20:44:17,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:17,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-03-15 20:44:17,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=5094, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 20:44:17,500 INFO L87 Difference]: Start difference. First operand 52476 states and 244894 transitions. Second operand has 67 states, 67 states have (on average 3.5223880597014925) internal successors, (236), 66 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:22,843 INFO L93 Difference]: Finished difference Result 147540 states and 645263 transitions. [2022-03-15 20:44:22,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-03-15 20:44:22,844 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 3.5223880597014925) internal successors, (236), 66 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 20:44:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:24,165 INFO L225 Difference]: With dead ends: 147540 [2022-03-15 20:44:24,165 INFO L226 Difference]: Without dead ends: 145309 [2022-03-15 20:44:24,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11400 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6096, Invalid=27944, Unknown=0, NotChecked=0, Total=34040 [2022-03-15 20:44:24,167 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1319 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 2024 mSolverCounterSat, 598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 598 IncrementalHoareTripleChecker+Valid, 2024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:24,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1319 Valid, 1 Invalid, 2622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [598 Valid, 2024 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:44:24,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145309 states. [2022-03-15 20:44:27,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145309 to 51246. [2022-03-15 20:44:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51246 states, 51245 states have (on average 4.615845448336423) internal successors, (236539), 51245 states have internal predecessors, (236539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51246 states to 51246 states and 236539 transitions. [2022-03-15 20:44:28,116 INFO L78 Accepts]: Start accepts. Automaton has 51246 states and 236539 transitions. Word has length 22 [2022-03-15 20:44:28,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:28,116 INFO L470 AbstractCegarLoop]: Abstraction has 51246 states and 236539 transitions. [2022-03-15 20:44:28,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 3.5223880597014925) internal successors, (236), 66 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 51246 states and 236539 transitions. [2022-03-15 20:44:28,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:44:28,275 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:28,275 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:28,293 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 20:44:28,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-03-15 20:44:28,493 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:44:28,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:28,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1664386861, now seen corresponding path program 20 times [2022-03-15 20:44:28,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:28,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937697764] [2022-03-15 20:44:28,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:28,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:28,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:28,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937697764] [2022-03-15 20:44:28,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937697764] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:28,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081784866] [2022-03-15 20:44:28,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:44:28,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:28,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:28,696 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:44:28,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 20:44:28,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:44:28,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:28,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 20:44:28,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:29,094 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:29,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:29,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081784866] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:29,281 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:29,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 30 [2022-03-15 20:44:29,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1073743919] [2022-03-15 20:44:29,282 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:29,283 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:29,331 INFO L252 McrAutomatonBuilder]: Finished intersection with 304 states and 758 transitions. [2022-03-15 20:44:29,332 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:36,671 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 54 new interpolants: [826814#(and (< x_3 (+ x_2 x_1 (* b 4) (* a 4) 1)) (<= (+ x_2 x_1 (* b 4) (* a 4)) x_3)), 826802#(and (<= (+ x_3 (* 3 b)) (+ x_2 x_1 a)) (<= (+ x_2 x_1 a) (+ x_3 (* 3 b)))), 826798#(and (< x_3 (+ (* 2 b) x_2 x_1 (* 2 a) 1)) (<= (+ (* 2 b) x_2 x_1 (* 2 a)) x_3)), 826785#(and (<= (+ x_3 a) (+ x_2 x_1 b)) (<= (+ x_2 x_1 b) (+ x_3 a))), 826794#(and (<= (+ x_3 b) (+ x_2 x_1 (* 3 a))) (<= (+ x_2 x_1 (* 3 a)) (+ x_3 b))), 826813#(and (< x_3 (+ x_2 x_1 (* a 4) (* 3 b) 1)) (<= (+ x_2 x_1 (* a 4) (* 3 b)) x_3)), 826793#(and (< x_3 (+ x_2 x_1 (* a 4) 1)) (<= (+ x_2 x_1 (* a 4)) x_3)), 826778#(and (<= (+ x_3 (* 3 b) (* 2 a)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 (* 3 b) (* 2 a)))), 826809#(and (<= (+ (* 2 b) x_2 x_1) (+ x_3 (* 2 a))) (<= (+ x_3 (* 2 a)) (+ (* 2 b) x_2 x_1))), 826799#(and (< x_3 (+ (* 2 b) x_2 x_1 1 (* 3 a))) (<= (+ (* 2 b) x_2 x_1 (* 3 a)) x_3)), 826805#(and (<= (+ x_2 x_1 a (* b 4)) x_3) (< x_3 (+ x_2 x_1 a (* b 4) 1))), 826807#(and (<= (+ x_2 x_1 (* 3 b) (* 2 a)) x_3) (< x_3 (+ x_2 x_1 (* 3 b) (* 2 a) 1))), 826812#(and (<= (+ x_2 x_1 (* b 4) (* 3 a)) x_3) (< x_3 (+ x_2 x_1 (* b 4) 1 (* 3 a)))), 826770#(and (<= (+ x_2 x_1 b) x_3) (< x_3 (+ x_2 x_1 b 1))), 826797#(and (< x_3 (+ x_2 x_1 b (* a 4) 1)) (<= (+ x_2 x_1 b (* a 4)) x_3)), 826801#(and (<= (+ x_3 b (* 3 a)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 b (* 3 a)))), 826803#(and (<= (+ x_3 (* b 4)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 (* b 4)))), 826741#(and (<= (+ x_3 (* a 4)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 (* a 4)))), 826781#(and (<= (+ x_3 (* b 4) (* 3 a)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 (* b 4) (* 3 a)))), 826776#(and (<= (+ x_2 x_1) (+ (* 2 b) x_3)) (<= (+ (* 2 b) x_3) (+ x_2 x_1))), 826806#(and (<= (+ x_2 x_1 (* 3 b)) (+ x_3 a)) (<= (+ x_3 a) (+ x_2 x_1 (* 3 b)))), 826782#(and (<= (+ x_2 x_1) (+ x_3 (* b 4) (* 2 a))) (<= (+ x_3 (* b 4) (* 2 a)) (+ x_2 x_1))), 826766#(and (< x_3 (+ x_2 x_1 a 1)) (<= (+ x_2 x_1 a) x_3)), 826788#(and (<= (+ x_3 a) (+ (* 2 b) x_2 x_1)) (<= (+ (* 2 b) x_2 x_1) (+ x_3 a))), 826774#(and (<= (+ x_2 x_1 (* 2 a)) (+ x_3 b)) (<= (+ x_3 b) (+ x_2 x_1 (* 2 a)))), 826795#(and (<= (+ (* 2 b) x_3) (+ x_2 x_1 (* 2 a))) (<= (+ x_2 x_1 (* 2 a)) (+ (* 2 b) x_3))), 826808#(and (< x_3 (+ x_2 x_1 (* b 4) (* 2 a) 1)) (<= (+ x_2 x_1 (* b 4) (* 2 a)) x_3)), 826777#(and (<= (+ x_2 x_1 a) (+ (* 2 b) x_3)) (<= (+ (* 2 b) x_3) (+ x_2 x_1 a))), 826759#(and (<= (+ x_3 a) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 a))), 826804#(and (< x_3 (+ x_2 x_1 (* b 4) 1)) (<= (+ x_2 x_1 (* b 4)) x_3)), 826787#(and (<= (+ x_2 x_1 (* 3 b)) x_3) (< x_3 (+ x_2 x_1 (* 3 b) 1))), 826773#(and (<= (+ x_2 x_1 (* 3 a)) x_3) (< x_3 (+ x_2 x_1 1 (* 3 a)))), 826768#(and (<= (+ x_3 b) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 b))), 826755#(and (<= (+ x_2 x_1) (+ x_3 (* 2 a))) (<= (+ x_3 (* 2 a)) (+ x_2 x_1))), 826775#(and (<= (+ (* 2 b) x_3 a) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ (* 2 b) x_3 a))), 826796#(and (< x_3 (+ x_2 x_1 b 1 (* 3 a))) (<= (+ x_2 x_1 b (* 3 a)) x_3)), 826772#(and (< x_3 (+ x_2 x_1 b (* 2 a) 1)) (<= (+ x_2 x_1 b (* 2 a)) x_3)), 826767#(and (< x_3 (+ x_2 x_1 (* 2 a) 1)) (<= (+ x_2 x_1 (* 2 a)) x_3)), 826790#(and (<= (+ (* 2 b) x_2 x_1 a) x_3) (< x_3 (+ (* 2 b) x_2 x_1 a 1))), 826792#(and (<= (+ (* 2 b) x_3 (* 3 a)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ (* 2 b) x_3 (* 3 a)))), 826751#(and (<= (+ x_2 x_1) (+ x_3 (* 3 a))) (<= (+ x_3 (* 3 a)) (+ x_2 x_1))), 826815#(and (<= (+ x_2 x_1) x_3) (< x_3 (+ x_2 x_1 1)) (<= 0 x_1) (<= x_1 0)), 826769#(and (<= (+ x_2 x_1 a) (+ x_3 b)) (<= (+ x_3 b) (+ x_2 x_1 a))), 826810#(and (<= (+ x_3 (* 3 a)) (+ x_2 x_1 b)) (<= (+ x_2 x_1 b) (+ x_3 (* 3 a)))), 826791#(and (<= (+ x_2 x_1 a (* 3 b)) x_3) (< x_3 (+ x_2 x_1 a (* 3 b) 1))), 826783#(and (<= (+ x_3 a (* b 4)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 a (* b 4)))), 826800#(and (< x_3 (+ (* 2 b) x_2 x_1 (* a 4) 1)) (<= (+ (* 2 b) x_2 x_1 (* a 4)) x_3)), 826771#(and (<= (+ x_2 x_1 b a) x_3) (< x_3 (+ x_2 x_1 b a 1))), 826811#(and (<= (+ x_2 x_1 (* 3 b) (* 3 a)) x_3) (< x_3 (+ x_2 x_1 (* 3 b) 1 (* 3 a)))), 826780#(and (<= (+ x_2 x_1) (+ x_3 (* 3 b))) (<= (+ x_3 (* 3 b)) (+ x_2 x_1))), 826784#(and (<= (+ (* 2 b) x_2 x_1) x_3) (< x_3 (+ (* 2 b) x_2 x_1 1))), 826789#(and (<= (+ x_2 x_1 b) (+ x_3 (* 2 a))) (<= (+ x_3 (* 2 a)) (+ x_2 x_1 b))), 826779#(and (<= (+ x_3 a (* 3 b)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 a (* 3 b)))), 826786#(and (<= (+ x_2 x_1) (+ x_3 b (* 2 a))) (<= (+ x_3 b (* 2 a)) (+ x_2 x_1)))] [2022-03-15 20:44:36,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-03-15 20:44:36,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:36,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-03-15 20:44:36,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=6455, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 20:44:36,672 INFO L87 Difference]: Start difference. First operand 51246 states and 236539 transitions. Second operand has 69 states, 68 states have (on average 4.5) internal successors, (306), 68 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:48,351 INFO L93 Difference]: Finished difference Result 85204 states and 382183 transitions. [2022-03-15 20:44:48,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 20:44:48,351 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 4.5) internal successors, (306), 68 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 20:44:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:48,857 INFO L225 Difference]: With dead ends: 85204 [2022-03-15 20:44:48,857 INFO L226 Difference]: Without dead ends: 85125 [2022-03-15 20:44:48,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 233 SyntacticMatches, 24 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=187, Invalid=6455, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 20:44:48,858 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 333 mSDsluCounter, 24574 mSDsCounter, 0 mSdLazyCounter, 40443 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 40445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:48,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 1 Invalid, 40445 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 40443 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2022-03-15 20:44:48,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85125 states. [2022-03-15 20:44:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85125 to 59221. [2022-03-15 20:44:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59221 states, 59220 states have (on average 4.659338061465721) internal successors, (275926), 59220 states have internal predecessors, (275926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59221 states to 59221 states and 275926 transitions. [2022-03-15 20:44:51,786 INFO L78 Accepts]: Start accepts. Automaton has 59221 states and 275926 transitions. Word has length 23 [2022-03-15 20:44:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:51,787 INFO L470 AbstractCegarLoop]: Abstraction has 59221 states and 275926 transitions. [2022-03-15 20:44:51,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 4.5) internal successors, (306), 68 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 59221 states and 275926 transitions. [2022-03-15 20:44:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 20:44:52,170 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:52,170 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:52,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 20:44:52,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 20:44:52,385 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:44:52,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:52,385 INFO L85 PathProgramCache]: Analyzing trace with hash 34189724, now seen corresponding path program 21 times [2022-03-15 20:44:52,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:52,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685464901] [2022-03-15 20:44:52,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:52,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 20:44:52,477 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:52,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685464901] [2022-03-15 20:44:52,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685464901] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:52,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901045814] [2022-03-15 20:44:52,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:44:52,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:52,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:52,478 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:44:52,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 20:44:52,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:44:52,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:52,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:44:52,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 20:44:52,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 20:44:52,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901045814] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:52,590 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:52,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 17 [2022-03-15 20:44:52,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [501827788] [2022-03-15 20:44:52,590 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:52,592 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:52,666 INFO L252 McrAutomatonBuilder]: Finished intersection with 347 states and 873 transitions. [2022-03-15 20:44:52,666 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:57,317 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [1030632#(or (<= c i_1) (<= c (+ 3 i_3)) (< (+ i_1 1) c)), 1030618#(< i_3 c), 1030628#(or (<= c i_1) (< (+ i_1 1) c)), 1030629#(or (<= c i_1) (<= c i_3) (< (+ i_1 1) c)), 1030642#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c)), 1030650#(or (<= c (+ 3 i_1)) (<= c (+ i_3 1)) (< (+ i_1 4) c)), 1030656#(and (or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (= i_3 x_2)) (or (<= c (+ i_3 4)) (<= c (+ i_1 1)) (< (+ 2 i_1) c))), 1030646#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ 3 i_3))), 1030651#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c (+ 2 i_3))), 1030653#(or (<= c (+ i_3 4)) (<= c (+ 3 i_1)) (< (+ i_1 4) c)), 1030621#(or (< (+ 3 i_3) c) (<= c (+ 2 i_3))), 1030652#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c (+ 3 i_3))), 1030630#(or (<= c i_1) (<= c (+ i_3 1)) (< (+ i_1 1) c)), 1030627#(or (<= c (+ 3 i_3)) (< i_1 c)), 1030635#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ i_3 1))), 1030657#(and (or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (= i_3 x_2)) (or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ i_3 4)))), 1030658#(and (or (<= c (+ i_3 4)) (<= c (+ 3 i_1)) (< (+ i_1 4) c)) (or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (= i_3 x_2))), 1030654#(and (or (<= c (+ i_3 4)) (< i_1 c)) (or (= (+ (* (- 1) i_3) x_2) 0) (< i_1 c))), 1030648#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c)), 1030645#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ 2 i_3))), 1030634#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c i_3)), 1030637#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 3 i_3))), 1030641#(or (<= c (+ i_3 4)) (< (+ 5 i_3) c)), 1030633#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 1030623#(< i_1 c), 1030625#(or (<= c (+ i_3 1)) (< i_1 c)), 1030619#(or (< (+ i_3 1) c) (<= c i_3)), 1030631#(or (<= c i_1) (<= c (+ 2 i_3)) (< (+ i_1 1) c)), 1030639#(or (<= c i_1) (<= c (+ i_3 4)) (< (+ i_1 1) c)), 1030640#(or (<= c (+ i_3 4)) (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 1030622#(or (< (+ i_3 4) c) (<= c (+ 3 i_3))), 1030647#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ i_3 4))), 1030620#(or (< (+ 2 i_3) c) (<= c (+ i_3 1))), 1030643#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c i_3)), 1030624#(or (< i_1 c) (<= c i_3)), 1030644#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ i_3 1))), 1030626#(or (< i_1 c) (<= c (+ 2 i_3))), 1030649#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c i_3)), 1030655#(and (or (<= c i_1) (<= c (+ i_3 4)) (< (+ i_1 1) c)) (or (<= c i_1) (= (+ (* (- 1) i_3) x_2) 0) (< (+ i_1 1) c))), 1030638#(or (<= c (+ i_3 4)) (< i_1 c)), 1030636#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 2 i_3)))] [2022-03-15 20:44:57,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 20:44:57,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:57,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 20:44:57,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=2990, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 20:44:57,318 INFO L87 Difference]: Start difference. First operand 59221 states and 275926 transitions. Second operand has 54 states, 54 states have (on average 3.8518518518518516) internal successors, (208), 53 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:59,979 INFO L93 Difference]: Finished difference Result 88871 states and 399268 transitions. [2022-03-15 20:44:59,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 20:44:59,980 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 3.8518518518518516) internal successors, (208), 53 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 20:44:59,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:00,371 INFO L225 Difference]: With dead ends: 88871 [2022-03-15 20:45:00,372 INFO L226 Difference]: Without dead ends: 88616 [2022-03-15 20:45:00,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 322 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2363 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2051, Invalid=8869, Unknown=0, NotChecked=0, Total=10920 [2022-03-15 20:45:00,373 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 413 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:00,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 1 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:45:00,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88616 states. [2022-03-15 20:45:02,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88616 to 69919. [2022-03-15 20:45:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69919 states, 69918 states have (on average 4.621642495494722) internal successors, (323136), 69918 states have internal predecessors, (323136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69919 states to 69919 states and 323136 transitions. [2022-03-15 20:45:03,614 INFO L78 Accepts]: Start accepts. Automaton has 69919 states and 323136 transitions. Word has length 24 [2022-03-15 20:45:03,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:03,614 INFO L470 AbstractCegarLoop]: Abstraction has 69919 states and 323136 transitions. [2022-03-15 20:45:03,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 3.8518518518518516) internal successors, (208), 53 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:03,614 INFO L276 IsEmpty]: Start isEmpty. Operand 69919 states and 323136 transitions. [2022-03-15 20:45:03,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 20:45:03,859 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:03,860 INFO L514 BasicCegarLoop]: trace histogram [7, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:03,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 20:45:04,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:04,077 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:45:04,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:04,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1202136587, now seen corresponding path program 22 times [2022-03-15 20:45:04,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:04,078 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409316992] [2022-03-15 20:45:04,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:04,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 20:45:04,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:04,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409316992] [2022-03-15 20:45:04,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409316992] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:04,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14176681] [2022-03-15 20:45:04,132 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:45:04,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:04,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:04,133 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:45:04,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 20:45:04,160 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:45:04,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:04,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:45:04,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:04,447 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 20:45:04,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 20:45:04,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14176681] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:04,503 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:04,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 14 [2022-03-15 20:45:04,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1074167843] [2022-03-15 20:45:04,504 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:04,505 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:04,546 INFO L252 McrAutomatonBuilder]: Finished intersection with 313 states and 776 transitions. [2022-03-15 20:45:04,547 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:10,356 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 65 new interpolants: [1259614#(or (< (+ 2 i_2) c) (<= c (+ i_2 1))), 1259570#(< i_2 c), 1259621#(or (< (+ i_2 1) c) (<= c i_1) (<= c i_2) (< (+ i_1 1) c)), 1259631#(or (< i_2 c) (< (+ 5 i_1) c) (<= c (+ i_1 4))), 1259667#(or (<= c (+ i_2 1)) (<= (+ 2 i_2) i_1)), 1259675#(or (<= i_2 i_1) (<= c (+ i_2 1))), 1259654#(or (< (+ 2 i_2) c) (< (+ 7 i_1) c) (<= c (+ i_2 1)) (<= c (+ 6 i_1))), 1259664#(or (<= c (+ i_2 1)) (<= (+ i_2 4) i_1)), 1259623#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 1259669#(or (<= (+ 7 i_2) c) (<= c (+ 2 i_2))), 1259662#(or (<= (+ 6 i_2) c) (<= c (+ i_2 1))), 1259665#(or (<= (+ 3 i_2) i_1) (<= c (+ i_2 1))), 1259638#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 1259673#(or (<= (+ 3 i_2) i_1) (<= c (+ 2 i_2))), 1259645#(or (<= c i_1) (<= c (+ 2 i_2)) (< (+ 3 i_2) c) (< (+ i_1 1) c)), 1259653#(or (< (+ i_2 1) c) (<= c i_2) (< (+ 7 i_1) c) (<= c (+ 6 i_1))), 1259676#(or (<= c (+ 2 i_2)) (<= (+ i_2 1) i_1)), 1259613#(or (< (+ i_2 1) c) (<= c i_2)), 1259670#(or (<= c (+ 2 i_2)) (<= (+ 6 i_2) i_1)), 1259635#(or (< (+ i_2 1) c) (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c i_2)), 1259650#(or (<= c (+ 2 i_2)) (<= c (+ 5 i_1)) (< (+ 6 i_1) c) (< (+ 3 i_2) c)), 1259620#(or (<= c i_1) (< i_2 c) (< (+ i_1 1) c)), 1259641#(or (< (+ 2 i_2) c) (< (+ 5 i_1) c) (<= c (+ i_2 1)) (<= c (+ i_1 4))), 1259655#(or (<= c (+ 2 i_2)) (< (+ 7 i_1) c) (< (+ 3 i_2) c) (<= c (+ 6 i_1))), 1259672#(or (<= c (+ 2 i_2)) (<= (+ i_2 4) i_1)), 1259624#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (< i_2 c)), 1259647#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 1259628#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c)), 1259625#(or (< (+ i_2 1) c) (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c i_2)), 1259618#(or (< (+ 2 i_2) c) (<= c (+ i_2 1)) (< i_1 c)), 1259619#(or (<= c i_1) (< (+ i_1 1) c)), 1259668#(or (<= (+ i_2 1) i_1) (<= c (+ i_2 1))), 1259649#(or (<= c (+ 2 i_2)) (< (+ 5 i_1) c) (< (+ 3 i_2) c) (<= c (+ i_1 4))), 1259656#(or (<= (+ 5 i_2) c) (<= c i_2)), 1259643#(or (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 1259657#(or (<= c i_2) (<= (+ i_2 4) i_1)), 1259660#(or (<= c i_2) (<= (+ i_2 1) i_1)), 1259661#(or (<= i_2 i_1) (<= c i_2)), 1259615#(< i_1 c), 1259646#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 1259626#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c)), 1259634#(or (< (+ i_2 1) c) (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c i_2)), 1259651#(or (< (+ 7 i_1) c) (<= c (+ 6 i_1))), 1259629#(or (< i_2 c) (<= c (+ 3 i_1)) (< (+ i_1 4) c)), 1259663#(or (<= (+ 5 i_2) i_1) (<= c (+ i_2 1))), 1259617#(or (< (+ i_2 1) c) (<= c i_2) (< i_1 c)), 1259674#(or (<= c (+ 2 i_2)) (<= (+ 2 i_2) i_1)), 1259616#(or (< i_2 c) (< i_1 c)), 1259627#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (< i_2 c)), 1259622#(or (<= c i_1) (< (+ 2 i_2) c) (<= c (+ i_2 1)) (< (+ i_1 1) c)), 1259648#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 1259659#(or (<= c i_2) (<= (+ 2 i_2) i_1)), 1259644#(or (<= c (+ 2 i_2)) (< i_1 c) (< (+ 3 i_2) c)), 1259633#(or (< i_2 c) (<= c (+ 5 i_1)) (< (+ 6 i_1) c)), 1259630#(or (< (+ 5 i_1) c) (<= c (+ i_1 4))), 1259642#(or (< (+ 2 i_2) c) (<= c (+ 5 i_1)) (<= c (+ i_2 1)) (< (+ 6 i_1) c)), 1259637#(or (< (+ i_2 1) c) (<= c i_2) (<= c (+ 5 i_1)) (< (+ 6 i_1) c)), 1259636#(or (< (+ i_2 1) c) (<= c i_2) (< (+ 5 i_1) c) (<= c (+ i_1 4))), 1259639#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 1259640#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 1259671#(or (<= (+ 5 i_2) i_1) (<= c (+ 2 i_2))), 1259652#(or (< i_2 c) (< (+ 7 i_1) c) (<= c (+ 6 i_1))), 1259632#(or (<= c (+ 5 i_1)) (< (+ 6 i_1) c)), 1259658#(or (<= (+ 3 i_2) i_1) (<= c i_2)), 1259666#(or (<= i_2 (+ i_1 1)) (<= c i_2))] [2022-03-15 20:45:10,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-03-15 20:45:10,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:10,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-03-15 20:45:10,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=883, Invalid=5279, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 20:45:10,358 INFO L87 Difference]: Start difference. First operand 69919 states and 323136 transitions. Second operand has 76 states, 76 states have (on average 3.8684210526315788) internal successors, (294), 75 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:18,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:18,507 INFO L93 Difference]: Finished difference Result 146165 states and 636063 transitions. [2022-03-15 20:45:18,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2022-03-15 20:45:18,507 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 3.8684210526315788) internal successors, (294), 75 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 20:45:18,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:19,258 INFO L225 Difference]: With dead ends: 146165 [2022-03-15 20:45:19,258 INFO L226 Difference]: Without dead ends: 145712 [2022-03-15 20:45:19,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12765 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10412, Invalid=34320, Unknown=0, NotChecked=0, Total=44732 [2022-03-15 20:45:19,261 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1760 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 2675 mSolverCounterSat, 804 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 3479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 804 IncrementalHoareTripleChecker+Valid, 2675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:19,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1760 Valid, 1 Invalid, 3479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [804 Valid, 2675 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:45:19,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145712 states. [2022-03-15 20:45:22,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145712 to 49196. [2022-03-15 20:45:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49196 states, 49195 states have (on average 4.528427685740421) internal successors, (222776), 49195 states have internal predecessors, (222776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:23,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49196 states to 49196 states and 222776 transitions. [2022-03-15 20:45:23,313 INFO L78 Accepts]: Start accepts. Automaton has 49196 states and 222776 transitions. Word has length 24 [2022-03-15 20:45:23,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:23,313 INFO L470 AbstractCegarLoop]: Abstraction has 49196 states and 222776 transitions. [2022-03-15 20:45:23,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 3.8684210526315788) internal successors, (294), 75 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:23,313 INFO L276 IsEmpty]: Start isEmpty. Operand 49196 states and 222776 transitions. [2022-03-15 20:45:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 20:45:23,419 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:23,419 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:23,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 20:45:23,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:23,634 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:45:23,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:23,634 INFO L85 PathProgramCache]: Analyzing trace with hash -695717906, now seen corresponding path program 23 times [2022-03-15 20:45:23,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:23,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061642130] [2022-03-15 20:45:23,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:23,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 20:45:23,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:23,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061642130] [2022-03-15 20:45:23,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061642130] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:23,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301590030] [2022-03-15 20:45:23,758 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:45:23,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:23,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:23,759 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:45:23,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 20:45:23,791 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 20:45:23,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:23,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:45:23,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:45:23,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:45:23,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301590030] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:23,981 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:23,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 24 [2022-03-15 20:45:23,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [768184576] [2022-03-15 20:45:23,981 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:23,983 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:24,026 INFO L252 McrAutomatonBuilder]: Finished intersection with 343 states and 863 transitions. [2022-03-15 20:45:24,026 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:29,261 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 87 new interpolants: [1504737#(or (<= c i_3) (<= (+ 2 i_3) i_2)), 1504710#(<= c (+ 3 i_2)), 1504692#(or (<= (+ 6 i_3) c) (<= c (+ 2 i_3))), 1504727#(or (<= c (+ 5 i_2)) (< (+ 6 i_2) c) (< (+ i_3 1) c) (<= c i_3)), 1504706#(or (< (+ i_2 4) c) (< i_3 c) (<= c (+ 3 i_2))), 1504681#(or (< i_3 c) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 1504739#(or (<= (+ 5 i_3) i_2) (<= c (+ 2 i_3))), 1504673#(or (< (+ i_2 1) c) (< i_3 c) (<= c i_2)), 1504728#(or (<= c (+ 5 i_2)) (<= c i_3) (<= (+ i_3 4) c)), 1504725#(or (< i_3 c) (<= c (+ 5 i_2)) (< (+ 6 i_2) c)), 1504704#(or (<= (+ 6 i_3) c) (<= c (+ 2 i_2)) (<= c (+ 2 i_3))), 1504663#(< i_3 c), 1504718#(<= c (+ 5 i_2)), 1504745#(or (<= i_3 (+ i_2 1)) (<= c i_3)), 1504672#(or (< (+ i_2 1) c) (<= c i_2)), 1504678#(or (<= c i_2) (<= c i_3) (<= (+ i_3 4) c)), 1504699#(or (<= c (+ 2 i_2)) (< (+ i_3 1) c) (< (+ 3 i_2) c) (<= c i_3)), 1504698#(or (<= c (+ 2 i_2)) (<= (+ 3 i_3) c)), 1504691#(or (< (+ 3 i_3) c) (< (+ 2 i_2) c) (<= c (+ i_2 1)) (<= c (+ 2 i_3))), 1504746#(or (<= (+ i_3 1) i_2) (<= c (+ i_3 1))), 1504738#(or (<= c (+ i_3 1)) (<= (+ 3 i_3) i_2)), 1504749#(or (<= (+ i_3 1) i_2) (<= c (+ 2 i_3))), 1504721#(or (<= c (+ i_2 4)) (< (+ 5 i_2) c) (< (+ i_3 1) c) (<= c i_3)), 1504744#(or (<= i_3 i_2) (<= c i_3)), 1504707#(or (< (+ i_2 4) c) (<= c (+ 3 i_2)) (< (+ i_3 1) c) (<= c i_3)), 1504724#(or (<= c (+ i_2 4)) (<= c (+ i_3 1)) (<= (+ 5 i_3) c)), 1504664#(or (< (+ i_3 1) c) (<= c i_3)), 1504671#(or (<= c (+ i_3 1)) (<= (+ 5 i_3) c)), 1504723#(or (<= c (+ i_2 4)) (< (+ 2 i_3) c) (<= c (+ i_3 1)) (< (+ 5 i_2) c)), 1504677#(or (<= c i_2) (<= (+ 3 i_3) c)), 1504719#(or (<= c (+ i_2 4)) (< i_3 c) (< (+ 5 i_2) c)), 1504697#(or (< i_3 c) (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 1504695#(or (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 1504685#(or (<= c (+ i_2 1)) (<= c i_3) (<= (+ i_3 4) c)), 1504714#(or (<= (+ 6 i_3) c) (<= c (+ 3 i_2)) (<= c (+ 2 i_3))), 1504674#(or (< (+ i_2 1) c) (<= c i_2) (< (+ i_3 1) c) (<= c i_3)), 1504701#(or (< (+ 2 i_3) c) (<= c (+ i_3 1)) (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 1504732#(or (<= (+ 6 i_3) c) (<= c (+ i_2 4)) (<= c (+ 2 i_3))), 1504690#(or (< (+ i_2 1) c) (< (+ 3 i_3) c) (<= c i_2) (<= c (+ 2 i_3))), 1504715#(or (<= c (+ i_2 4)) (< (+ 5 i_2) c)), 1504679#(or (<= c (+ i_3 1)) (<= c i_2) (<= (+ 5 i_3) c)), 1504680#(or (< (+ 2 i_2) c) (<= c (+ i_2 1))), 1504666#(< i_2 c), 1504703#(or (< (+ 3 i_3) c) (<= c (+ 2 i_2)) (< (+ 3 i_2) c) (<= c (+ 2 i_3))), 1504731#(or (<= c (+ i_2 4)) (< (+ 3 i_3) c) (< (+ 5 i_2) c) (<= c (+ 2 i_3))), 1504700#(or (<= c (+ 2 i_2)) (<= c i_3) (<= (+ i_3 4) c)), 1504693#(or (<= (+ 6 i_3) c) (<= c i_2) (<= c (+ 2 i_3))), 1504730#(or (<= c (+ i_3 1)) (<= (+ 5 i_3) c) (<= c (+ 5 i_2))), 1504665#(or (< (+ 2 i_3) c) (<= c (+ i_3 1))), 1504686#(or (< (+ 2 i_3) c) (<= c (+ i_3 1)) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 1504708#(or (< (+ i_2 4) c) (< (+ 2 i_3) c) (<= c (+ i_3 1)) (<= c (+ 3 i_2))), 1504722#(or (<= c (+ i_2 4)) (<= c i_3) (<= (+ i_3 4) c)), 1504683#(or (<= (+ 3 i_3) c) (<= c (+ i_2 1))), 1504709#(or (< (+ i_2 4) c) (< (+ 3 i_3) c) (<= c (+ 3 i_2)) (<= c (+ 2 i_3))), 1504675#(or (< (+ i_2 1) c) (< (+ 2 i_3) c) (<= c (+ i_3 1)) (<= c i_2)), 1504694#(or (<= (+ 6 i_3) c) (<= c (+ i_2 1)) (<= c (+ 2 i_3))), 1504740#(or (<= c (+ 2 i_3)) (<= (+ i_3 4) i_2)), 1504720#(or (<= c (+ i_2 4)) (<= (+ 3 i_3) c)), 1504736#(or (<= c (+ i_3 1)) (<= (+ i_3 4) i_2)), 1504676#(<= c i_2), 1504748#(or (<= c (+ i_3 1)) (<= i_3 i_2)), 1504682#(<= c (+ i_2 1)), 1504747#(or (<= c (+ 2 i_3)) (<= (+ 2 i_3) i_2)), 1504741#(or (<= (+ i_3 1) i_2) (<= c i_3)), 1504687#(or (<= c (+ i_3 1)) (<= (+ 5 i_3) c) (<= c (+ i_2 1))), 1504735#(or (<= (+ 3 i_3) i_2) (<= c i_3)), 1504734#(or (<= (+ 6 i_3) c) (<= c (+ 5 i_2)) (<= c (+ 2 i_3))), 1504726#(or (<= c (+ 5 i_2)) (<= (+ 3 i_3) c)), 1504667#(or (< i_3 c) (< i_2 c)), 1504670#(or (< (+ 2 i_3) c) (< i_2 c) (<= c (+ i_3 1))), 1504742#(or (<= c (+ i_3 1)) (<= (+ 2 i_3) i_2)), 1504688#(or (< (+ 3 i_3) c) (<= c (+ 2 i_3))), 1504668#(or (< i_2 c) (< (+ i_3 1) c) (<= c i_3)), 1504743#(or (<= (+ 3 i_3) i_2) (<= c (+ 2 i_3))), 1504733#(or (< (+ 3 i_3) c) (<= c (+ 5 i_2)) (< (+ 6 i_2) c) (<= c (+ 2 i_3))), 1504684#(or (< (+ 2 i_2) c) (< (+ i_3 1) c) (<= c (+ i_2 1)) (<= c i_3)), 1504705#(or (< (+ i_2 4) c) (<= c (+ 3 i_2))), 1504712#(or (<= c (+ 3 i_2)) (<= c i_3) (<= (+ i_3 4) c)), 1504669#(or (<= c i_3) (<= (+ i_3 4) c)), 1504717#(or (<= c (+ 5 i_2)) (< (+ 6 i_2) c)), 1504716#(<= c (+ i_2 4)), 1504729#(or (< (+ 2 i_3) c) (<= c (+ i_3 1)) (<= c (+ 5 i_2)) (< (+ 6 i_2) c)), 1504696#(<= c (+ 2 i_2)), 1504702#(or (<= c (+ i_3 1)) (<= c (+ 2 i_2)) (<= (+ 5 i_3) c)), 1504711#(or (<= c (+ 3 i_2)) (<= (+ 3 i_3) c)), 1504713#(or (<= c (+ i_3 1)) (<= c (+ 3 i_2)) (<= (+ 5 i_3) c)), 1504689#(or (< i_2 c) (< (+ 3 i_3) c) (<= c (+ 2 i_3)))] [2022-03-15 20:45:29,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2022-03-15 20:45:29,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:29,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2022-03-15 20:45:29,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=10991, Unknown=0, NotChecked=0, Total=12432 [2022-03-15 20:45:29,263 INFO L87 Difference]: Start difference. First operand 49196 states and 222776 transitions. Second operand has 99 states, 99 states have (on average 3.484848484848485) internal successors, (345), 98 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:39,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:39,234 INFO L93 Difference]: Finished difference Result 152122 states and 646043 transitions. [2022-03-15 20:45:39,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2022-03-15 20:45:39,234 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 99 states have (on average 3.484848484848485) internal successors, (345), 98 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 20:45:39,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:40,254 INFO L225 Difference]: With dead ends: 152122 [2022-03-15 20:45:40,255 INFO L226 Difference]: Without dead ends: 149732 [2022-03-15 20:45:40,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24424 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12419, Invalid=57013, Unknown=0, NotChecked=0, Total=69432 [2022-03-15 20:45:40,257 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1878 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 3434 mSolverCounterSat, 850 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 4284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 850 IncrementalHoareTripleChecker+Valid, 3434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:40,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1878 Valid, 1 Invalid, 4284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [850 Valid, 3434 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 20:45:40,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149732 states. [2022-03-15 20:45:43,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149732 to 48665. [2022-03-15 20:45:43,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48665 states, 48664 states have (on average 4.500123294427092) internal successors, (218994), 48664 states have internal predecessors, (218994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48665 states to 48665 states and 218994 transitions. [2022-03-15 20:45:43,814 INFO L78 Accepts]: Start accepts. Automaton has 48665 states and 218994 transitions. Word has length 24 [2022-03-15 20:45:43,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:43,815 INFO L470 AbstractCegarLoop]: Abstraction has 48665 states and 218994 transitions. [2022-03-15 20:45:43,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 99 states have (on average 3.484848484848485) internal successors, (345), 98 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:43,815 INFO L276 IsEmpty]: Start isEmpty. Operand 48665 states and 218994 transitions. [2022-03-15 20:45:43,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 20:45:43,921 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:43,921 INFO L514 BasicCegarLoop]: trace histogram [8, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:43,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 20:45:44,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 20:45:44,130 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:45:44,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:44,130 INFO L85 PathProgramCache]: Analyzing trace with hash 858366674, now seen corresponding path program 24 times [2022-03-15 20:45:44,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:44,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141539069] [2022-03-15 20:45:44,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:44,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:44,231 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 20:45:44,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:44,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141539069] [2022-03-15 20:45:44,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141539069] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:44,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374052736] [2022-03-15 20:45:44,232 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:45:44,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:44,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:44,233 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:45:44,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 20:45:44,265 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 20:45:44,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:44,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:45:44,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 20:45:44,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 20:45:44,489 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374052736] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:44,489 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:44,489 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 27 [2022-03-15 20:45:44,489 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [165975667] [2022-03-15 20:45:44,489 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:44,491 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:44,761 INFO L252 McrAutomatonBuilder]: Finished intersection with 344 states and 857 transitions. [2022-03-15 20:45:44,761 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:50,655 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 77 new interpolants: [1754678#(< i_1 c), 1754719#(or (< (+ 2 i_2) c) (< (+ 7 i_1) c) (<= c (+ i_2 1)) (<= c (+ 6 i_1))), 1754742#(or (< (+ i_2 1) c) (<= c (+ i_1 1)) (<= c i_2)), 1754750#(or (<= c (+ 2 i_1)) (< i_2 c)), 1754697#(or (< (+ i_2 1) c) (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c i_2)), 1754695#(or (< (+ i_2 1) c) (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c i_2)), 1754734#(or (< i_2 c) (<= (+ c 1) i_1)), 1754699#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 1754754#(or (< (+ i_1 8) c) (<= c (+ 2 i_2)) (<= c (+ 7 i_1)) (< (+ 3 i_2) c)), 1754687#(or (< (+ 2 i_2) c) (<= c (+ i_2 1)) (< i_1 c)), 1754688#(or (<= c i_1) (< (+ 2 i_2) c) (<= c (+ i_2 1)) (< (+ i_1 1) c)), 1754691#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c)), 1754693#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (< i_2 c)), 1754705#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 1754702#(or (<= c (+ 2 i_2)) (< i_1 c) (< (+ 3 i_2) c)), 1754728#(or (<= (+ 3 c) i_1) (< i_2 c)), 1754708#(or (< i_2 c) (< (+ 5 i_1) c) (<= c (+ i_1 4))), 1754700#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 1754741#(or (<= c (+ i_1 1)) (< i_2 c)), 1754694#(or (< i_2 c) (<= c (+ 3 i_1)) (< (+ i_1 4) c)), 1754732#(or (< i_2 c) (<= (+ 2 c) i_1)), 1754749#(or (<= c (+ 2 i_2)) (< (+ 7 i_1) c) (< (+ 3 i_2) c) (<= c (+ 6 i_1))), 1754737#(or (< (+ 2 i_2) c) (<= c (+ i_2 1)) (<= (+ c 1) i_1)), 1754743#(or (<= c (+ i_1 1)) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 1754709#(or (< (+ i_2 1) c) (<= c i_2) (< (+ 5 i_1) c) (<= c (+ i_1 4))), 1754729#(or (< (+ i_2 1) c) (<= (+ 3 c) i_1) (<= c i_2)), 1754701#(or (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 1754735#(or (< (+ i_2 1) c) (<= c i_2) (<= (+ c 1) i_1)), 1754689#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 1754692#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (< i_2 c)), 1754723#(or (< (+ i_1 8) c) (< (+ 2 i_2) c) (<= c (+ 7 i_1)) (<= c (+ i_2 1))), 1754725#(or (< (+ i_2 1) c) (<= (+ c 4) i_1) (<= c i_2)), 1754722#(or (< (+ i_2 1) c) (< (+ i_1 8) c) (<= c i_2) (<= c (+ 7 i_1))), 1754690#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c)), 1754686#(or (< (+ 2 i_2) c) (<= c (+ i_2 1))), 1754746#(or (<= c i_1) (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 1754751#(or (< (+ i_2 1) c) (<= c (+ 2 i_1)) (<= c i_2)), 1754736#(or (<= (+ 2 c) i_1) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 1754715#(or (< (+ 2 i_2) c) (<= c (+ 5 i_1)) (<= c (+ i_2 1)) (< (+ 6 i_1) c)), 1754733#(or (< (+ i_2 1) c) (<= (+ 2 c) i_1) (<= c i_2)), 1754683#(or (<= c i_1) (< (+ i_1 1) c)), 1754712#(or (<= c (+ 5 i_1)) (< (+ 6 i_1) c)), 1754730#(or (<= (+ 3 c) i_1) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 1754740#(or (<= c i_1) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 1754718#(or (< (+ i_2 1) c) (<= c i_2) (< (+ 7 i_1) c) (<= c (+ 6 i_1))), 1754710#(or (< (+ 2 i_2) c) (< (+ 5 i_1) c) (<= c (+ i_2 1)) (<= c (+ i_1 4))), 1754707#(or (< (+ 5 i_1) c) (<= c (+ i_1 4))), 1754680#(or (< i_2 c) (< i_1 c)), 1754744#(or (<= (+ 2 c) i_1) (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 1754747#(or (<= c (+ 2 i_2)) (<= c (+ 5 i_1)) (< (+ 6 i_1) c) (< (+ 3 i_2) c)), 1754706#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 1754745#(or (<= c (+ 2 i_2)) (< (+ 3 i_2) c) (<= (+ c 1) i_1)), 1754685#(or (< (+ i_2 1) c) (<= c i_1) (<= c i_2) (< (+ i_1 1) c)), 1754698#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 1754713#(or (< i_2 c) (<= c (+ 5 i_1)) (< (+ 6 i_1) c)), 1754731#(or (<= (+ 3 c) i_1) (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 1754717#(or (< i_2 c) (< (+ 7 i_1) c) (<= c (+ 6 i_1))), 1754739#(or (< (+ i_2 1) c) (<= c i_1) (<= c i_2)), 1754721#(or (< i_2 c) (< (+ i_1 8) c) (<= c (+ 7 i_1))), 1754720#(or (< (+ i_1 8) c) (<= c (+ 7 i_1))), 1754726#(or (<= (+ c 4) i_1) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 1754738#(or (<= c i_1) (< i_2 c)), 1754696#(or (< (+ i_2 1) c) (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c i_2)), 1754704#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 1754716#(or (< (+ 7 i_1) c) (<= c (+ 6 i_1))), 1754681#(or (< (+ i_2 1) c) (<= c i_2)), 1754703#(or (<= c i_1) (<= c (+ 2 i_2)) (< (+ 3 i_2) c) (< (+ i_1 1) c)), 1754711#(or (<= c (+ 2 i_2)) (< (+ 5 i_1) c) (< (+ 3 i_2) c) (<= c (+ i_1 4))), 1754724#(or (< i_2 c) (<= (+ c 4) i_1)), 1754684#(or (<= c i_1) (< i_2 c) (< (+ i_1 1) c)), 1754752#(or (<= c (+ 2 i_1)) (< (+ 2 i_2) c) (<= c (+ i_2 1))), 1754748#(or (<= c (+ i_1 1)) (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 1754682#(or (< (+ i_2 1) c) (<= c i_2) (< i_1 c)), 1754727#(or (<= (+ c 4) i_1) (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 1754679#(< i_2 c), 1754714#(or (< (+ i_2 1) c) (<= c i_2) (<= c (+ 5 i_1)) (< (+ 6 i_1) c)), 1754753#(or (<= c (+ 2 i_1)) (<= c (+ 2 i_2)) (< (+ 3 i_2) c))] [2022-03-15 20:45:50,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-03-15 20:45:50,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:50,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-03-15 20:45:50,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=9742, Unknown=0, NotChecked=0, Total=10920 [2022-03-15 20:45:50,657 INFO L87 Difference]: Start difference. First operand 48665 states and 218994 transitions. Second operand has 91 states, 91 states have (on average 3.6373626373626373) internal successors, (331), 90 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:07,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:46:07,681 INFO L93 Difference]: Finished difference Result 357591 states and 1556398 transitions. [2022-03-15 20:46:07,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 260 states. [2022-03-15 20:46:07,682 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 3.6373626373626373) internal successors, (331), 90 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 20:46:07,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:46:10,724 INFO L225 Difference]: With dead ends: 357591 [2022-03-15 20:46:10,724 INFO L226 Difference]: Without dead ends: 356811 [2022-03-15 20:46:10,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44297 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=21045, Invalid=99017, Unknown=0, NotChecked=0, Total=120062 [2022-03-15 20:46:10,732 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 2979 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 3909 mSolverCounterSat, 1304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2979 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 5213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1304 IncrementalHoareTripleChecker+Valid, 3909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:46:10,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2979 Valid, 1 Invalid, 5213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1304 Valid, 3909 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 20:46:11,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356811 states. [2022-03-15 20:46:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356811 to 102879. [2022-03-15 20:46:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102879 states, 102878 states have (on average 4.634528276210657) internal successors, (476791), 102878 states have internal predecessors, (476791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102879 states to 102879 states and 476791 transitions. [2022-03-15 20:46:21,971 INFO L78 Accepts]: Start accepts. Automaton has 102879 states and 476791 transitions. Word has length 25 [2022-03-15 20:46:21,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:46:21,971 INFO L470 AbstractCegarLoop]: Abstraction has 102879 states and 476791 transitions. [2022-03-15 20:46:21,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 3.6373626373626373) internal successors, (331), 90 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:21,971 INFO L276 IsEmpty]: Start isEmpty. Operand 102879 states and 476791 transitions. [2022-03-15 20:46:22,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:46:22,267 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:46:22,267 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:46:22,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 20:46:22,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 20:46:22,473 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:46:22,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:46:22,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1272079349, now seen corresponding path program 25 times [2022-03-15 20:46:22,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:46:22,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005742131] [2022-03-15 20:46:22,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:46:22,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:46:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:22,732 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:22,733 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:46:22,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005742131] [2022-03-15 20:46:22,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005742131] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:46:22,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429982086] [2022-03-15 20:46:22,733 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:46:22,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:22,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:46:22,734 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:46:22,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 20:46:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:22,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 20:46:22,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:46:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:23,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:46:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:23,783 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429982086] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:46:23,783 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:46:23,783 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 37 [2022-03-15 20:46:23,783 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16242577] [2022-03-15 20:46:23,783 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:46:23,786 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:46:23,875 INFO L252 McrAutomatonBuilder]: Finished intersection with 459 states and 1178 transitions. [2022-03-15 20:46:23,875 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:46:34,669 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 82 new interpolants: [2318748#(and (<= (+ x_3 (* 5 a)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 (* 5 a)))), 2318851#(and (<= (+ x_2 x_1 (* 5 b) (* a 4)) x_3) (< x_3 (+ x_2 x_1 (* 5 b) (* a 4) 1))), 2318832#(and (<= (+ x_3 (* a 4)) (+ x_2 x_1 b)) (<= (+ x_2 x_1 b) (+ x_3 (* a 4)))), 2318825#(and (<= (+ x_2 x_1 (* 3 b)) (+ x_3 a)) (<= (+ x_3 a) (+ x_2 x_1 (* 3 b)))), 2318800#(and (<= (+ (* 2 b) x_2 x_1 a) x_3) (< x_3 (+ (* 2 b) x_2 x_1 a 1))), 2318811#(and (<= (+ x_2 x_1 (* 2 a)) (+ x_3 b)) (<= (+ x_3 b) (+ x_2 x_1 (* 2 a)))), 2318829#(and (<= (+ x_2 x_1 (* b 4)) (+ x_3 a)) (<= (+ x_3 a) (+ x_2 x_1 (* b 4)))), 2318798#(and (<= (+ x_2 x_1) (+ x_3 (* b 4) (* 2 a))) (<= (+ x_3 (* b 4) (* 2 a)) (+ x_2 x_1))), 2318818#(and (<= (+ x_2 x_1 a) (+ (* 2 b) x_3)) (<= (+ (* 2 b) x_3) (+ x_2 x_1 a))), 2318806#(and (<= (+ x_2 x_1 a (* b 4)) x_3) (< x_3 (+ x_2 x_1 a (* b 4) 1))), 2318788#(and (<= (+ x_2 x_1) (+ x_3 b (* a 4))) (<= (+ x_3 b (* a 4)) (+ x_2 x_1))), 2318846#(and (< x_3 (+ (* 2 b) x_2 x_1 (* 5 a) 1)) (<= (+ (* 2 b) x_2 x_1 (* 5 a)) x_3)), 2318826#(and (<= (+ (* 2 b) x_2 x_1) (+ x_3 (* 2 a))) (<= (+ x_3 (* 2 a)) (+ (* 2 b) x_2 x_1))), 2318848#(and (< x_3 (+ x_2 x_1 (* b 4) (* a 4) 1)) (<= (+ x_2 x_1 (* b 4) (* a 4)) x_3)), 2318814#(and (<= (+ x_3 b) (+ x_2 x_1 (* 3 a))) (<= (+ x_2 x_1 (* 3 a)) (+ x_3 b))), 2318805#(and (< x_3 (+ x_2 x_1 (* b 4) 1)) (<= (+ x_2 x_1 (* b 4)) x_3)), 2318813#(and (< x_3 (+ x_2 x_1 (* a 4) 1)) (<= (+ x_2 x_1 (* a 4)) x_3)), 2318831#(and (<= (+ (* 2 b) x_2 x_1) (+ x_3 (* 3 a))) (<= (+ x_3 (* 3 a)) (+ (* 2 b) x_2 x_1))), 2318787#(and (<= (+ x_2 x_1 b) (+ x_3 (* 2 a))) (<= (+ x_3 (* 2 a)) (+ x_2 x_1 b))), 2318797#(and (<= (+ x_3 (* b 4) (* 3 a)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 (* b 4) (* 3 a)))), 2318816#(and (< x_3 (+ (* 2 b) x_2 x_1 (* a 4) 1)) (<= (+ (* 2 b) x_2 x_1 (* a 4)) x_3)), 2318770#(and (<= (+ x_3 a) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 a))), 2318850#(and (<= (+ x_3 (* 5 b)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 (* 5 b)))), 2318803#(and (< x_3 (+ (* 2 b) x_2 x_1 (* 2 a) 1)) (<= (+ (* 2 b) x_2 x_1 (* 2 a)) x_3)), 2318815#(and (< x_3 (+ x_2 x_1 b (* a 4) 1)) (<= (+ x_2 x_1 b (* a 4)) x_3)), 2318843#(and (<= (+ x_3 (* b 4)) (+ x_2 x_1 a)) (<= (+ x_2 x_1 a) (+ x_3 (* b 4)))), 2318785#(and (<= (+ x_2 x_1 (* 3 b)) x_3) (< x_3 (+ x_2 x_1 (* 3 b) 1))), 2318836#(and (< x_3 (+ x_2 x_1 (* 5 b) 1 (* 3 a))) (<= (+ x_2 x_1 (* 5 b) (* 3 a)) x_3)), 2318810#(and (< x_3 (+ (* 2 b) x_2 x_1 1 (* 3 a))) (<= (+ (* 2 b) x_2 x_1 (* 3 a)) x_3)), 2318838#(and (<= (+ x_3 (* b 4)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 (* b 4)))), 2318804#(and (<= (+ x_2 x_1 (* 3 b) (* 2 a)) x_3) (< x_3 (+ x_2 x_1 (* 3 b) (* 2 a) 1))), 2318822#(and (<= (+ x_3 a (* b 4)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 a (* b 4)))), 2318789#(and (< x_3 (+ x_2 x_1 a 1)) (<= (+ x_2 x_1 a) x_3)), 2318812#(and (<= (+ x_2 x_1 (* 3 b) (* 3 a)) x_3) (< x_3 (+ x_2 x_1 (* 3 b) 1 (* 3 a)))), 2318817#(and (< x_3 (+ x_2 x_1 (* a 4) (* 3 b) 1)) (<= (+ x_2 x_1 (* a 4) (* 3 b)) x_3)), 2318790#(and (<= (+ x_3 b) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 b))), 2318801#(and (<= (+ x_2 x_1 a (* 3 b)) x_3) (< x_3 (+ x_2 x_1 a (* 3 b) 1))), 2318779#(and (<= (+ (* 2 b) x_3 (* 3 a)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ (* 2 b) x_3 (* 3 a)))), 2318824#(and (<= (+ x_3 (* 5 b) (* 3 a)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 (* 5 b) (* 3 a)))), 2318849#(and (< x_3 (+ x_2 x_1 (* b 4) (* 5 a) 1)) (<= (+ x_2 x_1 (* b 4) (* 5 a)) x_3)), 2318762#(and (<= (+ x_2 x_1) (+ x_3 (* 3 a))) (<= (+ x_3 (* 3 a)) (+ x_2 x_1))), 2318828#(and (< x_3 (+ x_2 x_1 (* 5 b) 1)) (<= (+ x_2 x_1 (* 5 b)) x_3)), 2318845#(and (< x_3 (+ x_2 x_1 b (* 5 a) 1)) (<= (+ x_2 x_1 b (* 5 a)) x_3)), 2318842#(and (<= (+ x_2 x_1 (* 2 a)) (+ x_3 (* 3 b))) (<= (+ x_3 (* 3 b)) (+ x_2 x_1 (* 2 a)))), 2318784#(and (<= (+ x_2 x_1) (+ (* 2 b) x_3 (* a 4))) (<= (+ (* 2 b) x_3 (* a 4)) (+ x_2 x_1))), 2318833#(and (<= (+ x_2 x_1 a (* 5 b)) x_3) (< x_3 (+ x_2 x_1 a (* 5 b) 1))), 2318847#(and (<= (+ x_2 x_1 (* 3 b) (* 5 a)) x_3) (< x_3 (+ x_2 x_1 (* 3 b) (* 5 a) 1))), 2318777#(and (<= (+ x_2 x_1 b) x_3) (< x_3 (+ x_2 x_1 b 1))), 2318781#(and (<= (+ (* 2 b) x_2 x_1) x_3) (< x_3 (+ (* 2 b) x_2 x_1 1))), 2318791#(and (<= (+ (* 2 b) x_3 a) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ (* 2 b) x_3 a))), 2318802#(and (< x_3 (+ x_2 x_1 b (* 2 a) 1)) (<= (+ x_2 x_1 b (* 2 a)) x_3)), 2318841#(and (<= (+ x_2 x_1 (* 3 a)) (+ (* 2 b) x_3)) (<= (+ (* 2 b) x_3) (+ x_2 x_1 (* 3 a)))), 2318853#(and (<= (+ x_2 x_1) x_3) (< x_3 (+ x_2 x_1 1)) (<= 0 x_1) (<= x_1 0)), 2318809#(and (< x_3 (+ x_2 x_1 b 1 (* 3 a))) (<= (+ x_2 x_1 b (* 3 a)) x_3)), 2318839#(and (<= (+ x_2 x_1 (* 5 a)) x_3) (< x_3 (+ x_2 x_1 (* 5 a) 1))), 2318852#(and (<= (+ x_2 x_1 (* 5 b) (* 5 a)) x_3) (< x_3 (+ x_2 x_1 (* 5 b) (* 5 a) 1))), 2318780#(and (<= (+ x_2 x_1) (+ x_3 (* a 4) (* 3 b))) (<= (+ x_3 (* a 4) (* 3 b)) (+ x_2 x_1))), 2318837#(and (<= (+ x_3 (* 5 b) (* 2 a)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 (* 5 b) (* 2 a)))), 2318795#(and (<= (+ x_3 (* 3 b) (* 2 a)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 (* 3 b) (* 2 a)))), 2318799#(and (<= (+ x_2 x_1 b a) x_3) (< x_3 (+ x_2 x_1 b a 1))), 2318844#(and (<= (+ x_3 a (* 5 b)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 a (* 5 b)))), 2318778#(and (<= (+ x_2 x_1) (+ x_3 b (* 2 a))) (<= (+ x_3 b (* 2 a)) (+ x_2 x_1))), 2318820#(and (<= (+ x_2 x_1) (+ x_3 (* 3 b))) (<= (+ x_3 (* 3 b)) (+ x_2 x_1))), 2318783#(and (<= (+ x_3 b (* 3 a)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 b (* 3 a)))), 2318786#(and (<= (+ x_3 a) (+ (* 2 b) x_2 x_1)) (<= (+ (* 2 b) x_2 x_1) (+ x_3 a))), 2318796#(and (<= (+ x_3 a (* 3 b)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 a (* 3 b)))), 2318782#(and (<= (+ x_3 a) (+ x_2 x_1 b)) (<= (+ x_2 x_1 b) (+ x_3 a))), 2318835#(and (<= (+ x_2 x_1 (* b 4) (* 3 a)) x_3) (< x_3 (+ x_2 x_1 (* b 4) 1 (* 3 a)))), 2318792#(and (< x_3 (+ x_2 x_1 (* 2 a) 1)) (<= (+ x_2 x_1 (* 2 a)) x_3)), 2318758#(and (<= (+ x_3 (* a 4)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 (* a 4)))), 2318840#(and (<= (+ x_3 b) (+ x_2 x_1 (* a 4))) (<= (+ x_2 x_1 (* a 4)) (+ x_3 b))), 2318807#(and (< x_3 (+ x_2 x_1 (* b 4) (* 2 a) 1)) (<= (+ x_2 x_1 (* b 4) (* 2 a)) x_3)), 2318808#(and (<= (+ x_2 x_1 (* 3 a)) x_3) (< x_3 (+ x_2 x_1 1 (* 3 a)))), 2318819#(and (<= (+ (* 2 b) x_3) (+ x_2 x_1 (* 2 a))) (<= (+ x_2 x_1 (* 2 a)) (+ (* 2 b) x_3))), 2318794#(and (<= (+ x_2 x_1) (+ (* 2 b) x_3)) (<= (+ (* 2 b) x_3) (+ x_2 x_1))), 2318823#(and (<= (+ x_3 (* 5 b) (* a 4)) (+ x_2 x_1)) (<= (+ x_2 x_1) (+ x_3 (* 5 b) (* a 4)))), 2318830#(and (<= (+ x_3 (* 2 a)) (+ x_2 x_1 (* 3 b))) (<= (+ x_2 x_1 (* 3 b)) (+ x_3 (* 2 a)))), 2318821#(and (<= (+ x_3 (* 3 b)) (+ x_2 x_1 a)) (<= (+ x_2 x_1 a) (+ x_3 (* 3 b)))), 2318766#(and (<= (+ x_2 x_1) (+ x_3 (* 2 a))) (<= (+ x_3 (* 2 a)) (+ x_2 x_1))), 2318827#(and (<= (+ x_3 (* 3 a)) (+ x_2 x_1 b)) (<= (+ x_2 x_1 b) (+ x_3 (* 3 a)))), 2318793#(and (<= (+ x_2 x_1 a) (+ x_3 b)) (<= (+ x_3 b) (+ x_2 x_1 a))), 2318834#(and (< x_3 (+ x_2 x_1 (* 5 b) (* 2 a) 1)) (<= (+ x_2 x_1 (* 5 b) (* 2 a)) x_3))] [2022-03-15 20:46:34,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2022-03-15 20:46:34,669 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:46:34,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2022-03-15 20:46:34,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=13080, Unknown=0, NotChecked=0, Total=13340 [2022-03-15 20:46:34,670 INFO L87 Difference]: Start difference. First operand 102879 states and 476791 transitions. Second operand has 100 states, 99 states have (on average 4.5353535353535355) internal successors, (449), 99 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:03,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:03,945 INFO L93 Difference]: Finished difference Result 168629 states and 762507 transitions. [2022-03-15 20:47:03,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-03-15 20:47:03,945 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 99 states have (on average 4.5353535353535355) internal successors, (449), 99 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 20:47:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:05,047 INFO L225 Difference]: With dead ends: 168629 [2022-03-15 20:47:05,047 INFO L226 Difference]: Without dead ends: 168537 [2022-03-15 20:47:05,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 350 SyntacticMatches, 34 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2679 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=260, Invalid=13080, Unknown=0, NotChecked=0, Total=13340 [2022-03-15 20:47:05,048 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 502 mSDsluCounter, 54793 mSDsCounter, 0 mSdLazyCounter, 89734 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 89736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:05,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [502 Valid, 1 Invalid, 89736 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 89734 Invalid, 0 Unknown, 0 Unchecked, 27.2s Time] [2022-03-15 20:47:05,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168537 states. [2022-03-15 20:47:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168537 to 117777. [2022-03-15 20:47:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117777 states, 117776 states have (on average 4.684528257030295) internal successors, (551725), 117776 states have internal predecessors, (551725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:13,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117777 states to 117777 states and 551725 transitions. [2022-03-15 20:47:13,341 INFO L78 Accepts]: Start accepts. Automaton has 117777 states and 551725 transitions. Word has length 26 [2022-03-15 20:47:13,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:13,341 INFO L470 AbstractCegarLoop]: Abstraction has 117777 states and 551725 transitions. [2022-03-15 20:47:13,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 99 states have (on average 4.5353535353535355) internal successors, (449), 99 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:13,342 INFO L276 IsEmpty]: Start isEmpty. Operand 117777 states and 551725 transitions. [2022-03-15 20:47:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:47:13,996 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:13,997 INFO L514 BasicCegarLoop]: trace histogram [7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:14,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 20:47:14,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 20:47:14,197 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:47:14,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:14,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1774145265, now seen corresponding path program 26 times [2022-03-15 20:47:14,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:14,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215161699] [2022-03-15 20:47:14,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:14,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 20:47:14,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:14,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215161699] [2022-03-15 20:47:14,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215161699] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:14,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730228269] [2022-03-15 20:47:14,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:47:14,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:14,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:14,283 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:47:14,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 20:47:14,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:47:14,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:14,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:47:14,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 17 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 20:47:14,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:14,424 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 17 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 20:47:14,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730228269] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:14,424 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:14,424 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 19 [2022-03-15 20:47:14,425 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [633140582] [2022-03-15 20:47:14,425 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:14,427 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:14,527 INFO L252 McrAutomatonBuilder]: Finished intersection with 448 states and 1148 transitions. [2022-03-15 20:47:14,527 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:19,010 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 83 new interpolants: [2723208#(or (< (+ i_2 1) c) (<= c i_2)), 2723276#(or (<= c (+ 6 i_2)) (<= (+ 3 i_1) c)), 2723228#(or (<= c i_1) (<= c i_2) (< (+ i_1 1) c)), 2723229#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 2723231#(or (<= c i_2) (<= (+ i_1 4) c)), 2723277#(or (<= c i_1) (<= c (+ 6 i_2)) (< (+ i_1 1) c)), 2723270#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ 5 i_2))), 2723210#(or (< (+ 2 i_2) c) (<= c (+ i_2 1))), 2723255#(or (<= c (+ i_2 4)) (<= (+ 3 i_1) c)), 2723237#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ i_2 1))), 2723236#(or (<= c i_1) (<= c (+ i_2 1)) (< (+ i_1 1) c)), 2723282#(or (<= (+ 6 i_1) c) (<= c (+ 6 i_2))), 2723279#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 6 i_2))), 2723234#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c i_2)), 2723288#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c (+ 5 i_2))), 2723213#(<= c (+ 2 i_2)), 2723257#(or (<= c (+ i_2 4)) (<= (+ 5 i_1) c)), 2723281#(or (<= (+ 5 i_1) c) (<= c (+ 6 i_2))), 2723238#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ i_2 1))), 2723241#(or (<= (+ 6 i_1) c) (<= c (+ i_2 1))), 2723212#(or (<= c (+ 2 i_2)) (< (+ 3 i_2) c)), 2723242#(or (<= c i_1) (<= c (+ 2 i_2)) (< (+ i_1 1) c)), 2723263#(<= c (+ 5 i_2)), 2723274#(<= c (+ 6 i_2)), 2723267#(or (<= (+ i_1 4) c) (<= c (+ 5 i_2))), 2723284#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c (+ i_2 1))), 2723240#(or (<= (+ 5 i_1) c) (<= c (+ i_2 1))), 2723259#(or (<= (+ 6 i_1) c) (<= c (+ 3 i_2))), 2723251#(or (<= (+ 5 i_1) c) (<= c (+ 3 i_2))), 2723220#(or (<= c i_2) (<= (+ 3 i_1) c)), 2723266#(or (<= c (+ 5 i_2)) (<= (+ 3 i_1) c)), 2723219#(or (<= c (+ 2 i_2)) (< i_1 c)), 2723245#(or (<= (+ 5 i_1) c) (<= c (+ 2 i_2))), 2723265#(or (<= c i_1) (<= c (+ 5 i_2)) (< (+ i_1 1) c)), 2723269#(or (<= (+ 5 i_1) c) (<= c (+ 5 i_2))), 2723262#(or (<= c (+ 5 i_2)) (< (+ 6 i_2) c)), 2723209#(<= c i_2), 2723216#(< i_1 c), 2723232#(or (<= (+ 5 i_1) c) (<= c i_2)), 2723285#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c (+ 2 i_2))), 2723218#(or (<= c (+ i_2 1)) (< i_1 c)), 2723287#(or (<= c (+ i_2 4)) (<= c (+ 3 i_1)) (< (+ i_1 4) c)), 2723235#(or (<= (+ 6 i_1) c) (<= c i_2)), 2723249#(or (<= c (+ 3 i_2)) (<= (+ i_1 4) c)), 2723222#(or (<= c (+ 2 i_2)) (<= (+ 3 i_1) c)), 2723224#(or (<= c (+ 3 i_2)) (<= (+ 3 i_1) c)), 2723286#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c (+ 3 i_2))), 2723272#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c)), 2723217#(or (<= c i_2) (< i_1 c)), 2723260#(or (<= c (+ i_2 4)) (<= c (+ 2 i_1)) (< (+ 3 i_1) c)), 2723264#(or (<= c (+ 5 i_2)) (< i_1 c)), 2723246#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ 2 i_2))), 2723247#(or (<= (+ 6 i_1) c) (<= c (+ 2 i_2))), 2723273#(or (< (+ 7 i_2) c) (<= c (+ 6 i_2))), 2723214#(or (< (+ i_2 4) c) (<= c (+ 3 i_2))), 2723223#(or (<= c (+ 3 i_2)) (< i_1 c)), 2723250#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 3 i_2))), 2723275#(or (<= c (+ 6 i_2)) (< i_1 c)), 2723233#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c)), 2723215#(<= c (+ 3 i_2)), 2723278#(or (<= c (+ 6 i_2)) (<= (+ i_1 4) c)), 2723261#(or (<= c (+ i_2 4)) (<= (+ 6 i_1) c)), 2723268#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 5 i_2))), 2723226#(<= c (+ i_2 4)), 2723207#(< i_2 c), 2723252#(or (<= c (+ i_2 4)) (< i_1 c)), 2723258#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ 3 i_2))), 2723221#(or (<= (+ 3 i_1) c) (<= c (+ i_2 1))), 2723243#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 2 i_2))), 2723253#(or (<= c (+ i_2 4)) (<= c i_1) (< (+ i_1 1) c)), 2723283#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c i_2)), 2723244#(or (<= c (+ 2 i_2)) (<= (+ i_1 4) c)), 2723248#(or (<= c i_1) (<= c (+ 3 i_2)) (< (+ i_1 1) c)), 2723227#(or (<= c i_1) (< (+ i_1 1) c)), 2723271#(or (<= (+ 6 i_1) c) (<= c (+ 5 i_2))), 2723230#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c i_2)), 2723254#(or (<= c (+ i_2 4)) (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 2723225#(or (<= c (+ i_2 4)) (< (+ 5 i_2) c)), 2723239#(or (<= (+ i_1 4) c) (<= c (+ i_2 1))), 2723289#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c (+ 6 i_2))), 2723211#(<= c (+ i_2 1)), 2723280#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ 6 i_2))), 2723256#(or (<= c (+ i_2 4)) (<= (+ i_1 4) c))] [2022-03-15 20:47:19,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-03-15 20:47:19,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:19,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-03-15 20:47:19,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2068, Invalid=8438, Unknown=0, NotChecked=0, Total=10506 [2022-03-15 20:47:19,012 INFO L87 Difference]: Start difference. First operand 117777 states and 551725 transitions. Second operand has 97 states, 97 states have (on average 3.8247422680412373) internal successors, (371), 96 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:25,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:25,050 INFO L93 Difference]: Finished difference Result 298613 states and 1346242 transitions. [2022-03-15 20:47:25,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-03-15 20:47:25,050 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 3.8247422680412373) internal successors, (371), 96 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 20:47:25,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:29,113 INFO L225 Difference]: With dead ends: 298613 [2022-03-15 20:47:29,113 INFO L226 Difference]: Without dead ends: 298436 [2022-03-15 20:47:29,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8617 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=6902, Invalid=21828, Unknown=0, NotChecked=0, Total=28730 [2022-03-15 20:47:29,120 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1065 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 2201 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 2201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:29,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1065 Valid, 1 Invalid, 2460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 2201 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:47:29,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298436 states. [2022-03-15 20:47:42,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298436 to 219492. [2022-03-15 20:47:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219492 states, 219491 states have (on average 4.6844335303042035) internal successors, (1028191), 219491 states have internal predecessors, (1028191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219492 states to 219492 states and 1028191 transitions. [2022-03-15 20:47:45,721 INFO L78 Accepts]: Start accepts. Automaton has 219492 states and 1028191 transitions. Word has length 26 [2022-03-15 20:47:45,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:45,721 INFO L470 AbstractCegarLoop]: Abstraction has 219492 states and 1028191 transitions. [2022-03-15 20:47:45,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 3.8247422680412373) internal successors, (371), 96 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:45,722 INFO L276 IsEmpty]: Start isEmpty. Operand 219492 states and 1028191 transitions. [2022-03-15 20:47:46,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 20:47:46,526 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:46,526 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:46,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-03-15 20:47:46,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 20:47:46,740 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 20:47:46,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:46,741 INFO L85 PathProgramCache]: Analyzing trace with hash -801949570, now seen corresponding path program 27 times [2022-03-15 20:47:46,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:46,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925770318] [2022-03-15 20:47:46,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:46,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 20:47:46,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:46,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925770318] [2022-03-15 20:47:46,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925770318] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:46,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232209108] [2022-03-15 20:47:46,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:47:46,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:46,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:46,886 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:47:46,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 20:47:46,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:47:46,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:46,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 20:47:46,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 20:47:47,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 20:47:47,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232209108] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:47,061 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:47,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 20 [2022-03-15 20:47:47,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2119783354] [2022-03-15 20:47:47,061 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:47,064 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:47,161 INFO L252 McrAutomatonBuilder]: Finished intersection with 516 states and 1333 transitions. [2022-03-15 20:47:47,161 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:55,056 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 55 new interpolants: [3461218#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ i_3 1))), 3461248#(and (or (<= c i_1) (= (+ (* (- 1) i_3) x_2) 0) (< (+ i_1 1) c)) (or (<= c (+ 5 i_3)) (<= c i_1) (< (+ i_1 1) c))), 3461199#(or (< (+ i_3 1) c) (<= c i_3)), 3461202#(< i_1 c), 3461211#(or (<= c i_1) (<= c (+ 2 i_3)) (< (+ i_1 1) c)), 3461252#(and (or (<= c (+ 5 i_3)) (< (+ 5 i_1) c) (<= c (+ i_1 4))) (or (= i_3 x_2) (< (+ 5 i_1) c) (<= c (+ i_1 4)))), 3461225#(or (<= c (+ 5 i_3)) (< i_1 c)), 3461235#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c i_3)), 3461203#(or (< i_1 c) (<= c i_3)), 3461214#(or (<= c (+ i_3 4)) (< i_1 c)), 3461219#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 2 i_3))), 3461221#(or (<= c (+ i_3 4)) (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 3461239#(or (<= c (+ i_3 4)) (<= c (+ 3 i_1)) (< (+ i_1 4) c)), 3461244#(or (<= c (+ 3 i_3)) (< (+ 5 i_1) c) (<= c (+ i_1 4))), 3461222#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c)), 3461230#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ 2 i_3))), 3461224#(or (< (+ 5 i_1) c) (<= c (+ i_1 4))), 3461238#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c (+ 3 i_3))), 3461206#(or (< (+ i_3 4) c) (<= c (+ 3 i_3))), 3461198#(< i_3 c), 3461247#(and (or (= (+ (* (- 1) i_3) x_2) 0) (< i_1 c)) (or (<= c (+ 5 i_3)) (< i_1 c))), 3461208#(or (<= c i_1) (< (+ i_1 1) c)), 3461204#(or (<= c (+ i_3 1)) (< i_1 c)), 3461213#(or (<= c (+ i_3 4)) (< (+ 5 i_3) c)), 3461245#(or (<= c (+ i_3 4)) (< (+ 5 i_1) c) (<= c (+ i_1 4))), 3461217#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c i_3)), 3461241#(or (< (+ 5 i_1) c) (<= c i_3) (<= c (+ i_1 4))), 3461201#(or (< (+ 3 i_3) c) (<= c (+ 2 i_3))), 3461232#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ i_3 4))), 3461250#(and (or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (= i_3 x_2)) (or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ 5 i_3)))), 3461228#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c i_3)), 3461237#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (<= c (+ 2 i_3))), 3461210#(or (<= c i_1) (<= c (+ i_3 1)) (< (+ i_1 1) c)), 3461233#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ 5 i_3))), 3461246#(or (<= c (+ 5 i_3)) (< (+ 5 i_1) c) (<= c (+ i_1 4))), 3461207#(or (<= c (+ 3 i_3)) (< i_1 c)), 3461209#(or (<= c i_1) (<= c i_3) (< (+ i_1 1) c)), 3461242#(or (<= c (+ i_3 1)) (< (+ 5 i_1) c) (<= c (+ i_1 4))), 3461212#(or (<= c i_1) (<= c (+ 3 i_3)) (< (+ i_1 1) c)), 3461227#(or (<= c (+ 5 i_3)) (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 3461240#(or (<= c (+ 5 i_3)) (<= c (+ 3 i_1)) (< (+ i_1 4) c)), 3461205#(or (< i_1 c) (<= c (+ 2 i_3))), 3461229#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ i_3 1))), 3461226#(or (<= c (+ 5 i_3)) (<= c i_1) (< (+ i_1 1) c)), 3461231#(or (<= c (+ 2 i_1)) (< (+ 3 i_1) c) (<= c (+ 3 i_3))), 3461216#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c)), 3461236#(or (<= c (+ 3 i_1)) (<= c (+ i_3 1)) (< (+ i_1 4) c)), 3461200#(or (< (+ 2 i_3) c) (<= c (+ i_3 1))), 3461234#(or (<= c (+ 5 i_3)) (< (+ 6 i_3) c)), 3461243#(or (< (+ 5 i_1) c) (<= c (+ 2 i_3)) (<= c (+ i_1 4))), 3461249#(and (or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (= i_3 x_2)) (or (<= c (+ 5 i_3)) (<= c (+ i_1 1)) (< (+ 2 i_1) c))), 3461223#(or (<= c (+ 3 i_1)) (< (+ i_1 4) c)), 3461220#(or (<= c (+ i_1 1)) (< (+ 2 i_1) c) (<= c (+ 3 i_3))), 3461251#(and (or (<= c (+ 5 i_3)) (<= c (+ 3 i_1)) (< (+ i_1 4) c)) (or (<= c (+ 3 i_1)) (< (+ i_1 4) c) (= i_3 x_2))), 3461215#(or (<= c i_1) (<= c (+ i_3 4)) (< (+ i_1 1) c))] [2022-03-15 20:47:55,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-03-15 20:47:55,056 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:55,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-03-15 20:47:55,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=5053, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 20:47:55,057 INFO L87 Difference]: Start difference. First operand 219492 states and 1028191 transitions. Second operand has 70 states, 70 states have (on average 3.857142857142857) internal successors, (270), 69 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:48:02,994 INFO L93 Difference]: Finished difference Result 354675 states and 1585872 transitions. [2022-03-15 20:48:02,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-03-15 20:48:02,995 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 3.857142857142857) internal successors, (270), 69 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 20:48:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:48:06,160 INFO L225 Difference]: With dead ends: 354675 [2022-03-15 20:48:06,160 INFO L226 Difference]: Without dead ends: 354508 [2022-03-15 20:48:06,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 479 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4199 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3461, Invalid=15171, Unknown=0, NotChecked=0, Total=18632 [2022-03-15 20:48:06,164 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 549 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:48:06,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [549 Valid, 1 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:48:06,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354508 states. [2022-03-15 20:48:18,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354508 to 235383. [2022-03-15 20:48:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235383 states, 235382 states have (on average 4.629738042840999) internal successors, (1089757), 235382 states have internal predecessors, (1089757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235383 states to 235383 states and 1089757 transitions. [2022-03-15 20:48:21,879 INFO L78 Accepts]: Start accepts. Automaton has 235383 states and 1089757 transitions. Word has length 27 [2022-03-15 20:48:21,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:48:21,879 INFO L470 AbstractCegarLoop]: Abstraction has 235383 states and 1089757 transitions. [2022-03-15 20:48:21,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 3.857142857142857) internal successors, (270), 69 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:21,880 INFO L276 IsEmpty]: Start isEmpty. Operand 235383 states and 1089757 transitions.