/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/bench/exp1x3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:50:24,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:50:24,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:50:24,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:50:24,565 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:50:24,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:50:24,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:50:24,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:50:24,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:50:24,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:50:24,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:50:24,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:50:24,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:50:24,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:50:24,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:50:24,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:50:24,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:50:24,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:50:24,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:50:24,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:50:24,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:50:24,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:50:24,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:50:24,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:50:24,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:50:24,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:50:24,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:50:24,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:50:24,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:50:24,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:50:24,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:50:24,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:50:24,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:50:24,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:50:24,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:50:24,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:50:24,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:50:24,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:50:24,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:50:24,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:50:24,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:50:24,605 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:50:24,633 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:50:24,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:50:24,635 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:50:24,635 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:50:24,635 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:50:24,635 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:50:24,635 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:50:24,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:50:24,636 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:50:24,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:50:24,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:50:24,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:50:24,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:50:24,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:50:24,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:50:24,637 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:50:24,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:50:24,637 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:50:24,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:50:24,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:50:24,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:50:24,638 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:50:24,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:50:24,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:50:24,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:50:24,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:50:24,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:50:24,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:50:24,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:50:24,639 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:50:24,640 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:50:24,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:50:24,640 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:50:24,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:50:24,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:50:24,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:50:24,820 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 20:50:24,820 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 20:50:24,821 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp1x3.wvr.bpl [2022-03-15 20:50:24,822 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp1x3.wvr.bpl' [2022-03-15 20:50:24,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:50:24,849 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 20:50:24,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:50:24,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:50:24,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:50:24,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:50:24" (1/1) ... [2022-03-15 20:50:24,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:50:24" (1/1) ... [2022-03-15 20:50:24,873 INFO L137 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 20:50:24,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:50:24,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:50:24,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:50:24,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:50:24,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:50:24" (1/1) ... [2022-03-15 20:50:24,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:50:24" (1/1) ... [2022-03-15 20:50:24,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:50:24" (1/1) ... [2022-03-15 20:50:24,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:50:24" (1/1) ... [2022-03-15 20:50:24,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:50:24" (1/1) ... [2022-03-15 20:50:24,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:50:24" (1/1) ... [2022-03-15 20:50:24,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:50:24" (1/1) ... [2022-03-15 20:50:24,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:50:24,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:50:24,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:50:24,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:50:24,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:50:24" (1/1) ... [2022-03-15 20:50:24,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:50:24,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:24,924 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:50:24,943 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:50:24,953 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 20:50:24,953 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 20:50:24,953 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 20:50:24,954 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 20:50:24,954 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 20:50:24,954 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 20:50:24,954 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 20:50:24,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:50:24,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:50:24,954 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:50:24,989 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:50:24,990 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:50:25,038 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:50:25,042 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:50:25,043 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 20:50:25,047 INFO L202 PluginConnector]: Adding new model exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:50:25 BoogieIcfgContainer [2022-03-15 20:50:25,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:50:25,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:50:25,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:50:25,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:50:25,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:50:24" (1/2) ... [2022-03-15 20:50:25,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291f5206 and model type exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:50:25, skipping insertion in model container [2022-03-15 20:50:25,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:50:25" (2/2) ... [2022-03-15 20:50:25,053 INFO L111 eAbstractionObserver]: Analyzing ICFG exp1x3.wvr.bpl [2022-03-15 20:50:25,056 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:50:25,056 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:50:25,056 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 20:50:25,056 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:50:25,076 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 20:50:25,105 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:50:25,112 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:50:25,112 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 20:50:25,121 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:50:25,131 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 19 transitions, 54 flow [2022-03-15 20:50:25,134 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 19 transitions, 54 flow [2022-03-15 20:50:25,135 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 19 transitions, 54 flow [2022-03-15 20:50:25,149 INFO L129 PetriNetUnfolder]: 2/17 cut-off events. [2022-03-15 20:50:25,149 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 20:50:25,151 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 4. Compared 15 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:50:25,152 INFO L116 LiptonReduction]: Number of co-enabled transitions 48 [2022-03-15 20:50:25,259 INFO L131 LiptonReduction]: Checked pairs total: 37 [2022-03-15 20:50:25,259 INFO L133 LiptonReduction]: Total number of compositions: 7 [2022-03-15 20:50:25,264 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 13 transitions, 42 flow [2022-03-15 20:50:25,272 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-03-15 20:50:25,282 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:25,283 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:25,283 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:25,287 INFO L85 PathProgramCache]: Analyzing trace with hash -905168883, now seen corresponding path program 1 times [2022-03-15 20:50:25,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:25,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681170539] [2022-03-15 20:50:25,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:25,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:25,392 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:50:25,392 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:25,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681170539] [2022-03-15 20:50:25,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681170539] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:50:25,393 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:50:25,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 20:50:25,394 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [842295537] [2022-03-15 20:50:25,394 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:25,396 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:25,404 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 14 transitions. [2022-03-15 20:50:25,404 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:25,489 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:50:25,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:50:25,490 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:25,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:50:25,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:50:25,505 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:25,523 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2022-03-15 20:50:25,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:50:25,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-03-15 20:50:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:25,530 INFO L225 Difference]: With dead ends: 21 [2022-03-15 20:50:25,530 INFO L226 Difference]: Without dead ends: 18 [2022-03-15 20:50:25,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:50:25,533 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:25,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:50:25,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-03-15 20:50:25,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-03-15 20:50:25,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:25,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-03-15 20:50:25,554 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 32 transitions. Word has length 8 [2022-03-15 20:50:25,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:25,555 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 32 transitions. [2022-03-15 20:50:25,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:25,556 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 32 transitions. [2022-03-15 20:50:25,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:50:25,556 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:25,556 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:25,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:50:25,557 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:25,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:25,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2004511607, now seen corresponding path program 1 times [2022-03-15 20:50:25,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:25,559 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895945787] [2022-03-15 20:50:25,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:25,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:25,589 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:50:25,589 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:25,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895945787] [2022-03-15 20:50:25,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895945787] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:50:25,590 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:50:25,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:50:25,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [94833617] [2022-03-15 20:50:25,590 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:25,592 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:25,594 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2022-03-15 20:50:25,594 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:25,634 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [115#(< x1 n)] [2022-03-15 20:50:25,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 20:50:25,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:25,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 20:50:25,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-15 20:50:25,636 INFO L87 Difference]: Start difference. First operand 18 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:25,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:25,697 INFO L93 Difference]: Finished difference Result 20 states and 34 transitions. [2022-03-15 20:50:25,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:50:25,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-03-15 20:50:25,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:25,698 INFO L225 Difference]: With dead ends: 20 [2022-03-15 20:50:25,698 INFO L226 Difference]: Without dead ends: 17 [2022-03-15 20:50:25,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:50:25,699 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:25,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 1 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:50:25,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-03-15 20:50:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2022-03-15 20:50:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 26 transitions. [2022-03-15 20:50:25,702 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 26 transitions. Word has length 9 [2022-03-15 20:50:25,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:25,702 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 26 transitions. [2022-03-15 20:50:25,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 26 transitions. [2022-03-15 20:50:25,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:50:25,703 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:25,703 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:25,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:50:25,703 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:25,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:25,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2034809054, now seen corresponding path program 1 times [2022-03-15 20:50:25,705 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:25,705 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156225187] [2022-03-15 20:50:25,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:25,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:25,725 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:50:25,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:25,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156225187] [2022-03-15 20:50:25,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156225187] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:25,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568395817] [2022-03-15 20:50:25,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:25,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:25,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:25,729 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:50:25,732 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:50:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:25,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 20:50:25,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:25,816 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:50:25,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:25,840 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:50:25,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568395817] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:25,840 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:25,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-03-15 20:50:25,841 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [482128067] [2022-03-15 20:50:25,841 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:25,841 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:25,843 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2022-03-15 20:50:25,843 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:25,893 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [222#(< x1 n), 223#(or (not (< x1 n)) (< (* 2 x1) n))] [2022-03-15 20:50:25,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:50:25,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:25,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:50:25,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:50:25,894 INFO L87 Difference]: Start difference. First operand 15 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:25,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:25,985 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2022-03-15 20:50:25,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:50:25,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-03-15 20:50:25,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:25,987 INFO L225 Difference]: With dead ends: 26 [2022-03-15 20:50:25,987 INFO L226 Difference]: Without dead ends: 26 [2022-03-15 20:50:25,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:50:25,990 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:25,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 1 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:50:25,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-03-15 20:50:25,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2022-03-15 20:50:25,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:25,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 36 transitions. [2022-03-15 20:50:25,998 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 36 transitions. Word has length 9 [2022-03-15 20:50:25,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:25,998 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 36 transitions. [2022-03-15 20:50:25,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 36 transitions. [2022-03-15 20:50:25,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:50:25,999 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:25,999 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:26,022 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:50:26,199 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:50:26,200 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:26,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:26,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1345452858, now seen corresponding path program 1 times [2022-03-15 20:50:26,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:26,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341795668] [2022-03-15 20:50:26,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:26,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:26,268 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:50:26,268 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:26,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341795668] [2022-03-15 20:50:26,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341795668] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:26,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552758223] [2022-03-15 20:50:26,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:26,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:26,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:26,270 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:50:26,271 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:50:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:26,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:50:26,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:26,410 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:50:26,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:26,461 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:50:26,461 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552758223] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:26,461 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:26,461 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 2] total 3 [2022-03-15 20:50:26,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [157231650] [2022-03-15 20:50:26,462 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:26,462 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:26,467 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 26 transitions. [2022-03-15 20:50:26,467 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:26,596 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [355#(and (<= (* 2 x1) x2) (<= x2 (* 2 x1)))] [2022-03-15 20:50:26,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 20:50:26,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:26,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 20:50:26,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:50:26,597 INFO L87 Difference]: Start difference. First operand 20 states and 36 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:26,643 INFO L93 Difference]: Finished difference Result 51 states and 92 transitions. [2022-03-15 20:50:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 20:50:26,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:50:26,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:26,644 INFO L225 Difference]: With dead ends: 51 [2022-03-15 20:50:26,644 INFO L226 Difference]: Without dead ends: 48 [2022-03-15 20:50:26,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:50:26,645 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:26,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 1 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:50:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-15 20:50:26,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2022-03-15 20:50:26,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 68 transitions. [2022-03-15 20:50:26,657 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 68 transitions. Word has length 10 [2022-03-15 20:50:26,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:26,657 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 68 transitions. [2022-03-15 20:50:26,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 68 transitions. [2022-03-15 20:50:26,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:50:26,658 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:26,658 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:26,676 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:50:26,859 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:50:26,859 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:26,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:26,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2059131607, now seen corresponding path program 2 times [2022-03-15 20:50:26,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:26,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275465286] [2022-03-15 20:50:26,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:26,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:26,893 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:50:26,893 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:26,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275465286] [2022-03-15 20:50:26,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275465286] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:50:26,893 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:50:26,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:50:26,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2073383745] [2022-03-15 20:50:26,893 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:26,894 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:26,895 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2022-03-15 20:50:26,895 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:26,926 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [475#(< x2 n)] [2022-03-15 20:50:26,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 20:50:26,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:26,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 20:50:26,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-15 20:50:26,926 INFO L87 Difference]: Start difference. First operand 32 states and 68 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:26,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:26,967 INFO L93 Difference]: Finished difference Result 35 states and 71 transitions. [2022-03-15 20:50:26,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:50:26,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:50:26,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:26,968 INFO L225 Difference]: With dead ends: 35 [2022-03-15 20:50:26,968 INFO L226 Difference]: Without dead ends: 34 [2022-03-15 20:50:26,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:50:26,968 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 9 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:26,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 1 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:50:26,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-03-15 20:50:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-03-15 20:50:26,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 67 transitions. [2022-03-15 20:50:26,971 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 67 transitions. Word has length 10 [2022-03-15 20:50:26,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:26,971 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 67 transitions. [2022-03-15 20:50:26,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 67 transitions. [2022-03-15 20:50:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:50:26,972 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:26,972 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:26,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 20:50:26,972 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:26,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:26,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1240610270, now seen corresponding path program 2 times [2022-03-15 20:50:26,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:26,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530902773] [2022-03-15 20:50:26,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:26,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:26,997 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:26,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530902773] [2022-03-15 20:50:26,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530902773] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:26,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676829990] [2022-03-15 20:50:26,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:50:26,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:26,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:27,010 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:50:27,011 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:50:27,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:50:27,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:27,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:50:27,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:27,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:27,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676829990] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:27,104 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:27,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-03-15 20:50:27,105 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [446492818] [2022-03-15 20:50:27,105 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:27,105 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:27,106 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 33 transitions. [2022-03-15 20:50:27,106 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:27,207 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [649#(or (<= n x1) (<= n x2) (< (* 2 x1) n)), 648#(or (< x1 n) (<= n x2)), 647#(or (not (< x1 n)) (< (* 2 x1) n)), 646#(< x1 n)] [2022-03-15 20:50:27,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:50:27,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:27,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:50:27,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:50:27,208 INFO L87 Difference]: Start difference. First operand 32 states and 67 transitions. Second operand has 10 states, 10 states have (on average 2.5) 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:50:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:27,435 INFO L93 Difference]: Finished difference Result 84 states and 154 transitions. [2022-03-15 20:50:27,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 20:50:27,435 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) 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:50:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:27,436 INFO L225 Difference]: With dead ends: 84 [2022-03-15 20:50:27,436 INFO L226 Difference]: Without dead ends: 73 [2022-03-15 20:50:27,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:50:27,437 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 57 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:27,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 1 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:50:27,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-03-15 20:50:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 45. [2022-03-15 20:50:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 44 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 107 transitions. [2022-03-15 20:50:27,441 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 107 transitions. Word has length 11 [2022-03-15 20:50:27,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:27,441 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 107 transitions. [2022-03-15 20:50:27,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) 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:50:27,441 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 107 transitions. [2022-03-15 20:50:27,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:50:27,442 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:27,442 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:27,459 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:50:27,655 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:50:27,655 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:27,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:27,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2115136169, now seen corresponding path program 3 times [2022-03-15 20:50:27,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:27,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965865067] [2022-03-15 20:50:27,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:27,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:27,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:27,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965865067] [2022-03-15 20:50:27,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965865067] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:27,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416873525] [2022-03-15 20:50:27,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:50:27,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:27,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:27,683 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:50:27,684 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:50:27,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 20:50:27,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:27,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:50:27,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:27,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:27,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416873525] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:27,773 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:27,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-03-15 20:50:27,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1785544911] [2022-03-15 20:50:27,774 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:27,774 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:27,775 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 33 transitions. [2022-03-15 20:50:27,775 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:27,889 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [926#(or (not (< x1 n)) (< x2 n) (< (* 2 x1) n)), 924#(or (not (< x1 n)) (< (* 2 x1) n)), 923#(< x1 n), 928#(or (< (* x1 4) n) (< x2 n) (<= n (* 2 x1))), 925#(or (< x1 n) (< x2 n)), 927#(or (< (* x1 4) n) (<= n (* 2 x1)))] [2022-03-15 20:50:27,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:50:27,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:27,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:50:27,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:50:27,891 INFO L87 Difference]: Start difference. First operand 45 states and 107 transitions. Second operand has 12 states, 12 states have (on average 2.25) 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:50:28,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:28,064 INFO L93 Difference]: Finished difference Result 69 states and 140 transitions. [2022-03-15 20:50:28,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:50:28,064 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) 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:50:28,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:28,065 INFO L225 Difference]: With dead ends: 69 [2022-03-15 20:50:28,065 INFO L226 Difference]: Without dead ends: 67 [2022-03-15 20:50:28,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:50:28,065 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 68 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:28,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 1 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:50:28,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-03-15 20:50:28,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2022-03-15 20:50:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 2.375) internal successors, (114), 48 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 114 transitions. [2022-03-15 20:50:28,069 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 114 transitions. Word has length 11 [2022-03-15 20:50:28,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:28,069 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 114 transitions. [2022-03-15 20:50:28,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) 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:50:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 114 transitions. [2022-03-15 20:50:28,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:50:28,070 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:28,070 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:28,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 20:50:28,283 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:50:28,283 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:28,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:28,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1144735891, now seen corresponding path program 4 times [2022-03-15 20:50:28,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:28,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544600008] [2022-03-15 20:50:28,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:28,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:28,328 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:50:28,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:28,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544600008] [2022-03-15 20:50:28,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544600008] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:28,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632290776] [2022-03-15 20:50:28,328 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:50:28,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:28,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:28,329 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:50:28,331 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:50:28,349 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:50:28,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:28,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:50:28,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:28,453 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:50:28,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:28,497 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:50:28,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632290776] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:28,498 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:28,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 3] total 5 [2022-03-15 20:50:28,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1848211843] [2022-03-15 20:50:28,498 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:28,499 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:28,500 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 42 transitions. [2022-03-15 20:50:28,500 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:28,696 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1188#(and (<= (* x1 4) x2) (<= x2 (* x1 4))), 1187#(and (<= (* 2 x1) x2) (<= x2 (* 2 x1)))] [2022-03-15 20:50:28,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 20:50:28,696 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:28,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 20:50:28,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:50:28,697 INFO L87 Difference]: Start difference. First operand 49 states and 114 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:28,773 INFO L93 Difference]: Finished difference Result 116 states and 230 transitions. [2022-03-15 20:50:28,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:50:28,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:50:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:28,774 INFO L225 Difference]: With dead ends: 116 [2022-03-15 20:50:28,774 INFO L226 Difference]: Without dead ends: 113 [2022-03-15 20:50:28,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 9 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:50:28,775 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:28,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 1 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:50:28,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-03-15 20:50:28,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 66. [2022-03-15 20:50:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.3846153846153846) internal successors, (155), 65 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 155 transitions. [2022-03-15 20:50:28,780 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 155 transitions. Word has length 12 [2022-03-15 20:50:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:28,780 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 155 transitions. [2022-03-15 20:50:28,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:28,780 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 155 transitions. [2022-03-15 20:50:28,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:50:28,780 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:28,780 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:28,801 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:50:28,981 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:50:28,981 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:28,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:28,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1302613680, now seen corresponding path program 5 times [2022-03-15 20:50:28,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:28,983 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865655531] [2022-03-15 20:50:28,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:28,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:29,011 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:29,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865655531] [2022-03-15 20:50:29,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865655531] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:29,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459592272] [2022-03-15 20:50:29,011 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:50:29,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:29,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:29,021 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:50:29,022 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:50:29,039 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:50:29,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:29,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:50:29,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:50:29,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:50:29,128 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459592272] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:29,128 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:29,128 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2022-03-15 20:50:29,128 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1488789128] [2022-03-15 20:50:29,128 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:29,129 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:29,130 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 40 transitions. [2022-03-15 20:50:29,130 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:29,345 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [1518#(or (not (< x1 n)) (< (* 2 x1) n)), 1515#(or (not (< x2 n)) (<= (+ 3 (* 2 x2)) n)), 1519#(or (<= (+ 2 (* 2 x2)) (* 2 x1)) (not (< x2 n))), 1516#(or (not (< x2 n)) (<= (+ 2 (* 2 x2)) x1)), 1521#(or (< (* x1 8) n) (<= n (* x1 4))), 1517#(< x1 n), 1520#(or (< (* x1 4) n) (<= n (* 2 x1)))] [2022-03-15 20:50:29,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:50:29,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:29,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:50:29,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-03-15 20:50:29,346 INFO L87 Difference]: Start difference. First operand 66 states and 155 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:30,484 INFO L93 Difference]: Finished difference Result 210 states and 413 transitions. [2022-03-15 20:50:30,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 20:50:30,484 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:50:30,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:30,485 INFO L225 Difference]: With dead ends: 210 [2022-03-15 20:50:30,485 INFO L226 Difference]: Without dead ends: 210 [2022-03-15 20:50:30,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=717, Invalid=3573, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 20:50:30,487 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 153 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:30,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 1 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:50:30,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-03-15 20:50:30,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 88. [2022-03-15 20:50:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 2.5057471264367814) internal successors, (218), 87 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 218 transitions. [2022-03-15 20:50:30,492 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 218 transitions. Word has length 12 [2022-03-15 20:50:30,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:30,492 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 218 transitions. [2022-03-15 20:50:30,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 218 transitions. [2022-03-15 20:50:30,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:50:30,493 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:30,493 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:30,509 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:50:30,707 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:50:30,707 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:30,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:30,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1127098345, now seen corresponding path program 6 times [2022-03-15 20:50:30,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:30,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424527954] [2022-03-15 20:50:30,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:30,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:30,741 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:50:30,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:30,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424527954] [2022-03-15 20:50:30,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424527954] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:30,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019044928] [2022-03-15 20:50:30,742 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:50:30,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:30,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:30,743 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:50:30,743 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:50:30,760 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:50:30,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:30,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:50:30,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:30,819 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:50:30,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:30,850 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:50:30,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019044928] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:30,851 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:30,851 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 20:50:30,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1594365369] [2022-03-15 20:50:30,851 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:30,851 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:30,853 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 51 transitions. [2022-03-15 20:50:30,853 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:31,094 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [2084#(< x1 n), 2088#(or (<= n x1) (<= n x2) (< (* 2 x1) n)), 2089#(or (<= n x1) (< (* 2 x1) n) (<= n (* 2 x2))), 2092#(or (< (* x1 4) n) (<= n (* 2 x1)) (<= n (* 2 x2))), 2087#(or (not (< x1 n)) (< (* 2 x1) n)), 2085#(or (< x1 n) (<= n x2)), 2086#(or (< x1 n) (<= n (* 2 x2))), 2091#(or (< (* x1 4) n) (<= n x2) (<= n (* 2 x1))), 2090#(or (< (* x1 4) n) (<= n (* 2 x1)))] [2022-03-15 20:50:31,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 20:50:31,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:31,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 20:50:31,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-03-15 20:50:31,095 INFO L87 Difference]: Start difference. First operand 88 states and 218 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) 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:50:32,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:32,160 INFO L93 Difference]: Finished difference Result 293 states and 590 transitions. [2022-03-15 20:50:32,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 20:50:32,161 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) 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:50:32,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:32,162 INFO L225 Difference]: With dead ends: 293 [2022-03-15 20:50:32,162 INFO L226 Difference]: Without dead ends: 268 [2022-03-15 20:50:32,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1105, Invalid=4747, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 20:50:32,165 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 152 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:32,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 1 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:50:32,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-03-15 20:50:32,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 137. [2022-03-15 20:50:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 2.7573529411764706) internal successors, (375), 136 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 375 transitions. [2022-03-15 20:50:32,171 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 375 transitions. Word has length 13 [2022-03-15 20:50:32,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:32,172 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 375 transitions. [2022-03-15 20:50:32,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) 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:50:32,172 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 375 transitions. [2022-03-15 20:50:32,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:50:32,172 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:32,173 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:32,192 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:50:32,377 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:50:32,378 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:32,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:32,378 INFO L85 PathProgramCache]: Analyzing trace with hash -2076022850, now seen corresponding path program 7 times [2022-03-15 20:50:32,379 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:32,379 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658792941] [2022-03-15 20:50:32,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:32,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:32,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:32,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:32,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658792941] [2022-03-15 20:50:32,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658792941] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:32,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429283210] [2022-03-15 20:50:32,411 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:50:32,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:32,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:32,412 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:50:32,413 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:50:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:32,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:50:32,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:32,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:32,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429283210] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:32,519 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:32,519 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 20:50:32,519 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [640885812] [2022-03-15 20:50:32,519 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:32,520 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:32,521 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 51 transitions. [2022-03-15 20:50:32,521 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:32,838 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [2861#(or (< (* x1 8) n) (<= n (* x1 4))), 2858#(< x1 n), 2869#(or (< (* x1 8) n) (<= n (* x1 4)) (<= (+ (* 2 x2) 1) n)), 2863#(or (not (< x1 n)) (< x2 n) (< (* 2 x1) n)), 2860#(or (< (* x1 4) n) (<= n (* 2 x1))), 2864#(or (< (* x1 4) n) (< x2 n) (<= n (* 2 x1))), 2867#(or (not (< x1 n)) (<= (+ (* 2 x2) 1) n) (< (* 2 x1) n)), 2865#(or (< (* x1 8) n) (<= n (* x1 4)) (< x2 n)), 2859#(or (not (< x1 n)) (< (* 2 x1) n)), 2868#(or (< (* x1 4) n) (<= n (* 2 x1)) (<= (+ (* 2 x2) 1) n)), 2866#(or (< x1 n) (<= (+ (* 2 x2) 1) n)), 2862#(or (< x1 n) (< x2 n))] [2022-03-15 20:50:32,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:50:32,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:32,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:50:32,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:50:32,839 INFO L87 Difference]: Start difference. First operand 137 states and 375 transitions. Second operand has 20 states, 20 states have (on average 2.15) 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:50:33,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:33,307 INFO L93 Difference]: Finished difference Result 210 states and 486 transitions. [2022-03-15 20:50:33,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 20:50:33,308 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) 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:50:33,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:33,309 INFO L225 Difference]: With dead ends: 210 [2022-03-15 20:50:33,309 INFO L226 Difference]: Without dead ends: 204 [2022-03-15 20:50:33,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=470, Invalid=1336, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 20:50:33,310 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 108 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:33,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 1 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:50:33,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-03-15 20:50:33,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 147. [2022-03-15 20:50:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.73972602739726) internal successors, (400), 146 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 400 transitions. [2022-03-15 20:50:33,316 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 400 transitions. Word has length 13 [2022-03-15 20:50:33,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:33,316 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 400 transitions. [2022-03-15 20:50:33,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) 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:50:33,316 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 400 transitions. [2022-03-15 20:50:33,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:50:33,317 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:33,317 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:33,335 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:50:33,531 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:50:33,531 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:33,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:33,532 INFO L85 PathProgramCache]: Analyzing trace with hash -334951945, now seen corresponding path program 8 times [2022-03-15 20:50:33,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:33,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557255868] [2022-03-15 20:50:33,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:33,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:33,576 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:33,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:33,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557255868] [2022-03-15 20:50:33,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557255868] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:33,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712702855] [2022-03-15 20:50:33,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:50:33,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:33,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:33,577 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:50:33,578 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:50:33,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:50:33,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:33,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:50:33,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:50:33,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:50:33,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712702855] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:33,705 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:33,705 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2022-03-15 20:50:33,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [792958341] [2022-03-15 20:50:33,705 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:33,705 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:33,707 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2022-03-15 20:50:33,707 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:34,012 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [3508#(or (<= (+ 6 n) (* x1 4)) (< (* 2 x2) n) (<= n x2)), 3504#(or (< x2 n) (<= (+ 6 n) (* 2 x1))), 3505#(or (< (* 2 x2) n) (<= (+ 6 n) x1) (not (< x2 n))), 3507#(or (<= (+ 6 n) (* x1 4)) (< x2 n)), 3506#(or (< (* 2 x2) n) (not (< x2 n)) (<= (+ 6 n) (* 2 x1))), 3502#(or (< (* 2 x2) n) (not (< x2 n))), 3501#(< x2 n), 3503#(or (<= (+ 6 n) x1) (< x2 n))] [2022-03-15 20:50:34,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:50:34,013 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:34,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:50:34,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:50:34,013 INFO L87 Difference]: Start difference. First operand 147 states and 400 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:34,697 INFO L93 Difference]: Finished difference Result 312 states and 691 transitions. [2022-03-15 20:50:34,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 20:50:34,697 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:50:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:34,698 INFO L225 Difference]: With dead ends: 312 [2022-03-15 20:50:34,698 INFO L226 Difference]: Without dead ends: 299 [2022-03-15 20:50:34,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=432, Invalid=1920, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 20:50:34,699 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 81 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:34,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 1 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:50:34,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-03-15 20:50:34,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 162. [2022-03-15 20:50:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.701863354037267) internal successors, (435), 161 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 435 transitions. [2022-03-15 20:50:34,704 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 435 transitions. Word has length 13 [2022-03-15 20:50:34,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:34,705 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 435 transitions. [2022-03-15 20:50:34,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:34,705 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 435 transitions. [2022-03-15 20:50:34,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:50:34,705 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:34,705 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:34,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-15 20:50:34,919 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:50:34,919 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:34,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:34,920 INFO L85 PathProgramCache]: Analyzing trace with hash 67776998, now seen corresponding path program 9 times [2022-03-15 20:50:34,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:34,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870018211] [2022-03-15 20:50:34,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:34,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:34,971 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:50:34,972 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:34,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870018211] [2022-03-15 20:50:34,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870018211] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:34,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193239565] [2022-03-15 20:50:34,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:50:34,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:34,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:34,973 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:50:34,974 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:50:34,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:50:34,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:34,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 20:50:34,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:35,103 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:50:35,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:35,150 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:50:35,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193239565] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:35,151 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:35,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 4] total 7 [2022-03-15 20:50:35,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1828935808] [2022-03-15 20:50:35,151 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:35,151 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:35,153 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 62 transitions. [2022-03-15 20:50:35,153 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:35,484 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [4288#(and (<= (* 2 x1) x2) (<= x2 (* 2 x1))), 4289#(and (<= (* x1 4) x2) (<= x2 (* x1 4))), 4290#(and (<= (* x1 8) x2) (<= x2 (* x1 8)))] [2022-03-15 20:50:35,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:50:35,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:35,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:50:35,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:50:35,485 INFO L87 Difference]: Start difference. First operand 162 states and 435 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:35,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:35,631 INFO L93 Difference]: Finished difference Result 284 states and 645 transitions. [2022-03-15 20:50:35,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 20:50:35,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:50:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:35,632 INFO L225 Difference]: With dead ends: 284 [2022-03-15 20:50:35,632 INFO L226 Difference]: Without dead ends: 281 [2022-03-15 20:50:35,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 15 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:50:35,633 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:35,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 1 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:50:35,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-03-15 20:50:35,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 183. [2022-03-15 20:50:35,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 2.6758241758241756) internal successors, (487), 182 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 487 transitions. [2022-03-15 20:50:35,638 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 487 transitions. Word has length 14 [2022-03-15 20:50:35,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:35,638 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 487 transitions. [2022-03-15 20:50:35,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:35,638 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 487 transitions. [2022-03-15 20:50:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:50:35,644 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:35,644 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:35,659 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:50:35,851 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:50:35,851 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:35,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:35,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1597056499, now seen corresponding path program 10 times [2022-03-15 20:50:35,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:35,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656012267] [2022-03-15 20:50:35,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:35,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:35,897 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:35,897 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:35,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656012267] [2022-03-15 20:50:35,898 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656012267] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:35,898 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318513136] [2022-03-15 20:50:35,898 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:50:35,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:35,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:35,899 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:50:35,900 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:50:35,915 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:50:35,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:35,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:50:35,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:36,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:36,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318513136] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:36,252 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:36,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 20 [2022-03-15 20:50:36,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1088514972] [2022-03-15 20:50:36,252 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:36,253 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:36,254 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 60 transitions. [2022-03-15 20:50:36,254 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:36,726 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [5050#(or (< (* x1 4) n) (<= n (* 2 x1))), 5047#(or (<= n x2) (<= n (* 2 x2)) (<= (+ (* x2 4) 4) (* x1 4))), 5043#(or (<= (+ (* x2 4) 4) x1) (not (< (* 2 x2) n)) (not (< x2 n))), 5044#(or (not (< x2 n)) (<= (+ 4 (* 2 x2)) (* 2 x1))), 5040#(or (not (< x2 n)) (<= (+ 5 (* 2 x2)) n)), 5051#(or (< (* x1 8) n) (<= n (* x1 4))), 5048#(< x1 n), 5041#(or (not (< (* 2 x2) n)) (not (< x2 n)) (<= (+ (* x2 4) 5) n)), 5052#(or (< (* 16 x1) n) (<= n (* x1 8))), 5042#(or (<= (+ 4 (* 2 x2)) x1) (not (< x2 n))), 5046#(or (not (< x2 n)) (<= (+ 4 (* 2 x2)) (* x1 4))), 5045#(or (not (< (* 2 x2) n)) (<= (+ (* x2 4) 4) (* 2 x1)) (not (< x2 n))), 5049#(or (not (< x1 n)) (< (* 2 x1) n))] [2022-03-15 20:50:36,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 20:50:36,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:36,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 20:50:36,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:50:36,727 INFO L87 Difference]: Start difference. First operand 183 states and 487 transitions. Second operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:41,085 INFO L93 Difference]: Finished difference Result 551 states and 1136 transitions. [2022-03-15 20:50:41,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-03-15 20:50:41,086 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:50:41,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:41,088 INFO L225 Difference]: With dead ends: 551 [2022-03-15 20:50:41,088 INFO L226 Difference]: Without dead ends: 551 [2022-03-15 20:50:41,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7201 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2763, Invalid=17829, Unknown=0, NotChecked=0, Total=20592 [2022-03-15 20:50:41,091 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 488 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:41,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [488 Valid, 1 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:50:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-03-15 20:50:41,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 218. [2022-03-15 20:50:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.71889400921659) internal successors, (590), 217 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:41,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 590 transitions. [2022-03-15 20:50:41,098 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 590 transitions. Word has length 14 [2022-03-15 20:50:41,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:41,098 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 590 transitions. [2022-03-15 20:50:41,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:41,098 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 590 transitions. [2022-03-15 20:50:41,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:50:41,101 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:41,101 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:41,117 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:50:41,317 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:50:41,317 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:41,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:41,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2101062846, now seen corresponding path program 11 times [2022-03-15 20:50:41,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:41,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874689684] [2022-03-15 20:50:41,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:41,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:41,360 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:41,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874689684] [2022-03-15 20:50:41,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874689684] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:41,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386514897] [2022-03-15 20:50:41,360 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:50:41,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:41,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:41,361 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:50:41,362 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:50:41,388 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 20:50:41,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:41,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:50:41,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:41,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:41,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386514897] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:41,538 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:41,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2022-03-15 20:50:41,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [673487751] [2022-03-15 20:50:41,538 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:41,538 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:41,540 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 73 transitions. [2022-03-15 20:50:41,540 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:41,978 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [6370#(or (<= n (* x2 4)) (< (* x1 4) n) (<= n (* 2 x1))), 6368#(or (<= n (* x2 4)) (not (< x1 n)) (< (* 2 x1) n)), 6371#(or (< (* x1 8) n) (<= n (* x1 4)) (<= n (* 2 x2))), 6359#(or (not (< x1 n)) (< (* 2 x1) n)), 6357#(< x1 n), 6358#(or (< x1 n) (<= n x2)), 6364#(or (< (* x1 8) n) (<= n (* x1 4)) (<= n x2)), 6372#(or (<= n (* x2 4)) (< (* x1 8) n) (<= n (* x1 4))), 6366#(or (<= n (* x2 4)) (< x1 n)), 6361#(or (< (* x1 4) n) (<= n (* 2 x1))), 6363#(or (< (* x1 8) n) (<= n (* x1 4))), 6362#(or (< (* x1 4) n) (<= n x2) (<= n (* 2 x1))), 6365#(or (< x1 n) (<= n (* 2 x2))), 6369#(or (< (* x1 4) n) (<= n (* 2 x1)) (<= n (* 2 x2))), 6360#(or (<= n x1) (<= n x2) (< (* 2 x1) n)), 6367#(or (<= n x1) (< (* 2 x1) n) (<= n (* 2 x2)))] [2022-03-15 20:50:41,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 20:50:41,978 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:41,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 20:50:41,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:50:41,979 INFO L87 Difference]: Start difference. First operand 218 states and 590 transitions. Second operand has 26 states, 26 states have (on average 2.269230769230769) 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:50:45,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:45,827 INFO L93 Difference]: Finished difference Result 761 states and 1717 transitions. [2022-03-15 20:50:45,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2022-03-15 20:50:45,827 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.269230769230769) 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:50:45,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:45,829 INFO L225 Difference]: With dead ends: 761 [2022-03-15 20:50:45,829 INFO L226 Difference]: Without dead ends: 710 [2022-03-15 20:50:45,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 30 SyntacticMatches, 9 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12537 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5220, Invalid=26642, Unknown=0, NotChecked=0, Total=31862 [2022-03-15 20:50:45,837 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 357 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:45,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 1 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:50:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-03-15 20:50:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 388. [2022-03-15 20:50:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 2.9224806201550386) internal successors, (1131), 387 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:45,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1131 transitions. [2022-03-15 20:50:45,848 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1131 transitions. Word has length 15 [2022-03-15 20:50:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:45,850 INFO L470 AbstractCegarLoop]: Abstraction has 388 states and 1131 transitions. [2022-03-15 20:50:45,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.269230769230769) 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:50:45,850 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1131 transitions. [2022-03-15 20:50:45,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:50:45,851 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:45,851 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:45,868 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:50:46,066 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:50:46,067 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:46,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:46,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1545793033, now seen corresponding path program 12 times [2022-03-15 20:50:46,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:46,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262939157] [2022-03-15 20:50:46,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:46,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:46,134 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:46,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262939157] [2022-03-15 20:50:46,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262939157] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:46,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708198255] [2022-03-15 20:50:46,134 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:50:46,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:46,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:46,135 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:50:46,136 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:50:46,152 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:50:46,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:46,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:50:46,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:46,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:46,322 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:46,323 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708198255] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:46,323 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:46,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2022-03-15 20:50:46,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [892533943] [2022-03-15 20:50:46,323 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:46,324 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:46,325 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 73 transitions. [2022-03-15 20:50:46,325 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:46,907 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [8325#(or (<= (+ (* x2 4) 1) n) (< (* x1 8) n) (<= n (* x1 4))), 8310#(or (not (< x1 n)) (< x2 n) (< (* 2 x1) n)), 8313#(or (< (* x1 4) n) (<= n (* 2 x1))), 8311#(or (< x1 n) (<= (+ (* 2 x2) 1) n)), 8307#(< x1 n), 8317#(or (< (* x1 8) n) (<= n (* x1 4)) (< x2 n)), 8323#(or (not (< x1 n)) (<= (+ (* x2 4) 1) n) (< (* 2 x1) n)), 8308#(or (not (< x1 n)) (< (* 2 x1) n)), 8314#(or (< (* x1 4) n) (< x2 n) (<= n (* 2 x1))), 8318#(or (< (* x1 8) n) (<= n (* x1 4)) (<= (+ (* 2 x2) 1) n)), 8320#(or (< (* 16 x1) n) (<= n (* x1 8)) (< x2 n)), 8326#(or (<= (+ (* x2 4) 1) n) (< (* 16 x1) n) (<= n (* x1 8))), 8322#(or (<= (+ (* x2 4) 1) n) (< x1 n)), 8315#(or (< (* x1 4) n) (<= n (* 2 x1)) (<= (+ (* 2 x2) 1) n)), 8316#(or (< (* x1 8) n) (<= n (* x1 4))), 8319#(or (< (* 16 x1) n) (<= n (* x1 8))), 8324#(or (<= (+ (* x2 4) 1) n) (< (* x1 4) n) (<= n (* 2 x1))), 8309#(or (< x1 n) (< x2 n)), 8321#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= (+ (* 2 x2) 1) n)), 8312#(or (not (< x1 n)) (<= (+ (* 2 x2) 1) n) (< (* 2 x1) n))] [2022-03-15 20:50:46,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 20:50:46,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:46,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 20:50:46,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:50:46,908 INFO L87 Difference]: Start difference. First operand 388 states and 1131 transitions. Second operand has 30 states, 30 states have (on average 2.1) 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:50:47,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:47,836 INFO L93 Difference]: Finished difference Result 542 states and 1408 transitions. [2022-03-15 20:50:47,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 20:50:47,836 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1) 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:50:47,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:47,846 INFO L225 Difference]: With dead ends: 542 [2022-03-15 20:50:47,846 INFO L226 Difference]: Without dead ends: 529 [2022-03-15 20:50:47,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 24 SyntacticMatches, 11 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1141, Invalid=3551, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 20:50:47,847 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 179 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:47,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 1 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:50:47,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-03-15 20:50:47,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 412. [2022-03-15 20:50:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.9051094890510947) internal successors, (1194), 411 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1194 transitions. [2022-03-15 20:50:47,856 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1194 transitions. Word has length 15 [2022-03-15 20:50:47,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:47,856 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 1194 transitions. [2022-03-15 20:50:47,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1) 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:50:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1194 transitions. [2022-03-15 20:50:47,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:50:47,857 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:47,857 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:47,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 20:50:48,073 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:50:48,073 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:48,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:48,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1276051794, now seen corresponding path program 13 times [2022-03-15 20:50:48,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:48,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530368660] [2022-03-15 20:50:48,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:48,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:48,120 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:48,120 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:48,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530368660] [2022-03-15 20:50:48,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530368660] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:48,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470678058] [2022-03-15 20:50:48,120 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:50:48,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:48,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:48,121 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:50:48,122 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:50:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:48,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:50:48,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:50:48,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:50:48,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470678058] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:48,322 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:48,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2022-03-15 20:50:48,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1480436208] [2022-03-15 20:50:48,322 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:48,322 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:48,324 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 69 transitions. [2022-03-15 20:50:48,324 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:48,873 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [9868#(or (< (* 2 x2) n) (not (< x2 n))), 9867#(< x2 n), 9871#(or (<= (+ n 12) x1) (< (* 2 x2) n) (not (< x2 n))), 9878#(or (<= (+ n 12) (* x1 4)) (< (* x2 4) n) (<= n (* 2 x2))), 9872#(or (<= (+ n 12) (* 2 x1)) (< x2 n)), 9881#(or (<= (+ n 12) (* x1 8)) (< (* x2 4) n) (<= n (* 2 x2))), 9880#(or (<= (+ n 12) (* x1 8)) (< (* 2 x2) n) (<= n x2)), 9877#(or (<= (+ n 12) (* 2 x1)) (not (< (* 2 x2) n)) (< (* x2 4) n)), 9873#(or (<= (+ n 12) (* 2 x1)) (< (* 2 x2) n) (not (< x2 n))), 9870#(or (<= (+ n 12) x1) (< x2 n)), 9869#(or (< (* x2 4) n) (<= n (* 2 x2))), 9874#(or (<= (+ n 12) (* x1 4)) (< x2 n)), 9876#(or (<= (+ n 12) x1) (not (< (* 2 x2) n)) (< (* x2 4) n)), 9879#(or (<= (+ n 12) (* x1 8)) (< x2 n)), 9875#(or (<= (+ n 12) (* x1 4)) (< (* 2 x2) n) (not (< x2 n)))] [2022-03-15 20:50:48,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:50:48,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:48,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:50:48,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:50:48,874 INFO L87 Difference]: Start difference. First operand 412 states and 1194 transitions. Second operand has 25 states, 25 states have (on average 2.24) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:52,800 INFO L93 Difference]: Finished difference Result 1123 states and 2579 transitions. [2022-03-15 20:50:52,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-03-15 20:50:52,801 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.24) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:50:52,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:52,804 INFO L225 Difference]: With dead ends: 1123 [2022-03-15 20:50:52,804 INFO L226 Difference]: Without dead ends: 1095 [2022-03-15 20:50:52,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5569 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2768, Invalid=15864, Unknown=0, NotChecked=0, Total=18632 [2022-03-15 20:50:52,806 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 170 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:52,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 1 Invalid, 1790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1718 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:50:52,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2022-03-15 20:50:52,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 440. [2022-03-15 20:50:52,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 2.888382687927107) internal successors, (1268), 439 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1268 transitions. [2022-03-15 20:50:52,817 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1268 transitions. Word has length 15 [2022-03-15 20:50:52,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:52,817 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 1268 transitions. [2022-03-15 20:50:52,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.24) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:52,818 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1268 transitions. [2022-03-15 20:50:52,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:50:52,818 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:52,819 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:52,836 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:50:53,031 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:50:53,031 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:53,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:53,032 INFO L85 PathProgramCache]: Analyzing trace with hash -674967859, now seen corresponding path program 14 times [2022-03-15 20:50:53,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:53,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998394866] [2022-03-15 20:50:53,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:53,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:53,141 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:50:53,142 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:53,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998394866] [2022-03-15 20:50:53,142 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998394866] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:53,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890361246] [2022-03-15 20:50:53,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:50:53,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:53,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:53,143 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:50:53,144 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:50:53,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:50:53,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:53,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 20:50:53,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:53,346 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:50:53,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:53,403 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:50:53,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890361246] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:53,403 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:53,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 5] total 9 [2022-03-15 20:50:53,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [582418020] [2022-03-15 20:50:53,404 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:53,404 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:53,406 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 86 transitions. [2022-03-15 20:50:53,406 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:53,960 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [12194#(and (<= (* 2 x1) x2) (<= x2 (* 2 x1))), 12195#(and (<= (* x1 4) x2) (<= x2 (* x1 4))), 12197#(and (<= (* 16 x1) x2) (<= x2 (* 16 x1))), 12196#(and (<= (* x1 8) x2) (<= x2 (* x1 8)))] [2022-03-15 20:50:53,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:50:53,960 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:53,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:50:53,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:50:53,961 INFO L87 Difference]: Start difference. First operand 440 states and 1268 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:54,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:54,160 INFO L93 Difference]: Finished difference Result 654 states and 1679 transitions. [2022-03-15 20:50:54,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:50:54,161 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:50:54,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:54,163 INFO L225 Difference]: With dead ends: 654 [2022-03-15 20:50:54,163 INFO L226 Difference]: Without dead ends: 651 [2022-03-15 20:50:54,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 23 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:50:54,164 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:54,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 1 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:50:54,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-03-15 20:50:54,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 489. [2022-03-15 20:50:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 2.8668032786885247) internal successors, (1399), 488 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1399 transitions. [2022-03-15 20:50:54,173 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 1399 transitions. Word has length 16 [2022-03-15 20:50:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:54,173 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 1399 transitions. [2022-03-15 20:50:54,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 1399 transitions. [2022-03-15 20:50:54,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:50:54,174 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:54,175 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:54,199 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:50:54,390 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:50:54,391 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:54,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:54,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1595110288, now seen corresponding path program 15 times [2022-03-15 20:50:54,391 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:54,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821407251] [2022-03-15 20:50:54,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:54,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:54,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:54,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821407251] [2022-03-15 20:50:54,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821407251] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:54,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892963354] [2022-03-15 20:50:54,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:50:54,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:54,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:54,439 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:50:54,440 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:50:54,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 20:50:54,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:54,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:50:54,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:54,736 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-03-15 20:50:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:54,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:54,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892963354] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:54,857 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:54,857 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 25 [2022-03-15 20:50:54,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1911897117] [2022-03-15 20:50:54,857 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:54,858 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:54,860 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 84 transitions. [2022-03-15 20:50:54,860 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:55,661 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [13961#(or (< (* 16 x1) n) (<= n (* x1 8))), 13960#(or (< (* x1 8) n) (<= n (* x1 4))), 13947#(or (<= (+ 8 (* 2 x2)) x1) (not (< x2 n))), 13963#(or (<= n (* x2 4)) (<= (+ 8 (* x2 8)) (* x1 4)) (<= n x2)), 13952#(or (not (< (* 2 x2) n)) (not (< x2 n)) (<= (+ (* x2 4) 8) (* 2 x1))), 13957#(< x1 n), 13956#(or (<= n (* x2 4)) (<= n x2) (<= (+ 8 (* x2 8)) (* 2 x1))), 13966#(or (<= n (* x2 4)) (<= (+ 8 (* x2 8)) (* x1 8)) (<= n x2)), 13962#(or (< (* 32 x1) n) (<= n (* 16 x1))), 13959#(or (< (* x1 4) n) (<= n (* 2 x1))), 13949#(or (not (< x2 n)) (<= (+ 8 (* 2 x2)) (* x1 4))), 13951#(or (not (< (* 2 x2) n)) (<= (+ (* x2 4) 8) x1) (not (< x2 n))), 13955#(or (<= n (* x2 4)) (<= (+ 8 (* x2 8)) x1) (<= n x2)), 13965#(or (not (< (* 2 x2) n)) (not (< x2 n)) (<= (+ (* x2 4) 8) (* x1 8))), 13946#(or (<= (+ 9 (* 2 x2)) n) (not (< x2 n))), 13950#(or (not (< (* 2 x2) n)) (<= (+ (* x2 4) 9) n) (not (< x2 n))), 13954#(or (<= n (* x2 4)) (<= n x2) (<= (+ 9 (* x2 8)) n)), 13948#(or (<= (+ 8 (* 2 x2)) (* 2 x1)) (not (< x2 n))), 13964#(or (not (< x2 n)) (<= (+ 8 (* 2 x2)) (* x1 8))), 13958#(or (not (< x1 n)) (< (* 2 x1) n)), 13953#(or (not (< (* 2 x2) n)) (not (< x2 n)) (<= (+ (* x2 4) 8) (* x1 4)))] [2022-03-15 20:50:55,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 20:50:55,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:55,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 20:50:55,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1944, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 20:50:55,662 INFO L87 Difference]: Start difference. First operand 489 states and 1399 transitions. Second operand has 32 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:51:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:51:08,162 INFO L93 Difference]: Finished difference Result 1251 states and 2743 transitions. [2022-03-15 20:51:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2022-03-15 20:51:08,162 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:51:08,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:51:08,166 INFO L225 Difference]: With dead ends: 1251 [2022-03-15 20:51:08,166 INFO L226 Difference]: Without dead ends: 1251 [2022-03-15 20:51:08,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25147 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=8034, Invalid=58272, Unknown=0, NotChecked=0, Total=66306 [2022-03-15 20:51:08,169 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1108 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 1738 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 1738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:51:08,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1108 Valid, 1 Invalid, 2230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 1738 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:51:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2022-03-15 20:51:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 527. [2022-03-15 20:51:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 2.876425855513308) internal successors, (1513), 526 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:51:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 1513 transitions. [2022-03-15 20:51:08,182 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 1513 transitions. Word has length 16 [2022-03-15 20:51:08,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:51:08,182 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 1513 transitions. [2022-03-15 20:51:08,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:51:08,182 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 1513 transitions. [2022-03-15 20:51:08,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:51:08,183 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:51:08,183 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:51:08,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 20:51:08,403 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:51:08,404 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:51:08,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:51:08,404 INFO L85 PathProgramCache]: Analyzing trace with hash 550808759, now seen corresponding path program 16 times [2022-03-15 20:51:08,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:51:08,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906504190] [2022-03-15 20:51:08,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:51:08,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:51:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:51:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:51:08,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:51:08,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906504190] [2022-03-15 20:51:08,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906504190] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:51:08,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034016727] [2022-03-15 20:51:08,480 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:51:08,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:51:08,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:51:08,481 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:51:08,481 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:51:08,498 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:51:08,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:51:08,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:51:08,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:51:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:51:08,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:51:08,681 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:51:08,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034016727] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:51:08,681 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:51:08,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2022-03-15 20:51:08,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1285319375] [2022-03-15 20:51:08,681 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:51:08,682 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:51:08,684 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 99 transitions. [2022-03-15 20:51:08,684 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:51:09,492 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [16826#(or (< x1 n) (<= n (* x2 8))), 16829#(or (< (* x1 8) n) (<= n (* x1 4)) (<= n (* x2 8))), 16817#(or (< (* x1 8) n) (<= n (* x1 4)) (<= n x2)), 16812#(or (< x1 n) (<= n (* 2 x2))), 16821#(or (<= n (* x2 4)) (< (* x1 4) n) (<= n (* 2 x1))), 16820#(or (<= n (* x2 4)) (not (< x1 n)) (< (* 2 x1) n)), 16809#(or (< (* x1 8) n) (<= n (* x1 4))), 16828#(or (< (* x1 4) n) (<= n (* 2 x1)) (<= n (* x2 8))), 16815#(or (<= n (* x2 4)) (< x1 n)), 16824#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= n (* 2 x2))), 16814#(or (<= n x1) (< (* 2 x1) n) (<= n (* 2 x2))), 16816#(or (< (* x1 4) n) (<= n x2) (<= n (* 2 x1))), 16811#(or (< x1 n) (<= n x2)), 16818#(or (< (* x1 4) n) (<= n (* 2 x1)) (<= n (* 2 x2))), 16808#(or (< (* x1 4) n) (<= n (* 2 x1))), 16819#(or (< (* x1 8) n) (<= n (* x1 4)) (<= n (* 2 x2))), 16813#(or (<= n x1) (<= n x2) (< (* 2 x1) n)), 16806#(< x1 n), 16822#(or (<= n (* x2 4)) (< (* x1 8) n) (<= n (* x1 4))), 16830#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= n (* x2 8))), 16810#(or (< (* 16 x1) n) (<= n (* x1 8))), 16823#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= n x2)), 16807#(or (not (< x1 n)) (< (* 2 x1) n)), 16827#(or (<= n x1) (< (* 2 x1) n) (<= n (* x2 8))), 16825#(or (<= n (* x2 4)) (< (* 16 x1) n) (<= n (* x1 8)))] [2022-03-15 20:51:09,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 20:51:09,493 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:51:09,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 20:51:09,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1411, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 20:51:09,493 INFO L87 Difference]: Start difference. First operand 527 states and 1513 transitions. Second operand has 37 states, 37 states have (on average 2.2162162162162162) 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:51:23,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:51:23,565 INFO L93 Difference]: Finished difference Result 1877 states and 4644 transitions. [2022-03-15 20:51:23,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 380 states. [2022-03-15 20:51:23,565 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.2162162162162162) 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:51:23,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:51:23,571 INFO L225 Difference]: With dead ends: 1877 [2022-03-15 20:51:23,571 INFO L226 Difference]: Without dead ends: 1776 [2022-03-15 20:51:23,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 33 SyntacticMatches, 12 SemanticMatches, 412 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78517 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=25161, Invalid=145821, Unknown=0, NotChecked=0, Total=170982 [2022-03-15 20:51:23,579 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1012 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 726 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 726 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:51:23,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1012 Valid, 1 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [726 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:51:23,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2022-03-15 20:51:23,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1061. [2022-03-15 20:51:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 3.0358490566037735) internal successors, (3218), 1060 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:51:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 3218 transitions. [2022-03-15 20:51:23,604 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 3218 transitions. Word has length 17 [2022-03-15 20:51:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:51:23,604 INFO L470 AbstractCegarLoop]: Abstraction has 1061 states and 3218 transitions. [2022-03-15 20:51:23,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.2162162162162162) 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:51:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 3218 transitions. [2022-03-15 20:51:23,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:51:23,606 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:51:23,606 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:51:23,624 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:51:23,822 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:51:23,822 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:51:23,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:51:23,823 INFO L85 PathProgramCache]: Analyzing trace with hash -832573794, now seen corresponding path program 17 times [2022-03-15 20:51:23,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:51:23,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907314869] [2022-03-15 20:51:23,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:51:23,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:51:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:51:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:51:23,887 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:51:23,887 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907314869] [2022-03-15 20:51:23,887 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907314869] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:51:23,887 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381955703] [2022-03-15 20:51:23,887 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:51:23,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:51:23,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:51:23,889 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:51:23,890 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:51:23,909 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:51:23,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:51:23,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:51:23,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:51:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:51:24,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:51:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:51:24,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381955703] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:51:24,119 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:51:24,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2022-03-15 20:51:24,119 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1728240899] [2022-03-15 20:51:24,119 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:51:24,120 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:51:24,123 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 99 transitions. [2022-03-15 20:51:24,123 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:51:25,089 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [21689#(or (not (< x1 n)) (< (* 2 x1) n)), 21697#(or (< (* 16 x1) n) (<= n (* x1 8)) (< x2 n)), 21709#(or (< (* 32 x1) n) (<= n (* 16 x1)) (< x2 n)), 21712#(or (< (* 32 x1) n) (<= n (* 16 x1)) (<= (+ (* 2 x2) 1) n)), 21693#(or (not (< x1 n)) (< x2 n) (< (* 2 x1) n)), 21694#(or (< (* x1 4) n) (< x2 n) (<= n (* 2 x1))), 21706#(or (<= (+ (* x2 4) 1) n) (< (* x1 8) n) (<= n (* x1 4))), 21716#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= (+ (* x2 8) 1) n)), 21710#(or (< x1 n) (<= (+ (* x2 8) 1) n)), 21692#(or (< x1 n) (< x2 n)), 21690#(or (< (* x1 4) n) (<= n (* 2 x1))), 21702#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= (+ (* 2 x2) 1) n)), 21715#(or (< (* x1 8) n) (<= n (* x1 4)) (<= (+ (* x2 8) 1) n)), 21695#(or (< (* x1 8) n) (<= n (* x1 4)) (< x2 n)), 21698#(or (< x1 n) (<= (+ (* 2 x2) 1) n)), 21688#(< x1 n), 21707#(or (<= (+ (* x2 4) 1) n) (< (* 16 x1) n) (<= n (* x1 8))), 21714#(or (< (* x1 4) n) (<= (+ (* x2 8) 1) n) (<= n (* 2 x1))), 21691#(or (< (* x1 8) n) (<= n (* x1 4))), 21703#(or (<= (+ (* x2 4) 1) n) (< x1 n)), 21701#(or (< (* x1 8) n) (<= n (* x1 4)) (<= (+ (* 2 x2) 1) n)), 21713#(or (< (* 32 x1) n) (<= (+ (* x2 4) 1) n) (<= n (* 16 x1))), 21711#(or (not (< x1 n)) (<= (+ (* x2 8) 1) n) (< (* 2 x1) n)), 21696#(or (< (* 16 x1) n) (<= n (* x1 8))), 21704#(or (not (< x1 n)) (<= (+ (* x2 4) 1) n) (< (* 2 x1) n)), 21699#(or (not (< x1 n)) (<= (+ (* 2 x2) 1) n) (< (* 2 x1) n)), 21700#(or (< (* x1 4) n) (<= n (* 2 x1)) (<= (+ (* 2 x2) 1) n)), 21705#(or (<= (+ (* x2 4) 1) n) (< (* x1 4) n) (<= n (* 2 x1))), 21717#(or (< (* 32 x1) n) (<= n (* 16 x1)) (<= (+ (* x2 8) 1) n)), 21708#(or (< (* 32 x1) n) (<= n (* 16 x1)))] [2022-03-15 20:51:25,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 20:51:25,090 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:51:25,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 20:51:25,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=1705, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 20:51:25,090 INFO L87 Difference]: Start difference. First operand 1061 states and 3218 transitions. Second operand has 42 states, 42 states have (on average 2.0714285714285716) 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:51:26,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:51:26,702 INFO L93 Difference]: Finished difference Result 1355 states and 3829 transitions. [2022-03-15 20:51:26,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-15 20:51:26,702 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0714285714285716) 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:51:26,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:51:26,706 INFO L225 Difference]: With dead ends: 1355 [2022-03-15 20:51:26,706 INFO L226 Difference]: Without dead ends: 1337 [2022-03-15 20:51:26,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 26 SyntacticMatches, 14 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2259 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2276, Invalid=7624, Unknown=0, NotChecked=0, Total=9900 [2022-03-15 20:51:26,707 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 319 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:51:26,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 1 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:51:26,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2022-03-15 20:51:26,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1123. [2022-03-15 20:51:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 3.0115864527629235) internal successors, (3379), 1122 states have internal predecessors, (3379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:51:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 3379 transitions. [2022-03-15 20:51:26,724 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 3379 transitions. Word has length 17 [2022-03-15 20:51:26,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:51:26,724 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 3379 transitions. [2022-03-15 20:51:26,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0714285714285716) 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:51:26,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 3379 transitions. [2022-03-15 20:51:26,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:51:26,727 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:51:26,727 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:51:26,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 20:51:26,942 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:51:26,942 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:51:26,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:51:26,942 INFO L85 PathProgramCache]: Analyzing trace with hash -770399785, now seen corresponding path program 18 times [2022-03-15 20:51:26,943 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:51:26,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443509331] [2022-03-15 20:51:26,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:51:26,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:51:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:51:27,003 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:51:27,003 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:51:27,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443509331] [2022-03-15 20:51:27,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443509331] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:51:27,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133943502] [2022-03-15 20:51:27,004 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:51:27,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:51:27,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:51:27,005 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:51:27,005 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:51:27,022 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:51:27,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:51:27,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:51:27,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:51:27,198 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:51:27,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:51:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:51:27,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133943502] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:51:27,311 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:51:27,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2022-03-15 20:51:27,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [459518475] [2022-03-15 20:51:27,312 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:51:27,312 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:51:27,315 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 95 transitions. [2022-03-15 20:51:27,315 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:51:28,283 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [25555#(or (< (* 2 x2) n) (not (< x2 n)) (<= (+ n 24) (* x1 8))), 25562#(or (< (* x2 4) n) (<= (+ n 24) (* x1 8)) (<= n (* 2 x2))), 25552#(or (< (* 2 x2) n) (<= (+ n 24) (* 2 x1)) (not (< x2 n))), 25558#(or (<= (+ n 24) (* 16 x1)) (< (* 2 x2) n) (<= n x2)), 25548#(or (< x2 n) (<= (+ n 24) (* 2 x1))), 25550#(or (< (* 2 x2) n) (not (< x2 n))), 25549#(or (<= (+ n 24) (* x1 4)) (< x2 n)), 25565#(or (<= n (* x2 4)) (<= (+ n 24) x1) (< (* x2 8) n)), 25568#(or (<= n (* x2 4)) (<= (+ n 24) (* x1 8)) (< (* x2 8) n)), 25546#(< x2 n), 25563#(or (<= (+ n 24) (* 16 x1)) (< (* x2 4) n) (<= n (* 2 x2))), 25547#(or (<= (+ n 24) x1) (< x2 n)), 25557#(or (<= (+ n 24) (* 16 x1)) (< x2 n)), 25560#(or (not (< (* 2 x2) n)) (< (* x2 4) n) (<= (+ n 24) (* 2 x1))), 25559#(or (<= (+ n 24) x1) (< (* x2 4) n) (<= n (* 2 x2))), 25556#(or (< (* x2 4) n) (<= n (* 2 x2))), 25564#(or (<= n (* x2 4)) (< (* x2 8) n)), 25551#(or (<= (+ n 24) x1) (< (* 2 x2) n) (not (< x2 n))), 25554#(or (< x2 n) (<= (+ n 24) (* x1 8))), 25553#(or (<= (+ n 24) (* x1 4)) (< (* 2 x2) n) (not (< x2 n))), 25567#(or (<= n (* x2 4)) (<= (+ n 24) (* x1 4)) (< (* x2 8) n)), 25561#(or (<= (+ n 24) (* x1 4)) (not (< (* 2 x2) n)) (< (* x2 4) n)), 25569#(or (<= (+ n 24) (* 16 x1)) (<= n (* x2 4)) (< (* x2 8) n)), 25566#(or (<= (+ n 24) (* 2 x1)) (not (< (* x2 4) n)) (< (* x2 8) n))] [2022-03-15 20:51:28,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 20:51:28,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:51:28,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 20:51:28,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1934, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 20:51:28,284 INFO L87 Difference]: Start difference. First operand 1123 states and 3379 transitions. Second operand has 36 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 35 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:51:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:51:47,097 INFO L93 Difference]: Finished difference Result 3611 states and 8455 transitions. [2022-03-15 20:51:47,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 359 states. [2022-03-15 20:51:47,097 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 35 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:51:47,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:51:47,108 INFO L225 Difference]: With dead ends: 3611 [2022-03-15 20:51:47,108 INFO L226 Difference]: Without dead ends: 3562 [2022-03-15 20:51:47,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65398 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=17982, Invalid=142418, Unknown=0, NotChecked=0, Total=160400 [2022-03-15 20:51:47,114 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 333 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 4766 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 4915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 4766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:51:47,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 1 Invalid, 4915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 4766 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 20:51:47,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2022-03-15 20:51:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 1145. [2022-03-15 20:51:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1144 states have (on average 2.984265734265734) internal successors, (3414), 1144 states have internal predecessors, (3414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:51:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 3414 transitions. [2022-03-15 20:51:47,141 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 3414 transitions. Word has length 17 [2022-03-15 20:51:47,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:51:47,141 INFO L470 AbstractCegarLoop]: Abstraction has 1145 states and 3414 transitions. [2022-03-15 20:51:47,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 35 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:51:47,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 3414 transitions. [2022-03-15 20:51:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:51:47,143 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:51:47,143 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:51:47,161 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:51:47,351 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:51:47,351 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:51:47,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:51:47,352 INFO L85 PathProgramCache]: Analyzing trace with hash -40007930, now seen corresponding path program 19 times [2022-03-15 20:51:47,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:51:47,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96322774] [2022-03-15 20:51:47,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:51:47,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:51:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:51:47,413 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:51:47,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:51:47,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96322774] [2022-03-15 20:51:47,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96322774] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:51:47,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630910847] [2022-03-15 20:51:47,413 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:51:47,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:51:47,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:51:47,415 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:51:47,415 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:51:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:51:47,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 20:51:47,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:51:47,671 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:51:47,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:51:47,733 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:51:47,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630910847] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:51:47,734 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:51:47,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 6] total 11 [2022-03-15 20:51:47,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [97258490] [2022-03-15 20:51:47,734 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:51:47,735 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:51:47,737 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 114 transitions. [2022-03-15 20:51:47,737 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:51:48,464 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [32298#(and (<= (* 32 x1) x2) (<= x2 (* 32 x1))), 32296#(and (<= (* x1 8) x2) (<= x2 (* x1 8))), 32297#(and (<= (* 16 x1) x2) (<= x2 (* 16 x1))), 32294#(and (<= (* 2 x1) x2) (<= x2 (* 2 x1))), 32295#(and (<= (* x1 4) x2) (<= x2 (* x1 4)))] [2022-03-15 20:51:48,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:51:48,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:51:48,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:51:48,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:51:48,465 INFO L87 Difference]: Start difference. First operand 1145 states and 3414 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 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:51:48,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:51:48,760 INFO L93 Difference]: Finished difference Result 1486 states and 4133 transitions. [2022-03-15 20:51:48,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 20:51:48,761 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:51:48,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:51:48,766 INFO L225 Difference]: With dead ends: 1486 [2022-03-15 20:51:48,766 INFO L226 Difference]: Without dead ends: 1483 [2022-03-15 20:51:48,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 33 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:51:48,766 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 35 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:51:48,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 1 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:51:48,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2022-03-15 20:51:48,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1242. [2022-03-15 20:51:48,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1241 states have (on average 2.967767929089444) internal successors, (3683), 1241 states have internal predecessors, (3683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:51:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 3683 transitions. [2022-03-15 20:51:48,787 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 3683 transitions. Word has length 18 [2022-03-15 20:51:48,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:51:48,787 INFO L470 AbstractCegarLoop]: Abstraction has 1242 states and 3683 transitions. [2022-03-15 20:51:48,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 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:51:48,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 3683 transitions. [2022-03-15 20:51:48,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:51:48,789 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:51:48,789 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:51:48,815 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:51:49,015 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:51:49,015 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:51:49,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:51:49,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1758333421, now seen corresponding path program 20 times [2022-03-15 20:51:49,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:51:49,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637944887] [2022-03-15 20:51:49,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:51:49,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:51:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:51:49,086 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:51:49,086 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:51:49,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637944887] [2022-03-15 20:51:49,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637944887] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:51:49,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076615537] [2022-03-15 20:51:49,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:51:49,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:51:49,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:51:49,088 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:51:49,088 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:51:49,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:51:49,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:51:49,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:51:49,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:51:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:51:49,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:51:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:51:49,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076615537] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:51:49,436 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:51:49,436 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 7] total 23 [2022-03-15 20:51:49,436 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [149321439] [2022-03-15 20:51:49,436 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:51:49,437 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:51:49,440 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 112 transitions. [2022-03-15 20:51:49,440 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:51:50,700 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [36399#(or (not (< (* 2 x2) n)) (not (< x2 n)) (<= (+ (* x2 4) 17) n)), 36409#(or (not (< (* x2 8) n)) (not (< x2 n)) (<= (+ 16 (* 16 x2)) (* 2 x1))), 36395#(or (not (< x2 n)) (<= (+ 17 (* 2 x2)) n)), 36408#(or (not (< x2 n)) (<= n (* x2 8)) (<= (+ 16 (* 16 x2)) x1)), 36397#(or (<= (+ 16 (* 2 x2)) (* 2 x1)) (not (< x2 n))), 36407#(or (<= (+ 16 (* x2 8)) (* 2 x1)) (not (< x2 n)) (not (< (* x2 4) n))), 36424#(or (< (* 32 x1) n) (<= n (* 16 x1))), 36425#(or (<= n (* 32 x1)) (< (* 64 x1) n)), 36398#(or (<= (+ 16 (* 2 x2)) (* x1 4)) (not (< x2 n))), 36403#(or (not (< (* 2 x2) n)) (not (< x2 n)) (<= (+ (* x2 4) 16) x1)), 36405#(or (<= (+ 16 (* 2 x2)) (* 16 x1)) (not (< x2 n))), 36410#(< x1 n), 36423#(or (< (* 16 x1) n) (<= n (* x1 8))), 36406#(or (not (< (* 2 x2) n)) (not (< x2 n)) (<= (+ (* x2 4) 16) (* 2 x1))), 36416#(or (<= n (* x2 4)) (<= (+ 16 (* x2 8)) (* x1 4)) (<= n x2)), 36401#(or (<= (+ (* 16 x2) 17) n) (<= n x2) (<= n (* x2 8))), 36400#(or (<= n (* x2 4)) (<= (+ 17 (* x2 8)) n) (<= n x2)), 36420#(or (<= (+ 16 (* x2 8)) (* 16 x1)) (not (< x2 n)) (not (< (* x2 4) n))), 36412#(or (< (* x1 4) n) (<= n (* 2 x1))), 36421#(or (<= (+ 16 (* 16 x2)) (* 16 x1)) (<= n x2) (<= n (* x2 8))), 36402#(or (<= (+ 16 (* 2 x2)) (* x1 8)) (not (< x2 n))), 36415#(or (<= (+ (* x2 4) 16) (* 16 x1)) (not (< (* 2 x2) n)) (not (< x2 n))), 36419#(or (not (< x2 n)) (<= (+ 16 (* 16 x2)) (* x1 8)) (<= n (* x2 8))), 36422#(or (< (* x1 8) n) (<= n (* x1 4))), 36418#(or (<= n (* x2 4)) (<= n x2) (<= (+ 16 (* x2 8)) (* x1 8))), 36396#(or (<= (+ 16 (* 2 x2)) x1) (not (< x2 n))), 36417#(or (<= (+ 16 (* 16 x2)) (* x1 4)) (not (< x2 n)) (<= n (* x2 8))), 36413#(or (not (< (* 2 x2) n)) (<= (+ (* x2 4) 16) (* x1 4)) (not (< x2 n))), 36404#(or (<= n (* x2 4)) (<= n x2) (<= (+ 16 (* x2 8)) x1)), 36414#(or (not (< (* 2 x2) n)) (<= (+ (* x2 4) 16) (* x1 8)) (not (< x2 n))), 36411#(or (not (< x1 n)) (< (* 2 x1) n))] [2022-03-15 20:51:50,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 20:51:50,700 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:51:50,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 20:51:50,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2809, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 20:51:50,701 INFO L87 Difference]: Start difference. First operand 1242 states and 3683 transitions. Second operand has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:52:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:52:19,524 INFO L93 Difference]: Finished difference Result 2715 states and 6288 transitions. [2022-03-15 20:52:19,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 379 states. [2022-03-15 20:52:19,524 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:52:19,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:52:19,532 INFO L225 Difference]: With dead ends: 2715 [2022-03-15 20:52:19,532 INFO L226 Difference]: Without dead ends: 2715 [2022-03-15 20:52:19,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 27 SyntacticMatches, 13 SemanticMatches, 423 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71531 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=20929, Invalid=159271, Unknown=0, NotChecked=0, Total=180200 [2022-03-15 20:52:19,539 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 2388 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 962 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2388 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 4011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 962 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:52:19,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2388 Valid, 1 Invalid, 4011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [962 Valid, 3049 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 20:52:19,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2022-03-15 20:52:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 1289. [2022-03-15 20:52:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1288 states have (on average 2.974378881987578) internal successors, (3831), 1288 states have internal predecessors, (3831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:52:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 3831 transitions. [2022-03-15 20:52:19,590 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 3831 transitions. Word has length 18 [2022-03-15 20:52:19,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:52:19,590 INFO L470 AbstractCegarLoop]: Abstraction has 1289 states and 3831 transitions. [2022-03-15 20:52:19,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:52:19,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 3831 transitions. [2022-03-15 20:52:19,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:52:19,592 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:52:19,593 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:52:19,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 20:52:19,803 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:52:19,804 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:52:19,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:52:19,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1240269922, now seen corresponding path program 21 times [2022-03-15 20:52:19,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:52:19,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719092005] [2022-03-15 20:52:19,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:52:19,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:52:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:52:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:52:19,887 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:52:19,887 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719092005] [2022-03-15 20:52:19,887 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719092005] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:52:19,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535285062] [2022-03-15 20:52:19,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:52:19,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:52:19,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:52:19,889 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:52:19,890 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:52:19,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:52:19,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:52:19,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:52:19,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:52:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:52:20,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:52:20,121 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:52:20,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535285062] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:52:20,122 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:52:20,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2022-03-15 20:52:20,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [66966874] [2022-03-15 20:52:20,122 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:52:20,122 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:52:20,126 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 129 transitions. [2022-03-15 20:52:20,126 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:52:21,403 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [42620#(or (< (* 32 x1) n) (<= n (* 16 x1)) (<= n (* x2 8))), 42594#(or (< (* x1 4) n) (<= n (* 2 x1))), 42597#(or (< x1 n) (<= n (* 16 x2))), 42603#(or (< (* x1 4) n) (<= n (* 16 x2)) (<= n (* 2 x1))), 42605#(or (< (* x1 8) n) (<= n (* x1 4)) (<= n x2)), 42614#(or (< (* 32 x1) n) (<= n (* 16 x1))), 42617#(or (< (* x1 8) n) (<= n (* x1 4)) (<= n (* 16 x2))), 42615#(or (< (* 32 x1) n) (<= n (* 16 x1)) (<= n x2)), 42619#(or (<= n (* x2 4)) (< (* 32 x1) n) (<= n (* 16 x1))), 42593#(or (<= n (* x2 4)) (not (< x1 n)) (< (* 2 x1) n)), 42616#(or (< (* 32 x1) n) (<= n (* 16 x1)) (<= n (* 2 x2))), 42586#(< x1 n), 42587#(or (< x1 n) (<= n x2)), 42610#(or (<= n (* x2 4)) (< (* x1 8) n) (<= n (* x1 4))), 42588#(or (< x1 n) (<= n (* 2 x2))), 42601#(or (<= n (* x2 4)) (< (* x1 4) n) (<= n (* 2 x1))), 42596#(or (<= n x1) (< (* 2 x1) n) (<= n (* x2 8))), 42602#(or (< (* x1 4) n) (<= n (* 2 x1)) (<= n (* x2 8))), 42590#(or (<= n x1) (<= n x2) (< (* 2 x1) n)), 42600#(or (< (* x1 4) n) (<= n (* 2 x1)) (<= n (* 2 x2))), 42612#(or (< (* x1 8) n) (<= n (* x1 4)) (<= n (* x2 8))), 42607#(or (< (* 16 x1) n) (<= n (* x1 8))), 42606#(or (< (* x1 8) n) (<= n (* x1 4)) (<= n (* 2 x2))), 42604#(or (< (* x1 8) n) (<= n (* x1 4))), 42591#(or (<= n x1) (< (* 2 x1) n) (<= n (* 2 x2))), 42608#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= n x2)), 42611#(or (<= n (* x2 4)) (< (* 16 x1) n) (<= n (* x1 8))), 42598#(or (<= n x1) (<= n (* 16 x2)) (< (* 2 x1) n)), 42621#(or (< (* 32 x1) n) (<= n (* 16 x1)) (<= n (* 16 x2))), 42595#(or (< x1 n) (<= n (* x2 8))), 42609#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= n (* 2 x2))), 42599#(or (< (* x1 4) n) (<= n x2) (<= n (* 2 x1))), 42618#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= n (* 16 x2))), 42592#(or (<= n (* x2 4)) (< x1 n)), 42589#(or (not (< x1 n)) (< (* 2 x1) n)), 42613#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= n (* x2 8)))] [2022-03-15 20:52:21,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 20:52:21,404 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:52:21,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 20:52:21,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=2593, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 20:52:21,404 INFO L87 Difference]: Start difference. First operand 1289 states and 3831 transitions. Second operand has 50 states, 50 states have (on average 2.18) 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:53:18,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:53:18,114 INFO L93 Difference]: Finished difference Result 4507 states and 11996 transitions. [2022-03-15 20:53:18,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 927 states. [2022-03-15 20:53:18,115 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.18) 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:53:18,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:53:18,126 INFO L225 Difference]: With dead ends: 4507 [2022-03-15 20:53:18,126 INFO L226 Difference]: Without dead ends: 4322 [2022-03-15 20:53:18,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1024 GetRequests, 36 SyntacticMatches, 15 SemanticMatches, 973 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482746 ImplicationChecksByTransitivity, 54.6s TimeCoverageRelationStatistics Valid=128813, Invalid=820837, Unknown=0, NotChecked=0, Total=949650 [2022-03-15 20:53:18,174 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1476 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 1385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1385 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:53:18,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1476 Valid, 1 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1385 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 20:53:18,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4322 states. [2022-03-15 20:53:18,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4322 to 2835. [2022-03-15 20:53:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2835 states, 2834 states have (on average 3.093154551870148) internal successors, (8766), 2834 states have internal predecessors, (8766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 8766 transitions. [2022-03-15 20:53:18,230 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 8766 transitions. Word has length 19 [2022-03-15 20:53:18,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:53:18,230 INFO L470 AbstractCegarLoop]: Abstraction has 2835 states and 8766 transitions. [2022-03-15 20:53:18,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.18) 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:53:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 8766 transitions. [2022-03-15 20:53:18,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:53:18,234 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:53:18,234 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:53:18,251 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:53:18,451 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:53:18,451 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:53:18,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:53:18,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1175456105, now seen corresponding path program 22 times [2022-03-15 20:53:18,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:53:18,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737556511] [2022-03-15 20:53:18,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:53:18,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:53:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:53:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:18,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:53:18,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737556511] [2022-03-15 20:53:18,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737556511] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:53:18,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313022763] [2022-03-15 20:53:18,527 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:53:18,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:18,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:53:18,528 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:53:18,528 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:53:18,548 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:53:18,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:53:18,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:53:18,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:53:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:18,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:53:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:18,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313022763] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:53:18,761 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:53:18,761 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2022-03-15 20:53:18,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1717412883] [2022-03-15 20:53:18,762 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:53:18,762 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:53:18,766 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 129 transitions. [2022-03-15 20:53:18,766 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:53:20,179 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 42 new interpolants: [54777#(or (< (* x1 8) n) (<= n (* x1 4)) (<= (+ (* 2 x2) 1) n)), 54768#(or (< (* x1 4) n) (<= n (* 2 x1))), 54800#(or (<= (+ (* 16 x2) 1) n) (< (* x1 4) n) (not (< (* 2 x1) n))), 54794#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= (+ (* 2 x2) 1) n)), 54770#(or (< x1 n) (< x2 n)), 54788#(or (< (* x1 8) n) (<= n (* x1 4)) (<= (+ (* x2 8) 1) n)), 54799#(or (< (* 32 x1) n) (<= n (* 16 x1)) (<= (+ (* x2 8) 1) n)), 54791#(or (< (* 16 x1) n) (<= n (* x1 8)) (< x2 n)), 54781#(or (<= (+ (* x2 4) 1) n) (< (* x1 8) n) (<= n (* x1 4))), 54793#(or (< x2 n) (<= n (* 32 x1)) (< (* 64 x1) n)), 54783#(or (< (* 32 x1) n) (<= n (* 16 x1))), 54775#(or (not (< x1 n)) (<= (+ (* 2 x2) 1) n) (< (* 2 x1) n)), 54807#(or (<= (+ (* 16 x2) 1) n) (<= n (* 32 x1)) (< (* 64 x1) n)), 54804#(or (<= n (* 32 x1)) (<= (+ (* 2 x2) 1) n) (< (* 64 x1) n)), 54773#(or (< (* x1 8) n) (<= n (* x1 4)) (< x2 n)), 54792#(or (< (* 32 x1) n) (<= n (* 16 x1)) (< x2 n)), 54778#(or (<= (+ (* x2 4) 1) n) (< x1 n)), 54802#(or (<= (+ (* 16 x2) 1) n) (< (* 16 x1) n) (<= n (* x1 8))), 54787#(or (< (* x1 4) n) (<= (+ (* x2 8) 1) n) (<= n (* 2 x1))), 54786#(or (not (< x1 n)) (<= (+ (* x2 8) 1) n) (< (* 2 x1) n)), 54796#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= (+ (* x2 8) 1) n)), 54774#(or (< x1 n) (<= (+ (* 2 x2) 1) n)), 54795#(or (<= (+ (* x2 4) 1) n) (< (* 16 x1) n) (<= n (* x1 8))), 54776#(or (< (* x1 4) n) (<= n (* 2 x1)) (<= (+ (* 2 x2) 1) n)), 54784#(or (<= n (* 32 x1)) (< (* 64 x1) n)), 54769#(or (< (* x1 8) n) (<= n (* x1 4))), 54766#(< x1 n), 54798#(or (< (* 32 x1) n) (<= (+ (* x2 4) 1) n) (<= n (* 16 x1))), 54797#(or (< (* 32 x1) n) (<= n (* 16 x1)) (<= (+ (* 2 x2) 1) n)), 54806#(or (<= (+ (* x2 8) 1) n) (<= n (* 32 x1)) (< (* 64 x1) n)), 54790#(or (not (< x1 n)) (<= (+ (* 16 x2) 1) n) (< (* 2 x1) n)), 54780#(or (<= (+ (* x2 4) 1) n) (< (* x1 4) n) (<= n (* 2 x1))), 54771#(or (not (< x1 n)) (< x2 n) (< (* 2 x1) n)), 54785#(or (< x1 n) (<= (+ (* x2 8) 1) n)), 54782#(or (< (* 16 x1) n) (<= n (* x1 8))), 54805#(or (<= (+ (* x2 4) 1) n) (<= n (* 32 x1)) (< (* 64 x1) n)), 54767#(or (not (< x1 n)) (< (* 2 x1) n)), 54772#(or (< (* x1 4) n) (< x2 n) (<= n (* 2 x1))), 54803#(or (< (* 32 x1) n) (<= n (* 16 x1)) (<= (+ (* 16 x2) 1) n)), 54801#(or (<= (+ (* 16 x2) 1) n) (not (< (* x1 4) n)) (< (* x1 8) n)), 54779#(or (not (< x1 n)) (<= (+ (* x2 4) 1) n) (< (* 2 x1) n)), 54789#(or (<= (+ (* 16 x2) 1) n) (< x1 n))] [2022-03-15 20:53:20,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-15 20:53:20,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:53:20,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-15 20:53:20,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=3061, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 20:53:20,181 INFO L87 Difference]: Start difference. First operand 2835 states and 8766 transitions. Second operand has 56 states, 56 states have (on average 2.0535714285714284) 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:53:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:53:22,989 INFO L93 Difference]: Finished difference Result 3356 states and 9961 transitions. [2022-03-15 20:53:22,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-15 20:53:22,990 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0535714285714284) 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:53:22,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:53:22,996 INFO L225 Difference]: With dead ends: 3356 [2022-03-15 20:53:22,997 INFO L226 Difference]: Without dead ends: 3333 [2022-03-15 20:53:22,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 28 SyntacticMatches, 17 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4734 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4019, Invalid=14341, Unknown=0, NotChecked=0, Total=18360 [2022-03-15 20:53:22,999 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 384 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:53:22,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 1 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:53:23,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2022-03-15 20:53:23,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 2975. [2022-03-15 20:53:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2975 states, 2974 states have (on average 3.0669132481506387) internal successors, (9121), 2974 states have internal predecessors, (9121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 9121 transitions. [2022-03-15 20:53:23,043 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 9121 transitions. Word has length 19 [2022-03-15 20:53:23,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:53:23,043 INFO L470 AbstractCegarLoop]: Abstraction has 2975 states and 9121 transitions. [2022-03-15 20:53:23,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.0535714285714284) 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:53:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 9121 transitions. [2022-03-15 20:53:23,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:53:23,048 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:53:23,048 INFO L514 BasicCegarLoop]: trace histogram [7, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:53:23,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 20:53:23,255 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:53:23,270 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:53:23,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:53:23,270 INFO L85 PathProgramCache]: Analyzing trace with hash -778658190, now seen corresponding path program 23 times [2022-03-15 20:53:23,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:53:23,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25011769] [2022-03-15 20:53:23,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:53:23,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:53:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:53:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:23,408 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:53:23,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25011769] [2022-03-15 20:53:23,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25011769] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:53:23,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203469919] [2022-03-15 20:53:23,408 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:53:23,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:23,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:53:23,410 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:53:23,411 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:53:23,429 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 20:53:23,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:53:23,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 20:53:23,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:53:23,795 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-03-15 20:53:23,960 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-03-15 20:53:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:24,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:53:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:24,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203469919] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:53:24,382 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:53:24,382 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-03-15 20:53:24,382 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [637762312] [2022-03-15 20:53:24,382 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:53:24,383 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:53:24,386 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 125 transitions. [2022-03-15 20:53:24,387 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:53:25,941 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [64430#(or (<= (+ n 48) (* 2 x1)) (not (< (* x2 4) n)) (< (* x2 8) n)), 64439#(or (< (* 16 x2) n) (<= (+ n 48) x1) (<= n (* x2 8))), 64437#(or (<= n (* x2 4)) (<= (+ n 48) (* 32 x1)) (< (* x2 8) n)), 64420#(or (<= (+ n 48) (* x1 4)) (< x2 n)), 64411#(or (< (* 2 x2) n) (not (< x2 n))), 64421#(or (<= (+ n 48) (* x1 4)) (< (* 2 x2) n) (not (< x2 n))), 64412#(or (< x2 n) (<= (+ n 48) x1)), 64444#(or (< (* 16 x2) n) (<= n (* x2 8)) (<= (+ n 48) (* 32 x1))), 64413#(or (< (* 2 x2) n) (not (< x2 n)) (<= (+ n 48) x1)), 64442#(or (< (* 16 x2) n) (<= (+ n 48) (* x1 8)) (<= n (* x2 8))), 64432#(or (<= n (* x2 4)) (<= (+ n 48) (* x1 8)) (< (* x2 8) n)), 64417#(or (< (* x2 4) n) (<= (+ n 48) x1) (<= n (* 2 x2))), 64440#(or (< (* 16 x2) n) (<= (+ n 48) (* 2 x1)) (<= n (* x2 8))), 64438#(or (< (* 16 x2) n) (<= n (* x2 8))), 64426#(or (< x2 n) (<= (+ n 48) (* 16 x1))), 64425#(or (< (* x2 4) n) (<= (+ n 48) (* x1 8)) (<= n (* 2 x2))), 64410#(< x2 n), 64414#(or (<= (+ n 48) (* 2 x1)) (< x2 n)), 64429#(or (<= n (* x2 4)) (<= (+ n 48) x1) (< (* x2 8) n)), 64415#(or (< (* x2 4) n) (<= n (* 2 x2))), 64422#(or (<= (+ n 48) (* x1 4)) (< (* x2 4) n) (<= n (* 2 x2))), 64431#(or (<= n (* x2 4)) (<= (+ n 48) (* x1 4)) (< (* x2 8) n)), 64435#(or (< (* 2 x2) n) (<= n x2) (<= (+ n 48) (* 32 x1))), 64423#(or (< x2 n) (<= (+ n 48) (* x1 8))), 64443#(or (< (* 16 x2) n) (<= n (* x2 8)) (<= (+ n 48) (* 16 x1))), 64419#(or (<= (+ n 48) (* 2 x1)) (not (< (* 2 x2) n)) (< (* x2 4) n)), 64433#(or (<= n (* x2 4)) (<= (+ n 48) (* 16 x1)) (< (* x2 8) n)), 64418#(or (<= (+ n 48) (* 2 x1)) (< (* 2 x2) n) (not (< x2 n))), 64434#(or (< x2 n) (<= (+ n 48) (* 32 x1))), 64428#(or (< (* x2 4) n) (<= n (* 2 x2)) (<= (+ n 48) (* 16 x1))), 64424#(or (< (* 2 x2) n) (not (< x2 n)) (<= (+ n 48) (* x1 8))), 64427#(or (< (* 2 x2) n) (not (< x2 n)) (<= (+ n 48) (* 16 x1))), 64436#(or (< (* x2 4) n) (<= n (* 2 x2)) (<= (+ n 48) (* 32 x1))), 64416#(or (<= n (* x2 4)) (< (* x2 8) n)), 64441#(or (< (* 16 x2) n) (<= (+ n 48) (* x1 4)) (<= n (* x2 8)))] [2022-03-15 20:53:25,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-15 20:53:25,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:53:25,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-15 20:53:25,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=589, Invalid=4667, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 20:53:25,943 INFO L87 Difference]: Start difference. First operand 2975 states and 9121 transitions. Second operand has 49 states, 49 states have (on average 2.163265306122449) internal successors, (106), 48 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:54:54,372 INFO L93 Difference]: Finished difference Result 10586 states and 25244 transitions. [2022-03-15 20:54:54,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1089 states. [2022-03-15 20:54:54,373 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.163265306122449) internal successors, (106), 48 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 20:54:54,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:54:54,394 INFO L225 Difference]: With dead ends: 10586 [2022-03-15 20:54:54,394 INFO L226 Difference]: Without dead ends: 10507 [2022-03-15 20:54:54,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1186 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629582 ImplicationChecksByTransitivity, 80.6s TimeCoverageRelationStatistics Valid=112669, Invalid=1224823, Unknown=0, NotChecked=0, Total=1337492 [2022-03-15 20:54:54,458 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 577 mSDsluCounter, 3717 mSDsCounter, 0 mSdLazyCounter, 19294 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 19545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 19294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:54:54,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [577 Valid, 1 Invalid, 19545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 19294 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-03-15 20:54:54,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10507 states. [2022-03-15 20:54:54,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10507 to 2953. [2022-03-15 20:54:54,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2952 states have (on average 3.0321815718157183) internal successors, (8951), 2952 states have internal predecessors, (8951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 8951 transitions. [2022-03-15 20:54:54,547 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 8951 transitions. Word has length 19 [2022-03-15 20:54:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:54:54,547 INFO L470 AbstractCegarLoop]: Abstraction has 2953 states and 8951 transitions. [2022-03-15 20:54:54,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.163265306122449) internal successors, (106), 48 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 8951 transitions. [2022-03-15 20:54:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:54:54,551 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:54:54,552 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:54:54,569 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:54:54,767 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:54:54,767 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:54:54,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:54:54,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2079424979, now seen corresponding path program 24 times [2022-03-15 20:54:54,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:54:54,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836748463] [2022-03-15 20:54:54,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:54:54,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:54:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:54:54,842 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:54:54,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:54:54,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836748463] [2022-03-15 20:54:54,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836748463] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:54:54,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524586984] [2022-03-15 20:54:54,843 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:54:54,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:54:54,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:54:54,844 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:54:54,845 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:54:54,870 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:54:54,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:54:54,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 20:54:54,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:54:55,191 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:54:55,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:54:55,264 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:54:55,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524586984] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:54:55,264 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:54:55,264 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 7] total 13 [2022-03-15 20:54:55,264 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [712744002] [2022-03-15 20:54:55,264 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:54:55,265 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:54:55,269 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 146 transitions. [2022-03-15 20:54:55,269 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:54:56,377 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [83237#(and (<= (* 16 x1) x2) (<= x2 (* 16 x1))), 83239#(and (<= (* 64 x1) x2) (<= x2 (* 64 x1))), 83235#(and (<= (* x1 4) x2) (<= x2 (* x1 4))), 83238#(and (<= (* 32 x1) x2) (<= x2 (* 32 x1))), 83236#(and (<= (* x1 8) x2) (<= x2 (* x1 8))), 83234#(and (<= (* 2 x1) x2) (<= x2 (* 2 x1)))] [2022-03-15 20:54:56,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:54:56,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:54:56,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:54:56,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:54:56,378 INFO L87 Difference]: Start difference. First operand 2953 states and 8951 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 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:54:56,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:54:56,789 INFO L93 Difference]: Finished difference Result 3495 states and 10202 transitions. [2022-03-15 20:54:56,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:54:56,789 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 20:54:56,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:54:56,796 INFO L225 Difference]: With dead ends: 3495 [2022-03-15 20:54:56,796 INFO L226 Difference]: Without dead ends: 3492 [2022-03-15 20:54:56,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 51 SyntacticMatches, 44 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:54:56,797 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 42 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:54:56,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 1 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:54:56,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3492 states. [2022-03-15 20:54:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3492 to 3131. [2022-03-15 20:54:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3131 states, 3130 states have (on average 3.021725239616613) internal successors, (9458), 3130 states have internal predecessors, (9458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 9458 transitions. [2022-03-15 20:54:56,844 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 9458 transitions. Word has length 20 [2022-03-15 20:54:56,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:54:56,845 INFO L470 AbstractCegarLoop]: Abstraction has 3131 states and 9458 transitions. [2022-03-15 20:54:56,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 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:54:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 9458 transitions. [2022-03-15 20:54:56,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:54:56,849 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:54:56,849 INFO L514 BasicCegarLoop]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:54:56,867 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:54:57,063 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:54:57,064 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:54:57,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:54:57,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1924808592, now seen corresponding path program 25 times [2022-03-15 20:54:57,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:54:57,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781895818] [2022-03-15 20:54:57,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:54:57,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:54:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:54:57,143 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:54:57,144 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:54:57,144 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781895818] [2022-03-15 20:54:57,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781895818] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:54:57,144 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558176809] [2022-03-15 20:54:57,144 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:54:57,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:54:57,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:54:57,145 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:54:57,146 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:54:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:54:57,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 20:54:57,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:54:57,483 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-03-15 20:54:57,616 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-03-15 20:54:57,839 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-03-15 20:54:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:54:57,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:54:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:54:58,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558176809] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:54:58,162 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:54:58,162 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 9] total 35 [2022-03-15 20:54:58,162 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [580538273] [2022-03-15 20:54:58,162 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:54:58,163 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:54:58,167 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 144 transitions. [2022-03-15 20:54:58,167 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:55:00,356 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [93157#(or (not (< x1 n)) (< (* 2 x1) n)), 93150#(or (not (< (* 2 x2) n)) (not (< x2 n)) (<= (+ (* x2 4) 33) n)), 93170#(or (not (< x2 n)) (<= n (* x2 8)) (<= (+ 32 (* 16 x2)) (* 2 x1))), 93188#(or (<= (+ 32 (* 16 x2)) (* 32 x1)) (not (< x2 n)) (<= n (* x2 8))), 93169#(or (<= n (* 16 x2)) (<= (+ 32 (* 32 x2)) x1) (not (< x2 n))), 93158#(or (< (* x1 4) n) (<= n (* 2 x1))), 93163#(or (not (< x2 n)) (<= (+ 32 (* 2 x2)) (* x1 4))), 93182#(or (<= n (* x2 4)) (<= (+ 32 (* x2 8)) (* 16 x1)) (<= n x2)), 93179#(or (<= (+ 32 (* 16 x2)) (* x1 8)) (<= n x2) (<= n (* x2 8))), 93173#(or (not (< (* 2 x2) n)) (<= (+ 32 (* x2 4)) (* x1 4)) (not (< x2 n))), 93159#(or (< (* x1 8) n) (<= n (* x1 4))), 93187#(or (<= n (* 64 x1)) (< (* x1 128) n)), 93174#(or (not (< x2 n)) (not (< (* x2 4) n)) (<= (+ 32 (* x2 8)) (* x1 4))), 93183#(or (<= (+ 32 (* 16 x2)) (* 16 x1)) (<= n x2) (<= n (* x2 8))), 93148#(or (not (< x2 n)) (<= (+ 32 (* 2 x2)) x1)), 93175#(or (<= (+ 32 (* 16 x2)) (* x1 4)) (not (< (* x2 8) n)) (not (< x2 n))), 93156#(< x1 n), 93152#(or (not (< (* 2 x2) n)) (not (< x2 n)) (<= (+ 32 (* x2 4)) (* 2 x1))), 93176#(or (<= (+ 32 (* 32 x2)) (* x1 4)) (<= n (* 16 x2)) (<= n x2)), 93149#(or (<= (+ 32 (* 2 x2)) (* 2 x1)) (not (< x2 n))), 93168#(or (<= n (* 16 x2)) (<= (+ 33 (* 32 x2)) n) (<= n x2)), 93154#(or (<= (+ 32 (* x2 8)) x1) (not (< x2 n)) (not (< (* x2 4) n))), 93167#(or (<= n x2) (<= (+ 32 (* 16 x2)) x1) (<= n (* x2 8))), 93162#(or (<= n (* 32 x1)) (< (* 64 x1) n)), 93172#(or (not (< x2 n)) (<= (+ 32 (* 2 x2)) (* 32 x1))), 93185#(or (not (< (* 2 x2) n)) (<= (+ 32 (* x2 4)) (* 32 x1)) (not (< x2 n))), 93189#(or (<= (+ 32 (* 32 x2)) (* 32 x1)) (<= n (* 16 x2)) (<= n x2)), 93177#(or (not (< (* 2 x2) n)) (not (< x2 n)) (<= (+ 32 (* x2 4)) (* x1 8))), 93153#(or (<= n (* x2 4)) (<= (+ 33 (* x2 8)) n) (<= n x2)), 93160#(or (< (* 16 x1) n) (<= n (* x1 8))), 93155#(or (<= n (* x2 4)) (<= (+ 32 (* x2 8)) (* 2 x1)) (<= n x2)), 93151#(or (not (< (* 2 x2) n)) (<= (+ 32 (* x2 4)) x1) (not (< x2 n))), 93181#(or (not (< (* 2 x2) n)) (not (< x2 n)) (<= (+ 32 (* x2 4)) (* 16 x1))), 93164#(or (<= (+ 32 (* 2 x2)) (* x1 8)) (not (< x2 n))), 93184#(or (<= (+ 32 (* 32 x2)) (* 16 x1)) (<= n (* 16 x2)) (not (< x2 n))), 93186#(or (<= n (* x2 4)) (<= n x2) (<= (+ 32 (* x2 8)) (* 32 x1))), 93171#(or (<= (+ 32 (* 32 x2)) (* 2 x1)) (<= n (* 16 x2)) (<= n x2)), 93178#(or (<= n (* x2 4)) (<= n x2) (<= (+ 32 (* x2 8)) (* x1 8))), 93147#(or (<= (+ 33 (* 2 x2)) n) (not (< x2 n))), 93180#(or (<= (+ 32 (* 32 x2)) (* x1 8)) (<= n (* 16 x2)) (not (< x2 n))), 93161#(or (< (* 32 x1) n) (<= n (* 16 x1))), 93165#(or (<= (+ 32 (* 2 x2)) (* 16 x1)) (not (< x2 n))), 93166#(or (<= (+ 33 (* 16 x2)) n) (<= n x2) (<= n (* x2 8)))] [2022-03-15 20:55:00,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 20:55:00,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:55:00,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 20:55:00,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=5714, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 20:55:00,358 INFO L87 Difference]: Start difference. First operand 3131 states and 9458 transitions. Second operand has 58 states, 58 states have (on average 2.1379310344827585) internal successors, (124), 57 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:55:58,204 INFO L93 Difference]: Finished difference Result 5731 states and 14093 transitions. [2022-03-15 20:55:58,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 600 states. [2022-03-15 20:55:58,204 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.1379310344827585) internal successors, (124), 57 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have 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:55:58,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:55:58,213 INFO L225 Difference]: With dead ends: 5731 [2022-03-15 20:55:58,213 INFO L226 Difference]: Without dead ends: 5731 [2022-03-15 20:55:58,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 27 SyntacticMatches, 10 SemanticMatches, 667 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186681 ImplicationChecksByTransitivity, 56.4s TimeCoverageRelationStatistics Valid=46226, Invalid=400666, Unknown=0, NotChecked=0, Total=446892 [2022-03-15 20:55:58,237 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 4876 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 4917 mSolverCounterSat, 1679 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4876 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 6596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1679 IncrementalHoareTripleChecker+Valid, 4917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:55:58,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4876 Valid, 1 Invalid, 6596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1679 Valid, 4917 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 20:55:58,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5731 states. [2022-03-15 20:55:58,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5731 to 3213. [2022-03-15 20:55:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3213 states, 3212 states have (on average 3.0283312577833126) internal successors, (9727), 3212 states have internal predecessors, (9727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3213 states to 3213 states and 9727 transitions. [2022-03-15 20:55:58,339 INFO L78 Accepts]: Start accepts. Automaton has 3213 states and 9727 transitions. Word has length 20 [2022-03-15 20:55:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:55:58,340 INFO L470 AbstractCegarLoop]: Abstraction has 3213 states and 9727 transitions. [2022-03-15 20:55:58,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.1379310344827585) internal successors, (124), 57 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3213 states and 9727 transitions. [2022-03-15 20:55:58,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:55:58,344 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:55:58,345 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:55:58,379 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:55:58,563 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:55:58,563 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:55:58,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:55:58,564 INFO L85 PathProgramCache]: Analyzing trace with hash -37689001, now seen corresponding path program 26 times [2022-03-15 20:55:58,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:55:58,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408665047] [2022-03-15 20:55:58,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:55:58,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:55:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:55:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:58,664 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:55:58,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408665047] [2022-03-15 20:55:58,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408665047] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:55:58,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144935429] [2022-03-15 20:55:58,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:55:58,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:58,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:55:58,665 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:55:58,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 20:55:58,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:55:58,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:55:58,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 20:55:58,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:55:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:58,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:55:58,962 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:58,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144935429] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:55:58,963 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:55:58,963 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 21 [2022-03-15 20:55:58,963 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2068700767] [2022-03-15 20:55:58,963 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:55:58,964 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:55:58,969 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 163 transitions. [2022-03-15 20:55:58,969 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:56:00,942 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 49 new interpolants: [106691#(or (<= n (* 32 x1)) (< (* 64 x1) n)), 106711#(or (<= n (* 32 x1)) (< (* 64 x1) n) (<= n (* x2 8))), 106672#(or (< (* x1 8) n) (<= n (* x1 4))), 106712#(or (<= n (* 16 x2)) (<= n (* 32 x1)) (< (* 64 x1) n)), 106706#(or (< (* 32 x1) n) (<= n (* 16 x1)) (<= n (* x2 8))), 106675#(or (< x1 n) (<= n x2)), 106692#(or (<= n (* x2 4)) (< (* x1 4) n) (<= n (* 2 x1))), 106680#(or (< x1 n) (<= n (* 32 x2))), 106681#(or (<= n x1) (<= n x2) (< (* 2 x1) n)), 106684#(or (<= n x1) (< (* 2 x1) n) (<= n (* x2 8))), 106673#(or (< (* 16 x1) n) (<= n (* x1 8))), 106685#(or (<= n x1) (<= n (* 16 x2)) (< (* 2 x1) n)), 106708#(or (<= n (* 32 x1)) (<= n x2) (< (* 64 x1) n)), 106710#(or (<= n (* x2 4)) (<= n (* 32 x1)) (< (* 64 x1) n)), 106693#(or (< (* x1 4) n) (<= n (* 2 x1)) (<= n (* x2 8))), 106694#(or (< (* x1 4) n) (<= n (* 16 x2)) (<= n (* 2 x1))), 106703#(or (< (* 32 x1) n) (<= n (* 16 x1)) (<= n x2)), 106669#(< x1 n), 106679#(or (< x1 n) (<= n (* 16 x2))), 106682#(or (<= n x1) (< (* 2 x1) n) (<= n (* 2 x2))), 106678#(or (< x1 n) (<= n (* x2 8))), 106704#(or (< (* 32 x1) n) (<= n (* 16 x1)) (<= n (* 2 x2))), 106709#(or (<= n (* 32 x1)) (< (* 64 x1) n) (<= n (* 2 x2))), 106701#(or (< (* x1 8) n) (<= n (* x1 4)) (<= n (* 16 x2))), 106683#(or (<= n (* x2 4)) (not (< x1 n)) (< (* 2 x1) n)), 106677#(or (<= n (* x2 4)) (< x1 n)), 106676#(or (< x1 n) (<= n (* 2 x2))), 106702#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= n (* 16 x2))), 106687#(or (< (* x1 4) n) (<= n x2) (<= n (* 2 x1))), 106700#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= n (* x2 8))), 106714#(or (< (* x1 8) n) (<= n (* x1 4)) (<= n (* 32 x2))), 106698#(or (<= n (* x2 4)) (< (* 16 x1) n) (<= n (* x1 8))), 106717#(or (<= n (* 32 x1)) (<= n (* 32 x2)) (< (* 64 x1) n)), 106674#(or (< (* 32 x1) n) (<= n (* 16 x1))), 106707#(or (< (* 32 x1) n) (<= n (* 16 x1)) (<= n (* 16 x2))), 106716#(or (< (* 32 x1) n) (<= n (* 16 x1)) (<= n (* 32 x2))), 106671#(or (< (* x1 4) n) (<= n (* 2 x1))), 106690#(or (< (* x1 8) n) (<= n (* x1 4)) (<= n (* 2 x2))), 106697#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= n (* 2 x2))), 106699#(or (< (* x1 8) n) (<= n (* x1 4)) (<= n (* x2 8))), 106688#(or (< (* x1 8) n) (<= n (* x1 4)) (<= n x2)), 106715#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= n (* 32 x2))), 106686#(or (not (< x1 n)) (<= n (* 32 x2)) (< (* 2 x1) n)), 106695#(or (<= n (* x2 4)) (< (* x1 8) n) (<= n (* x1 4))), 106713#(or (< (* x1 4) n) (<= n (* 32 x2)) (<= n (* 2 x1))), 106670#(or (not (< x1 n)) (< (* 2 x1) n)), 106689#(or (< (* x1 4) n) (<= n (* 2 x1)) (<= n (* 2 x2))), 106696#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= n x2)), 106705#(or (<= n (* x2 4)) (< (* 32 x1) n) (<= n (* 16 x1)))] [2022-03-15 20:56:00,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-15 20:56:00,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:56:00,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-15 20:56:00,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=4388, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 20:56:00,943 INFO L87 Difference]: Start difference. First operand 3213 states and 9727 transitions. Second operand has 65 states, 65 states have (on average 2.1538461538461537) 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 21:00:21,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:00:21,166 INFO L93 Difference]: Finished difference Result 10742 states and 30212 transitions. [2022-03-15 21:00:21,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2267 states. [2022-03-15 21:00:21,166 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.1538461538461537) 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 21:00:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:00:21,184 INFO L225 Difference]: With dead ends: 10742 [2022-03-15 21:00:21,185 INFO L226 Difference]: Without dead ends: 10427 [2022-03-15 21:00:21,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2386 GetRequests, 39 SyntacticMatches, 18 SemanticMatches, 2329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2934706 ImplicationChecksByTransitivity, 243.9s TimeCoverageRelationStatistics Valid=690282, Invalid=4740948, Unknown=0, NotChecked=0, Total=5431230 [2022-03-15 21:00:21,520 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 2835 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 2262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2835 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 4635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2262 IncrementalHoareTripleChecker+Valid, 2373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:00:21,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2835 Valid, 1 Invalid, 4635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2262 Valid, 2373 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 21:00:21,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10427 states. [2022-03-15 21:00:21,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10427 to 7443. [2022-03-15 21:00:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7443 states, 7442 states have (on average 3.1158290782047837) internal successors, (23188), 7442 states have internal predecessors, (23188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:00:21,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7443 states to 7443 states and 23188 transitions. [2022-03-15 21:00:21,880 INFO L78 Accepts]: Start accepts. Automaton has 7443 states and 23188 transitions. Word has length 21 [2022-03-15 21:00:21,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:00:21,880 INFO L470 AbstractCegarLoop]: Abstraction has 7443 states and 23188 transitions. [2022-03-15 21:00:21,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.1538461538461537) 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 21:00:21,881 INFO L276 IsEmpty]: Start isEmpty. Operand 7443 states and 23188 transitions. [2022-03-15 21:00:21,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:00:21,891 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:00:21,891 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:00:21,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 21:00:22,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:00:22,095 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:00:22,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:00:22,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1971539326, now seen corresponding path program 27 times [2022-03-15 21:00:22,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:00:22,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766980039] [2022-03-15 21:00:22,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:00:22,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:00:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:00:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:00:22,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:00:22,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766980039] [2022-03-15 21:00:22,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766980039] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:00:22,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403651897] [2022-03-15 21:00:22,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:00:22,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:00:22,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:00:22,195 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:00:22,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 21:00:22,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 21:00:22,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:00:22,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 21:00:22,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:00:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:00:22,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:00:22,512 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:00:22,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403651897] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:00:22,512 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:00:22,512 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 21 [2022-03-15 21:00:22,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1352779482] [2022-03-15 21:00:22,512 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:00:22,513 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:00:22,518 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 163 transitions. [2022-03-15 21:00:22,518 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:00:24,891 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 56 new interpolants: [137047#(or (not (< x1 n)) (<= (+ (* 32 x2) 1) n) (< (* 2 x1) n)), 137052#(or (< (* x1 8) n) (<= n (* x1 4)) (<= (+ (* 32 x2) 1) n)), 137031#(or (<= (+ (* x2 4) 1) n) (< (* x1 4) n) (<= n (* 2 x1))), 137032#(or (<= (+ (* x2 4) 1) n) (< (* x1 8) n) (<= n (* x1 4))), 137063#(or (<= n (* 64 x1)) (< (* x1 128) n) (<= (+ (* 32 x2) 1) n)), 137053#(or (<= n (* 64 x1)) (< (* x1 128) n) (<= (+ (* 2 x2) 1) n)), 137033#(or (<= (+ (* x2 4) 1) n) (< (* 16 x1) n) (<= n (* x1 8))), 137057#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= (+ (* 32 x2) 1) n)), 137037#(or (not (< x1 n)) (<= (+ (* x2 8) 1) n) (< (* 2 x1) n)), 137011#(or (< (* x1 8) n) (<= n (* x1 4))), 137035#(or (<= (+ (* x2 4) 1) n) (<= n (* 32 x1)) (< (* 64 x1) n)), 137051#(or (<= (+ (* 16 x2) 1) n) (not (< (* x1 4) n)) (< (* x1 8) n)), 137021#(or (< x2 n) (<= n (* 32 x1)) (< (* 64 x1) n)), 137027#(or (< (* 32 x1) n) (<= n (* 16 x1)) (<= (+ (* 2 x2) 1) n)), 137025#(or (< (* x1 8) n) (<= n (* x1 4)) (<= (+ (* 2 x2) 1) n)), 137022#(or (< x1 n) (<= (+ (* 2 x2) 1) n)), 137041#(or (< (* 32 x1) n) (<= n (* 16 x1)) (<= (+ (* x2 8) 1) n)), 137044#(or (not (< x1 n)) (<= (+ (* 16 x2) 1) n) (< (* 2 x1) n)), 137029#(or (<= (+ (* x2 4) 1) n) (< x1 n)), 137028#(or (<= n (* 32 x1)) (<= (+ (* 2 x2) 1) n) (< (* 64 x1) n)), 137045#(or (<= (+ (* 16 x2) 1) n) (< (* x1 4) n) (not (< (* 2 x1) n))), 137008#(< x1 n), 137058#(or (< (* 32 x1) n) (<= n (* 16 x1)) (<= (+ (* 32 x2) 1) n)), 137024#(or (< (* x1 4) n) (<= n (* 2 x1)) (<= (+ (* 2 x2) 1) n)), 137026#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= (+ (* 2 x2) 1) n)), 137046#(or (< x1 n) (<= (+ (* 32 x2) 1) n)), 137055#(or (<= (+ (* 16 x2) 1) n) (< (* 16 x1) n) (<= n (* x1 8))), 137017#(or (< (* x1 4) n) (< x2 n) (<= n (* 2 x1))), 137049#(or (<= n (* 64 x1)) (< (* x1 128) n)), 137030#(or (not (< x1 n)) (<= (+ (* x2 4) 1) n) (< (* 2 x1) n)), 137014#(or (<= n (* 32 x1)) (< (* 64 x1) n)), 137056#(or (< (* 32 x1) n) (<= n (* 16 x1)) (<= (+ (* 16 x2) 1) n)), 137023#(or (not (< x1 n)) (<= (+ (* 2 x2) 1) n) (< (* 2 x1) n)), 137059#(or (<= (+ (* 16 x2) 1) n) (<= n (* 32 x1)) (< (* 64 x1) n)), 137062#(or (<= (+ (* 16 x2) 1) n) (<= n (* 64 x1)) (< (* x1 128) n)), 137038#(or (< (* x1 4) n) (<= (+ (* x2 8) 1) n) (<= n (* 2 x1))), 137020#(or (< (* 32 x1) n) (<= n (* 16 x1)) (< x2 n)), 137043#(or (<= (+ (* 16 x2) 1) n) (< x1 n)), 137061#(or (<= n (* 64 x1)) (< (* x1 128) n) (<= (+ (* x2 8) 1) n)), 137016#(or (not (< x1 n)) (< x2 n) (< (* 2 x1) n)), 137040#(or (< (* 16 x1) n) (<= n (* x1 8)) (<= (+ (* x2 8) 1) n)), 137050#(or (<= n (* 64 x1)) (< x2 n) (< (* x1 128) n)), 137054#(or (<= (+ (* x2 4) 1) n) (<= n (* 64 x1)) (< (* x1 128) n)), 137042#(or (<= (+ (* x2 8) 1) n) (<= n (* 32 x1)) (< (* 64 x1) n)), 137060#(or (<= n (* 32 x1)) (<= (+ (* 32 x2) 1) n) (< (* 64 x1) n)), 137019#(or (< (* 16 x1) n) (<= n (* x1 8)) (< x2 n)), 137018#(or (< (* x1 8) n) (<= n (* x1 4)) (< x2 n)), 137012#(or (< (* 16 x1) n) (<= n (* x1 8))), 137015#(or (< x1 n) (< x2 n)), 137036#(or (< x1 n) (<= (+ (* x2 8) 1) n)), 137034#(or (< (* 32 x1) n) (<= (+ (* x2 4) 1) n) (<= n (* 16 x1))), 137013#(or (< (* 32 x1) n) (<= n (* 16 x1))), 137010#(or (< (* x1 4) n) (<= n (* 2 x1))), 137048#(or (< (* x1 4) n) (<= (+ (* 32 x2) 1) n) (<= n (* 2 x1))), 137009#(or (not (< x1 n)) (< (* 2 x1) n)), 137039#(or (< (* x1 8) n) (<= n (* x1 4)) (<= (+ (* x2 8) 1) n))] [2022-03-15 21:00:24,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-03-15 21:00:24,891 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:00:24,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-03-15 21:00:24,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=919, Invalid=5087, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 21:00:24,892 INFO L87 Difference]: Start difference. First operand 7443 states and 23188 transitions. Second operand has 72 states, 72 states have (on average 2.0416666666666665) 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 21:00:29,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:00:29,228 INFO L93 Difference]: Finished difference Result 8328 states and 25384 transitions. [2022-03-15 21:00:29,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-03-15 21:00:29,228 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.0416666666666665) 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 21:00:29,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:00:29,242 INFO L225 Difference]: With dead ends: 8328 [2022-03-15 21:00:29,242 INFO L226 Difference]: Without dead ends: 8300 [2022-03-15 21:00:29,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 30 SyntacticMatches, 20 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6526, Invalid=24626, Unknown=0, NotChecked=0, Total=31152 [2022-03-15 21:00:29,245 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 475 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:00:29,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 1 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:00:29,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8300 states. [2022-03-15 21:00:29,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8300 to 7741. [2022-03-15 21:00:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7741 states, 7740 states have (on average 3.0887596899224805) internal successors, (23907), 7740 states have internal predecessors, (23907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:00:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7741 states to 7741 states and 23907 transitions. [2022-03-15 21:00:29,417 INFO L78 Accepts]: Start accepts. Automaton has 7741 states and 23907 transitions. Word has length 21 [2022-03-15 21:00:29,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:00:29,417 INFO L470 AbstractCegarLoop]: Abstraction has 7741 states and 23907 transitions. [2022-03-15 21:00:29,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.0416666666666665) 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 21:00:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 7741 states and 23907 transitions. [2022-03-15 21:00:29,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:00:29,429 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:00:29,429 INFO L514 BasicCegarLoop]: trace histogram [8, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:00:29,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 21:00:29,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:00:29,639 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:00:29,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:00:29,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1602838089, now seen corresponding path program 28 times [2022-03-15 21:00:29,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:00:29,640 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051589953] [2022-03-15 21:00:29,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:00:29,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:00:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:00:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:00:29,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:00:29,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051589953] [2022-03-15 21:00:29,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051589953] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:00:29,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937270680] [2022-03-15 21:00:29,742 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:00:29,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:00:29,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:00:29,743 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:00:29,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 21:00:29,761 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:00:29,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:00:29,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 21:00:29,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:00:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:00:30,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:00:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:00:30,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937270680] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:00:30,330 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:00:30,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 32 [2022-03-15 21:00:30,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [627030598] [2022-03-15 21:00:30,330 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:00:30,331 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:00:30,336 INFO L252 McrAutomatonBuilder]: Finished intersection with 91 states and 159 transitions. [2022-03-15 21:00:30,336 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:00:32,956 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 48 new interpolants: [161237#(or (< x2 n) (<= (+ n 96) (* x1 8))), 161264#(or (<= n (* x2 4)) (<= (+ n 96) (* 32 x1)) (< (* x2 8) n)), 161258#(or (<= n (* 16 x2)) (<= (+ n 96) (* x1 8)) (< (* 32 x2) n)), 161232#(or (<= (+ n 96) (* 2 x1)) (< x2 n)), 161235#(or (<= (+ n 96) (* 2 x1)) (< (* 2 x2) n) (not (< x2 n))), 161254#(or (<= (+ n 96) (* x1 4)) (<= n (* 16 x2)) (< (* 32 x2) n)), 161240#(or (< (* 2 x2) n) (not (< x2 n)) (<= (+ n 96) (* 16 x1))), 161231#(or (<= (+ n 96) x1) (< x2 n)), 161238#(or (< (* 2 x2) n) (not (< x2 n)) (<= (+ n 96) (* x1 8))), 161271#(or (< (* 16 x2) n) (<= (+ n 96) (* 64 x1)) (<= n (* x2 8))), 161225#(< x2 n), 161227#(or (< (* x2 4) n) (<= n (* 2 x2))), 161242#(or (< (* 2 x2) n) (<= (+ n 96) (* 32 x1)) (not (< x2 n))), 161259#(or (< (* x2 4) n) (<= n (* 2 x2)) (<= (+ n 96) (* 16 x1))), 161265#(or (< (* 16 x2) n) (<= (+ n 96) (* 32 x1)) (<= n (* x2 8))), 161229#(or (< (* 16 x2) n) (<= n (* x2 8))), 161268#(or (<= (+ n 96) (* 64 x1)) (< (* 2 x2) n) (not (< x2 n))), 161251#(or (< (* 16 x2) n) (<= (+ n 96) (* x1 4)) (<= n (* x2 8))), 161267#(or (<= (+ n 96) (* 64 x1)) (< x2 n)), 161239#(or (< x2 n) (<= (+ n 96) (* 16 x1))), 161228#(or (<= n (* x2 4)) (< (* x2 8) n)), 161245#(or (< (* 16 x2) n) (<= (+ n 96) x1) (<= n (* x2 8))), 161247#(or (<= n (* x2 4)) (<= (+ n 96) (* 2 x1)) (< (* x2 8) n)), 161241#(or (<= (+ n 96) (* 32 x1)) (< x2 n)), 161272#(or (<= (+ n 96) (* 64 x1)) (<= n (* 16 x2)) (< (* 32 x2) n)), 161236#(or (<= (+ n 96) (* x1 4)) (< (* 2 x2) n) (not (< x2 n))), 161263#(or (<= (+ n 96) (* 32 x1)) (< (* x2 4) n) (<= n (* 2 x2))), 161262#(or (<= n (* 16 x2)) (< (* 32 x2) n) (<= (+ n 96) (* 16 x1))), 161266#(or (<= (+ n 96) (* 32 x1)) (<= n (* 16 x2)) (< (* 32 x2) n)), 161249#(or (<= (+ n 96) (* x1 4)) (not (< (* 2 x2) n)) (< (* x2 4) n)), 161226#(or (< (* 2 x2) n) (not (< x2 n))), 161269#(or (<= (+ n 96) (* 64 x1)) (< (* x2 4) n) (<= n (* 2 x2))), 161256#(or (<= n (* x2 4)) (<= (+ n 96) (* x1 8)) (< (* x2 8) n)), 161270#(or (<= n (* x2 4)) (<= (+ n 96) (* 64 x1)) (< (* x2 8) n)), 161230#(or (<= n (* 16 x2)) (< (* 32 x2) n)), 161234#(or (<= (+ n 96) x1) (< (* 2 x2) n) (not (< x2 n))), 161246#(or (<= (+ n 96) (* 2 x1)) (< (* x2 4) n) (<= n (* 2 x2))), 161250#(or (<= n (* x2 4)) (<= (+ n 96) (* x1 4)) (< (* x2 8) n)), 161257#(or (< (* 16 x2) n) (<= (+ n 96) (* x1 8)) (<= n (* x2 8))), 161255#(or (< (* x2 4) n) (<= (+ n 96) (* x1 8)) (<= n (* 2 x2))), 161253#(or (<= (+ n 96) (* 2 x1)) (<= n (* 16 x2)) (< (* 32 x2) n)), 161243#(or (<= (+ n 96) x1) (< (* x2 4) n) (<= n (* 2 x2))), 161261#(or (< (* 16 x2) n) (<= n (* x2 8)) (<= (+ n 96) (* 16 x1))), 161244#(or (<= n (* x2 4)) (<= (+ n 96) x1) (< (* x2 8) n)), 161252#(or (<= (+ n 96) x1) (<= n (* 16 x2)) (< (* 32 x2) n)), 161248#(or (< (* 16 x2) n) (<= (+ n 96) (* 2 x1)) (<= n (* x2 8))), 161260#(or (<= n (* x2 4)) (<= (+ n 96) (* 16 x1)) (< (* x2 8) n)), 161233#(or (<= (+ n 96) (* x1 4)) (< x2 n))] [2022-03-15 21:00:32,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-15 21:00:32,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:00:32,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-15 21:00:32,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=5907, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 21:00:32,958 INFO L87 Difference]: Start difference. First operand 7741 states and 23907 transitions. Second operand has 64 states, 64 states have (on average 2.140625) internal successors, (137), 63 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 21:02:43,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1294 states. [2022-03-15 21:02:43,093 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:02:43,093 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:02:43,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1416 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 1370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840721 ImplicationChecksByTransitivity, 124.7s TimeCoverageRelationStatistics Valid=112965, Invalid=1768047, Unknown=0, NotChecked=0, Total=1881012 [2022-03-15 21:02:43,130 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 343 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 13792 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 14142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 13792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:02:43,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 1 Invalid, 14142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 13792 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-03-15 21:02:43,131 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2022-03-15 21:02:43,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 21:02:43,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:02:43,332 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (7741states) and FLOYD_HOARE automaton (currently 1294 states, 64 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1372 known predicates. [2022-03-15 21:02:43,333 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 21:02:43,333 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 21:02:43,335 INFO L732 BasicCegarLoop]: Path program histogram: [28, 2, 1, 1] [2022-03-15 21:02:43,336 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 21:02:43,336 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 21:02:43,337 INFO L202 PluginConnector]: Adding new model exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 09:02:43 BasicIcfg [2022-03-15 21:02:43,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 21:02:43,338 INFO L158 Benchmark]: Toolchain (without parser) took 738488.94ms. Allocated memory was 174.1MB in the beginning and 6.9GB in the end (delta: 6.8GB). Free memory was 132.8MB in the beginning and 5.8GB in the end (delta: -5.6GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-03-15 21:02:43,338 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.08ms. Allocated memory is still 174.1MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 21:02:43,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.15ms. Allocated memory is still 174.1MB. Free memory was 132.8MB in the beginning and 131.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:02:43,338 INFO L158 Benchmark]: Boogie Preprocessor took 12.75ms. Allocated memory is still 174.1MB. Free memory was 131.3MB in the beginning and 130.3MB in the end (delta: 938.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:02:43,338 INFO L158 Benchmark]: RCFGBuilder took 158.68ms. Allocated memory is still 174.1MB. Free memory was 130.3MB in the beginning and 121.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-03-15 21:02:43,338 INFO L158 Benchmark]: TraceAbstraction took 738288.73ms. Allocated memory was 174.1MB in the beginning and 6.9GB in the end (delta: 6.8GB). Free memory was 121.3MB in the beginning and 5.8GB in the end (delta: -5.6GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-03-15 21:02:43,339 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.08ms. Allocated memory is still 174.1MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.15ms. Allocated memory is still 174.1MB. Free memory was 132.8MB in the beginning and 131.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.75ms. Allocated memory is still 174.1MB. Free memory was 131.3MB in the beginning and 130.3MB in the end (delta: 938.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 158.68ms. Allocated memory is still 174.1MB. Free memory was 130.3MB in the beginning and 121.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 738288.73ms. Allocated memory was 174.1MB in the beginning and 6.9GB in the end (delta: 6.8GB). Free memory was 121.3MB in the beginning and 5.8GB in the end (delta: -5.6GB). Peak memory consumption was 1.4GB. 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, 18 PlacesAfterwards, 19 TransitionsBefore, 13 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 37 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 0, positive unconditional: 37, 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: 23, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 37, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, 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: 38]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (7741states) and FLOYD_HOARE automaton (currently 1294 states, 64 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1372 known predicates. - TimeoutResultAtElement [Line: 33]: 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 (7741states) and FLOYD_HOARE automaton (currently 1294 states, 64 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1372 known predicates. - TimeoutResultAtElement [Line: 33]: 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 (7741states) and FLOYD_HOARE automaton (currently 1294 states, 64 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1372 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: 738.2s, OverallIterations: 32, TraceHistogramMax: 8, PathProgramHistogramMax: 28, EmptinessCheckTime: 0.1s, AutomataDifference: 695.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18117 SdHoareTripleChecker+Valid, 29.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18117 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 24.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10662 mSDsCounter, 10042 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 65326 IncrementalHoareTripleChecker+Invalid, 75368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10042 mSolverCounterUnsat, 32 mSDtfsCounter, 65326 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10455 GetRequests, 852 SyntacticMatches, 331 SemanticMatches, 9271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5361250 ImplicationChecksByTransitivity, 659.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7741occurred in iteration=31, InterpolantAutomatonStates: 7250, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 23811 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 939 NumberOfCodeBlocks, 939 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 1305 ConstructedInterpolants, 0 QuantifiedInterpolants, 10366 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1252 ConjunctsInSsa, 324 ConjunctsInUnsatCore, 90 InterpolantComputations, 3 PerfectInterpolantSequences, 305/1957 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