/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/fibonacci.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:42:11,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:42:11,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:42:11,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:42:11,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:42:11,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:42:11,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:42:11,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:42:11,252 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:42:11,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:42:11,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:42:11,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:42:11,254 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:42:11,255 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:42:11,256 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:42:11,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:42:11,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:42:11,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:42:11,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:42:11,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:42:11,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:42:11,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:42:11,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:42:11,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:42:11,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:42:11,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:42:11,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:42:11,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:42:11,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:42:11,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:42:11,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:42:11,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:42:11,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:42:11,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:42:11,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:42:11,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:42:11,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:42:11,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:42:11,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:42:11,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:42:11,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:42:11,291 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:11,317 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:42:11,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:42:11,318 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:42:11,318 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:42:11,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:42:11,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:42:11,319 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:42:11,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:42:11,322 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:42:11,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:42:11,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:42:11,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:42:11,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:42:11,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:42:11,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:42:11,323 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:42:11,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:42:11,323 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:42:11,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:42:11,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:42:11,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:42:11,324 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:42:11,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:42:11,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:42:11,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:42:11,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:42:11,325 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:42:11,326 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:42:11,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:42:11,326 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:42:11,326 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:42:11,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:42:11,326 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:11,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:42:11,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:42:11,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:42:11,585 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 20:42:11,587 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 20:42:11,588 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/fibonacci.wvr.bpl [2022-03-15 20:42:11,588 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/fibonacci.wvr.bpl' [2022-03-15 20:42:11,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:42:11,617 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 20:42:11,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:42:11,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:42:11,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:42:11,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:11" (1/1) ... [2022-03-15 20:42:11,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:11" (1/1) ... [2022-03-15 20:42:11,638 INFO L137 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 20:42:11,640 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:42:11,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:42:11,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:42:11,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:42:11,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:11" (1/1) ... [2022-03-15 20:42:11,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:11" (1/1) ... [2022-03-15 20:42:11,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:11" (1/1) ... [2022-03-15 20:42:11,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:11" (1/1) ... [2022-03-15 20:42:11,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:11" (1/1) ... [2022-03-15 20:42:11,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:11" (1/1) ... [2022-03-15 20:42:11,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:11" (1/1) ... [2022-03-15 20:42:11,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:42:11,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:42:11,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:42:11,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:42:11,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:11" (1/1) ... [2022-03-15 20:42:11,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:42:11,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:11,687 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:11,701 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:11,724 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 20:42:11,725 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 20:42:11,725 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 20:42:11,725 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 20:42:11,725 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 20:42:11,725 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 20:42:11,725 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 20:42:11,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:42:11,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:42:11,726 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:11,770 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:42:11,772 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:42:11,887 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:42:11,920 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:42:11,920 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 20:42:11,922 INFO L202 PluginConnector]: Adding new model fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:42:11 BoogieIcfgContainer [2022-03-15 20:42:11,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:42:11,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:42:11,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:42:11,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:42:11,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:11" (1/2) ... [2022-03-15 20:42:11,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592f03dc and model type fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:42:11, skipping insertion in model container [2022-03-15 20:42:11,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:42:11" (2/2) ... [2022-03-15 20:42:11,933 INFO L111 eAbstractionObserver]: Analyzing ICFG fibonacci.wvr.bpl [2022-03-15 20:42:11,941 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:42:11,941 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:42:11,942 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 20:42:11,942 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:42:12,001 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 20:42:12,067 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:42:12,089 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:12,090 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 20:42:12,097 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:42:12,108 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 19 transitions, 54 flow [2022-03-15 20:42:12,115 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 19 transitions, 54 flow [2022-03-15 20:42:12,117 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 19 transitions, 54 flow [2022-03-15 20:42:12,142 INFO L129 PetriNetUnfolder]: 2/17 cut-off events. [2022-03-15 20:42:12,151 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 20:42:12,156 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 17 events. 2/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2022-03-15 20:42:12,158 INFO L116 LiptonReduction]: Number of co-enabled transitions 48 [2022-03-15 20:42:12,262 INFO L131 LiptonReduction]: Checked pairs total: 36 [2022-03-15 20:42:12,262 INFO L133 LiptonReduction]: Total number of compositions: 5 [2022-03-15 20:42:12,278 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 15 transitions, 46 flow [2022-03-15 20:42:12,292 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:12,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:42:12,298 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:12,299 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:12,299 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:12,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:12,303 INFO L85 PathProgramCache]: Analyzing trace with hash -381902407, now seen corresponding path program 1 times [2022-03-15 20:42:12,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:12,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138726321] [2022-03-15 20:42:12,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:12,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:12,595 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:12,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:12,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138726321] [2022-03-15 20:42:12,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138726321] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:42:12,596 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:42:12,597 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:42:12,598 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1823320152] [2022-03-15 20:42:12,598 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:12,603 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:12,614 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 26 transitions. [2022-03-15 20:42:12,614 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:13,094 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [70#(and (or (<= f1_2 0) (= l_8 1)) (or (= l_8 0) (< 0 f1_2))), 71#(and (or (< 0 f1_6) (<= f1_2 0)) (or (<= f1_6 0) (< 0 f1_2)))] [2022-03-15 20:42:13,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 20:42:13,095 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:13,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 20:42:13,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:42:13,116 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:13,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:13,215 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2022-03-15 20:42:13,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:42:13,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 20:42:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:13,223 INFO L225 Difference]: With dead ends: 33 [2022-03-15 20:42:13,224 INFO L226 Difference]: Without dead ends: 30 [2022-03-15 20:42:13,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:42:13,227 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:13,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 20 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:42:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-03-15 20:42:13,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-03-15 20:42:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2022-03-15 20:42:13,255 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 56 transitions. Word has length 10 [2022-03-15 20:42:13,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:13,255 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 56 transitions. [2022-03-15 20:42:13,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:13,255 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 56 transitions. [2022-03-15 20:42:13,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:42:13,256 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:13,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:13,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:42:13,257 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:13,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:13,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1045603425, now seen corresponding path program 1 times [2022-03-15 20:42:13,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:13,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312026075] [2022-03-15 20:42:13,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:13,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:13,288 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:13,289 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:13,289 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312026075] [2022-03-15 20:42:13,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312026075] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:42:13,289 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:42:13,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:42:13,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1193781254] [2022-03-15 20:42:13,290 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:13,291 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:13,294 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 33 transitions. [2022-03-15 20:42:13,294 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:13,390 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [177#(or (<= n_0 i_5) (< i_1 n_0)), 179#(or (< 0 n_0) (<= n_0 i_5)), 176#(< i_1 n_0), 178#(< 0 n_0)] [2022-03-15 20:42:13,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:42:13,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:13,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:42:13,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:42:13,392 INFO L87 Difference]: Start difference. First operand 30 states and 56 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:13,549 INFO L93 Difference]: Finished difference Result 40 states and 72 transitions. [2022-03-15 20:42:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 20:42:13,549 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have 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:13,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:13,551 INFO L225 Difference]: With dead ends: 40 [2022-03-15 20:42:13,551 INFO L226 Difference]: Without dead ends: 35 [2022-03-15 20:42:13,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:42:13,553 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:13,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 31 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-03-15 20:42:13,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2022-03-15 20:42:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:13,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 42 transitions. [2022-03-15 20:42:13,561 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 42 transitions. Word has length 11 [2022-03-15 20:42:13,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:13,561 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 42 transitions. [2022-03-15 20:42:13,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:13,562 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 42 transitions. [2022-03-15 20:42:13,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:42:13,562 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:13,562 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:13,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:42:13,563 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:13,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:13,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1627298969, now seen corresponding path program 1 times [2022-03-15 20:42:13,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:13,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073468735] [2022-03-15 20:42:13,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:13,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:13,593 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:13,593 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:13,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073468735] [2022-03-15 20:42:13,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073468735] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:13,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636587233] [2022-03-15 20:42:13,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:13,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:13,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:13,603 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:13,605 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:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:13,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 20:42:13,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:13,665 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:13,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:13,688 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:13,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636587233] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:13,688 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:13,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-03-15 20:42:13,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [88124568] [2022-03-15 20:42:13,689 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:13,689 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:13,692 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 33 transitions. [2022-03-15 20:42:13,692 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:13,841 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [350#(or (< i_1 n_0) (< i_5 n_0)), 347#(< i_1 n_0), 351#(or (<= n_0 i_1) (< i_5 n_0) (< (+ i_1 1) n_0)), 349#(or (< 1 n_0) (<= n_0 0)), 352#(or (< 1 n_0) (<= n_0 0) (< i_5 n_0)), 348#(or (<= n_0 i_1) (< (+ i_1 1) n_0))] [2022-03-15 20:42:13,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:42:13,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:13,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:42:13,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:42:13,843 INFO L87 Difference]: Start difference. First operand 23 states and 42 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:14,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:14,169 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. [2022-03-15 20:42:14,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:42:14,169 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have 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:14,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:14,170 INFO L225 Difference]: With dead ends: 40 [2022-03-15 20:42:14,170 INFO L226 Difference]: Without dead ends: 40 [2022-03-15 20:42:14,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:42:14,171 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 43 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:14,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 31 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:14,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-15 20:42:14,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2022-03-15 20:42:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.0) internal successors, (60), 30 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:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 60 transitions. [2022-03-15 20:42:14,175 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 60 transitions. Word has length 11 [2022-03-15 20:42:14,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:14,175 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 60 transitions. [2022-03-15 20:42:14,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:14,176 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 60 transitions. [2022-03-15 20:42:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:42:14,176 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:14,176 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:14,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:14,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:14,377 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:14,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:14,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1093663359, now seen corresponding path program 1 times [2022-03-15 20:42:14,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:14,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642469996] [2022-03-15 20:42:14,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:14,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:14,489 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:14,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642469996] [2022-03-15 20:42:14,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642469996] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:14,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463887715] [2022-03-15 20:42:14,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:14,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:14,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:14,491 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:14,493 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:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:14,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:42:14,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:14,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:14,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463887715] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:14,853 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:14,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-03-15 20:42:14,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1267234648] [2022-03-15 20:42:14,853 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:14,854 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:14,857 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 42 transitions. [2022-03-15 20:42:14,857 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:15,414 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [560#(and (or (<= (+ f2_3 f1_2) 0) (< 0 f1_6)) (or (<= f1_6 0) (< 0 (+ f2_3 f1_2)))), 543#(and (or (<= (+ f2_7 f1_6) 0) (< 0 f1_2)) (or (<= 1 (+ f2_7 f1_6)) (<= f1_2 0))), 557#(and (or (<= f1_2 0) (= l_8 1)) (or (= l_8 0) (< 0 f1_2))), 559#(and (or (< 0 f1_6) (<= f1_2 0)) (or (<= f1_6 0) (< 0 f1_2))), 558#(and (or (< 0 (+ f2_3 f1_2)) (= l_8 0)) (or (<= (+ f2_3 f1_2) 0) (= l_8 1))), 547#(and (or (<= 1 (+ f2_7 f1_6)) (<= (+ f2_3 f1_2) 0)) (or (<= (+ f2_7 f1_6) 0) (< 0 (+ f2_3 f1_2))))] [2022-03-15 20:42:15,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:42:15,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:15,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:42:15,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:42:15,416 INFO L87 Difference]: Start difference. First operand 31 states and 60 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 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:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:15,687 INFO L93 Difference]: Finished difference Result 51 states and 98 transitions. [2022-03-15 20:42:15,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 20:42:15,691 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 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:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:15,692 INFO L225 Difference]: With dead ends: 51 [2022-03-15 20:42:15,692 INFO L226 Difference]: Without dead ends: 48 [2022-03-15 20:42:15,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:42:15,693 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:15,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 63 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:15,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-15 20:42:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2022-03-15 20:42:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.097560975609756) internal successors, (86), 41 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:15,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2022-03-15 20:42:15,698 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 12 [2022-03-15 20:42:15,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:15,699 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 86 transitions. [2022-03-15 20:42:15,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 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:15,699 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 86 transitions. [2022-03-15 20:42:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:42:15,699 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:15,700 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:15,727 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:15,911 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:15,912 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:15,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:15,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1303351751, now seen corresponding path program 2 times [2022-03-15 20:42:15,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:15,913 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743465458] [2022-03-15 20:42:15,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:15,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:15,939 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:15,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743465458] [2022-03-15 20:42:15,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743465458] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:42:15,939 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:42:15,939 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:42:15,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1632101079] [2022-03-15 20:42:15,940 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:15,941 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:15,942 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 40 transitions. [2022-03-15 20:42:15,942 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:16,043 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [715#(< i_5 n_0), 714#(<= i_5 0), 716#(< 0 n_0), 713#(<= n_0 0)] [2022-03-15 20:42:16,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:42:16,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:16,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:42:16,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:42:16,044 INFO L87 Difference]: Start difference. First operand 42 states and 86 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:16,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:16,188 INFO L93 Difference]: Finished difference Result 58 states and 107 transitions. [2022-03-15 20:42:16,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 20:42:16,188 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:42:16,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:16,189 INFO L225 Difference]: With dead ends: 58 [2022-03-15 20:42:16,189 INFO L226 Difference]: Without dead ends: 56 [2022-03-15 20:42:16,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:42:16,190 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 38 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:16,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 34 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:16,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-03-15 20:42:16,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2022-03-15 20:42:16,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.0) internal successors, (80), 40 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:16,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 80 transitions. [2022-03-15 20:42:16,200 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 80 transitions. Word has length 12 [2022-03-15 20:42:16,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:16,200 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 80 transitions. [2022-03-15 20:42:16,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 80 transitions. [2022-03-15 20:42:16,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:42:16,201 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:16,201 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:16,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 20:42:16,201 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:16,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:16,202 INFO L85 PathProgramCache]: Analyzing trace with hash 455850393, now seen corresponding path program 2 times [2022-03-15 20:42:16,203 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:16,203 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147799605] [2022-03-15 20:42:16,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:16,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:16,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:16,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147799605] [2022-03-15 20:42:16,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147799605] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:16,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507341283] [2022-03-15 20:42:16,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:42:16,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:16,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:16,240 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:16,274 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:16,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:42:16,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:16,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:42:16,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:16,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:16,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:16,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507341283] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:16,355 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:16,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 20:42:16,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [801487125] [2022-03-15 20:42:16,355 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:16,356 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:16,361 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 51 transitions. [2022-03-15 20:42:16,361 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:16,608 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [956#(< i_1 n_0), 963#(or (<= n_0 i_1) (< (+ i_1 1) n_0) (<= n_0 (+ i_5 1))), 962#(or (< i_1 n_0) (<= n_0 (+ i_5 1))), 958#(or (<= n_0 i_5) (< i_1 n_0)), 957#(or (<= n_0 i_1) (< (+ i_1 1) n_0)), 961#(or (< 1 n_0) (<= n_0 0) (<= n_0 i_5)), 960#(or (< 1 n_0) (<= n_0 0)), 964#(or (< 1 n_0) (<= n_0 0) (<= n_0 (+ i_5 1))), 959#(or (<= n_0 i_1) (<= n_0 i_5) (< (+ i_1 1) n_0))] [2022-03-15 20:42:16,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:42:16,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:16,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:42:16,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:42:16,609 INFO L87 Difference]: Start difference. First operand 41 states and 80 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:17,130 INFO L93 Difference]: Finished difference Result 59 states and 110 transitions. [2022-03-15 20:42:17,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 20:42:17,130 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:42:17,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:17,131 INFO L225 Difference]: With dead ends: 59 [2022-03-15 20:42:17,131 INFO L226 Difference]: Without dead ends: 52 [2022-03-15 20:42:17,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=411, Invalid=1311, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:42:17,132 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 67 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:17,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 39 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:42:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-03-15 20:42:17,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 33. [2022-03-15 20:42:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.9375) internal successors, (62), 32 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:17,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 62 transitions. [2022-03-15 20:42:17,136 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 62 transitions. Word has length 13 [2022-03-15 20:42:17,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:17,136 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 62 transitions. [2022-03-15 20:42:17,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:17,137 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 62 transitions. [2022-03-15 20:42:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:42:17,137 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:17,137 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:17,163 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:17,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:17,352 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:17,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:17,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1308543073, now seen corresponding path program 3 times [2022-03-15 20:42:17,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:17,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551411526] [2022-03-15 20:42:17,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:17,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:17,388 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:17,388 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551411526] [2022-03-15 20:42:17,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551411526] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:17,388 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126467869] [2022-03-15 20:42:17,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:42:17,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:17,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:17,390 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:17,393 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:17,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 20:42:17,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:17,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:42:17,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:17,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:17,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:17,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126467869] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:17,500 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:17,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 20:42:17,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1118374632] [2022-03-15 20:42:17,500 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:17,501 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:17,503 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 51 transitions. [2022-03-15 20:42:17,503 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:17,817 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [1224#(or (< i_1 n_0) (<= (+ 2 i_5) n_0)), 1223#(or (<= n_0 i_1) (< i_5 n_0) (< (+ i_1 1) n_0)), 1229#(or (<= n_0 1) (< 2 n_0)), 1227#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (< i_5 n_0)), 1226#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 1231#(or (<= n_0 1) (< 2 n_0) (<= (+ 2 i_5) n_0)), 1228#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (<= (+ 2 i_5) n_0)), 1230#(or (<= n_0 1) (< 2 n_0) (< i_5 n_0)), 1222#(or (<= n_0 i_1) (< (+ i_1 1) n_0)), 1221#(or (< i_1 n_0) (< i_5 n_0)), 1220#(< i_1 n_0), 1225#(or (<= n_0 i_1) (< (+ i_1 1) n_0) (<= (+ 2 i_5) n_0))] [2022-03-15 20:42:17,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 20:42:17,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:17,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 20:42:17,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:42:17,818 INFO L87 Difference]: Start difference. First operand 33 states and 62 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:18,619 INFO L93 Difference]: Finished difference Result 64 states and 126 transitions. [2022-03-15 20:42:18,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 20:42:18,619 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:42:18,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:18,620 INFO L225 Difference]: With dead ends: 64 [2022-03-15 20:42:18,620 INFO L226 Difference]: Without dead ends: 64 [2022-03-15 20:42:18,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=528, Invalid=1922, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 20:42:18,622 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 74 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:18,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 50 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:42:18,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-03-15 20:42:18,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2022-03-15 20:42:18,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 2.130434782608696) internal successors, (98), 46 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:18,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 98 transitions. [2022-03-15 20:42:18,626 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 98 transitions. Word has length 13 [2022-03-15 20:42:18,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:18,626 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 98 transitions. [2022-03-15 20:42:18,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 98 transitions. [2022-03-15 20:42:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:42:18,627 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:18,627 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:18,653 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:18,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:18,849 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:18,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1909805753, now seen corresponding path program 4 times [2022-03-15 20:42:18,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:18,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739587492] [2022-03-15 20:42:18,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:18,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:18,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:18,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739587492] [2022-03-15 20:42:18,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739587492] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:18,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067400655] [2022-03-15 20:42:18,988 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:42:18,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:18,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:18,989 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:18,990 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:19,016 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:42:19,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:19,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 20:42:19,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:19,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:19,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067400655] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:19,330 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:19,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-03-15 20:42:19,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [356944472] [2022-03-15 20:42:19,330 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:19,331 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:19,335 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 62 transitions. [2022-03-15 20:42:19,335 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:20,265 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [1547#(and (or (<= (+ f2_7 f1_6) 0) (< 0 (+ f2_3 f1_2))) (or (<= (+ f2_3 f1_2) 0) (< 0 (+ f2_7 f1_6)))), 1549#(and (or (< 0 f1_6) (<= (+ (* 2 f1_2) f2_3) 0)) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= f1_6 0))), 1548#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (= l_8 0)) (or (<= (+ (* 2 f1_2) f2_3) 0) (= l_8 1))), 1544#(and (or (< 0 f1_6) (<= f1_2 0)) (or (<= f1_6 0) (< 0 f1_2))), 1542#(and (or (<= f1_2 0) (= l_8 1)) (or (= l_8 0) (< 0 f1_2))), 1546#(and (or (<= (+ f2_7 f1_6) 0) (< 0 f1_2)) (or (<= 1 (+ f2_7 f1_6)) (<= f1_2 0))), 1524#(and (or (<= 1 (+ f2_7 (* 2 f1_6))) (<= f1_2 0)) (or (<= (+ f2_7 (* 2 f1_6)) 0) (< 0 f1_2))), 1543#(and (or (< 0 (+ f2_3 f1_2)) (= l_8 0)) (or (<= (+ f2_3 f1_2) 0) (= l_8 1))), 1532#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ f2_7 (* 2 f1_6)) 0)) (or (<= 1 (+ f2_7 (* 2 f1_6))) (<= (+ (* 2 f1_2) f2_3) 0))), 1550#(and (or (< 0 (+ f2_7 f1_6)) (<= (+ (* 2 f1_2) f2_3) 0)) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ f2_7 f1_6) 0))), 1545#(and (or (<= (+ f2_3 f1_2) 0) (< 0 f1_6)) (or (<= f1_6 0) (< 0 (+ f2_3 f1_2)))), 1528#(and (or (<= (+ f2_3 f1_2) 0) (<= 1 (+ f2_7 (* 2 f1_6)))) (or (<= (+ f2_7 (* 2 f1_6)) 0) (< 0 (+ f2_3 f1_2))))] [2022-03-15 20:42:20,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 20:42:20,265 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:20,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 20:42:20,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:42:20,266 INFO L87 Difference]: Start difference. First operand 47 states and 98 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:20,884 INFO L93 Difference]: Finished difference Result 77 states and 156 transitions. [2022-03-15 20:42:20,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 20:42:20,884 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:42:20,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:20,885 INFO L225 Difference]: With dead ends: 77 [2022-03-15 20:42:20,885 INFO L226 Difference]: Without dead ends: 74 [2022-03-15 20:42:20,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 24 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=1075, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 20:42:20,886 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 38 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:20,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 151 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:42:20,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-03-15 20:42:20,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2022-03-15 20:42:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.2033898305084745) internal successors, (130), 59 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:20,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 130 transitions. [2022-03-15 20:42:20,891 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 130 transitions. Word has length 14 [2022-03-15 20:42:20,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:20,891 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 130 transitions. [2022-03-15 20:42:20,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:20,892 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 130 transitions. [2022-03-15 20:42:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:42:20,892 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:20,892 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:20,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:21,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:21,100 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:21,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:21,100 INFO L85 PathProgramCache]: Analyzing trace with hash -21022977, now seen corresponding path program 5 times [2022-03-15 20:42:21,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:21,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264562074] [2022-03-15 20:42:21,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:21,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:21,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:21,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264562074] [2022-03-15 20:42:21,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264562074] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:21,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749260377] [2022-03-15 20:42:21,140 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:42:21,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:21,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:21,142 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:21,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 20:42:21,171 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 20:42:21,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:21,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:42:21,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:21,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:21,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749260377] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:21,281 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:21,281 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-03-15 20:42:21,281 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [708244599] [2022-03-15 20:42:21,281 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:21,282 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:21,285 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 60 transitions. [2022-03-15 20:42:21,285 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:21,631 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [1870#(or (<= n_0 i_1) (< i_5 n_0)), 1871#(or (<= (+ n_0 1) i_1) (<= n_0 i_5) (< (+ i_5 1) n_0)), 1869#(or (<= (+ n_0 1) i_1) (< i_5 n_0)), 1868#(or (< 1 n_0) (<= n_0 0)), 1872#(or (<= n_0 i_1) (<= n_0 i_5) (< (+ i_5 1) n_0)), 1875#(<= i_5 0), 1874#(<= i_5 1), 1866#(< i_5 n_0), 1873#(<= n_0 1), 1877#(or (< 1 n_0) (<= n_0 0) (<= n_0 i_1)), 1876#(or (< 1 n_0) (<= (+ n_0 1) i_1) (<= n_0 0)), 1867#(or (<= n_0 i_5) (< (+ i_5 1) n_0))] [2022-03-15 20:42:21,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:42:21,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:21,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:42:21,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:42:21,632 INFO L87 Difference]: Start difference. First operand 60 states and 130 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:22,632 INFO L93 Difference]: Finished difference Result 138 states and 280 transitions. [2022-03-15 20:42:22,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 20:42:22,633 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:42:22,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:22,633 INFO L225 Difference]: With dead ends: 138 [2022-03-15 20:42:22,633 INFO L226 Difference]: Without dead ends: 130 [2022-03-15 20:42:22,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1074, Invalid=3618, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 20:42:22,635 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 107 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:22,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 47 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:42:22,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-03-15 20:42:22,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 66. [2022-03-15 20:42:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.169230769230769) internal successors, (141), 65 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 141 transitions. [2022-03-15 20:42:22,648 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 141 transitions. Word has length 14 [2022-03-15 20:42:22,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:22,648 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 141 transitions. [2022-03-15 20:42:22,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:22,648 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 141 transitions. [2022-03-15 20:42:22,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:42:22,649 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:22,649 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:22,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:22,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:22,851 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:22,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:22,852 INFO L85 PathProgramCache]: Analyzing trace with hash -925887647, now seen corresponding path program 6 times [2022-03-15 20:42:22,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:22,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260099496] [2022-03-15 20:42:22,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:22,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:22,896 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:22,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260099496] [2022-03-15 20:42:22,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260099496] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:22,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095651397] [2022-03-15 20:42:22,896 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:42:22,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:22,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:22,898 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:22,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 20:42:22,927 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:42:22,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:22,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:42:22,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:22,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:23,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095651397] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:23,000 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:23,000 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2022-03-15 20:42:23,000 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1280751670] [2022-03-15 20:42:23,000 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:23,001 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:23,013 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 73 transitions. [2022-03-15 20:42:23,013 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:23,454 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [2331#(< i_1 n_0), 2334#(or (<= n_0 i_1) (<= n_0 i_5) (< (+ i_1 1) n_0)), 2344#(or (<= n_0 i_1) (<= n_0 (+ 2 i_5)) (< (+ i_1 1) n_0)), 2338#(or (<= n_0 i_1) (< (+ i_1 1) n_0) (<= n_0 (+ i_5 1))), 2340#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (<= n_0 (+ i_5 1))), 2332#(or (<= n_0 i_1) (< (+ i_1 1) n_0)), 2336#(or (<= n_0 1) (< 2 n_0)), 2339#(or (<= n_0 i_5) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 2341#(or (<= n_0 1) (< 2 n_0) (<= n_0 i_5)), 2337#(or (< i_1 n_0) (<= n_0 (+ i_5 1))), 2342#(or (<= n_0 1) (< 2 n_0) (<= n_0 (+ i_5 1))), 2345#(or (< (+ 2 i_1) n_0) (<= n_0 (+ 2 i_5)) (<= n_0 (+ i_1 1))), 2346#(or (<= n_0 1) (< 2 n_0) (<= n_0 (+ 2 i_5))), 2335#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 2343#(or (< i_1 n_0) (<= n_0 (+ 2 i_5))), 2333#(or (<= n_0 i_5) (< i_1 n_0))] [2022-03-15 20:42:23,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:42:23,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:23,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:42:23,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:42:23,455 INFO L87 Difference]: Start difference. First operand 66 states and 141 transitions. Second operand has 25 states, 25 states have (on average 2.36) internal successors, (59), 25 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:24,459 INFO L93 Difference]: Finished difference Result 125 states and 263 transitions. [2022-03-15 20:42:24,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 20:42:24,460 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.36) internal successors, (59), 25 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:42:24,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:24,460 INFO L225 Difference]: With dead ends: 125 [2022-03-15 20:42:24,460 INFO L226 Difference]: Without dead ends: 116 [2022-03-15 20:42:24,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1045, Invalid=3785, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 20:42:24,462 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 77 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:24,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 64 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:42:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-03-15 20:42:24,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 55. [2022-03-15 20:42:24,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 54 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:24,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 113 transitions. [2022-03-15 20:42:24,465 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 113 transitions. Word has length 15 [2022-03-15 20:42:24,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:24,466 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 113 transitions. [2022-03-15 20:42:24,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.36) internal successors, (59), 25 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 113 transitions. [2022-03-15 20:42:24,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:42:24,466 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:24,467 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:24,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:24,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:24,680 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:24,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:24,680 INFO L85 PathProgramCache]: Analyzing trace with hash -262218343, now seen corresponding path program 7 times [2022-03-15 20:42:24,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:24,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892403685] [2022-03-15 20:42:24,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:24,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:24,729 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:24,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892403685] [2022-03-15 20:42:24,729 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892403685] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:24,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457940903] [2022-03-15 20:42:24,729 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:42:24,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:24,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:24,730 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:24,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 20:42:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:24,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:42:24,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:24,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:24,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457940903] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:24,838 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:24,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2022-03-15 20:42:24,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1762570610] [2022-03-15 20:42:24,839 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:24,840 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:24,844 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 73 transitions. [2022-03-15 20:42:24,844 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:25,401 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [2783#(or (<= (+ 3 i_5) n_0) (< 3 n_0) (<= n_0 2)), 2779#(or (< 3 n_0) (<= n_0 2) (< i_5 n_0)), 2765#(or (<= n_0 i_1) (< (+ i_1 1) n_0)), 2766#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 2777#(or (< 3 n_0) (<= n_0 2)), 2781#(or (< 3 n_0) (<= n_0 2) (<= (+ 2 i_5) n_0)), 2770#(or (<= n_0 i_1) (< (+ i_1 1) n_0) (<= (+ 2 i_5) n_0)), 2768#(or (<= n_0 i_1) (< i_5 n_0) (< (+ i_1 1) n_0)), 2778#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (< i_5 n_0)), 2775#(or (<= (+ 3 i_5) n_0) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 2772#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (<= (+ 2 i_5) n_0)), 2780#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= (+ 2 i_5) n_0)), 2782#(or (< (+ 3 i_1) n_0) (<= (+ 3 i_5) n_0) (<= n_0 (+ 2 i_1))), 2767#(or (< i_1 n_0) (< i_5 n_0)), 2776#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1))), 2764#(< i_1 n_0), 2774#(or (<= (+ 3 i_5) n_0) (<= n_0 i_1) (< (+ i_1 1) n_0)), 2771#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (< i_5 n_0)), 2773#(or (<= (+ 3 i_5) n_0) (< i_1 n_0)), 2769#(or (< i_1 n_0) (<= (+ 2 i_5) n_0))] [2022-03-15 20:42:25,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 20:42:25,402 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:25,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 20:42:25,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:42:25,403 INFO L87 Difference]: Start difference. First operand 55 states and 113 transitions. Second operand has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:26,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:26,943 INFO L93 Difference]: Finished difference Result 184 states and 410 transitions. [2022-03-15 20:42:26,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-15 20:42:26,943 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:42:26,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:26,944 INFO L225 Difference]: With dead ends: 184 [2022-03-15 20:42:26,944 INFO L226 Difference]: Without dead ends: 178 [2022-03-15 20:42:26,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1496, Invalid=6514, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 20:42:26,947 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 132 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:26,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 67 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:42:26,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-03-15 20:42:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 90. [2022-03-15 20:42:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.303370786516854) internal successors, (205), 89 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have 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:26,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 205 transitions. [2022-03-15 20:42:26,951 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 205 transitions. Word has length 15 [2022-03-15 20:42:26,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:26,951 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 205 transitions. [2022-03-15 20:42:26,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:26,952 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 205 transitions. [2022-03-15 20:42:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:42:26,952 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:26,953 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:26,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:27,159 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,SelfDestructingSolverStorable10 [2022-03-15 20:42:27,160 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:27,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:27,160 INFO L85 PathProgramCache]: Analyzing trace with hash 460842113, now seen corresponding path program 8 times [2022-03-15 20:42:27,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:27,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710193902] [2022-03-15 20:42:27,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:27,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:27,302 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:27,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710193902] [2022-03-15 20:42:27,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710193902] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:27,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24571234] [2022-03-15 20:42:27,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:42:27,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:27,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:27,304 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:27,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 20:42:27,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:42:27,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:27,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 20:42:27,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:27,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:27,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:27,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:27,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24571234] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:27,771 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:27,771 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-03-15 20:42:27,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1090003062] [2022-03-15 20:42:27,771 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:27,772 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:27,776 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 86 transitions. [2022-03-15 20:42:27,776 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:29,246 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [3376#(and (or (< 0 f1_6) (<= f1_2 0)) (or (<= f1_6 0) (< 0 f1_2))), 3364#(and (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0)) (or (<= 1 (+ (* 3 f1_6) (* 2 f2_7))) (not (< 0 (+ (* 2 f2_3) (* 3 f1_2)))))), 3374#(and (or (<= f1_2 0) (= l_8 1)) (or (= l_8 0) (< 0 f1_2))), 3386#(and (or (<= 1 (+ f2_7 (* 2 f1_6))) (<= f1_2 0)) (or (<= (+ f2_7 (* 2 f1_6)) 0) (< 0 f1_2))), 3360#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0)) (or (<= 1 (+ (* 3 f1_6) (* 2 f2_7))) (not (< 0 (+ (* 2 f1_2) f2_3))))), 3388#(and (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* 2 f1_2) f2_3) 0)) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ f2_7 (* 2 f1_6)) 0))), 3356#(and (or (not (< 0 (+ f2_3 f1_2))) (<= 1 (+ (* 3 f1_6) (* 2 f2_7)))) (or (< 0 (+ f2_3 f1_2)) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0))), 3385#(and (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ f2_7 f1_6) 0)) (or (< 0 (+ f2_7 f1_6)) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0))), 3384#(and (or (< 0 (+ f2_7 f1_6)) (<= (+ (* 2 f1_2) f2_3) 0)) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ f2_7 f1_6) 0))), 3381#(and (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= f1_6 0)) (or (< 0 f1_6) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0))), 3389#(and (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0)) (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ f2_7 (* 2 f1_6)) 0))), 3378#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (= l_8 0)) (or (<= (+ (* 2 f1_2) f2_3) 0) (= l_8 1))), 3379#(and (or (< 0 f1_6) (<= (+ (* 2 f1_2) f2_3) 0)) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= f1_6 0))), 3387#(and (or (<= (+ f2_7 (* 2 f1_6)) 0) (< 0 (+ f2_3 f1_2))) (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ f2_3 f1_2) 0))), 3377#(and (or (<= (+ f2_3 f1_2) 0) (< 0 f1_6)) (or (<= f1_6 0) (< 0 (+ f2_3 f1_2)))), 3380#(and (or (<= (+ (* 2 f2_3) (* 3 f1_2)) 0) (= l_8 1)) (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (= l_8 0))), 3383#(and (or (<= (+ f2_7 f1_6) 0) (< 0 (+ f2_3 f1_2))) (or (<= (+ f2_3 f1_2) 0) (< 0 (+ f2_7 f1_6)))), 3352#(and (or (<= (+ (* 3 f1_6) (* 2 f2_7)) 0) (< 0 f1_2)) (or (<= 1 (+ (* 3 f1_6) (* 2 f2_7))) (not (< 0 f1_2)))), 3375#(and (or (< 0 (+ f2_3 f1_2)) (= l_8 0)) (or (<= (+ f2_3 f1_2) 0) (= l_8 1))), 3382#(and (or (<= (+ f2_7 f1_6) 0) (< 0 f1_2)) (or (<= 1 (+ f2_7 f1_6)) (<= f1_2 0)))] [2022-03-15 20:42:29,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 20:42:29,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:29,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 20:42:29,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1042, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:42:29,247 INFO L87 Difference]: Start difference. First operand 90 states and 205 transitions. Second operand has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:30,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:30,284 INFO L93 Difference]: Finished difference Result 146 states and 326 transitions. [2022-03-15 20:42:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 20:42:30,284 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:42:30,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:30,285 INFO L225 Difference]: With dead ends: 146 [2022-03-15 20:42:30,285 INFO L226 Difference]: Without dead ends: 141 [2022-03-15 20:42:30,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 26 SyntacticMatches, 16 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=188, Invalid=2674, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 20:42:30,286 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 54 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:30,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 270 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:42:30,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-03-15 20:42:30,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2022-03-15 20:42:30,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 2.3873873873873874) internal successors, (265), 111 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have 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:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 265 transitions. [2022-03-15 20:42:30,291 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 265 transitions. Word has length 16 [2022-03-15 20:42:30,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:30,291 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 265 transitions. [2022-03-15 20:42:30,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 265 transitions. [2022-03-15 20:42:30,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:42:30,292 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:30,292 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:30,310 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:42:30,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:30,499 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:30,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:30,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1681436409, now seen corresponding path program 9 times [2022-03-15 20:42:30,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:30,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398677674] [2022-03-15 20:42:30,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:30,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:30,565 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:30,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398677674] [2022-03-15 20:42:30,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398677674] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:30,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328582567] [2022-03-15 20:42:30,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:42:30,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:30,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:30,567 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:30,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 20:42:30,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:42:30,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:30,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:42:30,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:30,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:30,697 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:30,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328582567] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:30,698 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:30,698 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 16 [2022-03-15 20:42:30,698 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [812712419] [2022-03-15 20:42:30,698 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:30,699 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:30,703 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 84 transitions. [2022-03-15 20:42:30,703 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:31,276 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [3922#(<= n_0 2), 3908#(or (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 3921#(or (<= n_0 1) (< 2 n_0) (<= n_0 (+ i_1 1))), 3920#(or (<= n_0 (+ i_1 1)) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 3909#(or (<= n_0 1) (< 2 n_0)), 3910#(or (<= (+ n_0 1) i_1) (< i_5 n_0)), 3924#(<= i_5 1), 3914#(or (<= n_0 i_1) (< i_5 n_0)), 3916#(or (<= n_0 i_1) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 3915#(or (<= n_0 i_1) (<= n_0 i_5) (< (+ i_5 1) n_0)), 3917#(or (<= n_0 1) (< 2 n_0) (<= n_0 i_1)), 3911#(or (<= (+ n_0 1) i_1) (<= n_0 i_5) (< (+ i_5 1) n_0)), 3925#(<= i_5 0), 3913#(or (<= n_0 1) (<= (+ n_0 1) i_1) (< 2 n_0)), 3907#(or (<= n_0 i_5) (< (+ i_5 1) n_0)), 3919#(or (<= n_0 i_5) (<= n_0 (+ i_1 1)) (< (+ i_5 1) n_0)), 3923#(<= i_5 2), 3906#(< i_5 n_0), 3912#(or (<= (+ n_0 1) i_1) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 3918#(or (<= n_0 (+ i_1 1)) (< i_5 n_0))] [2022-03-15 20:42:31,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 20:42:31,276 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:31,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 20:42:31,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:42:31,277 INFO L87 Difference]: Start difference. First operand 112 states and 265 transitions. Second operand has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:34,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:34,705 INFO L93 Difference]: Finished difference Result 336 states and 747 transitions. [2022-03-15 20:42:34,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-03-15 20:42:34,706 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:42:34,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:34,707 INFO L225 Difference]: With dead ends: 336 [2022-03-15 20:42:34,707 INFO L226 Difference]: Without dead ends: 318 [2022-03-15 20:42:34,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6806 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4457, Invalid=16423, Unknown=0, NotChecked=0, Total=20880 [2022-03-15 20:42:34,713 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 164 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:34,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 59 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:42:34,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-03-15 20:42:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 111. [2022-03-15 20:42:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.327272727272727) internal successors, (256), 110 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have 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:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 256 transitions. [2022-03-15 20:42:34,719 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 256 transitions. Word has length 16 [2022-03-15 20:42:34,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:34,720 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 256 transitions. [2022-03-15 20:42:34,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:34,720 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 256 transitions. [2022-03-15 20:42:34,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:42:34,721 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:34,721 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:34,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:34,931 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,SelfDestructingSolverStorable12 [2022-03-15 20:42:34,931 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:34,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:34,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1400879769, now seen corresponding path program 10 times [2022-03-15 20:42:34,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:34,932 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562166710] [2022-03-15 20:42:34,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:34,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:34,998 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:34,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562166710] [2022-03-15 20:42:34,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562166710] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:34,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133711574] [2022-03-15 20:42:34,999 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:42:34,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:34,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:35,000 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:35,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 20:42:35,025 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:42:35,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:35,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:42:35,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:35,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:35,128 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133711574] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:35,128 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:35,128 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2022-03-15 20:42:35,128 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [13875481] [2022-03-15 20:42:35,128 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:35,129 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:35,134 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 99 transitions. [2022-03-15 20:42:35,134 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:35,802 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [4833#(or (<= n_0 i_1) (<= n_0 (+ 2 i_5)) (< (+ i_1 1) n_0)), 4825#(or (<= n_0 i_1) (< (+ i_1 1) n_0) (<= n_0 (+ i_5 1))), 4828#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (<= n_0 (+ i_5 1))), 4823#(or (<= n_0 i_1) (<= n_0 i_5) (< (+ i_1 1) n_0)), 4830#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= n_0 i_5)), 4834#(or (< (+ 2 i_1) n_0) (<= n_0 (+ 2 i_5)) (<= n_0 (+ i_1 1))), 4839#(or (< 3 n_0) (<= n_0 2)), 4843#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 3 i_5)) (<= n_0 (+ 2 i_1))), 4838#(or (<= n_0 (+ 3 i_5)) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 4829#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1))), 4821#(or (<= n_0 i_5) (< i_1 n_0)), 4840#(or (<= n_0 i_5) (< 3 n_0) (<= n_0 2)), 4835#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= n_0 (+ 2 i_5))), 4844#(or (<= n_0 (+ 3 i_5)) (< 3 n_0) (<= n_0 2)), 4831#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= n_0 (+ i_5 1))), 4820#(< i_1 n_0), 4826#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 4836#(or (<= n_0 (+ 3 i_5)) (< i_1 n_0)), 4822#(or (<= n_0 i_1) (< (+ i_1 1) n_0)), 4827#(or (<= n_0 i_5) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 4824#(or (< i_1 n_0) (<= n_0 (+ i_5 1))), 4841#(or (< 3 n_0) (<= n_0 2) (<= n_0 (+ i_5 1))), 4832#(or (< i_1 n_0) (<= n_0 (+ 2 i_5))), 4842#(or (< 3 n_0) (<= n_0 (+ 2 i_5)) (<= n_0 2)), 4837#(or (<= n_0 (+ 3 i_5)) (<= n_0 i_1) (< (+ i_1 1) n_0))] [2022-03-15 20:42:35,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 20:42:35,803 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:35,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 20:42:35,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1301, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 20:42:35,804 INFO L87 Difference]: Start difference. First operand 111 states and 256 transitions. Second operand has 36 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 36 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:37,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:37,634 INFO L93 Difference]: Finished difference Result 237 states and 540 transitions. [2022-03-15 20:42:37,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-03-15 20:42:37,634 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 36 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:42:37,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:37,635 INFO L225 Difference]: With dead ends: 237 [2022-03-15 20:42:37,636 INFO L226 Difference]: Without dead ends: 226 [2022-03-15 20:42:37,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2745 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2153, Invalid=8353, Unknown=0, NotChecked=0, Total=10506 [2022-03-15 20:42:37,638 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 151 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:37,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 63 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:42:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-03-15 20:42:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 92. [2022-03-15 20:42:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.230769230769231) internal successors, (203), 91 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:37,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 203 transitions. [2022-03-15 20:42:37,642 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 203 transitions. Word has length 17 [2022-03-15 20:42:37,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:37,642 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 203 transitions. [2022-03-15 20:42:37,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 36 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:37,642 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 203 transitions. [2022-03-15 20:42:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:42:37,647 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:37,647 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:37,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:37,847 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,SelfDestructingSolverStorable13 [2022-03-15 20:42:37,847 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:37,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:37,848 INFO L85 PathProgramCache]: Analyzing trace with hash 499791713, now seen corresponding path program 11 times [2022-03-15 20:42:37,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:37,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481594145] [2022-03-15 20:42:37,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:37,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:37,914 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:37,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:37,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481594145] [2022-03-15 20:42:37,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481594145] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:37,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387673817] [2022-03-15 20:42:37,914 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:42:37,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:37,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:37,916 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:37,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 20:42:37,947 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 20:42:37,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:37,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:42:37,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:38,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:38,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387673817] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:38,039 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:38,039 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2022-03-15 20:42:38,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2142475457] [2022-03-15 20:42:38,040 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:38,041 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:38,044 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 99 transitions. [2022-03-15 20:42:38,044 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:38,865 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [5529#(or (< i_1 n_0) (<= (+ i_5 4) n_0)), 5511#(or (<= n_0 i_1) (< (+ i_1 1) n_0) (<= (+ 2 i_5) n_0)), 5512#(or (<= (+ 3 i_5) n_0) (<= n_0 i_1) (< (+ i_1 1) n_0)), 5534#(or (<= n_0 3) (< 4 n_0) (<= (+ i_5 4) n_0)), 5506#(or (< i_1 n_0) (< i_5 n_0)), 5522#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (< i_5 n_0)), 5526#(or (<= n_0 3) (< 4 n_0) (< i_5 n_0)), 5528#(or (<= n_0 3) (<= (+ 3 i_5) n_0) (< 4 n_0)), 5514#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (< i_5 n_0)), 5523#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= (+ 2 i_5) n_0)), 5509#(or (<= n_0 i_1) (< (+ i_1 1) n_0)), 5517#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1))), 5525#(or (<= n_0 3) (< 4 n_0)), 5513#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 5507#(or (< i_1 n_0) (<= (+ 2 i_5) n_0)), 5521#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0)), 5530#(or (<= n_0 i_1) (<= (+ i_5 4) n_0) (< (+ i_1 1) n_0)), 5519#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= (+ 2 i_5) n_0)), 5524#(or (<= n_0 (+ 3 i_1)) (<= (+ 3 i_5) n_0) (< (+ i_1 4) n_0)), 5505#(< i_1 n_0), 5515#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (<= (+ 2 i_5) n_0)), 5527#(or (<= n_0 3) (< 4 n_0) (<= (+ 2 i_5) n_0)), 5531#(or (< (+ 2 i_1) n_0) (<= (+ i_5 4) n_0) (<= n_0 (+ i_1 1))), 5520#(or (< (+ 3 i_1) n_0) (<= (+ 3 i_5) n_0) (<= n_0 (+ 2 i_1))), 5510#(or (<= n_0 i_1) (< i_5 n_0) (< (+ i_1 1) n_0)), 5508#(or (<= (+ 3 i_5) n_0) (< i_1 n_0)), 5516#(or (<= (+ 3 i_5) n_0) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 5532#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= (+ i_5 4) n_0)), 5518#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (< i_5 n_0)), 5533#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= (+ i_5 4) n_0))] [2022-03-15 20:42:38,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 20:42:38,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:38,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 20:42:38,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1681, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 20:42:38,867 INFO L87 Difference]: Start difference. First operand 92 states and 203 transitions. Second operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:41,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:41,890 INFO L93 Difference]: Finished difference Result 409 states and 977 transitions. [2022-03-15 20:42:41,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-03-15 20:42:41,891 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:42:41,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:41,892 INFO L225 Difference]: With dead ends: 409 [2022-03-15 20:42:41,892 INFO L226 Difference]: Without dead ends: 397 [2022-03-15 20:42:41,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7460 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3588, Invalid=17874, Unknown=0, NotChecked=0, Total=21462 [2022-03-15 20:42:41,895 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 203 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:41,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 77 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:42:41,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-03-15 20:42:41,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 168. [2022-03-15 20:42:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 2.413173652694611) internal successors, (403), 167 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 403 transitions. [2022-03-15 20:42:41,901 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 403 transitions. Word has length 17 [2022-03-15 20:42:41,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:41,902 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 403 transitions. [2022-03-15 20:42:41,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:41,902 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 403 transitions. [2022-03-15 20:42:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:42:41,903 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:41,903 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:41,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:42,111 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,SelfDestructingSolverStorable14 [2022-03-15 20:42:42,111 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:42,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1686649927, now seen corresponding path program 12 times [2022-03-15 20:42:42,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:42,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058880587] [2022-03-15 20:42:42,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:42,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:42,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:42,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058880587] [2022-03-15 20:42:42,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058880587] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:42,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33772096] [2022-03-15 20:42:42,324 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:42:42,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:42,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:42,326 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:42,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 20:42:42,360 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:42:42,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:42,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 20:42:42,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:42,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:42,820 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33772096] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:42,820 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:42,820 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2022-03-15 20:42:42,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [11610565] [2022-03-15 20:42:42,820 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:42,821 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:42,826 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 114 transitions. [2022-03-15 20:42:42,826 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:45,086 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [6626#(and (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ f2_7 f1_6) 0)) (or (< 0 (+ f2_7 f1_6)) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0))), 6618#(and (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= f1_6 0)) (or (< 0 f1_6) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0))), 6615#(and (or (< 0 f1_6) (<= f1_2 0)) (or (<= f1_6 0) (< 0 f1_2))), 6630#(and (or (<= (+ (* 3 f1_6) (* 2 f2_7)) 0) (< 0 f1_2)) (or (<= 1 (+ (* 3 f1_6) (* 2 f2_7))) (<= f1_2 0))), 6620#(and (or (<= (+ f2_7 f1_6) 0) (< 0 f1_2)) (or (<= 1 (+ f2_7 f1_6)) (<= f1_2 0))), 6611#(and (or (< 0 (+ f2_3 f1_2)) (= l_8 0)) (or (<= (+ f2_3 f1_2) 0) (= l_8 1))), 6631#(and (or (< 0 (+ f2_3 f1_2)) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0)) (or (<= (+ f2_3 f1_2) 0) (<= 1 (+ (* 3 f1_6) (* 2 f2_7))))), 6629#(and (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0)) (or (<= (+ f2_7 (* 2 f1_6)) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3))))), 6623#(and (or (<= (+ f2_7 (* 2 f1_6)) 0) (< 0 (+ f2_3 f1_2))) (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ f2_3 f1_2) 0))), 6634#(and (or (<= (+ (* 3 f1_6) (* 2 f2_7)) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3)))) (or (< 0 (+ (* 3 f1_6) (* 2 f2_7))) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0))), 6622#(and (or (<= 1 (+ f2_7 (* 2 f1_6))) (<= f1_2 0)) (or (<= (+ f2_7 (* 2 f1_6)) 0) (< 0 f1_2))), 6614#(and (or (= l_8 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3)))) (or (<= (+ (* 5 f1_2) (* 3 f2_3)) 0) (= l_8 1))), 6625#(and (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* 2 f1_2) f2_3) 0)) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ f2_7 (* 2 f1_6)) 0))), 6628#(and (or (< 0 (+ f2_7 f1_6)) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0)) (or (<= (+ f2_7 f1_6) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3))))), 6624#(and (or (< 0 (+ f2_7 f1_6)) (<= (+ (* 2 f1_2) f2_3) 0)) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ f2_7 f1_6) 0))), 6584#(and (or (<= (+ (* 5 f1_6) (* 3 f2_7)) 0) (< 0 f1_2)) (or (<= 1 (+ (* 5 f1_6) (* 3 f2_7))) (not (< 0 f1_2)))), 6613#(and (or (<= (+ (* 2 f2_3) (* 3 f1_2)) 0) (= l_8 1)) (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (= l_8 0))), 6632#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0)) (or (< 0 (+ (* 3 f1_6) (* 2 f2_7))) (<= (+ (* 2 f1_2) f2_3) 0))), 6627#(and (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0)) (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ f2_7 (* 2 f1_6)) 0))), 6616#(and (or (<= (+ f2_3 f1_2) 0) (< 0 f1_6)) (or (<= f1_6 0) (< 0 (+ f2_3 f1_2)))), 6600#(and (or (<= 1 (+ (* 5 f1_6) (* 3 f2_7))) (not (< 0 (+ (* 5 f1_2) (* 3 f2_3))))) (or (<= (+ (* 5 f1_6) (* 3 f2_7)) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3))))), 6619#(and (or (< 0 f1_6) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0)) (or (<= f1_6 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3))))), 6588#(and (or (<= (+ (* 5 f1_6) (* 3 f2_7)) 0) (< 0 (+ f2_3 f1_2))) (or (<= 1 (+ (* 5 f1_6) (* 3 f2_7))) (not (< 0 (+ f2_3 f1_2))))), 6596#(and (or (<= 1 (+ (* 5 f1_6) (* 3 f2_7))) (not (< 0 (+ (* 2 f2_3) (* 3 f1_2))))) (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ (* 5 f1_6) (* 3 f2_7)) 0))), 6610#(and (or (<= f1_2 0) (= l_8 1)) (or (= l_8 0) (< 0 f1_2))), 6633#(and (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0)) (or (< 0 (+ (* 3 f1_6) (* 2 f2_7))) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0))), 6612#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (= l_8 0)) (or (<= (+ (* 2 f1_2) f2_3) 0) (= l_8 1))), 6592#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ (* 5 f1_6) (* 3 f2_7)) 0)) (or (<= 1 (+ (* 5 f1_6) (* 3 f2_7))) (not (< 0 (+ (* 2 f1_2) f2_3))))), 6617#(and (or (< 0 f1_6) (<= (+ (* 2 f1_2) f2_3) 0)) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= f1_6 0))), 6621#(and (or (<= (+ f2_7 f1_6) 0) (< 0 (+ f2_3 f1_2))) (or (<= (+ f2_3 f1_2) 0) (< 0 (+ f2_7 f1_6))))] [2022-03-15 20:42:45,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 20:42:45,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:45,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 20:42:45,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=2049, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 20:42:45,087 INFO L87 Difference]: Start difference. First operand 168 states and 403 transitions. Second operand has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have 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:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:46,916 INFO L93 Difference]: Finished difference Result 268 states and 638 transitions. [2022-03-15 20:42:46,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 20:42:46,916 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:42:46,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:46,917 INFO L225 Difference]: With dead ends: 268 [2022-03-15 20:42:46,917 INFO L226 Difference]: Without dead ends: 262 [2022-03-15 20:42:46,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 32 SyntacticMatches, 16 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=285, Invalid=5567, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 20:42:46,918 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 74 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 2242 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:46,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 493 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2242 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:42:46,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-03-15 20:42:46,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 208. [2022-03-15 20:42:46,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.5072463768115942) internal successors, (519), 207 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have 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:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 519 transitions. [2022-03-15 20:42:46,924 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 519 transitions. Word has length 18 [2022-03-15 20:42:46,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:46,924 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 519 transitions. [2022-03-15 20:42:46,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have 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:46,925 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 519 transitions. [2022-03-15 20:42:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:42:46,925 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:46,925 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:46,944 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:42:47,135 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,SelfDestructingSolverStorable15 [2022-03-15 20:42:47,135 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:47,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:47,136 INFO L85 PathProgramCache]: Analyzing trace with hash 181624383, now seen corresponding path program 13 times [2022-03-15 20:42:47,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:47,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058765739] [2022-03-15 20:42:47,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:47,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:47,208 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:47,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058765739] [2022-03-15 20:42:47,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058765739] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:47,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632197966] [2022-03-15 20:42:47,208 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:42:47,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:47,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:47,209 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:47,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 20:42:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:47,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:42:47,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:47,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:42:47,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632197966] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:47,372 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:47,372 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 20 [2022-03-15 20:42:47,372 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1620968816] [2022-03-15 20:42:47,372 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:47,373 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:47,378 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 112 transitions. [2022-03-15 20:42:47,378 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:48,237 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [7521#(or (<= n_0 i_1) (< 3 n_0) (<= n_0 2)), 7530#(<= i_5 0), 7514#(or (<= n_0 (+ i_1 1)) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 7511#(or (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 7503#(<= i_5 3), 7516#(or (<= (+ n_0 1) i_1) (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 7504#(or (<= (+ n_0 1) i_1) (< i_5 n_0)), 7517#(or (<= n_0 i_1) (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 7512#(or (<= (+ n_0 1) i_1) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 7524#(or (<= n_0 (+ 2 i_1)) (<= n_0 i_5) (< (+ i_5 1) n_0)), 7523#(or (<= n_0 (+ 2 i_1)) (< i_5 n_0)), 7522#(or (< 3 n_0) (<= n_0 (+ i_1 1)) (<= n_0 2)), 7513#(or (<= n_0 i_1) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 7519#(or (< 3 n_0) (<= n_0 2)), 7501#(< i_5 n_0), 7527#(or (<= n_0 (+ 2 i_1)) (< 3 n_0) (<= n_0 2)), 7510#(or (<= n_0 i_5) (<= n_0 (+ i_1 1)) (< (+ i_5 1) n_0)), 7518#(or (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5)) (<= n_0 (+ i_1 1))), 7528#(<= i_5 2), 7508#(or (<= (+ n_0 1) i_1) (<= n_0 i_5) (< (+ i_5 1) n_0)), 7507#(or (<= n_0 i_5) (< (+ i_5 1) n_0)), 7515#(or (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 7502#(<= n_0 3), 7520#(or (<= (+ n_0 1) i_1) (< 3 n_0) (<= n_0 2)), 7526#(or (<= n_0 (+ 2 i_1)) (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 7509#(or (<= n_0 i_1) (<= n_0 i_5) (< (+ i_5 1) n_0)), 7529#(<= i_5 1), 7506#(or (<= n_0 (+ i_1 1)) (< i_5 n_0)), 7505#(or (<= n_0 i_1) (< i_5 n_0)), 7525#(or (<= n_0 (+ 2 i_1)) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0))] [2022-03-15 20:42:48,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 20:42:48,238 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:48,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 20:42:48,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=2127, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 20:42:48,239 INFO L87 Difference]: Start difference. First operand 208 states and 519 transitions. Second operand has 42 states, 42 states have (on average 2.238095238095238) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have 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,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:58,703 INFO L93 Difference]: Finished difference Result 704 states and 1652 transitions. [2022-03-15 20:42:58,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 277 states. [2022-03-15 20:42:58,703 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.238095238095238) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:42:58,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:58,706 INFO L225 Difference]: With dead ends: 704 [2022-03-15 20:42:58,707 INFO L226 Difference]: Without dead ends: 668 [2022-03-15 20:42:58,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40067 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=20623, Invalid=78917, Unknown=0, NotChecked=0, Total=99540 [2022-03-15 20:42:58,715 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 329 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:58,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 72 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:42:58,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-03-15 20:42:58,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 204. [2022-03-15 20:42:58,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.4679802955665027) internal successors, (501), 203 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have 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,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 501 transitions. [2022-03-15 20:42:58,724 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 501 transitions. Word has length 18 [2022-03-15 20:42:58,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:58,724 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 501 transitions. [2022-03-15 20:42:58,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.238095238095238) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have 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,724 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 501 transitions. [2022-03-15 20:42:58,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:42:58,725 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:58,725 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:58,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:58,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:58,947 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:58,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:58,948 INFO L85 PathProgramCache]: Analyzing trace with hash -746864031, now seen corresponding path program 14 times [2022-03-15 20:42:58,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:58,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305152252] [2022-03-15 20:42:58,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:58,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:59,031 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:59,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:59,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305152252] [2022-03-15 20:42:59,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305152252] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:59,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006220409] [2022-03-15 20:42:59,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:42:59,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:59,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:59,036 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:59,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 20:42:59,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:42:59,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:59,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:42:59,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:59,152 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:59,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:59,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006220409] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:59,185 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:59,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2022-03-15 20:42:59,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1801095653] [2022-03-15 20:42:59,185 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:59,186 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:59,192 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 129 transitions. [2022-03-15 20:42:59,192 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:00,268 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [9317#(or (<= n_0 i_1) (< (+ i_1 1) n_0) (<= n_0 (+ i_5 1))), 9314#(or (<= n_0 (+ 3 i_5)) (< i_1 n_0)), 9323#(or (< (+ 2 i_1) n_0) (<= n_0 (+ 2 i_5)) (<= n_0 (+ i_1 1))), 9322#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (<= n_0 (+ i_5 1))), 9331#(or (<= n_0 i_1) (< (+ i_1 1) n_0) (<= n_0 (+ i_5 4))), 9328#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= n_0 (+ 2 i_5))), 9315#(or (<= n_0 i_1) (< (+ i_1 1) n_0)), 9326#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= n_0 i_5)), 9324#(or (<= n_0 (+ 3 i_5)) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 9320#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 9334#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= n_0 (+ i_5 4))), 9318#(or (<= n_0 i_1) (<= n_0 (+ 2 i_5)) (< (+ i_1 1) n_0)), 9312#(or (< i_1 n_0) (<= n_0 (+ i_5 1))), 9310#(< i_1 n_0), 9325#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1))), 9344#(or (<= n_0 3) (<= n_0 (+ 3 i_5)) (< 4 n_0)), 9311#(or (<= n_0 i_5) (< i_1 n_0)), 9333#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0)), 9337#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= n_0 (+ 2 i_5))), 9336#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= n_0 (+ i_5 1))), 9340#(or (<= n_0 3) (< 4 n_0)), 9330#(or (< i_1 n_0) (<= n_0 (+ i_5 4))), 9345#(or (<= n_0 3) (< 4 n_0) (<= n_0 (+ i_5 4))), 9332#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (<= n_0 (+ i_5 4))), 9327#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= n_0 (+ i_5 1))), 9343#(or (<= n_0 3) (< 4 n_0) (<= n_0 (+ 2 i_5))), 9342#(or (<= n_0 3) (< 4 n_0) (<= n_0 (+ i_5 1))), 9316#(or (<= n_0 i_1) (<= n_0 i_5) (< (+ i_1 1) n_0)), 9319#(or (<= n_0 (+ 3 i_5)) (<= n_0 i_1) (< (+ i_1 1) n_0)), 9335#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= n_0 i_5)), 9313#(or (< i_1 n_0) (<= n_0 (+ 2 i_5))), 9339#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= n_0 (+ i_5 4))), 9341#(or (<= n_0 3) (<= n_0 i_5) (< 4 n_0)), 9329#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 3 i_5)) (<= n_0 (+ 2 i_1))), 9338#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= n_0 (+ 3 i_5))), 9321#(or (<= n_0 i_5) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)))] [2022-03-15 20:43:00,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-15 20:43:00,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:00,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-15 20:43:00,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=2437, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 20:43:00,270 INFO L87 Difference]: Start difference. First operand 204 states and 501 transitions. Second operand has 49 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 49 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have 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,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:03,191 INFO L93 Difference]: Finished difference Result 474 states and 1155 transitions. [2022-03-15 20:43:03,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-15 20:43:03,191 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 49 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have 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:03,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:03,193 INFO L225 Difference]: With dead ends: 474 [2022-03-15 20:43:03,193 INFO L226 Difference]: Without dead ends: 461 [2022-03-15 20:43:03,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5471 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3916, Invalid=16106, Unknown=0, NotChecked=0, Total=20022 [2022-03-15 20:43:03,196 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 168 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:03,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 66 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 20:43:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-03-15 20:43:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 166. [2022-03-15 20:43:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.3636363636363638) internal successors, (390), 165 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have 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,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 390 transitions. [2022-03-15 20:43:03,202 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 390 transitions. Word has length 19 [2022-03-15 20:43:03,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:03,202 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 390 transitions. [2022-03-15 20:43:03,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 49 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have 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,202 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 390 transitions. [2022-03-15 20:43:03,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:43:03,203 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:03,203 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:03,227 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:03,417 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,SelfDestructingSolverStorable17 [2022-03-15 20:43:03,417 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:03,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:03,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1384177305, now seen corresponding path program 15 times [2022-03-15 20:43:03,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:03,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660536165] [2022-03-15 20:43:03,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:03,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:03,491 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:03,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660536165] [2022-03-15 20:43:03,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660536165] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:03,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361727481] [2022-03-15 20:43:03,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:43:03,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:03,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:03,492 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:03,521 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:03,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:43:03,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:03,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:43:03,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:03,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:03,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361727481] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:03,655 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:03,655 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2022-03-15 20:43:03,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1638017671] [2022-03-15 20:43:03,655 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:03,656 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:03,661 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 129 transitions. [2022-03-15 20:43:03,661 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:04,963 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 42 new interpolants: [10479#(or (< i_5 n_0) (< 5 n_0) (<= n_0 4)), 10468#(or (<= (+ 3 i_5) n_0) (< i_1 n_0)), 10471#(or (< (+ 3 i_1) n_0) (<= (+ 3 i_5) n_0) (<= n_0 (+ 2 i_1))), 10497#(or (<= (+ 5 i_5) n_0) (< 5 n_0) (<= n_0 4)), 10488#(or (<= (+ i_5 4) n_0) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 10475#(or (<= n_0 (+ 3 i_1)) (<= (+ 3 i_5) n_0) (< (+ i_1 4) n_0)), 10463#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (< i_5 n_0)), 10484#(or (<= n_0 i_1) (<= (+ i_5 4) n_0) (< (+ i_1 1) n_0)), 10482#(or (<= (+ 3 i_5) n_0) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 10464#(or (< i_1 n_0) (<= (+ 2 i_5) n_0)), 10472#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0)), 10494#(or (<= (+ 5 i_5) n_0) (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1))), 10477#(or (<= n_0 (+ i_1 4)) (< i_5 n_0) (< (+ 5 i_1) n_0)), 10493#(or (<= (+ 5 i_5) n_0) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 10474#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= (+ 2 i_5) n_0)), 10467#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= (+ 2 i_5) n_0)), 10461#(or (<= n_0 i_1) (< i_5 n_0) (< (+ i_1 1) n_0)), 10462#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (< i_5 n_0)), 10483#(or (< i_1 n_0) (<= (+ i_5 4) n_0)), 10478#(or (< 5 n_0) (<= n_0 4)), 10480#(or (<= n_0 (+ i_1 4)) (<= (+ 2 i_5) n_0) (< (+ 5 i_1) n_0)), 10491#(or (<= (+ 5 i_5) n_0) (< i_1 n_0)), 10481#(or (< 5 n_0) (<= n_0 4) (<= (+ 2 i_5) n_0)), 10456#(< i_1 n_0), 10485#(or (< (+ 2 i_1) n_0) (<= (+ i_5 4) n_0) (<= n_0 (+ i_1 1))), 10476#(or (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 10459#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1))), 10490#(or (<= (+ i_5 4) n_0) (< 5 n_0) (<= n_0 4)), 10495#(or (<= (+ 5 i_5) n_0) (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0)), 10466#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (<= (+ 2 i_5) n_0)), 10470#(or (<= (+ 3 i_5) n_0) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 10457#(or (<= n_0 i_1) (< (+ i_1 1) n_0)), 10465#(or (<= n_0 i_1) (< (+ i_1 1) n_0) (<= (+ 2 i_5) n_0)), 10486#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= (+ i_5 4) n_0)), 10492#(or (<= (+ 5 i_5) n_0) (<= n_0 i_1) (< (+ i_1 1) n_0)), 10469#(or (<= (+ 3 i_5) n_0) (<= n_0 i_1) (< (+ i_1 1) n_0)), 10496#(or (<= (+ 5 i_5) n_0) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 10473#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (< i_5 n_0)), 10458#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 10487#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= (+ i_5 4) n_0)), 10489#(or (<= (+ 3 i_5) n_0) (< 5 n_0) (<= n_0 4)), 10460#(or (< i_1 n_0) (< i_5 n_0))] [2022-03-15 20:43:04,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-15 20:43:04,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:04,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-15 20:43:04,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=3058, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 20:43:04,965 INFO L87 Difference]: Start difference. First operand 166 states and 390 transitions. Second operand has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 55 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:10,547 INFO L93 Difference]: Finished difference Result 917 states and 2299 transitions. [2022-03-15 20:43:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2022-03-15 20:43:10,547 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 55 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 20:43:10,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:10,551 INFO L225 Difference]: With dead ends: 917 [2022-03-15 20:43:10,551 INFO L226 Difference]: Without dead ends: 897 [2022-03-15 20:43:10,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18920 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7655, Invalid=42297, Unknown=0, NotChecked=0, Total=49952 [2022-03-15 20:43:10,554 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 297 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 473 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:10,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 83 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [473 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:43:10,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-03-15 20:43:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 329. [2022-03-15 20:43:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 2.4939024390243905) internal successors, (818), 328 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have 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,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 818 transitions. [2022-03-15 20:43:10,565 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 818 transitions. Word has length 19 [2022-03-15 20:43:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:10,565 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 818 transitions. [2022-03-15 20:43:10,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 55 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 818 transitions. [2022-03-15 20:43:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:43:10,566 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:10,566 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:10,586 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:10,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:10,780 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:10,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:10,780 INFO L85 PathProgramCache]: Analyzing trace with hash -40500351, now seen corresponding path program 16 times [2022-03-15 20:43:10,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:10,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343984955] [2022-03-15 20:43:10,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:10,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:10,988 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:43:10,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:10,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343984955] [2022-03-15 20:43:10,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343984955] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:10,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123211401] [2022-03-15 20:43:10,989 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:43:10,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:10,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:10,990 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:10,991 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:11,015 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:43:11,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:11,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 20:43:11,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:11,259 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:43:11,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:11,557 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:43:11,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123211401] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:11,557 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:11,557 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2022-03-15 20:43:11,557 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [330420229] [2022-03-15 20:43:11,557 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:11,559 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:11,567 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 146 transitions. [2022-03-15 20:43:11,568 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:14,585 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 42 new interpolants: [12543#(and (or (<= f1_2 0) (= l_8 1)) (or (= l_8 0) (< 0 f1_2))), 12559#(and (or (<= (+ f2_7 f1_6) 0) (< 0 (+ f2_3 f1_2))) (or (<= (+ f2_3 f1_2) 0) (< 0 (+ f2_7 f1_6)))), 12525#(and (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ (* 5 f2_7) (* f1_6 8)) 0)) (or (<= (+ (* 2 f2_3) (* 3 f1_2)) 0) (<= 1 (+ (* 5 f2_7) (* f1_6 8))))), 12563#(and (or (< 0 (+ f2_7 f1_6)) (<= (+ (* 2 f1_2) f2_3) 0)) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ f2_7 f1_6) 0))), 12557#(and (or (<= (+ (* 3 f1_6) (* 2 f2_7)) 0) (< 0 f1_2)) (or (<= 1 (+ (* 3 f1_6) (* 2 f2_7))) (<= f1_2 0))), 12546#(and (or (<= (+ f2_3 f1_2) 0) (< 0 f1_6)) (or (<= f1_6 0) (< 0 (+ f2_3 f1_2)))), 12555#(and (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (not (< 0 f1_6))) (or (< 0 f1_6) (<= (+ (* 5 f2_3) (* f1_2 8)) 0))), 12573#(and (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0)) (or (<= (+ f2_7 (* 2 f1_6)) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3))))), 12553#(and (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= f1_6 0)) (or (< 0 f1_6) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0))), 12548#(and (or (<= (+ (* 2 f2_3) (* 3 f1_2)) 0) (= l_8 1)) (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (= l_8 0))), 12564#(and (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* 2 f1_2) f2_3) 0)) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ f2_7 (* 2 f1_6)) 0))), 12567#(and (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ f2_7 f1_6) 0)) (or (< 0 (+ f2_7 f1_6)) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0))), 12571#(and (or (< 0 (+ f2_7 f1_6)) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0)) (or (<= (+ f2_7 f1_6) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3))))), 12513#(and (or (<= (+ (* 5 f2_7) (* f1_6 8)) 0) (< 0 f1_2)) (or (<= f1_2 0) (<= 1 (+ (* 5 f2_7) (* f1_6 8))))), 12558#(and (or (<= (+ (* 5 f1_6) (* 3 f2_7)) 0) (< 0 f1_2)) (or (<= 1 (+ (* 5 f1_6) (* 3 f2_7))) (not (< 0 f1_2)))), 12533#(and (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (<= (+ (* 5 f2_7) (* f1_6 8)) 0)) (or (<= (+ (* 5 f2_3) (* f1_2 8)) 0) (<= 1 (+ (* 5 f2_7) (* f1_6 8))))), 12545#(and (or (< 0 f1_6) (<= f1_2 0)) (or (<= f1_6 0) (< 0 f1_2))), 12570#(and (or (< 0 (+ (* 5 f1_6) (* 3 f2_7))) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0)) (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ (* 5 f1_6) (* 3 f2_7)) 0))), 12574#(and (or (<= (+ (* 3 f1_6) (* 2 f2_7)) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3)))) (or (< 0 (+ (* 3 f1_6) (* 2 f2_7))) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0))), 12521#(and (or (<= (+ (* 2 f1_2) f2_3) 0) (<= 1 (+ (* 5 f2_7) (* f1_6 8)))) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ (* 5 f2_7) (* f1_6 8)) 0))), 12529#(and (or (<= (+ (* 5 f1_2) (* 3 f2_3)) 0) (<= 1 (+ (* 5 f2_7) (* f1_6 8)))) (or (<= (+ (* 5 f2_7) (* f1_6 8)) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3))))), 12517#(and (or (<= (+ f2_3 f1_2) 0) (<= 1 (+ (* 5 f2_7) (* f1_6 8)))) (or (<= (+ (* 5 f2_7) (* f1_6 8)) 0) (< 0 (+ f2_3 f1_2)))), 12544#(and (or (< 0 (+ f2_3 f1_2)) (= l_8 0)) (or (<= (+ f2_3 f1_2) 0) (= l_8 1))), 12577#(and (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0)) (or (< 0 (+ (* 3 f1_6) (* 2 f2_7))) (<= (+ (* 5 f2_3) (* f1_2 8)) 0))), 12562#(and (or (<= (+ (* 5 f1_6) (* 3 f2_7)) 0) (< 0 (+ f2_3 f1_2))) (or (<= 1 (+ (* 5 f1_6) (* 3 f2_7))) (not (< 0 (+ f2_3 f1_2))))), 12565#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0)) (or (< 0 (+ (* 3 f1_6) (* 2 f2_7))) (<= (+ (* 2 f1_2) f2_3) 0))), 12550#(and (or (<= (+ (* 5 f2_3) (* f1_2 8)) 0) (= l_8 1)) (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (= l_8 0))), 12572#(and (or (< 0 (+ f2_7 f1_6)) (<= (+ (* 5 f2_3) (* f1_2 8)) 0)) (or (not (< 0 (+ f2_7 f1_6))) (< 0 (+ (* 5 f2_3) (* f1_2 8))))), 12549#(and (or (= l_8 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3)))) (or (<= (+ (* 5 f1_2) (* 3 f2_3)) 0) (= l_8 1))), 12556#(and (or (<= 1 (+ f2_7 (* 2 f1_6))) (<= f1_2 0)) (or (<= (+ f2_7 (* 2 f1_6)) 0) (< 0 f1_2))), 12560#(and (or (<= (+ f2_7 (* 2 f1_6)) 0) (< 0 (+ f2_3 f1_2))) (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ f2_3 f1_2) 0))), 12569#(and (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0)) (or (< 0 (+ (* 3 f1_6) (* 2 f2_7))) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0))), 12576#(and (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (<= (+ f2_7 (* 2 f1_6)) 0)) (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* 5 f2_3) (* f1_2 8)) 0))), 12547#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (= l_8 0)) (or (<= (+ (* 2 f1_2) f2_3) 0) (= l_8 1))), 12552#(and (or (< 0 f1_6) (<= (+ (* 2 f1_2) f2_3) 0)) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= f1_6 0))), 12578#(and (or (< 0 (+ (* 5 f1_6) (* 3 f2_7))) (<= (+ (* 5 f2_3) (* f1_2 8)) 0)) (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (<= (+ (* 5 f1_6) (* 3 f2_7)) 0))), 12566#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ (* 5 f1_6) (* 3 f2_7)) 0)) (or (< 0 (+ (* 5 f1_6) (* 3 f2_7))) (<= (+ (* 2 f1_2) f2_3) 0))), 12551#(and (or (<= (+ f2_7 f1_6) 0) (< 0 f1_2)) (or (<= 1 (+ f2_7 f1_6)) (<= f1_2 0))), 12554#(and (or (< 0 f1_6) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0)) (or (<= f1_6 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3))))), 12568#(and (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0)) (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ f2_7 (* 2 f1_6)) 0))), 12575#(and (or (<= (+ (* 5 f1_6) (* 3 f2_7)) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3)))) (or (< 0 (+ (* 5 f1_6) (* 3 f2_7))) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0))), 12561#(and (or (< 0 (+ f2_3 f1_2)) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0)) (or (<= (+ f2_3 f1_2) 0) (<= 1 (+ (* 3 f1_6) (* 2 f2_7)))))] [2022-03-15 20:43:14,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-15 20:43:14,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:14,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-15 20:43:14,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=3631, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 20:43:14,587 INFO L87 Difference]: Start difference. First operand 329 states and 818 transitions. Second operand has 57 states, 56 states have (on average 2.1964285714285716) internal successors, (123), 56 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:17,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:17,666 INFO L93 Difference]: Finished difference Result 516 states and 1294 transitions. [2022-03-15 20:43:17,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 20:43:17,667 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.1964285714285716) internal successors, (123), 56 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 20:43:17,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:17,669 INFO L225 Difference]: With dead ends: 516 [2022-03-15 20:43:17,669 INFO L226 Difference]: Without dead ends: 509 [2022-03-15 20:43:17,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 37 SyntacticMatches, 17 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1907 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=410, Invalid=10302, Unknown=0, NotChecked=0, Total=10712 [2022-03-15 20:43:17,670 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 99 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 3304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:17,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 717 Invalid, 3310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3304 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 20:43:17,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-03-15 20:43:17,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 409. [2022-03-15 20:43:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 2.593137254901961) internal successors, (1058), 408 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have 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:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1058 transitions. [2022-03-15 20:43:17,679 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1058 transitions. Word has length 20 [2022-03-15 20:43:17,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:17,680 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 1058 transitions. [2022-03-15 20:43:17,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.1964285714285716) internal successors, (123), 56 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1058 transitions. [2022-03-15 20:43:17,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:43:17,681 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:17,681 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:17,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 20:43:17,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:17,899 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:17,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:17,900 INFO L85 PathProgramCache]: Analyzing trace with hash -271990855, now seen corresponding path program 17 times [2022-03-15 20:43:17,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:17,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781290052] [2022-03-15 20:43:17,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:17,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:17,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:17,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781290052] [2022-03-15 20:43:17,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781290052] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:17,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189868154] [2022-03-15 20:43:17,988 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:43:17,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:17,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:17,989 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:18,028 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:18,038 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:43:18,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:18,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:43:18,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:18,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:18,272 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:18,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189868154] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:18,273 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:18,273 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2022-03-15 20:43:18,273 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [765640658] [2022-03-15 20:43:18,273 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:18,274 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:18,281 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 144 transitions. [2022-03-15 20:43:18,281 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:19,690 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 42 new interpolants: [14171#(or (<= n_0 3) (<= n_0 i_1) (< 4 n_0)), 14162#(or (<= n_0 (+ 3 i_1)) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 14153#(or (<= (+ n_0 1) i_1) (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 14160#(or (<= n_0 (+ 3 i_1)) (< i_5 n_0)), 14166#(or (<= n_0 (+ 3 i_5)) (< (+ i_5 4) n_0) (<= n_0 (+ i_1 1))), 14141#(or (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 14168#(or (<= n_0 (+ 3 i_1)) (<= n_0 (+ 3 i_5)) (< (+ i_5 4) n_0)), 14180#(<= i_5 0), 14179#(<= i_5 1), 14156#(or (<= n_0 (+ 2 i_1)) (< i_5 n_0)), 14161#(or (<= n_0 (+ 3 i_1)) (<= n_0 i_5) (< (+ i_5 1) n_0)), 14178#(<= i_5 2), 14149#(or (<= n_0 i_5) (<= n_0 (+ i_1 1)) (< (+ i_5 1) n_0)), 14144#(or (<= (+ n_0 1) i_1) (< i_5 n_0)), 14176#(<= i_5 3), 14177#(or (<= n_0 (+ 3 i_1)) (<= n_0 3) (< 4 n_0)), 14152#(or (<= n_0 (+ i_1 1)) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 14140#(or (<= n_0 i_5) (< (+ i_5 1) n_0)), 14154#(or (<= n_0 i_1) (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 14164#(or (<= (+ n_0 1) i_1) (<= n_0 (+ 3 i_5)) (< (+ i_5 4) n_0)), 14148#(or (<= n_0 (+ i_1 1)) (< i_5 n_0)), 14174#(<= n_0 4), 14157#(or (<= n_0 (+ 2 i_1)) (<= n_0 i_5) (< (+ i_5 1) n_0)), 14175#(<= i_5 4), 14151#(or (<= n_0 i_1) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 14169#(or (<= n_0 3) (< 4 n_0)), 14165#(or (<= n_0 (+ 3 i_5)) (<= n_0 i_1) (< (+ i_5 4) n_0)), 14172#(or (<= n_0 3) (< 4 n_0) (<= n_0 (+ i_1 1))), 14146#(or (<= (+ n_0 1) i_1) (<= n_0 i_5) (< (+ i_5 1) n_0)), 14158#(or (<= n_0 (+ 2 i_1)) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 14170#(or (<= n_0 3) (<= (+ n_0 1) i_1) (< 4 n_0)), 14147#(or (<= n_0 i_1) (<= n_0 i_5) (< (+ i_5 1) n_0)), 14159#(or (<= n_0 (+ 2 i_1)) (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 14173#(or (<= n_0 3) (<= n_0 (+ 2 i_1)) (< 4 n_0)), 14163#(or (<= n_0 (+ 3 i_1)) (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 14139#(< i_5 n_0), 14155#(or (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5)) (<= n_0 (+ i_1 1))), 14145#(or (<= n_0 i_1) (< i_5 n_0)), 14143#(or (<= n_0 (+ 3 i_5)) (< (+ i_5 4) n_0)), 14150#(or (<= (+ n_0 1) i_1) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 14142#(or (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 14167#(or (<= n_0 (+ 3 i_5)) (<= n_0 (+ 2 i_1)) (< (+ i_5 4) n_0))] [2022-03-15 20:43:19,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-15 20:43:19,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:19,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-15 20:43:19,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=4221, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 20:43:19,691 INFO L87 Difference]: Start difference. First operand 409 states and 1058 transitions. Second operand has 56 states, 56 states have (on average 2.1964285714285716) internal successors, (123), 56 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:54,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:54,888 INFO L93 Difference]: Finished difference Result 1468 states and 3612 transitions. [2022-03-15 20:43:54,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 641 states. [2022-03-15 20:43:54,888 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.1964285714285716) internal successors, (123), 56 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 20:43:54,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:54,892 INFO L225 Difference]: With dead ends: 1468 [2022-03-15 20:43:54,893 INFO L226 Difference]: Without dead ends: 1402 [2022-03-15 20:43:54,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 696 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225475 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=100195, Invalid=386311, Unknown=0, NotChecked=0, Total=486506 [2022-03-15 20:43:54,918 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 520 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 2628 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 2628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:54,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [520 Valid, 84 Invalid, 2989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 2628 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:43:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2022-03-15 20:43:54,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 402. [2022-03-15 20:43:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 2.571072319201995) internal successors, (1031), 401 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have 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:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1031 transitions. [2022-03-15 20:43:54,933 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1031 transitions. Word has length 20 [2022-03-15 20:43:54,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:54,933 INFO L470 AbstractCegarLoop]: Abstraction has 402 states and 1031 transitions. [2022-03-15 20:43:54,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.1964285714285716) internal successors, (123), 56 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1031 transitions. [2022-03-15 20:43:54,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:43:54,935 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:54,935 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:54,957 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:43:55,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:55,156 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:55,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:55,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1255834727, now seen corresponding path program 18 times [2022-03-15 20:43:55,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:55,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281135438] [2022-03-15 20:43:55,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:55,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:55,255 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:55,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281135438] [2022-03-15 20:43:55,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281135438] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:55,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939007612] [2022-03-15 20:43:55,255 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:43:55,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:55,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:55,256 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:55,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 20:43:55,299 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:43:55,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:55,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 20:43:55,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:55,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:55,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939007612] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:55,440 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:55,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 21 [2022-03-15 20:43:55,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [555854407] [2022-03-15 20:43:55,440 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:55,441 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:55,449 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 163 transitions. [2022-03-15 20:43:55,449 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:57,066 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 49 new interpolants: [17863#(or (<= n_0 i_5) (< i_1 n_0)), 17880#(or (<= n_0 i_1) (<= n_0 (+ 2 i_5)) (< (+ i_1 1) n_0)), 17909#(or (<= n_0 (+ 5 i_5)) (< 5 n_0) (<= n_0 4)), 17871#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0)), 17897#(or (<= n_0 (+ 5 i_5)) (< i_1 n_0)), 17882#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= n_0 (+ 2 i_5))), 17877#(or (<= n_0 i_5) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 17889#(or (<= n_0 i_1) (< (+ i_1 1) n_0) (<= n_0 (+ i_5 4))), 17890#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (<= n_0 (+ i_5 4))), 17881#(or (< (+ 2 i_1) n_0) (<= n_0 (+ 2 i_5)) (<= n_0 (+ i_1 1))), 17865#(or (< i_1 n_0) (<= n_0 (+ i_5 1))), 17894#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= n_0 (+ i_5 4))), 17907#(or (<= n_0 (+ 3 i_5)) (< 5 n_0) (<= n_0 4)), 17908#(or (< 5 n_0) (<= n_0 4) (<= n_0 (+ i_5 4))), 17895#(or (<= n_0 (+ 3 i_5)) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 17903#(or (< 5 n_0) (<= n_0 4)), 17866#(or (<= n_0 i_1) (< (+ i_1 1) n_0) (<= n_0 (+ i_5 1))), 17876#(or (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 17902#(or (<= n_0 (+ 5 i_5)) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 17904#(or (<= n_0 i_5) (< 5 n_0) (<= n_0 4)), 17874#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= n_0 (+ i_5 1))), 17870#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1))), 17896#(or (<= n_0 (+ i_1 4)) (<= n_0 (+ i_5 4)) (< (+ 5 i_1) n_0)), 17883#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= n_0 (+ 2 i_5))), 17901#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= n_0 (+ 5 i_5))), 17869#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (<= n_0 (+ i_5 1))), 17884#(or (<= n_0 (+ 2 i_5)) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 17900#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= n_0 (+ 5 i_5))), 17891#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 3 i_5)) (<= n_0 (+ 2 i_1))), 17864#(or (<= n_0 i_1) (<= n_0 i_5) (< (+ i_1 1) n_0)), 17868#(or (<= n_0 i_5) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 17872#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= n_0 i_5)), 17888#(or (< i_1 n_0) (<= n_0 (+ i_5 4))), 17885#(or (<= n_0 (+ 3 i_5)) (< i_1 n_0)), 17899#(or (<= n_0 (+ 5 i_5)) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 17892#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= n_0 (+ i_5 4))), 17867#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 17878#(or (<= n_0 (+ i_1 4)) (<= n_0 (+ i_5 1)) (< (+ 5 i_1) n_0)), 17861#(< i_1 n_0), 17879#(or (< i_1 n_0) (<= n_0 (+ 2 i_5))), 17875#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= n_0 (+ i_5 1))), 17905#(or (< 5 n_0) (<= n_0 4) (<= n_0 (+ i_5 1))), 17873#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= n_0 i_5)), 17893#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= n_0 (+ 3 i_5))), 17862#(or (<= n_0 i_1) (< (+ i_1 1) n_0)), 17898#(or (<= n_0 i_1) (<= n_0 (+ 5 i_5)) (< (+ i_1 1) n_0)), 17886#(or (<= n_0 (+ 3 i_5)) (<= n_0 i_1) (< (+ i_1 1) n_0)), 17887#(or (<= n_0 (+ 3 i_5)) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 17906#(or (<= n_0 (+ 2 i_5)) (< 5 n_0) (<= n_0 4))] [2022-03-15 20:43:57,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-15 20:43:57,067 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:57,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-15 20:43:57,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=4180, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 20:43:57,068 INFO L87 Difference]: Start difference. First operand 402 states and 1031 transitions. Second operand has 64 states, 64 states have (on average 2.1875) internal successors, (140), 64 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:01,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:01,681 INFO L93 Difference]: Finished difference Result 991 states and 2539 transitions. [2022-03-15 20:44:01,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-03-15 20:44:01,681 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.1875) internal successors, (140), 64 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 20:44:01,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:01,684 INFO L225 Difference]: With dead ends: 991 [2022-03-15 20:44:01,684 INFO L226 Difference]: Without dead ends: 976 [2022-03-15 20:44:01,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9708 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6529, Invalid=28253, Unknown=0, NotChecked=0, Total=34782 [2022-03-15 20:44:01,687 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 230 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:01,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 74 Invalid, 1906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:44:01,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2022-03-15 20:44:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 321. [2022-03-15 20:44:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 2.46875) internal successors, (790), 320 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have 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:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 790 transitions. [2022-03-15 20:44:01,699 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 790 transitions. Word has length 21 [2022-03-15 20:44:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:01,699 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 790 transitions. [2022-03-15 20:44:01,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.1875) internal successors, (140), 64 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:01,699 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 790 transitions. [2022-03-15 20:44:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:44:01,700 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:01,700 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:01,726 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:01,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:01,915 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:01,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:01,916 INFO L85 PathProgramCache]: Analyzing trace with hash 381937249, now seen corresponding path program 19 times [2022-03-15 20:44:01,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:01,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145474802] [2022-03-15 20:44:01,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:01,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:02,015 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:02,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:02,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145474802] [2022-03-15 20:44:02,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145474802] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:02,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949172611] [2022-03-15 20:44:02,015 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:44:02,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:02,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:02,016 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:02,017 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:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:02,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 20:44:02,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:02,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:02,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949172611] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:02,183 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:02,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 21 [2022-03-15 20:44:02,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2118814953] [2022-03-15 20:44:02,184 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:02,186 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:02,196 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 163 transitions. [2022-03-15 20:44:02,197 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:03,928 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 56 new interpolants: [19948#(or (<= n_0 (+ 3 i_1)) (<= (+ 3 i_5) n_0) (< (+ i_1 4) n_0)), 19960#(or (<= (+ i_5 4) n_0) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 19946#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (< i_5 n_0)), 19966#(or (<= (+ 6 i_5) n_0) (< i_1 n_0)), 19937#(or (<= (+ 5 i_5) n_0) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 19961#(or (<= (+ 5 i_5) n_0) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 19975#(or (< 6 n_0) (<= (+ 6 i_5) n_0) (<= n_0 5)), 19968#(or (<= (+ 6 i_5) n_0) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 19956#(or (< 6 n_0) (<= n_0 5)), 19933#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (< i_5 n_0)), 19949#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= (+ i_5 4) n_0)), 19951#(or (<= n_0 (+ i_1 4)) (< i_5 n_0) (< (+ 5 i_1) n_0)), 19952#(or (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0)), 19967#(or (<= (+ 6 i_5) n_0) (<= n_0 i_1) (< (+ i_1 1) n_0)), 19930#(or (<= n_0 i_1) (<= (+ i_5 4) n_0) (< (+ i_1 1) n_0)), 19922#(or (< i_1 n_0) (<= (+ 2 i_5) n_0)), 19974#(or (< 6 n_0) (<= (+ 5 i_5) n_0) (<= n_0 5)), 19957#(or (< 6 n_0) (< i_5 n_0) (<= n_0 5)), 19954#(or (<= n_0 (+ i_1 4)) (<= (+ 2 i_5) n_0) (< (+ 5 i_1) n_0)), 19944#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0)), 19965#(or (< 6 n_0) (<= (+ i_5 4) n_0) (<= n_0 5)), 19935#(or (<= (+ 3 i_5) n_0) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 19947#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= (+ 2 i_5) n_0)), 19945#(or (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 19941#(or (< (+ 3 i_1) n_0) (<= (+ 3 i_5) n_0) (<= n_0 (+ 2 i_1))), 19931#(or (<= (+ 5 i_5) n_0) (<= n_0 i_1) (< (+ i_1 1) n_0)), 19925#(or (<= (+ 5 i_5) n_0) (< i_1 n_0)), 19964#(or (<= (+ i_5 4) n_0) (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0)), 19938#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1))), 19943#(or (<= (+ 5 i_5) n_0) (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1))), 19929#(or (<= (+ 3 i_5) n_0) (<= n_0 i_1) (< (+ i_1 1) n_0)), 19923#(or (<= (+ 3 i_5) n_0) (< i_1 n_0)), 19926#(or (<= n_0 i_1) (< (+ i_1 1) n_0)), 19969#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= (+ 6 i_5) n_0)), 19963#(or (< 6 n_0) (<= (+ 3 i_5) n_0) (<= n_0 5)), 19940#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= (+ 2 i_5) n_0)), 19955#(or (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0) (<= (+ 2 i_5) n_0)), 19971#(or (<= (+ 6 i_5) n_0) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 19924#(or (< i_1 n_0) (<= (+ i_5 4) n_0)), 19939#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (< i_5 n_0)), 19962#(or (<= (+ 3 i_5) n_0) (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0)), 19921#(or (< i_1 n_0) (< i_5 n_0)), 19942#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= (+ i_5 4) n_0)), 19953#(or (< i_5 n_0) (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0)), 19928#(or (<= n_0 i_1) (< (+ i_1 1) n_0) (<= (+ 2 i_5) n_0)), 19936#(or (< (+ 2 i_1) n_0) (<= (+ i_5 4) n_0) (<= n_0 (+ i_1 1))), 19950#(or (<= (+ 5 i_5) n_0) (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0)), 19920#(< i_1 n_0), 19958#(or (< 6 n_0) (<= (+ 2 i_5) n_0) (<= n_0 5)), 19972#(or (<= (+ 5 i_5) n_0) (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0)), 19932#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 19959#(or (<= (+ 3 i_5) n_0) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 19973#(or (<= (+ 6 i_5) n_0) (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0)), 19934#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (<= (+ 2 i_5) n_0)), 19970#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= (+ 6 i_5) n_0)), 19927#(or (<= n_0 i_1) (< i_5 n_0) (< (+ i_1 1) n_0))] [2022-03-15 20:44:03,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-03-15 20:44:03,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:03,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-03-15 20:44:03,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=5125, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 20:44:03,929 INFO L87 Difference]: Start difference. First operand 321 states and 790 transitions. Second operand has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 71 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:44:13,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:13,814 INFO L93 Difference]: Finished difference Result 2067 states and 5351 transitions. [2022-03-15 20:44:13,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 262 states. [2022-03-15 20:44:13,815 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 71 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 21 [2022-03-15 20:44:13,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:13,821 INFO L225 Difference]: With dead ends: 2067 [2022-03-15 20:44:13,821 INFO L226 Difference]: Without dead ends: 2037 [2022-03-15 20:44:13,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42425 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=14963, Invalid=89689, Unknown=0, NotChecked=0, Total=104652 [2022-03-15 20:44:13,828 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 326 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 2440 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 3034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 2440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:13,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 121 Invalid, 3034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 2440 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 20:44:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2022-03-15 20:44:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 669. [2022-03-15 20:44:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 668 states have (on average 2.5479041916167664) internal successors, (1702), 668 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have 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:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1702 transitions. [2022-03-15 20:44:13,850 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1702 transitions. Word has length 21 [2022-03-15 20:44:13,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:13,850 INFO L470 AbstractCegarLoop]: Abstraction has 669 states and 1702 transitions. [2022-03-15 20:44:13,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 71 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:44:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1702 transitions. [2022-03-15 20:44:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 20:44:13,852 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:13,852 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:13,879 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:14,075 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,SelfDestructingSolverStorable22 [2022-03-15 20:44:14,075 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:14,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:14,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1045171015, now seen corresponding path program 20 times [2022-03-15 20:44:14,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:14,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045645782] [2022-03-15 20:44:14,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:14,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:14,331 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:14,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045645782] [2022-03-15 20:44:14,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045645782] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:14,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126500557] [2022-03-15 20:44:14,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:44:14,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:14,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:14,333 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:14,334 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:14,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:44:14,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:14,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-15 20:44:14,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:14,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:15,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126500557] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:15,052 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:15,052 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2022-03-15 20:44:15,052 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [239637686] [2022-03-15 20:44:15,052 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:15,053 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:15,063 INFO L252 McrAutomatonBuilder]: Finished intersection with 103 states and 182 transitions. [2022-03-15 20:44:15,064 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:19,306 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 56 new interpolants: [24075#(and (or (<= (+ (* 5 f2_7) (* f1_6 8)) 0) (< 0 f1_2)) (or (<= f1_2 0) (<= 1 (+ (* 5 f2_7) (* f1_6 8))))), 24057#(and (or (< 0 (+ (* f2_3 8) (* f1_2 13))) (= l_8 0)) (or (<= (+ (* f2_3 8) (* f1_2 13)) 0) (= l_8 1))), 24041#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (= l_8 0)) (or (<= (+ (* 2 f1_2) f2_3) 0) (= l_8 1))), 24070#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ (* 5 f1_6) (* 3 f2_7)) 0)) (or (< 0 (+ (* 5 f1_6) (* 3 f2_7))) (<= (+ (* 2 f1_2) f2_3) 0))), 24051#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0)) (or (< 0 (+ (* 3 f1_6) (* 2 f2_7))) (<= (+ (* 2 f1_2) f2_3) 0))), 24019#(and (or (<= 1 (+ (* f2_7 8) (* f1_6 13))) (<= (+ (* 5 f2_3) (* f1_2 8)) 0)) (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (<= (+ (* f2_7 8) (* f1_6 13)) 0))), 24036#(and (or (< 0 (+ f2_3 f1_2)) (= l_8 0)) (or (<= (+ f2_3 f1_2) 0) (= l_8 1))), 24007#(and (or (<= 1 (+ (* f2_7 8) (* f1_6 13))) (<= (+ (* 2 f1_2) f2_3) 0)) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ (* f2_7 8) (* f1_6 13)) 0))), 24054#(and (or (< 0 f1_6) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0)) (or (<= f1_6 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3))))), 24038#(and (or (<= (+ f2_7 f1_6) 0) (< 0 (+ f2_3 f1_2))) (or (<= (+ f2_3 f1_2) 0) (< 0 (+ f2_7 f1_6)))), 24037#(and (or (<= (+ f2_3 f1_2) 0) (< 0 f1_6)) (or (<= f1_6 0) (< 0 (+ f2_3 f1_2)))), 24072#(and (or (<= (+ (* 5 f1_6) (* 3 f2_7)) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3)))) (or (< 0 (+ (* 5 f1_6) (* 3 f2_7))) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0))), 24048#(and (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0)) (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ f2_7 (* 2 f1_6)) 0))), 24056#(and (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (not (< 0 f1_6))) (or (< 0 f1_6) (<= (+ (* 5 f2_3) (* f1_2 8)) 0))), 24081#(and (or (<= (+ (* f2_3 8) (* f1_2 13)) 0) (< 0 (+ (* 5 f2_7) (* f1_6 8)))) (or (<= (+ (* 5 f2_7) (* f1_6 8)) 0) (< 0 (+ (* f2_3 8) (* f1_2 13))))), 24055#(and (or (<= (+ (* 5 f2_3) (* f1_2 8)) 0) (= l_8 1)) (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (= l_8 0))), 24046#(and (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= f1_6 0)) (or (< 0 f1_6) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0))), 24033#(and (or (<= f1_2 0) (= l_8 1)) (or (= l_8 0) (< 0 f1_2))), 24040#(and (or (<= (+ f2_7 (* 2 f1_6)) 0) (< 0 (+ f2_3 f1_2))) (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ f2_3 f1_2) 0))), 24003#(and (or (< 0 (+ f2_3 f1_2)) (<= (+ (* f2_7 8) (* f1_6 13)) 0)) (or (<= (+ f2_3 f1_2) 0) (<= 1 (+ (* f2_7 8) (* f1_6 13))))), 24053#(and (or (= l_8 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3)))) (or (<= (+ (* 5 f1_2) (* 3 f2_3)) 0) (= l_8 1))), 24071#(and (or (< 0 (+ (* 5 f1_6) (* 3 f2_7))) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0)) (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ (* 5 f1_6) (* 3 f2_7)) 0))), 24066#(and (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0)) (or (< 0 (+ (* 3 f1_6) (* 2 f2_7))) (<= (+ (* 5 f2_3) (* f1_2 8)) 0))), 24045#(and (or (<= (+ (* 2 f2_3) (* 3 f1_2)) 0) (= l_8 1)) (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (= l_8 0))), 24050#(and (or (< 0 (+ f2_3 f1_2)) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0)) (or (<= (+ f2_3 f1_2) 0) (<= 1 (+ (* 3 f1_6) (* 2 f2_7))))), 24039#(and (or (<= 1 (+ f2_7 (* 2 f1_6))) (<= f1_2 0)) (or (<= (+ f2_7 (* 2 f1_6)) 0) (< 0 f1_2))), 24076#(and (or (<= (+ (* 5 f2_7) (* f1_6 8)) 0) (< 0 (+ f2_3 f1_2))) (or (not (< 0 (+ f2_3 f1_2))) (<= 1 (+ (* 5 f2_7) (* f1_6 8))))), 24079#(and (or (<= (+ (* 5 f2_7) (* f1_6 8)) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3)))) (or (< 0 (+ (* 5 f2_7) (* f1_6 8))) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0))), 24058#(and (or (< 0 f1_6) (<= (+ (* f2_3 8) (* f1_2 13)) 0)) (or (not (< 0 f1_6)) (< 0 (+ (* f2_3 8) (* f1_2 13))))), 24015#(and (or (< 0 (+ (* 5 f1_2) (* 3 f2_3))) (<= (+ (* f2_7 8) (* f1_6 13)) 0)) (or (<= 1 (+ (* f2_7 8) (* f1_6 13))) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0))), 24080#(and (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (<= (+ (* 5 f2_7) (* f1_6 8)) 0)) (or (< 0 (+ (* 5 f2_7) (* f1_6 8))) (<= (+ (* 5 f2_3) (* f1_2 8)) 0))), 24052#(and (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0)) (or (< 0 (+ (* 3 f1_6) (* 2 f2_7))) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0))), 24060#(and (or (< 0 (+ f2_7 f1_6)) (<= (+ (* 5 f2_3) (* f1_2 8)) 0)) (or (not (< 0 (+ f2_7 f1_6))) (< 0 (+ (* 5 f2_3) (* f1_2 8))))), 24023#(and (or (<= (+ (* f2_3 8) (* f1_2 13)) 0) (<= 1 (+ (* f2_7 8) (* f1_6 13)))) (or (< 0 (+ (* f2_3 8) (* f1_2 13))) (<= (+ (* f2_7 8) (* f1_6 13)) 0))), 24035#(and (or (<= (+ f2_7 f1_6) 0) (< 0 f1_2)) (or (<= 1 (+ f2_7 f1_6)) (<= f1_2 0))), 24062#(and (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0)) (or (<= (+ f2_7 (* 2 f1_6)) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3))))), 24074#(and (or (<= (+ (* 5 f1_6) (* 3 f2_7)) 0) (< 0 (+ (* f2_3 8) (* f1_2 13)))) (or (< 0 (+ (* 5 f1_6) (* 3 f2_7))) (<= (+ (* f2_3 8) (* f1_2 13)) 0))), 24042#(and (or (< 0 f1_6) (<= (+ (* 2 f1_2) f2_3) 0)) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= f1_6 0))), 24047#(and (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ f2_7 f1_6) 0)) (or (< 0 (+ f2_7 f1_6)) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0))), 24073#(and (or (< 0 (+ (* 5 f1_6) (* 3 f2_7))) (<= (+ (* 5 f2_3) (* f1_2 8)) 0)) (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (<= (+ (* 5 f1_6) (* 3 f2_7)) 0))), 24068#(and (or (<= (+ (* 5 f1_6) (* 3 f2_7)) 0) (< 0 f1_2)) (or (<= 1 (+ (* 5 f1_6) (* 3 f2_7))) (not (< 0 f1_2)))), 24044#(and (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* 2 f1_2) f2_3) 0)) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ f2_7 (* 2 f1_6)) 0))), 23999#(and (or (<= 1 (+ (* f2_7 8) (* f1_6 13))) (<= f1_2 0)) (or (<= (+ (* f2_7 8) (* f1_6 13)) 0) (< 0 f1_2))), 24059#(and (or (< 0 (+ f2_7 f1_6)) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0)) (or (<= (+ f2_7 f1_6) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3))))), 24011#(and (or (<= 1 (+ (* f2_7 8) (* f1_6 13))) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0)) (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ (* f2_7 8) (* f1_6 13)) 0))), 24065#(and (or (<= (+ (* 3 f1_6) (* 2 f2_7)) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3)))) (or (< 0 (+ (* 3 f1_6) (* 2 f2_7))) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0))), 24061#(and (or (not (< 0 (+ f2_7 f1_6))) (< 0 (+ (* f2_3 8) (* f1_2 13)))) (or (<= (+ (* f2_3 8) (* f1_2 13)) 0) (< 0 (+ f2_7 f1_6)))), 24064#(and (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* f2_3 8) (* f1_2 13)) 0)) (or (<= (+ f2_7 (* 2 f1_6)) 0) (< 0 (+ (* f2_3 8) (* f1_2 13))))), 24078#(and (or (< 0 (+ (* 5 f2_7) (* f1_6 8))) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0)) (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ (* 5 f2_7) (* f1_6 8)) 0))), 24034#(and (or (< 0 f1_6) (<= f1_2 0)) (or (<= f1_6 0) (< 0 f1_2))), 24077#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ (* 5 f2_7) (* f1_6 8)) 0)) (or (< 0 (+ (* 5 f2_7) (* f1_6 8))) (<= (+ (* 2 f1_2) f2_3) 0))), 24069#(and (or (<= (+ (* 5 f1_6) (* 3 f2_7)) 0) (< 0 (+ f2_3 f1_2))) (or (<= 1 (+ (* 5 f1_6) (* 3 f2_7))) (not (< 0 (+ f2_3 f1_2))))), 24063#(and (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (<= (+ f2_7 (* 2 f1_6)) 0)) (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* 5 f2_3) (* f1_2 8)) 0))), 24043#(and (or (< 0 (+ f2_7 f1_6)) (<= (+ (* 2 f1_2) f2_3) 0)) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ f2_7 f1_6) 0))), 24067#(and (or (<= (+ (* f2_3 8) (* f1_2 13)) 0) (< 0 (+ (* 3 f1_6) (* 2 f2_7)))) (or (< 0 (+ (* f2_3 8) (* f1_2 13))) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0))), 24049#(and (or (<= (+ (* 3 f1_6) (* 2 f2_7)) 0) (< 0 f1_2)) (or (<= 1 (+ (* 3 f1_6) (* 2 f2_7))) (<= f1_2 0)))] [2022-03-15 20:44:19,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-03-15 20:44:19,307 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:19,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-03-15 20:44:19,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5968, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 20:44:19,308 INFO L87 Difference]: Start difference. First operand 669 states and 1702 transitions. Second operand has 73 states, 72 states have (on average 2.1666666666666665) internal successors, (156), 72 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:24,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:24,252 INFO L93 Difference]: Finished difference Result 1033 states and 2693 transitions. [2022-03-15 20:44:24,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 20:44:24,252 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 2.1666666666666665) internal successors, (156), 72 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 20:44:24,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:24,255 INFO L225 Difference]: With dead ends: 1033 [2022-03-15 20:44:24,255 INFO L226 Difference]: Without dead ends: 1025 [2022-03-15 20:44:24,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 40 SyntacticMatches, 20 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3293 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=567, Invalid=17523, Unknown=0, NotChecked=0, Total=18090 [2022-03-15 20:44:24,257 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 119 mSDsluCounter, 2306 mSDsCounter, 0 mSdLazyCounter, 5173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 5180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 5173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:24,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 1106 Invalid, 5180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 5173 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 20:44:24,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2022-03-15 20:44:24,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 837. [2022-03-15 20:44:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 2.648325358851675) internal successors, (2214), 836 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have 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:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 2214 transitions. [2022-03-15 20:44:24,272 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 2214 transitions. Word has length 22 [2022-03-15 20:44:24,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:24,273 INFO L470 AbstractCegarLoop]: Abstraction has 837 states and 2214 transitions. [2022-03-15 20:44:24,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 2.1666666666666665) internal successors, (156), 72 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:24,273 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 2214 transitions. [2022-03-15 20:44:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 20:44:24,275 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:24,275 INFO L514 BasicCegarLoop]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:24,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-03-15 20:44:24,491 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,SelfDestructingSolverStorable23 [2022-03-15 20:44:24,491 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:24,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:24,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1068545407, now seen corresponding path program 21 times [2022-03-15 20:44:24,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:24,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817630621] [2022-03-15 20:44:24,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:24,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:24,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:24,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817630621] [2022-03-15 20:44:24,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817630621] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:24,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804621786] [2022-03-15 20:44:24,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:44:24,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:24,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:24,610 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:24,612 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:24,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 20:44:24,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:24,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 20:44:24,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:24,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:24,898 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:24,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804621786] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:24,899 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:24,899 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2022-03-15 20:44:24,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [373104385] [2022-03-15 20:44:24,899 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:24,900 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:24,910 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 180 transitions. [2022-03-15 20:44:24,910 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:26,980 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 56 new interpolants: [27078#(or (<= n_0 i_1) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 27110#(or (<= n_0 (+ 3 i_1)) (< 5 n_0) (<= n_0 4)), 27103#(or (<= n_0 (+ i_1 4)) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 27069#(or (< (+ 5 i_5) n_0) (<= n_0 (+ i_5 4))), 27097#(or (<= n_0 (+ 3 i_1)) (<= n_0 i_5) (< (+ i_5 1) n_0)), 27092#(or (<= n_0 i_1) (< (+ 5 i_5) n_0) (<= n_0 (+ i_5 4))), 27114#(<= i_5 0), 27070#(or (<= (+ n_0 1) i_1) (< (+ 5 i_5) n_0) (<= n_0 (+ i_5 4))), 27099#(or (<= n_0 (+ 3 i_1)) (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 27112#(<= i_5 2), 27108#(or (<= n_0 (+ i_1 4)) (< (+ 5 i_5) n_0) (<= n_0 (+ i_5 4))), 27095#(or (<= n_0 (+ i_1 1)) (< 5 n_0) (<= n_0 4)), 27113#(<= i_5 1), 27075#(or (<= n_0 (+ 2 i_1)) (< i_5 n_0)), 27087#(or (<= n_0 (+ 3 i_5)) (<= n_0 (+ 2 i_1)) (< (+ i_5 4) n_0)), 27059#(< i_5 n_0), 27071#(or (< 5 n_0) (<= n_0 4)), 27105#(or (<= n_0 (+ 3 i_5)) (< (+ i_5 4) n_0) (<= n_0 (+ i_1 4))), 27102#(or (<= n_0 i_5) (<= n_0 (+ i_1 4)) (< (+ i_5 1) n_0)), 27076#(or (<= n_0 i_1) (<= n_0 i_5) (< (+ i_5 1) n_0)), 27074#(or (<= n_0 (+ i_1 1)) (< i_5 n_0)), 27064#(or (<= (+ n_0 1) i_1) (<= n_0 i_5) (< (+ i_5 1) n_0)), 27062#(or (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 27079#(or (<= n_0 (+ i_1 1)) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 27065#(or (<= (+ n_0 1) i_1) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 27091#(<= i_5 3), 27083#(or (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5)) (<= n_0 (+ i_1 1))), 27060#(or (<= n_0 i_5) (< (+ i_5 1) n_0)), 27085#(or (<= n_0 (+ 3 i_5)) (<= n_0 i_1) (< (+ i_5 4) n_0)), 27077#(or (<= n_0 i_5) (<= n_0 (+ i_1 1)) (< (+ i_5 1) n_0)), 27088#(<= n_0 5), 27100#(or (<= n_0 (+ 3 i_1)) (<= n_0 (+ 3 i_5)) (< (+ i_5 4) n_0)), 27063#(or (<= (+ n_0 1) i_1) (< i_5 n_0)), 27066#(or (<= (+ n_0 1) i_1) (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 27096#(or (<= n_0 (+ 3 i_1)) (< i_5 n_0)), 27073#(or (<= n_0 i_1) (< i_5 n_0)), 27101#(or (<= n_0 (+ i_1 4)) (< i_5 n_0)), 27093#(or (<= n_0 i_1) (< 5 n_0) (<= n_0 4)), 27061#(or (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 27104#(or (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5)) (<= n_0 (+ i_1 4))), 27072#(or (<= (+ n_0 1) i_1) (< 5 n_0) (<= n_0 4)), 27111#(or (<= n_0 (+ i_1 4)) (< 5 n_0) (<= n_0 4)), 27084#(or (<= n_0 (+ 2 i_1)) (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 27106#(or (<= n_0 (+ 2 i_1)) (< (+ 5 i_5) n_0) (<= n_0 (+ i_5 4))), 27109#(or (<= n_0 (+ 2 i_1)) (< 5 n_0) (<= n_0 4)), 27107#(or (<= n_0 (+ 3 i_1)) (< (+ 5 i_5) n_0) (<= n_0 (+ i_5 4))), 27089#(<= i_5 5), 27098#(or (<= n_0 (+ 3 i_1)) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 27081#(or (<= n_0 (+ 2 i_1)) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 27080#(or (<= n_0 (+ 2 i_1)) (<= n_0 i_5) (< (+ i_5 1) n_0)), 27086#(or (<= n_0 (+ 3 i_5)) (< (+ i_5 4) n_0) (<= n_0 (+ i_1 1))), 27067#(or (<= n_0 (+ 3 i_5)) (< (+ i_5 4) n_0)), 27068#(or (<= (+ n_0 1) i_1) (<= n_0 (+ 3 i_5)) (< (+ i_5 4) n_0)), 27090#(<= i_5 4), 27082#(or (<= n_0 i_1) (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 27094#(or (<= n_0 (+ i_1 1)) (< (+ 5 i_5) n_0) (<= n_0 (+ i_5 4)))] [2022-03-15 20:44:26,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-03-15 20:44:26,980 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:26,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-03-15 20:44:26,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=901, Invalid=6755, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 20:44:26,982 INFO L87 Difference]: Start difference. First operand 837 states and 2214 transitions. Second operand has 72 states, 72 states have (on average 2.1666666666666665) internal successors, (156), 72 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:46:31,062 INFO L93 Difference]: Finished difference Result 3081 states and 7888 transitions. [2022-03-15 20:46:31,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1473 states. [2022-03-15 20:46:31,063 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.1666666666666665) internal successors, (156), 72 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 20:46:31,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:46:31,072 INFO L225 Difference]: With dead ends: 3081 [2022-03-15 20:46:31,072 INFO L226 Difference]: Without dead ends: 2968 [2022-03-15 20:46:31,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1608 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 1544 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1227839 ImplicationChecksByTransitivity, 117.1s TimeCoverageRelationStatistics Valid=494201, Invalid=1894369, Unknown=0, NotChecked=0, Total=2388570 [2022-03-15 20:46:31,255 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 980 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 4305 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 5016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 4305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:46:31,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [980 Valid, 89 Invalid, 5016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 4305 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 20:46:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2022-03-15 20:46:31,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 829. [2022-03-15 20:46:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 2.635265700483092) internal successors, (2182), 828 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states have 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:31,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 2182 transitions. [2022-03-15 20:46:31,292 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 2182 transitions. Word has length 22 [2022-03-15 20:46:31,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:46:31,292 INFO L470 AbstractCegarLoop]: Abstraction has 829 states and 2182 transitions. [2022-03-15 20:46:31,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.1666666666666665) internal successors, (156), 72 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:31,293 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 2182 transitions. [2022-03-15 20:46:31,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:46:31,295 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:46:31,295 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:46:31,321 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:46:31,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:31,518 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:46:31,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:46:31,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1959113057, now seen corresponding path program 22 times [2022-03-15 20:46:31,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:46:31,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558184510] [2022-03-15 20:46:31,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:46:31,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:46:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:31,633 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:31,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:46:31,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558184510] [2022-03-15 20:46:31,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558184510] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:46:31,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473072996] [2022-03-15 20:46:31,633 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:46:31,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:31,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:46:31,635 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:46:31,636 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:46:31,664 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:46:31,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:46:31,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 20:46:31,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:46:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:31,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:46:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:31,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473072996] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:46:31,849 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:46:31,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 24 [2022-03-15 20:46:31,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1705077736] [2022-03-15 20:46:31,849 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:46:31,851 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:46:31,863 INFO L252 McrAutomatonBuilder]: Finished intersection with 113 states and 201 transitions. [2022-03-15 20:46:31,864 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:46:34,355 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 64 new interpolants: [34975#(or (<= n_0 (+ 2 i_5)) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 34995#(or (< i_1 n_0) (<= n_0 (+ 6 i_5))), 34998#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= n_0 (+ 6 i_5))), 34946#(or (<= n_0 i_1) (<= n_0 i_5) (< (+ i_1 1) n_0)), 34951#(or (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0)), 34991#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= n_0 (+ 5 i_5))), 34999#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= n_0 (+ 6 i_5))), 34962#(or (< 6 n_0) (<= n_0 (+ i_5 1)) (<= n_0 5)), 34969#(or (< (+ 2 i_1) n_0) (<= n_0 (+ 2 i_5)) (<= n_0 (+ i_1 1))), 34952#(or (<= n_0 i_5) (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0)), 34944#(or (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 34960#(or (<= n_0 (+ i_1 4)) (<= n_0 (+ i_5 1)) (< (+ 5 i_1) n_0)), 34977#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (<= n_0 (+ i_5 4))), 34971#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= n_0 (+ 2 i_5))), 34948#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= n_0 i_5)), 34994#(or (< 6 n_0) (<= n_0 (+ 5 i_5)) (<= n_0 5)), 34943#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0)), 34992#(or (<= n_0 (+ 5 i_5)) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 34958#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= n_0 (+ i_5 1))), 34990#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= n_0 (+ 5 i_5))), 34945#(or (<= n_0 i_5) (< i_1 n_0)), 34954#(or (< 6 n_0) (<= n_0 i_5) (<= n_0 5)), 34947#(or (<= n_0 i_5) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 34984#(or (< 6 n_0) (<= n_0 (+ 2 i_5)) (<= n_0 5)), 34980#(or (<= n_0 (+ i_1 4)) (<= n_0 (+ i_5 4)) (< (+ 5 i_1) n_0)), 34972#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= n_0 (+ 2 i_5))), 34974#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= n_0 (+ 3 i_5))), 35001#(or (<= n_0 (+ 6 i_5)) (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0)), 34976#(or (<= n_0 (+ 3 i_5)) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 34979#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= n_0 (+ i_5 4))), 34941#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 34988#(or (<= n_0 i_1) (<= n_0 (+ 5 i_5)) (< (+ i_1 1) n_0)), 34939#(< i_1 n_0), 35002#(or (< 6 n_0) (<= n_0 (+ 6 i_5)) (<= n_0 5)), 34997#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (<= n_0 (+ 6 i_5))), 34982#(or (<= n_0 (+ 3 i_5)) (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0)), 34985#(or (< 6 n_0) (<= n_0 (+ 3 i_5)) (<= n_0 5)), 34940#(or (<= n_0 i_1) (< (+ i_1 1) n_0)), 34942#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1))), 34983#(or (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0) (<= n_0 (+ i_5 4))), 34967#(or (<= n_0 (+ 3 i_5)) (<= n_0 i_1) (< (+ i_1 1) n_0)), 34957#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (<= n_0 (+ i_5 1))), 34956#(or (<= n_0 i_1) (< (+ i_1 1) n_0) (<= n_0 (+ i_5 1))), 34973#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 3 i_5)) (<= n_0 (+ 2 i_1))), 34950#(or (<= n_0 i_5) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 34961#(or (<= n_0 (+ 5 i_1)) (<= n_0 (+ i_5 1)) (< (+ 6 i_1) n_0)), 34963#(or (< i_1 n_0) (<= n_0 (+ 2 i_5))), 34993#(or (<= n_0 (+ 5 i_5)) (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0)), 34968#(or (<= n_0 i_1) (< (+ i_1 1) n_0) (<= n_0 (+ i_5 4))), 34964#(or (<= n_0 (+ 3 i_5)) (< i_1 n_0)), 34965#(or (< i_1 n_0) (<= n_0 (+ i_5 4))), 34959#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= n_0 (+ i_5 1))), 34978#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= n_0 (+ i_5 4))), 34955#(or (< i_1 n_0) (<= n_0 (+ i_5 1))), 34987#(or (<= n_0 (+ 5 i_5)) (< i_1 n_0)), 34996#(or (<= n_0 i_1) (< (+ i_1 1) n_0) (<= n_0 (+ 6 i_5))), 34970#(or (<= n_0 (+ 3 i_5)) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 34989#(or (<= n_0 (+ 5 i_5)) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 34986#(or (< 6 n_0) (<= n_0 5) (<= n_0 (+ i_5 4))), 34953#(or (< 6 n_0) (<= n_0 5)), 34949#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= n_0 i_5)), 35000#(or (<= n_0 (+ i_1 4)) (<= n_0 (+ 6 i_5)) (< (+ 5 i_1) n_0)), 34966#(or (<= n_0 i_1) (<= n_0 (+ 2 i_5)) (< (+ i_1 1) n_0)), 34981#(or (<= n_0 (+ 2 i_5)) (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0))] [2022-03-15 20:46:34,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-03-15 20:46:34,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:46:34,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-03-15 20:46:34,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=943, Invalid=6713, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 20:46:34,357 INFO L87 Difference]: Start difference. First operand 829 states and 2182 transitions. Second operand has 81 states, 81 states have (on average 2.1604938271604937) internal successors, (175), 81 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have 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:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:46:41,336 INFO L93 Difference]: Finished difference Result 2138 states and 5666 transitions. [2022-03-15 20:46:41,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2022-03-15 20:46:41,336 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 2.1604938271604937) internal successors, (175), 81 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have 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:46:41,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:46:41,342 INFO L225 Difference]: With dead ends: 2138 [2022-03-15 20:46:41,343 INFO L226 Difference]: Without dead ends: 2121 [2022-03-15 20:46:41,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15953 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10208, Invalid=46198, Unknown=0, NotChecked=0, Total=56406 [2022-03-15 20:46:41,347 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 244 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 2182 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 2182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:46:41,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 94 Invalid, 2490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 2182 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:46:41,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2022-03-15 20:46:41,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 653. [2022-03-15 20:46:41,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 652 states have (on average 2.5383435582822087) internal successors, (1655), 652 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have 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:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1655 transitions. [2022-03-15 20:46:41,363 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1655 transitions. Word has length 23 [2022-03-15 20:46:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:46:41,364 INFO L470 AbstractCegarLoop]: Abstraction has 653 states and 1655 transitions. [2022-03-15 20:46:41,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 2.1604938271604937) internal successors, (175), 81 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have 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:41,364 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1655 transitions. [2022-03-15 20:46:41,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:46:41,365 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:46:41,365 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:46:41,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-03-15 20:46:41,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:41,588 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:46:41,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:46:41,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1190436761, now seen corresponding path program 23 times [2022-03-15 20:46:41,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:46:41,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031848926] [2022-03-15 20:46:41,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:46:41,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:46:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:41,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:46:41,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031848926] [2022-03-15 20:46:41,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031848926] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:46:41,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418211471] [2022-03-15 20:46:41,689 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:46:41,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:41,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:46:41,690 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:46:41,691 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:46:41,719 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 20:46:41,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:46:41,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 20:46:41,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:46:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:41,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:46:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:41,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418211471] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:46:41,877 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:46:41,877 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 24 [2022-03-15 20:46:41,877 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [472308216] [2022-03-15 20:46:41,877 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:46:41,878 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:46:41,890 INFO L252 McrAutomatonBuilder]: Finished intersection with 113 states and 201 transitions. [2022-03-15 20:46:41,890 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:46:44,390 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 72 new interpolants: [38932#(or (<= (+ 3 i_5) n_0) (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0)), 38927#(or (<= (+ 3 i_5) n_0) (<= n_0 i_1) (< (+ i_1 1) n_0)), 38926#(or (<= (+ 3 i_5) n_0) (< i_1 n_0)), 38919#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= (+ 2 i_5) n_0)), 38915#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (< i_5 n_0)), 38925#(or (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0) (<= (+ 2 i_5) n_0)), 38953#(or (< 7 n_0) (<= n_0 6)), 38975#(or (< 7 n_0) (<= (+ 6 i_5) n_0) (<= n_0 6)), 38933#(or (< i_1 n_0) (<= (+ i_5 4) n_0)), 38923#(or (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0)), 38946#(or (<= (+ 5 i_5) n_0) (<= n_0 i_1) (< (+ i_1 1) n_0)), 38906#(or (< i_1 n_0) (< i_5 n_0)), 38941#(or (<= n_0 (+ 6 i_1)) (< (+ 7 i_1) n_0) (< i_5 n_0)), 38952#(or (<= (+ 5 i_5) n_0) (<= n_0 (+ 6 i_1)) (< (+ 7 i_1) n_0)), 38936#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= (+ i_5 4) n_0)), 38949#(or (<= (+ 5 i_5) n_0) (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0)), 38907#(or (< i_1 n_0) (<= (+ 2 i_5) n_0)), 38959#(or (<= (+ 6 i_5) n_0) (< i_1 n_0)), 38948#(or (<= (+ 5 i_5) n_0) (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1))), 38950#(or (<= (+ 5 i_5) n_0) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 38910#(or (<= n_0 i_1) (< (+ i_1 1) n_0) (<= (+ 2 i_5) n_0)), 38971#(or (<= (+ 7 i_5) n_0) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 38956#(or (< 7 n_0) (<= (+ 3 i_5) n_0) (<= n_0 6)), 38922#(or (<= n_0 (+ i_1 4)) (<= (+ 2 i_5) n_0) (< (+ 5 i_1) n_0)), 38917#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0)), 38942#(or (<= n_0 (+ 6 i_1)) (< (+ 7 i_1) n_0) (<= (+ 2 i_5) n_0)), 38911#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 38938#(or (<= (+ i_5 4) n_0) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 38963#(or (<= (+ 7 i_5) n_0) (< i_1 n_0)), 38937#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= (+ i_5 4) n_0)), 38940#(or (<= n_0 (+ 6 i_1)) (< (+ 7 i_1) n_0)), 38964#(or (<= (+ 7 i_5) n_0) (<= n_0 i_1) (< (+ i_1 1) n_0)), 38905#(< i_1 n_0), 38960#(or (<= (+ 6 i_5) n_0) (<= n_0 i_1) (< (+ i_1 1) n_0)), 38968#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= (+ 7 i_5) n_0)), 38924#(or (< i_5 n_0) (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0)), 38970#(or (<= (+ 6 i_5) n_0) (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0)), 38920#(or (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 38955#(or (< 7 n_0) (<= n_0 6) (<= (+ 2 i_5) n_0)), 38957#(or (< 7 n_0) (<= (+ i_5 4) n_0) (<= n_0 6)), 38928#(or (<= (+ 3 i_5) n_0) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 38939#(or (<= (+ i_5 4) n_0) (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0)), 38918#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (< i_5 n_0)), 38934#(or (<= n_0 i_1) (<= (+ i_5 4) n_0) (< (+ i_1 1) n_0)), 38943#(or (<= (+ 3 i_5) n_0) (<= n_0 (+ 6 i_1)) (< (+ 7 i_1) n_0)), 38913#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (<= (+ 2 i_5) n_0)), 38945#(or (<= (+ 5 i_5) n_0) (< i_1 n_0)), 38974#(or (<= n_0 (+ 6 i_1)) (<= (+ 7 i_5) n_0) (< (+ 7 i_1) n_0)), 38973#(or (<= n_0 (+ 6 i_1)) (<= (+ 6 i_5) n_0) (< (+ 7 i_1) n_0)), 38947#(or (<= (+ 5 i_5) n_0) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 38930#(or (<= n_0 (+ 3 i_1)) (<= (+ 3 i_5) n_0) (< (+ i_1 4) n_0)), 38958#(or (<= (+ 5 i_5) n_0) (< 7 n_0) (<= n_0 6)), 38965#(or (<= (+ 7 i_5) n_0) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 38909#(or (<= n_0 i_1) (< i_5 n_0) (< (+ i_1 1) n_0)), 38912#(or (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1)) (< i_5 n_0)), 38954#(or (< 7 n_0) (< i_5 n_0) (<= n_0 6)), 38916#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= (+ 2 i_5) n_0)), 38976#(or (< 7 n_0) (<= (+ 7 i_5) n_0) (<= n_0 6)), 38908#(or (<= n_0 i_1) (< (+ i_1 1) n_0)), 38935#(or (< (+ 2 i_1) n_0) (<= (+ i_5 4) n_0) (<= n_0 (+ i_1 1))), 38961#(or (<= (+ 6 i_5) n_0) (< (+ 2 i_1) n_0) (<= n_0 (+ i_1 1))), 38921#(or (<= n_0 (+ i_1 4)) (< i_5 n_0) (< (+ 5 i_1) n_0)), 38951#(or (<= (+ 5 i_5) n_0) (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0)), 38944#(or (<= n_0 (+ 6 i_1)) (< (+ 7 i_1) n_0) (<= (+ i_5 4) n_0)), 38929#(or (< (+ 3 i_1) n_0) (<= (+ 3 i_5) n_0) (<= n_0 (+ 2 i_1))), 38972#(or (<= (+ 7 i_5) n_0) (<= n_0 (+ 5 i_1)) (< (+ 6 i_1) n_0)), 38914#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1))), 38967#(or (<= n_0 (+ 3 i_1)) (< (+ i_1 4) n_0) (<= (+ 6 i_5) n_0)), 38969#(or (<= (+ 6 i_5) n_0) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 38966#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= (+ 7 i_5) n_0)), 38931#(or (<= (+ 3 i_5) n_0) (<= n_0 (+ i_1 4)) (< (+ 5 i_1) n_0)), 38962#(or (< (+ 3 i_1) n_0) (<= n_0 (+ 2 i_1)) (<= (+ 6 i_5) n_0))] [2022-03-15 20:46:44,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-03-15 20:46:44,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:46:44,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-03-15 20:46:44,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1043, Invalid=8077, Unknown=0, NotChecked=0, Total=9120 [2022-03-15 20:46:44,392 INFO L87 Difference]: Start difference. First operand 653 states and 1655 transitions. Second operand has 89 states, 89 states have (on average 2.056179775280899) internal successors, (183), 89 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have 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:00,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:00,587 INFO L93 Difference]: Finished difference Result 4668 states and 12334 transitions. [2022-03-15 20:47:00,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 371 states. [2022-03-15 20:47:00,588 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 2.056179775280899) internal successors, (183), 89 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 20:47:00,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:00,606 INFO L225 Difference]: With dead ends: 4668 [2022-03-15 20:47:00,606 INFO L226 Difference]: Without dead ends: 4626 [2022-03-15 20:47:00,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 448 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85502 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=27312, Invalid=174738, Unknown=0, NotChecked=0, Total=202050 [2022-03-15 20:47:00,622 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 469 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 2793 mSolverCounterSat, 842 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 3635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 842 IncrementalHoareTripleChecker+Valid, 2793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:00,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 139 Invalid, 3635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [842 Valid, 2793 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 20:47:00,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2022-03-15 20:47:00,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 1396. [2022-03-15 20:47:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1395 states have (on average 2.5799283154121864) internal successors, (3599), 1395 states have internal predecessors, (3599), 0 states have call successors, (0), 0 states have 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:00,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 3599 transitions. [2022-03-15 20:47:00,673 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 3599 transitions. Word has length 23 [2022-03-15 20:47:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:00,673 INFO L470 AbstractCegarLoop]: Abstraction has 1396 states and 3599 transitions. [2022-03-15 20:47:00,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 2.056179775280899) internal successors, (183), 89 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have 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:00,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 3599 transitions. [2022-03-15 20:47:00,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 20:47:00,677 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:00,677 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:00,702 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:47:00,891 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,SelfDestructingSolverStorable26 [2022-03-15 20:47:00,891 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:00,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:00,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1751489919, now seen corresponding path program 24 times [2022-03-15 20:47:00,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:00,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378051627] [2022-03-15 20:47:00,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:00,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:01,248 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:01,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378051627] [2022-03-15 20:47:01,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378051627] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:01,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338188286] [2022-03-15 20:47:01,248 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:47:01,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:01,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:01,249 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:47:01,250 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:47:01,281 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 20:47:01,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:01,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-15 20:47:01,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:01,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:02,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338188286] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:02,014 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:02,014 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2022-03-15 20:47:02,014 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [721511862] [2022-03-15 20:47:02,014 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:02,016 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:02,030 INFO L252 McrAutomatonBuilder]: Finished intersection with 124 states and 222 transitions. [2022-03-15 20:47:02,030 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:08,134 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 72 new interpolants: [47360#(and (or (< 0 (+ (* 5 f1_2) (* 3 f2_3))) (<= (+ (* f2_7 8) (* f1_6 13)) 0)) (or (< 0 (+ (* f2_7 8) (* f1_6 13))) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0))), 47333#(and (or (<= (+ f2_7 f1_6) 0) (< 0 (+ f2_3 f1_2))) (or (<= (+ f2_3 f1_2) 0) (< 0 (+ f2_7 f1_6)))), 47341#(and (or (<= (+ (* 5 f1_6) (* 3 f2_7)) 0) (< 0 (+ f2_3 f1_2))) (or (<= 1 (+ (* 5 f1_6) (* 3 f2_7))) (not (< 0 (+ f2_3 f1_2))))), 47371#(and (or (<= (+ (* f2_3 8) (* f1_2 13)) 0) (< 0 (+ (* 3 f1_6) (* 2 f2_7)))) (or (< 0 (+ (* f2_3 8) (* f1_2 13))) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0))), 47364#(and (or (< 0 (+ (* 5 f1_6) (* 3 f2_7))) (<= (+ (* 5 f2_3) (* f1_2 8)) 0)) (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (<= (+ (* 5 f1_6) (* 3 f2_7)) 0))), 47329#(and (or (< 0 f1_6) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0)) (or (<= f1_6 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3))))), 47373#(and (or (<= (+ (* f2_3 8) (* f1_2 13)) 0) (< 0 (+ (* 5 f2_7) (* f1_6 8)))) (or (<= (+ (* 5 f2_7) (* f1_6 8)) 0) (< 0 (+ (* f2_3 8) (* f1_2 13))))), 47340#(and (or (<= (+ (* 5 f1_6) (* 3 f2_7)) 0) (< 0 f1_2)) (or (<= 1 (+ (* 5 f1_6) (* 3 f2_7))) (not (< 0 f1_2)))), 47377#(and (or (not (< 0 (+ f2_7 f1_6))) (< 0 (+ (* 21 f1_2) (* f2_3 13)))) (or (<= (+ (* 21 f1_2) (* f2_3 13)) 0) (< 0 (+ f2_7 f1_6)))), 47321#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (= l_8 0)) (or (<= (+ (* 2 f1_2) f2_3) 0) (= l_8 1))), 47331#(and (or (<= (+ f2_7 f1_6) 0) (< 0 f1_2)) (or (<= 1 (+ f2_7 f1_6)) (<= f1_2 0))), 47324#(and (or (<= (+ (* 5 f2_3) (* f1_2 8)) 0) (= l_8 1)) (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (= l_8 0))), 47349#(and (or (< 0 (+ (* 5 f1_6) (* 3 f2_7))) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0)) (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ (* 5 f1_6) (* 3 f2_7)) 0))), 47362#(and (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (<= (+ f2_7 (* 2 f1_6)) 0)) (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* 5 f2_3) (* f1_2 8)) 0))), 47365#(and (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (<= (+ (* 5 f2_7) (* f1_6 8)) 0)) (or (< 0 (+ (* 5 f2_7) (* f1_6 8))) (<= (+ (* 5 f2_3) (* f1_2 8)) 0))), 47355#(and (or (< 0 (+ f2_7 f1_6)) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0)) (or (<= (+ f2_7 f1_6) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3))))), 47339#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0)) (or (< 0 (+ (* 3 f1_6) (* 2 f2_7))) (<= (+ (* 2 f1_2) f2_3) 0))), 47363#(and (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0)) (or (< 0 (+ (* 3 f1_6) (* 2 f2_7))) (<= (+ (* 5 f2_3) (* f1_2 8)) 0))), 47322#(and (or (<= (+ (* 2 f2_3) (* 3 f1_2)) 0) (= l_8 1)) (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (= l_8 0))), 47366#(and (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (<= (+ (* f2_7 8) (* f1_6 13)) 0)) (or (< 0 (+ (* f2_7 8) (* f1_6 13))) (<= (+ (* 5 f2_3) (* f1_2 8)) 0))), 47328#(and (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= f1_6 0)) (or (< 0 f1_6) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0))), 47309#(and (or (<= 1 (+ (* 21 f1_6) (* f2_7 13))) (<= (+ (* 21 f1_2) (* f2_3 13)) 0)) (or (< 0 (+ (* 21 f1_2) (* f2_3 13))) (<= (+ (* 21 f1_6) (* f2_7 13)) 0))), 47354#(and (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ (* f2_7 8) (* f1_6 13)) 0)) (or (< 0 (+ (* f2_7 8) (* f1_6 13))) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0))), 47323#(and (or (= l_8 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3)))) (or (<= (+ (* 5 f1_2) (* 3 f2_3)) 0) (= l_8 1))), 47281#(and (or (<= (+ (* 21 f1_6) (* f2_7 13)) 0) (< 0 f1_2)) (or (<= 1 (+ (* 21 f1_6) (* f2_7 13))) (<= f1_2 0))), 47380#(and (or (< 0 (+ (* 21 f1_2) (* f2_3 13))) (<= (+ (* 5 f1_6) (* 3 f2_7)) 0)) (or (< 0 (+ (* 5 f1_6) (* 3 f2_7))) (<= (+ (* 21 f1_2) (* f2_3 13)) 0))), 47381#(and (or (< 0 (+ (* 21 f1_2) (* f2_3 13))) (<= (+ (* 5 f2_7) (* f1_6 8)) 0)) (or (< 0 (+ (* 5 f2_7) (* f1_6 8))) (<= (+ (* 21 f1_2) (* f2_3 13)) 0))), 47361#(and (or (< 0 (+ f2_7 f1_6)) (<= (+ (* 5 f2_3) (* f1_2 8)) 0)) (or (not (< 0 (+ f2_7 f1_6))) (< 0 (+ (* 5 f2_3) (* f1_2 8))))), 47352#(and (or (< 0 (+ f2_3 f1_2)) (<= (+ (* f2_7 8) (* f1_6 13)) 0)) (or (<= (+ f2_3 f1_2) 0) (<= 1 (+ (* f2_7 8) (* f1_6 13))))), 47356#(and (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0)) (or (<= (+ f2_7 (* 2 f1_6)) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3))))), 47301#(and (or (<= 1 (+ (* 21 f1_6) (* f2_7 13))) (<= (+ (* 5 f2_3) (* f1_2 8)) 0)) (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (<= (+ (* 21 f1_6) (* f2_7 13)) 0))), 47379#(and (or (< 0 (+ (* 21 f1_2) (* f2_3 13))) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0)) (or (<= (+ (* 21 f1_2) (* f2_3 13)) 0) (< 0 (+ (* 3 f1_6) (* 2 f2_7))))), 47382#(and (or (< 0 (+ (* f2_7 8) (* f1_6 13))) (<= (+ (* 21 f1_2) (* f2_3 13)) 0)) (or (< 0 (+ (* 21 f1_2) (* f2_3 13))) (<= (+ (* f2_7 8) (* f1_6 13)) 0))), 47358#(and (or (<= (+ (* 5 f1_6) (* 3 f2_7)) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3)))) (or (< 0 (+ (* 5 f1_6) (* 3 f2_7))) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0))), 47374#(and (or (< 0 (+ (* f2_7 8) (* f1_6 13))) (<= (+ (* f2_3 8) (* f1_2 13)) 0)) (or (< 0 (+ (* f2_3 8) (* f1_2 13))) (<= (+ (* f2_7 8) (* f1_6 13)) 0))), 47348#(and (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0)) (or (< 0 (+ (* 3 f1_6) (* 2 f2_7))) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0))), 47285#(and (or (<= 1 (+ (* 21 f1_6) (* f2_7 13))) (<= (+ f2_3 f1_2) 0)) (or (< 0 (+ f2_3 f1_2)) (<= (+ (* 21 f1_6) (* f2_7 13)) 0))), 47376#(and (or (< 0 (+ (* 21 f1_2) (* f2_3 13))) (not (< 0 f1_6))) (or (< 0 f1_6) (<= (+ (* 21 f1_2) (* f2_3 13)) 0))), 47357#(and (or (<= (+ (* 3 f1_6) (* 2 f2_7)) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3)))) (or (< 0 (+ (* 3 f1_6) (* 2 f2_7))) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0))), 47325#(and (or (< 0 f1_6) (<= f1_2 0)) (or (<= f1_6 0) (< 0 f1_2))), 47372#(and (or (<= (+ (* 5 f1_6) (* 3 f2_7)) 0) (< 0 (+ (* f2_3 8) (* f1_2 13)))) (or (< 0 (+ (* 5 f1_6) (* 3 f2_7))) (<= (+ (* f2_3 8) (* f1_2 13)) 0))), 47337#(and (or (< 0 (+ f2_7 f1_6)) (<= (+ (* 2 f1_2) f2_3) 0)) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ f2_7 f1_6) 0))), 47336#(and (or (< 0 (+ f2_3 f1_2)) (<= (+ (* 3 f1_6) (* 2 f2_7)) 0)) (or (<= (+ f2_3 f1_2) 0) (<= 1 (+ (* 3 f1_6) (* 2 f2_7))))), 47375#(and (or (< 0 (+ (* 21 f1_2) (* f2_3 13))) (= l_8 0)) (or (<= (+ (* 21 f1_2) (* f2_3 13)) 0) (= l_8 1))), 47378#(and (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* 21 f1_2) (* f2_3 13)) 0)) (or (< 0 (+ (* 21 f1_2) (* f2_3 13))) (not (< 0 (+ f2_7 (* 2 f1_6)))))), 47326#(and (or (<= (+ f2_3 f1_2) 0) (< 0 f1_6)) (or (<= f1_6 0) (< 0 (+ f2_3 f1_2)))), 47345#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ (* 5 f2_7) (* f1_6 8)) 0)) (or (< 0 (+ (* 5 f2_7) (* f1_6 8))) (<= (+ (* 2 f1_2) f2_3) 0))), 47327#(and (or (< 0 f1_6) (<= (+ (* 2 f1_2) f2_3) 0)) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= f1_6 0))), 47368#(and (or (< 0 f1_6) (<= (+ (* f2_3 8) (* f1_2 13)) 0)) (or (not (< 0 f1_6)) (< 0 (+ (* f2_3 8) (* f1_2 13))))), 47370#(and (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* f2_3 8) (* f1_2 13)) 0)) (or (<= (+ f2_7 (* 2 f1_6)) 0) (< 0 (+ (* f2_3 8) (* f1_2 13))))), 47293#(and (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ (* 21 f1_6) (* f2_7 13)) 0)) (or (<= 1 (+ (* 21 f1_6) (* f2_7 13))) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0))), 47347#(and (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0)) (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ f2_7 (* 2 f1_6)) 0))), 47334#(and (or (<= (+ f2_7 (* 2 f1_6)) 0) (< 0 (+ f2_3 f1_2))) (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ f2_3 f1_2) 0))), 47342#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ (* 5 f1_6) (* 3 f2_7)) 0)) (or (< 0 (+ (* 5 f1_6) (* 3 f2_7))) (<= (+ (* 2 f1_2) f2_3) 0))), 47369#(and (or (not (< 0 (+ f2_7 f1_6))) (< 0 (+ (* f2_3 8) (* f1_2 13)))) (or (<= (+ (* f2_3 8) (* f1_2 13)) 0) (< 0 (+ f2_7 f1_6)))), 47350#(and (or (< 0 (+ (* 5 f2_7) (* f1_6 8))) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0)) (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ (* 5 f2_7) (* f1_6 8)) 0))), 47319#(and (or (<= f1_2 0) (= l_8 1)) (or (= l_8 0) (< 0 f1_2))), 47330#(and (or (< 0 (+ (* 5 f2_3) (* f1_2 8))) (not (< 0 f1_6))) (or (< 0 f1_6) (<= (+ (* 5 f2_3) (* f1_2 8)) 0))), 47297#(and (or (<= 1 (+ (* 21 f1_6) (* f2_7 13))) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0)) (or (<= (+ (* 21 f1_6) (* f2_7 13)) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3))))), 47344#(and (or (<= (+ (* 5 f2_7) (* f1_6 8)) 0) (< 0 (+ f2_3 f1_2))) (or (not (< 0 (+ f2_3 f1_2))) (<= 1 (+ (* 5 f2_7) (* f1_6 8))))), 47332#(and (or (<= 1 (+ f2_7 (* 2 f1_6))) (<= f1_2 0)) (or (<= (+ f2_7 (* 2 f1_6)) 0) (< 0 f1_2))), 47343#(and (or (<= (+ (* 5 f2_7) (* f1_6 8)) 0) (< 0 f1_2)) (or (<= f1_2 0) (<= 1 (+ (* 5 f2_7) (* f1_6 8))))), 47335#(and (or (<= (+ (* 3 f1_6) (* 2 f2_7)) 0) (< 0 f1_2)) (or (<= 1 (+ (* 3 f1_6) (* 2 f2_7))) (<= f1_2 0))), 47289#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ (* 21 f1_6) (* f2_7 13)) 0)) (or (<= 1 (+ (* 21 f1_6) (* f2_7 13))) (<= (+ (* 2 f1_2) f2_3) 0))), 47320#(and (or (< 0 (+ f2_3 f1_2)) (= l_8 0)) (or (<= (+ f2_3 f1_2) 0) (= l_8 1))), 47338#(and (or (< 0 (+ f2_7 (* 2 f1_6))) (<= (+ (* 2 f1_2) f2_3) 0)) (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ f2_7 (* 2 f1_6)) 0))), 47359#(and (or (<= (+ (* 5 f2_7) (* f1_6 8)) 0) (< 0 (+ (* 5 f1_2) (* 3 f2_3)))) (or (< 0 (+ (* 5 f2_7) (* f1_6 8))) (<= (+ (* 5 f1_2) (* 3 f2_3)) 0))), 47353#(and (or (< 0 (+ (* 2 f1_2) f2_3)) (<= (+ (* f2_7 8) (* f1_6 13)) 0)) (or (< 0 (+ (* f2_7 8) (* f1_6 13))) (<= (+ (* 2 f1_2) f2_3) 0))), 47305#(and (or (<= 1 (+ (* 21 f1_6) (* f2_7 13))) (<= (+ (* f2_3 8) (* f1_2 13)) 0)) (or (< 0 (+ (* f2_3 8) (* f1_2 13))) (<= (+ (* 21 f1_6) (* f2_7 13)) 0))), 47351#(and (or (<= (+ (* f2_7 8) (* f1_6 13)) 0) (< 0 f1_2)) (or (<= 1 (+ (* f2_7 8) (* f1_6 13))) (not (< 0 f1_2)))), 47346#(and (or (< 0 (+ (* 2 f2_3) (* 3 f1_2))) (<= (+ f2_7 f1_6) 0)) (or (< 0 (+ f2_7 f1_6)) (<= (+ (* 2 f2_3) (* 3 f1_2)) 0))), 47367#(and (or (< 0 (+ (* f2_3 8) (* f1_2 13))) (= l_8 0)) (or (<= (+ (* f2_3 8) (* f1_2 13)) 0) (= l_8 1)))] [2022-03-15 20:47:08,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-03-15 20:47:08,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:08,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-03-15 20:47:08,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=9264, Unknown=0, NotChecked=0, Total=9506 [2022-03-15 20:47:08,137 INFO L87 Difference]: Start difference. First operand 1396 states and 3599 transitions. Second operand has 91 states, 90 states have (on average 2.1444444444444444) internal successors, (193), 90 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have 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:15,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:15,787 INFO L93 Difference]: Finished difference Result 2128 states and 5696 transitions. [2022-03-15 20:47:15,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-15 20:47:15,788 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 90 states have (on average 2.1444444444444444) internal successors, (193), 90 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 20:47:15,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:15,792 INFO L225 Difference]: With dead ends: 2128 [2022-03-15 20:47:15,792 INFO L226 Difference]: Without dead ends: 2119 [2022-03-15 20:47:15,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 44 SyntacticMatches, 22 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5467 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=760, Invalid=27970, Unknown=0, NotChecked=0, Total=28730 [2022-03-15 20:47:15,795 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 155 mSDsluCounter, 3233 mSDsCounter, 0 mSdLazyCounter, 7323 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 7331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:15,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 1553 Invalid, 7331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7323 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-03-15 20:47:15,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2022-03-15 20:47:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1756. [2022-03-15 20:47:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1755 states have (on average 2.67977207977208) internal successors, (4703), 1755 states have internal predecessors, (4703), 0 states have call successors, (0), 0 states have 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:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 4703 transitions. [2022-03-15 20:47:15,823 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 4703 transitions. Word has length 24 [2022-03-15 20:47:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:15,823 INFO L470 AbstractCegarLoop]: Abstraction has 1756 states and 4703 transitions. [2022-03-15 20:47:15,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 90 states have (on average 2.1444444444444444) internal successors, (193), 90 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have 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:15,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 4703 transitions. [2022-03-15 20:47:15,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 20:47:15,828 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:15,828 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:15,853 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:47:16,042 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,SelfDestructingSolverStorable27 [2022-03-15 20:47:16,043 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:16,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:16,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1125097593, now seen corresponding path program 25 times [2022-03-15 20:47:16,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:16,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303240265] [2022-03-15 20:47:16,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:16,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:16,184 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:16,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303240265] [2022-03-15 20:47:16,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303240265] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:16,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936385405] [2022-03-15 20:47:16,184 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:47:16,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:16,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:16,188 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:47:16,189 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:47:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:16,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 20:47:16,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:16,485 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:47:16,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:47:16,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936385405] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:16,528 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:16,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 32 [2022-03-15 20:47:16,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1557268108] [2022-03-15 20:47:16,529 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:16,531 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:16,544 INFO L252 McrAutomatonBuilder]: Finished intersection with 123 states and 220 transitions. [2022-03-15 20:47:16,544 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:19,433 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 72 new interpolants: [53385#(or (< 6 n_0) (<= n_0 (+ 2 i_1)) (<= n_0 5)), 53382#(or (< 6 n_0) (<= (+ n_0 1) i_1) (<= n_0 5)), 53393#(or (<= n_0 (+ i_1 4)) (< (+ 5 i_5) n_0) (<= n_0 (+ i_5 4))), 53392#(or (<= n_0 (+ 3 i_5)) (< (+ i_5 4) n_0) (<= n_0 (+ i_1 4))), 53356#(or (<= n_0 i_5) (<= n_0 (+ i_1 4)) (< (+ i_5 1) n_0)), 53401#(<= n_0 6), 53383#(or (< 6 n_0) (<= n_0 i_1) (<= n_0 5)), 53345#(or (<= n_0 (+ 2 i_1)) (< i_5 n_0)), 53352#(or (<= n_0 (+ 3 i_1)) (< i_5 n_0)), 53379#(or (<= n_0 (+ 2 i_1)) (< (+ 5 i_5) n_0) (<= n_0 (+ i_5 4))), 53377#(or (<= n_0 (+ 2 i_1)) (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 53359#(or (<= n_0 i_5) (<= n_0 (+ 5 i_1)) (< (+ i_5 1) n_0)), 53398#(or (<= n_0 (+ 5 i_1)) (< (+ 5 i_5) n_0) (<= n_0 (+ i_5 4))), 53405#(<= i_5 3), 53339#(or (<= n_0 i_1) (< i_5 n_0)), 53355#(or (<= n_0 (+ i_1 4)) (< i_5 n_0)), 53346#(or (<= n_0 (+ 2 i_1)) (<= n_0 i_5) (< (+ i_5 1) n_0)), 53408#(<= i_5 0), 53358#(or (< i_5 n_0) (<= n_0 (+ 5 i_1))), 53343#(or (<= n_0 (+ i_1 1)) (< i_5 n_0)), 53344#(or (<= n_0 i_5) (<= n_0 (+ i_1 1)) (< (+ i_5 1) n_0)), 53353#(or (<= n_0 (+ 3 i_1)) (<= n_0 i_5) (< (+ i_5 1) n_0)), 53374#(or (<= (+ n_0 1) i_1) (<= n_0 (+ 5 i_5)) (< (+ 6 i_5) n_0)), 53349#(or (<= n_0 i_1) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 53400#(or (< 6 n_0) (<= n_0 (+ 5 i_1)) (<= n_0 5)), 53376#(or (<= n_0 (+ 5 i_5)) (<= n_0 (+ i_1 1)) (< (+ 6 i_5) n_0)), 53397#(or (<= n_0 (+ 3 i_5)) (< (+ i_5 4) n_0) (<= n_0 (+ 5 i_1))), 53362#(or (<= n_0 (+ 3 i_5)) (< (+ i_5 4) n_0)), 53370#(or (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5)) (<= n_0 (+ i_1 1))), 53363#(or (<= (+ n_0 1) i_1) (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 53386#(or (<= n_0 (+ 3 i_1)) (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 53391#(or (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5)) (<= n_0 (+ i_1 4))), 53407#(<= i_5 1), 53348#(or (<= (+ n_0 1) i_1) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 53337#(< i_5 n_0), 53354#(or (<= n_0 (+ 3 i_1)) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 53406#(<= i_5 2), 53387#(or (<= n_0 (+ 3 i_1)) (<= n_0 (+ 3 i_5)) (< (+ i_5 4) n_0)), 53389#(or (<= n_0 (+ 3 i_1)) (<= n_0 (+ 5 i_5)) (< (+ 6 i_5) n_0)), 53384#(or (< 6 n_0) (<= n_0 (+ i_1 1)) (<= n_0 5)), 53341#(or (<= (+ n_0 1) i_1) (<= n_0 i_5) (< (+ i_5 1) n_0)), 53380#(or (<= n_0 (+ 2 i_1)) (<= n_0 (+ 5 i_5)) (< (+ 6 i_5) n_0)), 53338#(or (<= (+ n_0 1) i_1) (< i_5 n_0)), 53404#(<= i_5 4), 53342#(or (<= n_0 i_1) (<= n_0 i_5) (< (+ i_5 1) n_0)), 53357#(or (<= n_0 (+ i_1 4)) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 53396#(or (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5)) (<= n_0 (+ 5 i_1))), 53364#(or (<= (+ n_0 1) i_1) (<= n_0 (+ 3 i_5)) (< (+ i_5 4) n_0)), 53360#(or (<= n_0 (+ 5 i_1)) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 53399#(or (<= n_0 (+ 5 i_5)) (< (+ 6 i_5) n_0) (<= n_0 (+ 5 i_1))), 53390#(or (< 6 n_0) (<= n_0 (+ 3 i_1)) (<= n_0 5)), 53340#(or (<= n_0 i_5) (< (+ i_5 1) n_0)), 53367#(or (< (+ 5 i_5) n_0) (<= n_0 (+ i_5 4))), 53351#(or (<= n_0 (+ 2 i_1)) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 53394#(or (<= n_0 (+ 5 i_5)) (<= n_0 (+ i_1 4)) (< (+ 6 i_5) n_0)), 53395#(or (< 6 n_0) (<= n_0 (+ i_1 4)) (<= n_0 5)), 53347#(or (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 53375#(or (<= n_0 i_1) (<= n_0 (+ 5 i_5)) (< (+ 6 i_5) n_0)), 53378#(or (<= n_0 (+ 3 i_5)) (<= n_0 (+ 2 i_1)) (< (+ i_5 4) n_0)), 53369#(or (<= n_0 i_1) (< (+ 5 i_5) n_0) (<= n_0 (+ i_5 4))), 53403#(<= i_5 5), 53361#(or (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 53368#(or (<= (+ n_0 1) i_1) (< (+ 5 i_5) n_0) (<= n_0 (+ i_5 4))), 53381#(or (< 6 n_0) (<= n_0 5)), 53350#(or (<= n_0 (+ i_1 1)) (<= n_0 (+ i_5 1)) (< (+ 2 i_5) n_0)), 53373#(or (<= n_0 (+ 5 i_5)) (< (+ 6 i_5) n_0)), 53365#(or (<= n_0 i_1) (< (+ 3 i_5) n_0) (<= n_0 (+ 2 i_5))), 53372#(or (<= n_0 (+ i_1 1)) (< (+ 5 i_5) n_0) (<= n_0 (+ i_5 4))), 53366#(or (<= n_0 (+ 3 i_5)) (<= n_0 i_1) (< (+ i_5 4) n_0)), 53402#(<= i_5 6), 53371#(or (<= n_0 (+ 3 i_5)) (< (+ i_5 4) n_0) (<= n_0 (+ i_1 1))), 53388#(or (<= n_0 (+ 3 i_1)) (< (+ 5 i_5) n_0) (<= n_0 (+ i_5 4)))] [2022-03-15 20:47:19,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-03-15 20:47:19,433 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:19,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-03-15 20:47:19,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1150, Invalid=9562, Unknown=0, NotChecked=0, Total=10712 [2022-03-15 20:47:19,435 INFO L87 Difference]: Start difference. First operand 1756 states and 4703 transitions. Second operand has 90 states, 90 states have (on average 2.1444444444444444) internal successors, (193), 90 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 20:53:32,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2814 states. [2022-03-15 20:53:32,487 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 20:53:32,487 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 20:53:33,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2975 GetRequests, 67 SyntacticMatches, 8 SemanticMatches, 2899 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4668731 ImplicationChecksByTransitivity, 339.5s TimeCoverageRelationStatistics Valid=1895325, Invalid=6517575, Unknown=0, NotChecked=0, Total=8412900 [2022-03-15 20:53:33,084 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 1001 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 6252 mSolverCounterSat, 1036 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 7288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1036 IncrementalHoareTripleChecker+Valid, 6252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:53:33,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1001 Valid, 113 Invalid, 7288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1036 Valid, 6252 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 20:53:33,086 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2022-03-15 20:53:33,102 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:53:33,289 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,SelfDestructingSolverStorable28 [2022-03-15 20:53:33,289 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (1756states) and FLOYD_HOARE automaton (currently 2814 states, 90 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 2901 known predicates. [2022-03-15 20:53:33,291 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 20:53:33,291 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 20:53:33,293 INFO L732 BasicCegarLoop]: Path program histogram: [25, 2, 1, 1] [2022-03-15 20:53:33,295 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:53:33,295 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:53:33,296 INFO L202 PluginConnector]: Adding new model fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:53:33 BasicIcfg [2022-03-15 20:53:33,296 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:53:33,297 INFO L158 Benchmark]: Toolchain (without parser) took 681679.90ms. Allocated memory was 177.2MB in the beginning and 7.9GB in the end (delta: 7.8GB). Free memory was 134.3MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-03-15 20:53:33,297 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:53:33,297 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.49ms. Allocated memory is still 177.2MB. Free memory was 134.2MB in the beginning and 132.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 20:53:33,297 INFO L158 Benchmark]: Boogie Preprocessor took 14.97ms. Allocated memory is still 177.2MB. Free memory was 132.6MB in the beginning and 131.7MB in the end (delta: 914.8kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:53:33,297 INFO L158 Benchmark]: RCFGBuilder took 265.85ms. Allocated memory is still 177.2MB. Free memory was 131.7MB in the beginning and 121.6MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 20:53:33,298 INFO L158 Benchmark]: TraceAbstraction took 681372.61ms. Allocated memory was 177.2MB in the beginning and 7.9GB in the end (delta: 7.8GB). Free memory was 121.1MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-03-15 20:53:33,298 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.49ms. Allocated memory is still 177.2MB. Free memory was 134.2MB in the beginning and 132.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.97ms. Allocated memory is still 177.2MB. Free memory was 132.6MB in the beginning and 131.7MB in the end (delta: 914.8kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 265.85ms. Allocated memory is still 177.2MB. Free memory was 131.7MB in the beginning and 121.6MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 681372.61ms. Allocated memory was 177.2MB in the beginning and 7.9GB in the end (delta: 7.8GB). Free memory was 121.1MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 24 PlacesBefore, 20 PlacesAfterwards, 19 TransitionsBefore, 15 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 36 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 36, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 36, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (1756states) and FLOYD_HOARE automaton (currently 2814 states, 90 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 2901 known predicates. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (1756states) and FLOYD_HOARE automaton (currently 2814 states, 90 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 2901 known predicates. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (1756states) and FLOYD_HOARE automaton (currently 2814 states, 90 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 2901 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 28 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 681.2s, OverallIterations: 29, TraceHistogramMax: 8, PathProgramHistogramMax: 25, EmptinessCheckTime: 0.0s, AutomataDifference: 623.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6228 SdHoareTripleChecker+Valid, 24.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6228 mSDsluCounter, 5870 SdHoareTripleChecker+Invalid, 20.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14200 mSDsCounter, 5844 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51880 IncrementalHoareTripleChecker+Invalid, 57724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5844 mSolverCounterUnsat, 341 mSDtfsCounter, 51880 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9652 GetRequests, 1129 SyntacticMatches, 176 SemanticMatches, 8346 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6375309 ImplicationChecksByTransitivity, 582.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1756occurred in iteration=28, InterpolantAutomatonStates: 4517, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 12796 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 967 NumberOfCodeBlocks, 967 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 1353 ConstructedInterpolants, 0 QuantifiedInterpolants, 10910 SizeOfPredicates, 59 NumberOfNonLiveVariables, 2203 ConjunctsInSsa, 464 ConjunctsInUnsatCore, 81 InterpolantComputations, 3 PerfectInterpolantSequences, 769/1861 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown