/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/parallel/bakery-3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:13:47,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:13:47,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:13:47,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:13:47,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:13:47,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:13:47,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:13:47,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:13:47,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:13:47,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:13:47,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:13:47,976 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:13:47,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:13:47,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:13:47,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:13:47,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:13:47,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:13:47,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:13:47,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:13:47,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:13:47,982 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:13:47,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:13:47,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:13:47,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:13:47,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:13:47,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:13:47,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:13:47,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:13:47,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:13:47,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:13:47,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:13:47,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:13:47,990 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:13:47,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:13:47,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:13:47,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:13:47,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:13:47,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:13:47,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:13:47,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:13:47,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:13:47,994 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 21:13:48,013 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:13:48,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:13:48,014 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:13:48,014 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:13:48,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:13:48,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:13:48,015 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:13:48,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:13:48,015 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:13:48,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:13:48,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:13:48,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:13:48,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:13:48,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:13:48,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:13:48,016 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:13:48,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:13:48,016 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:13:48,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:13:48,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:13:48,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:13:48,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:13:48,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:13:48,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:13:48,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:13:48,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:13:48,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:13:48,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:13:48,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:13:48,018 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:13:48,018 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:13:48,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:13:48,018 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 21:13:48,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:13:48,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:13:48,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:13:48,206 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:13:48,208 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:13:48,209 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/bakery-3.wvr.bpl [2022-03-15 21:13:48,209 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/bakery-3.wvr.bpl' [2022-03-15 21:13:48,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:13:48,237 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:13:48,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:13:48,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:13:48,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:13:48,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:13:48" (1/1) ... [2022-03-15 21:13:48,251 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:13:48" (1/1) ... [2022-03-15 21:13:48,259 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:13:48,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:13:48,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:13:48,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:13:48,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:13:48,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:13:48" (1/1) ... [2022-03-15 21:13:48,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:13:48" (1/1) ... [2022-03-15 21:13:48,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:13:48" (1/1) ... [2022-03-15 21:13:48,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:13:48" (1/1) ... [2022-03-15 21:13:48,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:13:48" (1/1) ... [2022-03-15 21:13:48,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:13:48" (1/1) ... [2022-03-15 21:13:48,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:13:48" (1/1) ... [2022-03-15 21:13:48,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:13:48,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:13:48,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:13:48,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:13:48,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:13:48" (1/1) ... [2022-03-15 21:13:48,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:13:48,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:13:48,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 21:13:48,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 21:13:48,344 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:13:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:13:48,344 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:13:48,344 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:13:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:13:48,344 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:13:48,344 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:13:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:13:48,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:13:48,345 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:13:48,345 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:13:48,345 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:13:48,345 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 21:13:48,378 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:13:48,379 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:13:48,460 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:13:48,466 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:13:48,466 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 21:13:48,467 INFO L202 PluginConnector]: Adding new model bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:13:48 BoogieIcfgContainer [2022-03-15 21:13:48,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:13:48,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:13:48,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:13:48,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:13:48,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:13:48" (1/2) ... [2022-03-15 21:13:48,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13584070 and model type bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:13:48, skipping insertion in model container [2022-03-15 21:13:48,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:13:48" (2/2) ... [2022-03-15 21:13:48,472 INFO L111 eAbstractionObserver]: Analyzing ICFG bakery-3.wvr.bpl [2022-03-15 21:13:48,475 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:13:48,475 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:13:48,475 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:13:48,475 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:13:48,509 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 21:13:48,556 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:13:48,560 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 21:13:48,560 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 21:13:48,576 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:13:48,596 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 53 transitions, 130 flow [2022-03-15 21:13:48,598 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 53 transitions, 130 flow [2022-03-15 21:13:48,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 53 transitions, 130 flow [2022-03-15 21:13:48,623 INFO L129 PetriNetUnfolder]: 0/50 cut-off events. [2022-03-15 21:13:48,624 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 21:13:48,625 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 0/50 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 80 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-03-15 21:13:48,626 INFO L116 LiptonReduction]: Number of co-enabled transitions 1170 [2022-03-15 21:13:48,700 INFO L131 LiptonReduction]: Checked pairs total: 5676 [2022-03-15 21:13:48,700 INFO L133 LiptonReduction]: Total number of compositions: 6 [2022-03-15 21:13:48,708 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 48 transitions, 120 flow [2022-03-15 21:13:48,821 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2565 states, 2564 states have (on average 2.769110764430577) internal successors, (7100), 2564 states have internal predecessors, (7100), 0 states have call successors, (0), 0 states have 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:13:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 2565 states, 2564 states have (on average 2.769110764430577) internal successors, (7100), 2564 states have internal predecessors, (7100), 0 states have call successors, (0), 0 states have 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:13:48,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:13:48,866 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:13:48,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:13:48,867 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:13:48,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:13:48,871 INFO L85 PathProgramCache]: Analyzing trace with hash -103821606, now seen corresponding path program 1 times [2022-03-15 21:13:48,887 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:13:48,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330724810] [2022-03-15 21:13:48,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:13:48,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:13:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:13:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:13:49,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:13:49,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330724810] [2022-03-15 21:13:49,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330724810] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:13:49,202 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:13:49,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 21:13:49,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1108007403] [2022-03-15 21:13:49,205 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:13:49,213 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:13:49,247 INFO L252 McrAutomatonBuilder]: Finished intersection with 143 states and 253 transitions. [2022-03-15 21:13:49,247 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:13:50,361 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:13:50,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:13:50,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:13:50,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:13:50,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:13:50,384 INFO L87 Difference]: Start difference. First operand has 2565 states, 2564 states have (on average 2.769110764430577) internal successors, (7100), 2564 states have internal predecessors, (7100), 0 states have call successors, (0), 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 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:13:50,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:13:50,641 INFO L93 Difference]: Finished difference Result 3123 states and 8286 transitions. [2022-03-15 21:13:50,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 21:13:50,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:13:50,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:13:50,663 INFO L225 Difference]: With dead ends: 3123 [2022-03-15 21:13:50,664 INFO L226 Difference]: Without dead ends: 3027 [2022-03-15 21:13:50,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:13:50,671 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 163 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:13:50,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 521 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:13:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2022-03-15 21:13:50,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 2597. [2022-03-15 21:13:50,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2597 states, 2596 states have (on average 2.755392912172573) internal successors, (7153), 2596 states have internal predecessors, (7153), 0 states have call successors, (0), 0 states have 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:13:50,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 7153 transitions. [2022-03-15 21:13:50,780 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 7153 transitions. Word has length 44 [2022-03-15 21:13:50,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:13:50,780 INFO L470 AbstractCegarLoop]: Abstraction has 2597 states and 7153 transitions. [2022-03-15 21:13:50,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:13:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 7153 transitions. [2022-03-15 21:13:50,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:13:50,786 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:13:50,787 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:13:50,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:13:50,787 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:13:50,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:13:50,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1178838868, now seen corresponding path program 2 times [2022-03-15 21:13:50,789 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:13:50,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146800869] [2022-03-15 21:13:50,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:13:50,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:13:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:13:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:13:51,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:13:51,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146800869] [2022-03-15 21:13:51,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146800869] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:13:51,029 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:13:51,029 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 21:13:51,029 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [267571517] [2022-03-15 21:13:51,029 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:13:51,032 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:13:51,047 INFO L252 McrAutomatonBuilder]: Finished intersection with 147 states and 264 transitions. [2022-03-15 21:13:51,047 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:13:53,175 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [13549#(and (or (not (< n1 n3)) (< n2 (+ n3 1)) (not (= n3 0))) (or (< n2 (+ n1 1)) (not (= n3 0)) (< n1 n3))), 13548#(and (or (<= n2 0) (< n2 (+ n1 1)) (< n3 (+ n1 1))) (or (<= 0 n3) (< n2 (+ n1 1)) (< n3 (+ n1 1))) (or (< n2 (+ n1 1)) (<= n3 n2)) (or (not (= n2 0)) (< n3 (+ n1 1)) (<= n3 n2)) (or (<= n2 0) (< n2 (+ n1 1)) (not (= n3 0)))), 13546#(and (or (<= n2 0) (< n3 n1)) (or (< n3 n1) (<= n3 n2)) (or (<= n2 0) (not (= n3 0))) (or (<= 0 n3) (< n3 n1)) (or (not (= n3 0)) (<= n3 n2))), 13545#(and (or (<= n2 (+ n1 1)) (< n3 n2)) (or (<= 1 n2) (< n3 n2)) (or (not (= n3 0)) (<= n1 n3)) (or (<= (+ n1 1) n2) (< n3 n2)) (or (<= n2 (+ n1 1)) (not (= n3 0)))), 13547#(and (or (not (= n2 0)) (< n3 n1) (<= n3 n2)) (or (<= 0 n3) (< n3 n1) (< n2 n1)) (or (<= n2 0) (not (= n3 0)) (< n2 n1)) (or (<= n3 n2) (< n2 n1)) (or (<= n2 0) (< n3 n1) (< n2 n1)))] [2022-03-15 21:13:53,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 21:13:53,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:13:53,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 21:13:53,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:13:53,177 INFO L87 Difference]: Start difference. First operand 2597 states and 7153 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:13:53,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:13:53,880 INFO L93 Difference]: Finished difference Result 8599 states and 23358 transitions. [2022-03-15 21:13:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 21:13:53,881 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:13:53,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:13:53,911 INFO L225 Difference]: With dead ends: 8599 [2022-03-15 21:13:53,911 INFO L226 Difference]: Without dead ends: 8116 [2022-03-15 21:13:53,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2022-03-15 21:13:53,912 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 351 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:13:53,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 949 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:13:53,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8116 states. [2022-03-15 21:13:53,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8116 to 3531. [2022-03-15 21:13:53,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3531 states, 3530 states have (on average 2.7359773371104814) internal successors, (9658), 3530 states have internal predecessors, (9658), 0 states have call successors, (0), 0 states have 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:13:54,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3531 states to 3531 states and 9658 transitions. [2022-03-15 21:13:54,008 INFO L78 Accepts]: Start accepts. Automaton has 3531 states and 9658 transitions. Word has length 44 [2022-03-15 21:13:54,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:13:54,008 INFO L470 AbstractCegarLoop]: Abstraction has 3531 states and 9658 transitions. [2022-03-15 21:13:54,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:13:54,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3531 states and 9658 transitions. [2022-03-15 21:13:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:13:54,014 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:13:54,014 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:13:54,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 21:13:54,015 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:13:54,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:13:54,015 INFO L85 PathProgramCache]: Analyzing trace with hash 733317302, now seen corresponding path program 3 times [2022-03-15 21:13:54,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:13:54,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155780781] [2022-03-15 21:13:54,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:13:54,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:13:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:13:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:13:54,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:13:54,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155780781] [2022-03-15 21:13:54,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155780781] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:13:54,036 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:13:54,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:13:54,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [295795631] [2022-03-15 21:13:54,036 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:13:54,039 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:13:54,063 INFO L252 McrAutomatonBuilder]: Finished intersection with 164 states and 316 transitions. [2022-03-15 21:13:54,063 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:13:54,511 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:13:54,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:13:54,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:13:54,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:13:54,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:13:54,512 INFO L87 Difference]: Start difference. First operand 3531 states and 9658 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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:13:54,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:13:54,536 INFO L93 Difference]: Finished difference Result 3457 states and 9315 transitions. [2022-03-15 21:13:54,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:13:54,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 44 [2022-03-15 21:13:54,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:13:54,548 INFO L225 Difference]: With dead ends: 3457 [2022-03-15 21:13:54,548 INFO L226 Difference]: Without dead ends: 3457 [2022-03-15 21:13:54,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:13:54,549 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:13:54,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 80 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:13:54,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2022-03-15 21:13:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 3433. [2022-03-15 21:13:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3433 states, 3432 states have (on average 2.6966783216783217) internal successors, (9255), 3432 states have internal predecessors, (9255), 0 states have call successors, (0), 0 states have 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:13:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 9255 transitions. [2022-03-15 21:13:54,608 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 9255 transitions. Word has length 44 [2022-03-15 21:13:54,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:13:54,608 INFO L470 AbstractCegarLoop]: Abstraction has 3433 states and 9255 transitions. [2022-03-15 21:13:54,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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:13:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 9255 transitions. [2022-03-15 21:13:54,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:13:54,614 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:13:54,614 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:13:54,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 21:13:54,615 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:13:54,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:13:54,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1337045290, now seen corresponding path program 4 times [2022-03-15 21:13:54,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:13:54,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114711212] [2022-03-15 21:13:54,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:13:54,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:13:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:13:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:13:54,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:13:54,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114711212] [2022-03-15 21:13:54,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114711212] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:13:54,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:13:54,695 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 21:13:54,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1099966752] [2022-03-15 21:13:54,697 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:13:54,701 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:13:54,721 INFO L252 McrAutomatonBuilder]: Finished intersection with 188 states and 376 transitions. [2022-03-15 21:13:54,722 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:13:55,920 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:13:55,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:13:55,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:13:55,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:13:55,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:13:55,921 INFO L87 Difference]: Start difference. First operand 3433 states and 9255 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:13:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:13:56,155 INFO L93 Difference]: Finished difference Result 4017 states and 10512 transitions. [2022-03-15 21:13:56,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 21:13:56,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:13:56,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:13:56,186 INFO L225 Difference]: With dead ends: 4017 [2022-03-15 21:13:56,186 INFO L226 Difference]: Without dead ends: 3936 [2022-03-15 21:13:56,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:13:56,187 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 151 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:13:56,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 522 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:13:56,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3936 states. [2022-03-15 21:13:56,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3936 to 3463. [2022-03-15 21:13:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3463 states, 3462 states have (on average 2.6877527440785673) internal successors, (9305), 3462 states have internal predecessors, (9305), 0 states have call successors, (0), 0 states have 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:13:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 9305 transitions. [2022-03-15 21:13:56,249 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 9305 transitions. Word has length 44 [2022-03-15 21:13:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:13:56,250 INFO L470 AbstractCegarLoop]: Abstraction has 3463 states and 9305 transitions. [2022-03-15 21:13:56,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:13:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 9305 transitions. [2022-03-15 21:13:56,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:13:56,256 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:13:56,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:13:56,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 21:13:56,256 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:13:56,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:13:56,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1191301702, now seen corresponding path program 5 times [2022-03-15 21:13:56,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:13:56,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949404649] [2022-03-15 21:13:56,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:13:56,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:13:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:13:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:13:56,369 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:13:56,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949404649] [2022-03-15 21:13:56,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949404649] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:13:56,369 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:13:56,369 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 21:13:56,369 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1430470811] [2022-03-15 21:13:56,370 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:13:56,373 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:13:56,394 INFO L252 McrAutomatonBuilder]: Finished intersection with 206 states and 415 transitions. [2022-03-15 21:13:56,394 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:00,668 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [50540#(or (<= 0 n3) (< n3 n1)), 50541#(and (or (< n3 n1) (<= n3 n2)) (or (<= 0 n3) (< n3 n1)) (or (not (= n3 0)) (<= n3 n2))), 50530#(and (not (= n2 0)) (or (= n3 n2) (< n2 n3))), 50543#(and (or (<= 0 n3) (< n2 (+ n1 1)) (< n3 (+ n1 1))) (or (< n2 (+ n1 1)) (<= n3 n2)) (or (not (= n2 0)) (< n3 (+ n1 1)) (<= n3 n2))), 50536#(and (or (not (= n2 0)) (< n1 (+ n3 1)) (= n1 (+ n3 1))) (or (<= 0 n3) (= n2 (+ n3 1)) (< n2 (+ n3 1)) (not (= n1 0))) (or (not (= n2 0)) (not (= n1 0))) (or (<= 0 n3) (= n2 (+ n3 1)) (< n2 (+ n3 1)) (< n1 (+ n3 1)) (= n1 (+ n3 1)))), 50538#(and (<= 0 n3) (<= n1 n3)), 50542#(and (or (not (= n2 0)) (< n3 n1) (<= n3 n2)) (or (<= 0 n3) (< n3 n1) (< n2 n1)) (or (<= n3 n2) (< n2 n1))), 50531#(and (not (= n2 0)) (or (= n3 n2) (< n2 n3) (<= 1 n3))), 50532#(and (or (= n3 n2) (= n3 n1) (< n2 n3) (< n1 n3)) (or (not (= n2 0)) (= n3 n1) (< n1 n3)) (or (not (= n2 0)) (not (= n1 0))) (or (= n3 n2) (not (= n1 0)) (< n2 n3))), 50539#(<= 0 n3), 50535#(and (or (not (= n1 0)) (<= (+ n3 1) n2)) (or (not (= n1 0)) (<= 1 n3)) (or (< n1 n2) (= n2 n1) (<= 1 n3)) (or (< n1 n2) (= n2 n1) (<= (+ n3 1) n2))), 50537#(and (or (<= 0 n3) (not (= n1 0))) (or (<= 1 n2) (not (= n1 0))) (or (<= 0 n3) (< n1 (+ n3 1)) (= n1 (+ n3 1))) (or (<= 1 n2) (< n1 (+ n3 1)) (= n1 (+ n3 1)))), 50533#(and (or (= n3 n2) (= n3 n1) (< n2 n3) (<= 1 n3) (< n1 n3)) (or (= n3 n2) (not (= n1 0)) (< n2 n3) (<= 1 n3)) (or (not (= n2 0)) (= n3 n1) (< n1 n3)) (or (not (= n2 0)) (not (= n1 0)))), 50534#(and (or (not (= n1 0)) (<= 1 n3)) (or (= n3 n1) (<= 1 n3) (< n1 n3)) (or (<= 1 n2) (not (= n1 0))) (or (<= 1 n2) (= n3 n1) (< n1 n3)))] [2022-03-15 21:14:00,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:14:00,669 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:00,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:14:00,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:14:00,670 INFO L87 Difference]: Start difference. First operand 3463 states and 9305 transitions. Second operand has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 23 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:03,247 INFO L93 Difference]: Finished difference Result 15457 states and 41773 transitions. [2022-03-15 21:14:03,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 21:14:03,247 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 23 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:14:03,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:03,280 INFO L225 Difference]: With dead ends: 15457 [2022-03-15 21:14:03,281 INFO L226 Difference]: Without dead ends: 14412 [2022-03-15 21:14:03,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 160 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1531 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1490, Invalid=4060, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 21:14:03,283 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 1504 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:03,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1504 Valid, 1576 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:14:03,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14412 states. [2022-03-15 21:14:03,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14412 to 5513. [2022-03-15 21:14:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5513 states, 5512 states have (on average 2.735123367198839) internal successors, (15076), 5512 states have internal predecessors, (15076), 0 states have call successors, (0), 0 states have 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:14:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5513 states to 5513 states and 15076 transitions. [2022-03-15 21:14:03,452 INFO L78 Accepts]: Start accepts. Automaton has 5513 states and 15076 transitions. Word has length 44 [2022-03-15 21:14:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:03,452 INFO L470 AbstractCegarLoop]: Abstraction has 5513 states and 15076 transitions. [2022-03-15 21:14:03,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 23 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 5513 states and 15076 transitions. [2022-03-15 21:14:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:03,463 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:03,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:03,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 21:14:03,464 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:03,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:03,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2096104994, now seen corresponding path program 6 times [2022-03-15 21:14:03,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:03,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403233765] [2022-03-15 21:14:03,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:03,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:03,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:03,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403233765] [2022-03-15 21:14:03,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403233765] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:03,571 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:03,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 21:14:03,571 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2031440218] [2022-03-15 21:14:03,571 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:03,574 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:03,596 INFO L252 McrAutomatonBuilder]: Finished intersection with 216 states and 441 transitions. [2022-03-15 21:14:03,596 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:05,282 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [77164#(and (or (<= (+ n2 1) n1) (not (= n3 0))) (< n3 n1)), 77158#(and (not (= n3 0)) (< n3 n2)), 77163#(and (< n3 n1) (or (not (= n3 0)) (= n2 n1))), 77162#(and (or (not (= n3 0)) (<= n1 n2)) (or (< n3 n1) (<= n1 n2)) (or (< n3 n1) (<= 1 n1))), 77160#(and (not (= n3 0)) (or (< n3 n1) (< n3 n2))), 77166#(and (or (< n2 (+ n1 1)) (not (= n3 0))) (or (not (= n2 0)) (< n3 (+ n1 1))) (or (< n2 (+ n1 1)) (< n3 (+ n1 1)))), 77165#(and (or (< n3 n1) (< n2 n1)) (or (not (= n2 0)) (< n3 n1)) (or (not (= n3 0)) (< n2 n1))), 77167#(and (or (not (< n1 n3)) (< n2 (+ n3 1)) (not (= n3 0))) (or (< n2 (+ n1 1)) (not (= n3 0)) (< n1 n3))), 77159#(and (< n3 n1) (not (= n3 0))), 77161#(and (or (<= (+ n1 1) n2) (< n3 n1)) (or (< n3 n1) (<= 1 n1)) (or (<= (+ n1 1) n2) (not (= n3 0))))] [2022-03-15 21:14:05,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:14:05,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:05,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:14:05,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-03-15 21:14:05,284 INFO L87 Difference]: Start difference. First operand 5513 states and 15076 transitions. Second operand has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:05,988 INFO L93 Difference]: Finished difference Result 10740 states and 28411 transitions. [2022-03-15 21:14:05,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 21:14:05,989 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:14:05,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:06,010 INFO L225 Difference]: With dead ends: 10740 [2022-03-15 21:14:06,010 INFO L226 Difference]: Without dead ends: 10728 [2022-03-15 21:14:06,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:14:06,011 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 441 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:06,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 1142 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:14:06,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10728 states. [2022-03-15 21:14:06,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10728 to 6505. [2022-03-15 21:14:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6505 states, 6504 states have (on average 2.6989544895448954) internal successors, (17554), 6504 states have internal predecessors, (17554), 0 states have call successors, (0), 0 states have 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:14:06,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6505 states to 6505 states and 17554 transitions. [2022-03-15 21:14:06,171 INFO L78 Accepts]: Start accepts. Automaton has 6505 states and 17554 transitions. Word has length 44 [2022-03-15 21:14:06,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:06,171 INFO L470 AbstractCegarLoop]: Abstraction has 6505 states and 17554 transitions. [2022-03-15 21:14:06,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:06,171 INFO L276 IsEmpty]: Start isEmpty. Operand 6505 states and 17554 transitions. [2022-03-15 21:14:06,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:06,181 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:06,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:06,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 21:14:06,181 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:06,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:06,182 INFO L85 PathProgramCache]: Analyzing trace with hash 404995600, now seen corresponding path program 7 times [2022-03-15 21:14:06,183 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:06,183 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520270060] [2022-03-15 21:14:06,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:06,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:06,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:06,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520270060] [2022-03-15 21:14:06,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520270060] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:06,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:06,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 21:14:06,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1969738090] [2022-03-15 21:14:06,362 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:06,365 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:06,383 INFO L252 McrAutomatonBuilder]: Finished intersection with 190 states and 373 transitions. [2022-03-15 21:14:06,383 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:09,163 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [100956#(and (or (<= n1 n3) (< n3 n2)) (or (<= 1 n2) (< n3 n2)) (or (not (= n3 0)) (<= n1 n3)) (or (not (= n3 0)) (<= 2 n2))), 100950#(and (or (<= 1 n2) (not (= n3 0))) (or (< n3 n1) (<= 0 n2)) (or (<= 0 n3) (< n3 n1))), 100957#(and (<= 0 n3) (or (<= 1 n2) (not (= n3 0))) (<= n1 n3) (<= 0 n2)), 100949#(and (or (<= 1 n2) (< n3 n1)) (or (not (= n3 0)) (<= 2 n2)) (or (<= 0 n3) (< n3 n1))), 100953#(and (or (<= 0 n3) (< n3 n1) (< n2 n1)) (or (not (= n3 0)) (< n2 n1))), 100955#(and (or (not (< n1 n3)) (< n2 (+ n3 1)) (not (= n3 0))) (or (< n2 (+ n1 1)) (not (= n3 0)) (< n1 n3))), 100952#(and (or (<= (+ n2 1) n1) (not (= n3 0))) (or (not (= n3 0)) (<= 1 n1)) (or (<= 0 n3) (< n3 n1))), 100954#(and (or (<= 0 n3) (< n2 (+ n1 1)) (< n3 (+ n1 1))) (or (< n2 (+ n1 1)) (not (= n3 0)))), 100958#(and (<= 0 n3) (<= n1 n3) (or (<= 1 n2) (< n2 n3)) (or (not (= n3 0)) (not (< n2 n3)))), 100951#(and (or (not (= n3 0)) (<= (+ n3 1) n2)) (or (<= 0 n3) (< n3 n1)))] [2022-03-15 21:14:09,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 21:14:09,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:09,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 21:14:09,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:14:09,165 INFO L87 Difference]: Start difference. First operand 6505 states and 17554 transitions. Second operand has 21 states, 21 states have (on average 5.238095238095238) internal successors, (110), 21 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have 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:14:10,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:10,472 INFO L93 Difference]: Finished difference Result 16866 states and 43874 transitions. [2022-03-15 21:14:10,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:14:10,498 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.238095238095238) internal successors, (110), 21 states have internal predecessors, (110), 0 states have call successors, (0), 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 44 [2022-03-15 21:14:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:10,530 INFO L225 Difference]: With dead ends: 16866 [2022-03-15 21:14:10,530 INFO L226 Difference]: Without dead ends: 16059 [2022-03-15 21:14:10,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 110 SyntacticMatches, 31 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=515, Invalid=1207, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 21:14:10,531 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 796 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:10,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [796 Valid, 1430 Invalid, 1769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:14:10,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16059 states. [2022-03-15 21:14:10,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16059 to 6675. [2022-03-15 21:14:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6675 states, 6674 states have (on average 2.6964339226850464) internal successors, (17996), 6674 states have internal predecessors, (17996), 0 states have call successors, (0), 0 states have 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:14:10,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6675 states to 6675 states and 17996 transitions. [2022-03-15 21:14:10,681 INFO L78 Accepts]: Start accepts. Automaton has 6675 states and 17996 transitions. Word has length 44 [2022-03-15 21:14:10,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:10,682 INFO L470 AbstractCegarLoop]: Abstraction has 6675 states and 17996 transitions. [2022-03-15 21:14:10,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.238095238095238) internal successors, (110), 21 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have 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:14:10,682 INFO L276 IsEmpty]: Start isEmpty. Operand 6675 states and 17996 transitions. [2022-03-15 21:14:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:10,692 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:10,692 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:10,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 21:14:10,692 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:10,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1845349946, now seen corresponding path program 8 times [2022-03-15 21:14:10,694 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:10,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83086131] [2022-03-15 21:14:10,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:10,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:10,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:10,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83086131] [2022-03-15 21:14:10,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83086131] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:10,821 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:10,821 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 21:14:10,821 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1768136736] [2022-03-15 21:14:10,822 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:10,825 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:10,852 INFO L252 McrAutomatonBuilder]: Finished intersection with 264 states and 567 transitions. [2022-03-15 21:14:10,852 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:14,885 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [131238#(and (not (= n2 0)) (or (= n3 n2) (< n2 n3))), 131248#(and (or (not (= n3 0)) (<= n2 n1)) (< n3 n1)), 131252#(and (or (< n2 (+ n1 1)) (not (= n3 0))) (or (not (= n2 0)) (< n3 (+ n1 1))) (or (< n2 (+ n1 1)) (< n3 (+ n1 1)))), 131242#(and (or (not (= n2 0)) (< n1 (+ n3 1)) (= n1 (+ n3 1))) (or (= n2 (+ n3 1)) (< n2 (+ n3 1)) (< n1 (+ n3 1)) (<= 1 n3) (= n1 (+ n3 1))) (or (= n2 (+ n3 1)) (< n2 (+ n3 1)) (not (= n1 0)) (<= 1 n3)) (or (not (= n2 0)) (not (= n1 0)))), 131240#(and (or (= n3 n2) (= n3 n1) (< n2 n3) (< n1 n3)) (or (not (= n2 0)) (= n3 n1) (< n1 n3)) (or (not (= n2 0)) (not (= n1 0))) (or (= n3 n2) (not (= n1 0)) (< n2 n3))), 131254#(<= 1 n2), 131241#(and (or (= n3 n2) (not (= n1 0)) (<= 2 n3) (< n2 n3)) (or (= n3 n2) (= n3 n1) (<= 2 n3) (< n2 n3) (< n1 n3)) (or (not (= n2 0)) (= n3 n1) (< n1 n3)) (or (not (= n2 0)) (not (= n1 0)))), 131253#(and (or (not (< n1 n3)) (< n2 (+ n3 1)) (not (= n3 0))) (or (< n2 (+ n1 1)) (not (= n3 0)) (< n1 n3))), 131247#(and (or (not (= n3 0)) (<= n2 n1)) (or (<= 1 n2) (not (= n3 0))) (< n3 n1)), 131239#(and (not (= n2 0)) (or (= n3 n2) (<= 2 n3) (< n2 n3))), 131251#(and (or (< n3 n1) (< n2 n1)) (or (not (= n2 0)) (< n3 n1)) (or (not (= n3 0)) (< n2 n1))), 131249#(and (< n3 n1) (or (not (= n3 0)) (= n2 n1))), 131244#(and (<= 1 n2) (<= 2 n3)), 131250#(and (or (<= (+ n2 1) n1) (not (= n3 0))) (< n3 n1)), 131243#(and (or (not (= n1 0)) (<= 2 n3)) (or (not (<= n2 n3)) (not (= n1 0))) (or (< n1 n2) (not (<= n2 n3)) (= n2 n1)) (or (< n1 n2) (= n2 n1) (<= 2 n3))), 131246#(and (<= (+ n3 1) n1) (<= n2 n1) (<= 1 n1)), 131245#(and (or (<= 1 n3) (not (< n2 n3))) (or (<= 1 n2) (< n2 n3)) (<= (+ n3 1) n1) (<= n2 n1))] [2022-03-15 21:14:14,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 21:14:14,885 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:14,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 21:14:14,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2022-03-15 21:14:14,886 INFO L87 Difference]: Start difference. First operand 6675 states and 17996 transitions. Second operand has 30 states, 30 states have (on average 5.133333333333334) internal successors, (154), 30 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:16,348 INFO L93 Difference]: Finished difference Result 12988 states and 33944 transitions. [2022-03-15 21:14:16,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 21:14:16,348 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.133333333333334) internal successors, (154), 30 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:14:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:16,367 INFO L225 Difference]: With dead ends: 12988 [2022-03-15 21:14:16,367 INFO L226 Difference]: Without dead ends: 12353 [2022-03-15 21:14:16,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 191 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=520, Invalid=2342, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 21:14:16,370 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 1091 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:16,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1091 Valid, 1284 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:14:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12353 states. [2022-03-15 21:14:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12353 to 6957. [2022-03-15 21:14:16,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6957 states, 6956 states have (on average 2.697527314548591) internal successors, (18764), 6956 states have internal predecessors, (18764), 0 states have call successors, (0), 0 states have 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:14:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6957 states to 6957 states and 18764 transitions. [2022-03-15 21:14:16,541 INFO L78 Accepts]: Start accepts. Automaton has 6957 states and 18764 transitions. Word has length 44 [2022-03-15 21:14:16,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:16,542 INFO L470 AbstractCegarLoop]: Abstraction has 6957 states and 18764 transitions. [2022-03-15 21:14:16,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.133333333333334) internal successors, (154), 30 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 6957 states and 18764 transitions. [2022-03-15 21:14:16,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:16,553 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:16,553 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:16,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 21:14:16,553 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:16,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:16,553 INFO L85 PathProgramCache]: Analyzing trace with hash -519756722, now seen corresponding path program 9 times [2022-03-15 21:14:16,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:16,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608476623] [2022-03-15 21:14:16,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:16,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:16,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:16,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608476623] [2022-03-15 21:14:16,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608476623] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:16,658 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:16,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 21:14:16,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1519940201] [2022-03-15 21:14:16,659 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:16,662 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:16,706 INFO L252 McrAutomatonBuilder]: Finished intersection with 220 states and 451 transitions. [2022-03-15 21:14:16,706 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:18,776 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [158220#(and (or (< n2 (+ n1 1)) (not (= n3 0))) (or (not (= n2 0)) (< n3 (+ n1 1))) (or (< n2 (+ n1 1)) (< n3 (+ n1 1)))), 158217#(and (or (= n3 n2) (= n3 n1) (< n2 n3) (< n1 n3)) (or (not (= n2 0)) (= n3 n1) (< n1 n3)) (or (not (= n2 0)) (not (= n1 0))) (or (= n3 n2) (not (= n1 0)) (< n2 n3))), 158216#(and (not (= n2 0)) (or (= n3 n2) (< n2 n3))), 158218#(and (or (<= (+ n2 1) n1) (not (= n3 0))) (< n3 n1)), 158219#(and (or (< n3 n1) (< n2 n1)) (or (not (= n2 0)) (< n3 n1)) (or (not (= n3 0)) (< n2 n1))), 158221#(and (or (not (< n1 n3)) (< n2 (+ n3 1)) (not (= n3 0))) (or (< n2 (+ n1 1)) (not (= n3 0)) (< n1 n3)))] [2022-03-15 21:14:18,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:14:18,776 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:18,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:14:18,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:14:18,777 INFO L87 Difference]: Start difference. First operand 6957 states and 18764 transitions. Second operand has 16 states, 16 states have (on average 6.1875) internal successors, (99), 16 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have 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:14:19,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:19,484 INFO L93 Difference]: Finished difference Result 11665 states and 30549 transitions. [2022-03-15 21:14:19,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 21:14:19,484 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.1875) internal successors, (99), 16 states have internal predecessors, (99), 0 states have call successors, (0), 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 44 [2022-03-15 21:14:19,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:19,498 INFO L225 Difference]: With dead ends: 11665 [2022-03-15 21:14:19,498 INFO L226 Difference]: Without dead ends: 11263 [2022-03-15 21:14:19,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2022-03-15 21:14:19,499 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 422 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:19,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [422 Valid, 1029 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:14:19,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11263 states. [2022-03-15 21:14:19,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11263 to 6619. [2022-03-15 21:14:19,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6619 states, 6618 states have (on average 2.683288002417649) internal successors, (17758), 6618 states have internal predecessors, (17758), 0 states have call successors, (0), 0 states have 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:14:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6619 states to 6619 states and 17758 transitions. [2022-03-15 21:14:19,631 INFO L78 Accepts]: Start accepts. Automaton has 6619 states and 17758 transitions. Word has length 44 [2022-03-15 21:14:19,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:19,631 INFO L470 AbstractCegarLoop]: Abstraction has 6619 states and 17758 transitions. [2022-03-15 21:14:19,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.1875) internal successors, (99), 16 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have 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:14:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 6619 states and 17758 transitions. [2022-03-15 21:14:19,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:19,641 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:19,641 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:19,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 21:14:19,641 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:19,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:19,641 INFO L85 PathProgramCache]: Analyzing trace with hash -389977192, now seen corresponding path program 10 times [2022-03-15 21:14:19,642 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:19,642 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916117193] [2022-03-15 21:14:19,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:19,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:19,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:19,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:19,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916117193] [2022-03-15 21:14:19,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916117193] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:19,785 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:19,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 21:14:19,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1322029766] [2022-03-15 21:14:19,785 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:19,788 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:19,812 INFO L252 McrAutomatonBuilder]: Finished intersection with 248 states and 525 transitions. [2022-03-15 21:14:19,812 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:23,055 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [183157#(and (not (= n2 0)) (or (= n3 n2) (< n2 n3))), 183166#(and (or (= n3 n2) (< n2 n3)) (<= 1 n3)), 183162#(and (or (<= (+ n2 1) n1) (not (= n3 0))) (< n3 n1)), 183160#(and (not (= n1 0)) (or (< n1 n2) (= n2 n1))), 183159#(and (or (not (= n2 0)) (< n1 (+ n3 1)) (= n1 (+ n3 1))) (or (= n2 (+ n3 1)) (< n2 (+ n3 1)) (not (= n1 0))) (or (not (= n2 0)) (not (= n1 0))) (or (= n2 (+ n3 1)) (< n2 (+ n3 1)) (< n1 (+ n3 1)) (= n1 (+ n3 1)))), 183165#(and (or (not (< n1 n3)) (< n2 (+ n3 1)) (not (= n3 0))) (or (< n2 (+ n1 1)) (not (= n3 0)) (< n1 n3))), 183161#(and (<= 1 n2) (<= (+ n2 1) n3) (< n3 (+ 2 n2))), 183158#(and (or (= n3 n2) (= n3 n1) (< n2 n3) (< n1 n3)) (or (not (= n2 0)) (= n3 n1) (< n1 n3)) (or (not (= n2 0)) (not (= n1 0))) (or (= n3 n2) (not (= n1 0)) (< n2 n3))), 183163#(and (or (< n3 n1) (< n2 n1)) (or (not (= n2 0)) (< n3 n1)) (or (not (= n3 0)) (< n2 n1))), 183164#(and (or (< n2 (+ n1 1)) (not (= n3 0))) (or (not (= n2 0)) (< n3 (+ n1 1))) (or (< n2 (+ n1 1)) (< n3 (+ n1 1))))] [2022-03-15 21:14:23,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 21:14:23,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:23,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 21:14:23,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:14:23,056 INFO L87 Difference]: Start difference. First operand 6619 states and 17758 transitions. Second operand has 20 states, 20 states have (on average 5.85) internal successors, (117), 20 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:24,279 INFO L93 Difference]: Finished difference Result 11399 states and 29632 transitions. [2022-03-15 21:14:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 21:14:24,280 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.85) internal successors, (117), 20 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:14:24,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:24,325 INFO L225 Difference]: With dead ends: 11399 [2022-03-15 21:14:24,325 INFO L226 Difference]: Without dead ends: 11132 [2022-03-15 21:14:24,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 185 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=372, Invalid=1608, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:14:24,326 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 890 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:24,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [890 Valid, 1474 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:14:24,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11132 states. [2022-03-15 21:14:24,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11132 to 6969. [2022-03-15 21:14:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6969 states, 6968 states have (on average 2.6779563719862227) internal successors, (18660), 6968 states have internal predecessors, (18660), 0 states have call successors, (0), 0 states have 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:14:24,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6969 states to 6969 states and 18660 transitions. [2022-03-15 21:14:24,461 INFO L78 Accepts]: Start accepts. Automaton has 6969 states and 18660 transitions. Word has length 44 [2022-03-15 21:14:24,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:24,461 INFO L470 AbstractCegarLoop]: Abstraction has 6969 states and 18660 transitions. [2022-03-15 21:14:24,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.85) internal successors, (117), 20 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:24,462 INFO L276 IsEmpty]: Start isEmpty. Operand 6969 states and 18660 transitions. [2022-03-15 21:14:24,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:24,472 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:24,472 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:24,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 21:14:24,474 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:24,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:24,475 INFO L85 PathProgramCache]: Analyzing trace with hash -192786468, now seen corresponding path program 11 times [2022-03-15 21:14:24,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:24,476 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356587068] [2022-03-15 21:14:24,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:24,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:24,598 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:24,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356587068] [2022-03-15 21:14:24,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356587068] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:24,598 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:24,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 21:14:24,598 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1420996389] [2022-03-15 21:14:24,598 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:24,601 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:24,620 INFO L252 McrAutomatonBuilder]: Finished intersection with 187 states and 364 transitions. [2022-03-15 21:14:24,621 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:26,570 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [208572#(and (or (<= (+ n2 1) n1) (not (= n3 0))) (< n3 n1)), 208569#(and (not (= n1 0)) (or (= n3 n1) (< n1 n3))), 208568#(and (or (= n3 n2) (= n3 n1) (< n2 n3) (< n1 n3)) (or (not (= n2 0)) (= n3 n1) (< n1 n3)) (or (not (= n2 0)) (not (= n1 0))) (or (= n3 n2) (not (= n1 0)) (< n2 n3))), 208571#(and (not (= n1 0)) (or (< n1 n2) (= n2 n1))), 208575#(and (or (not (< n1 n3)) (< n2 (+ n3 1)) (not (= n3 0))) (or (< n2 (+ n1 1)) (not (= n3 0)) (< n1 n3))), 208573#(and (or (< n3 n1) (< n2 n1)) (or (not (= n2 0)) (< n3 n1)) (or (not (= n3 0)) (< n2 n1))), 208570#(and (= n2 n1) (<= n2 n3) (<= 1 n1)), 208574#(and (or (< n2 (+ n1 1)) (not (= n3 0))) (or (not (= n2 0)) (< n3 (+ n1 1))) (or (< n2 (+ n1 1)) (< n3 (+ n1 1)))), 208567#(and (not (= n2 0)) (or (= n3 n2) (< n2 n3)))] [2022-03-15 21:14:26,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:14:26,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:26,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:14:26,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2022-03-15 21:14:26,571 INFO L87 Difference]: Start difference. First operand 6969 states and 18660 transitions. Second operand has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:27,092 INFO L93 Difference]: Finished difference Result 10304 states and 26944 transitions. [2022-03-15 21:14:27,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 21:14:27,092 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:14:27,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:27,106 INFO L225 Difference]: With dead ends: 10304 [2022-03-15 21:14:27,106 INFO L226 Difference]: Without dead ends: 10070 [2022-03-15 21:14:27,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 121 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2022-03-15 21:14:27,107 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 331 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:27,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 956 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:14:27,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10070 states. [2022-03-15 21:14:27,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10070 to 7176. [2022-03-15 21:14:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7176 states, 7175 states have (on average 2.6788850174216026) internal successors, (19221), 7175 states have internal predecessors, (19221), 0 states have call successors, (0), 0 states have 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:14:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7176 states to 7176 states and 19221 transitions. [2022-03-15 21:14:27,232 INFO L78 Accepts]: Start accepts. Automaton has 7176 states and 19221 transitions. Word has length 44 [2022-03-15 21:14:27,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:27,232 INFO L470 AbstractCegarLoop]: Abstraction has 7176 states and 19221 transitions. [2022-03-15 21:14:27,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:27,232 INFO L276 IsEmpty]: Start isEmpty. Operand 7176 states and 19221 transitions. [2022-03-15 21:14:27,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:27,242 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:27,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:27,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 21:14:27,242 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:27,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:27,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1958238852, now seen corresponding path program 12 times [2022-03-15 21:14:27,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:27,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844222941] [2022-03-15 21:14:27,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:27,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:27,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:27,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844222941] [2022-03-15 21:14:27,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844222941] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:27,256 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:27,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:14:27,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [900324184] [2022-03-15 21:14:27,256 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:27,259 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:27,279 INFO L252 McrAutomatonBuilder]: Finished intersection with 189 states and 378 transitions. [2022-03-15 21:14:27,279 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:27,718 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:14:27,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:14:27,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:27,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:14:27,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:14:27,719 INFO L87 Difference]: Start difference. First operand 7176 states and 19221 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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 21:14:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:27,744 INFO L93 Difference]: Finished difference Result 5957 states and 15381 transitions. [2022-03-15 21:14:27,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:14:27,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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 44 [2022-03-15 21:14:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:27,751 INFO L225 Difference]: With dead ends: 5957 [2022-03-15 21:14:27,751 INFO L226 Difference]: Without dead ends: 5951 [2022-03-15 21:14:27,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:14:27,752 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 17 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:27,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 80 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:14:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5951 states. [2022-03-15 21:14:27,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5951 to 5729. [2022-03-15 21:14:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5729 states, 5728 states have (on average 2.5895600558659218) internal successors, (14833), 5728 states have internal predecessors, (14833), 0 states have call successors, (0), 0 states have 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:14:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5729 states to 5729 states and 14833 transitions. [2022-03-15 21:14:27,826 INFO L78 Accepts]: Start accepts. Automaton has 5729 states and 14833 transitions. Word has length 44 [2022-03-15 21:14:27,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:27,826 INFO L470 AbstractCegarLoop]: Abstraction has 5729 states and 14833 transitions. [2022-03-15 21:14:27,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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 21:14:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 5729 states and 14833 transitions. [2022-03-15 21:14:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:27,832 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:27,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:27,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 21:14:27,832 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:27,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:27,833 INFO L85 PathProgramCache]: Analyzing trace with hash -103867228, now seen corresponding path program 13 times [2022-03-15 21:14:27,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:27,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103375428] [2022-03-15 21:14:27,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:27,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:27,883 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:27,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103375428] [2022-03-15 21:14:27,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103375428] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:27,883 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:27,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 21:14:27,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1268701640] [2022-03-15 21:14:27,883 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:27,886 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:27,904 INFO L252 McrAutomatonBuilder]: Finished intersection with 191 states and 383 transitions. [2022-03-15 21:14:27,904 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:29,125 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:14:29,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:14:29,125 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:29,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:14:29,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:14:29,126 INFO L87 Difference]: Start difference. First operand 5729 states and 14833 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:14:29,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:29,299 INFO L93 Difference]: Finished difference Result 6206 states and 15859 transitions. [2022-03-15 21:14:29,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 21:14:29,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 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 44 [2022-03-15 21:14:29,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:29,306 INFO L225 Difference]: With dead ends: 6206 [2022-03-15 21:14:29,306 INFO L226 Difference]: Without dead ends: 5966 [2022-03-15 21:14:29,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:14:29,307 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 147 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:29,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 522 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:14:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2022-03-15 21:14:29,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 5663. [2022-03-15 21:14:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5663 states, 5662 states have (on average 2.5748851995761215) internal successors, (14579), 5662 states have internal predecessors, (14579), 0 states have call successors, (0), 0 states have 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:14:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5663 states to 5663 states and 14579 transitions. [2022-03-15 21:14:29,375 INFO L78 Accepts]: Start accepts. Automaton has 5663 states and 14579 transitions. Word has length 44 [2022-03-15 21:14:29,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:29,375 INFO L470 AbstractCegarLoop]: Abstraction has 5663 states and 14579 transitions. [2022-03-15 21:14:29,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:14:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 5663 states and 14579 transitions. [2022-03-15 21:14:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:29,381 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:29,381 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:29,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 21:14:29,382 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:29,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:29,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1119766886, now seen corresponding path program 14 times [2022-03-15 21:14:29,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:29,383 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571089174] [2022-03-15 21:14:29,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:29,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:29,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:29,465 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:29,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571089174] [2022-03-15 21:14:29,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571089174] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:29,465 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:29,465 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 21:14:29,466 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [473891148] [2022-03-15 21:14:29,466 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:29,468 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:29,486 INFO L252 McrAutomatonBuilder]: Finished intersection with 174 states and 340 transitions. [2022-03-15 21:14:29,486 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:31,551 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [268227#(and (= n3 n1) (<= 1 n1)), 268234#(and (<= 0 n3) (<= n1 n3) (<= n2 n3)), 268230#(and (or (< n3 n2) (<= 1 n1)) (or (<= (+ n3 1) n1) (< n3 n2)) (or (not (= n3 0)) (<= (+ n3 1) n1))), 268231#(and (or (< n3 n1) (not (= n3 0))) (or (< n3 n1) (< n3 n2))), 268229#(< n3 n1), 268233#(and (or (not (= n1 0)) (< n3 n2)) (or (not (= n1 0)) (not (= n3 0))) (or (< n1 n2) (= n2 n1) (<= (+ n3 1) n1)) (or (< n1 n2) (= n2 n1) (< n3 n2) (<= 1 n1))), 268228#(and (or (<= (+ n2 1) n1) (not (= n3 0))) (< n3 n1)), 268232#(and (or (not (= n2 0)) (<= (+ n3 1) n1)) (or (< n2 n1) (<= (+ n3 1) n1)) (or (< n2 n1) (<= 1 n1)))] [2022-03-15 21:14:31,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 21:14:31,551 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:31,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 21:14:31,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:14:31,552 INFO L87 Difference]: Start difference. First operand 5663 states and 14579 transitions. Second operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:31,953 INFO L93 Difference]: Finished difference Result 7689 states and 19509 transitions. [2022-03-15 21:14:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 21:14:31,953 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:14:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:31,962 INFO L225 Difference]: With dead ends: 7689 [2022-03-15 21:14:31,962 INFO L226 Difference]: Without dead ends: 7508 [2022-03-15 21:14:31,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 111 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2022-03-15 21:14:31,964 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 322 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:31,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 744 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:14:31,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7508 states. [2022-03-15 21:14:32,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7508 to 5213. [2022-03-15 21:14:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5213 states, 5212 states have (on average 2.548733691481197) internal successors, (13284), 5212 states have internal predecessors, (13284), 0 states have call successors, (0), 0 states have 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:14:32,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5213 states to 5213 states and 13284 transitions. [2022-03-15 21:14:32,037 INFO L78 Accepts]: Start accepts. Automaton has 5213 states and 13284 transitions. Word has length 44 [2022-03-15 21:14:32,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:32,037 INFO L470 AbstractCegarLoop]: Abstraction has 5213 states and 13284 transitions. [2022-03-15 21:14:32,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 5213 states and 13284 transitions. [2022-03-15 21:14:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:32,043 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:32,043 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:32,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 21:14:32,043 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:32,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:32,044 INFO L85 PathProgramCache]: Analyzing trace with hash 669037596, now seen corresponding path program 15 times [2022-03-15 21:14:32,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:32,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47453846] [2022-03-15 21:14:32,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:32,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:32,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:32,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:32,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47453846] [2022-03-15 21:14:32,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47453846] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:32,116 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:32,116 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 21:14:32,116 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [965059087] [2022-03-15 21:14:32,116 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:32,119 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:32,138 INFO L252 McrAutomatonBuilder]: Finished intersection with 196 states and 386 transitions. [2022-03-15 21:14:32,138 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:33,789 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [286377#(and (not (= n3 0)) (or (< n3 n1) (< n3 n2))), 286380#(and (or (not (= n1 0)) (< n3 n2)) (or (<= 1 n2) (< n1 n2) (= n2 n1) (< n3 n2)) (or (not (= n1 0)) (not (= n3 0)))), 286372#(and (<= 0 n3) (<= 1 n1)), 286374#(and (not (= n2 0)) (< n2 n1)), 286379#(and (or (< n1 n2) (= n2 n1) (< n3 n2)) (or (not (= n1 0)) (< n3 n2)) (or (not (= n1 0)) (not (= n3 0))) (or (< n1 n2) (not (= n3 0)) (= n2 n1))), 286375#(and (not (= n3 0)) (< n3 n2)), 286378#(and (or (<= (+ n2 1) n1) (not (= n3 0))) (or (<= 1 n2) (< n3 n2)) (or (<= (+ n2 1) n1) (< n3 n2))), 286376#(and (< n3 n1) (not (= n3 0))), 286373#(<= 0 n3), 286371#(and (<= 0 n3) (<= 0 n2) (<= 1 n1))] [2022-03-15 21:14:33,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:14:33,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:33,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:14:33,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-03-15 21:14:33,790 INFO L87 Difference]: Start difference. First operand 5213 states and 13284 transitions. Second operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:34,453 INFO L93 Difference]: Finished difference Result 8579 states and 21264 transitions. [2022-03-15 21:14:34,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 21:14:34,460 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:14:34,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:34,470 INFO L225 Difference]: With dead ends: 8579 [2022-03-15 21:14:34,470 INFO L226 Difference]: Without dead ends: 8293 [2022-03-15 21:14:34,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=326, Invalid=864, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:14:34,471 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 633 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:34,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [633 Valid, 674 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:14:34,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8293 states. [2022-03-15 21:14:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8293 to 5626. [2022-03-15 21:14:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5626 states, 5625 states have (on average 2.5242666666666667) internal successors, (14199), 5625 states have internal predecessors, (14199), 0 states have call successors, (0), 0 states have 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:14:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5626 states to 5626 states and 14199 transitions. [2022-03-15 21:14:34,545 INFO L78 Accepts]: Start accepts. Automaton has 5626 states and 14199 transitions. Word has length 44 [2022-03-15 21:14:34,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:34,545 INFO L470 AbstractCegarLoop]: Abstraction has 5626 states and 14199 transitions. [2022-03-15 21:14:34,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:34,545 INFO L276 IsEmpty]: Start isEmpty. Operand 5626 states and 14199 transitions. [2022-03-15 21:14:34,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:34,551 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:34,551 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:34,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-15 21:14:34,551 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:34,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:34,551 INFO L85 PathProgramCache]: Analyzing trace with hash -693042670, now seen corresponding path program 16 times [2022-03-15 21:14:34,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:34,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586146523] [2022-03-15 21:14:34,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:34,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:34,640 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:34,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586146523] [2022-03-15 21:14:34,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586146523] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:34,642 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:34,642 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 21:14:34,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [676098737] [2022-03-15 21:14:34,642 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:34,645 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:34,661 INFO L252 McrAutomatonBuilder]: Finished intersection with 170 states and 323 transitions. [2022-03-15 21:14:34,661 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:35,526 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [306253#(and (not (= n3 0)) (< n3 n2)), 306256#(and (<= (+ n2 1) n1) (or (<= 0 n3) (not (< n2 n3))) (or (<= 0 n2) (< n2 n3)) (<= (+ n3 1) n1)), 306252#(and (<= n1 n3) (<= 0 n2) (<= n2 n3) (<= n3 n2)), 306251#(and (not (= n1 0)) (or (< n1 n2) (= n2 n1))), 306254#(and (not (= n2 0)) (< n2 n1)), 306255#(and (<= (+ n2 1) n1) (<= 0 n2))] [2022-03-15 21:14:35,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 21:14:35,526 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:35,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 21:14:35,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:14:35,526 INFO L87 Difference]: Start difference. First operand 5626 states and 14199 transitions. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 12 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 21:14:35,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:35,946 INFO L93 Difference]: Finished difference Result 6439 states and 15782 transitions. [2022-03-15 21:14:35,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 21:14:35,947 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 12 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 44 [2022-03-15 21:14:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:35,955 INFO L225 Difference]: With dead ends: 6439 [2022-03-15 21:14:35,955 INFO L226 Difference]: Without dead ends: 6439 [2022-03-15 21:14:35,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 105 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-03-15 21:14:35,956 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 193 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:35,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 726 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:14:35,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6439 states. [2022-03-15 21:14:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6439 to 5108. [2022-03-15 21:14:36,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5108 states, 5107 states have (on average 2.4926571372625808) internal successors, (12730), 5107 states have internal predecessors, (12730), 0 states have call successors, (0), 0 states have 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:14:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5108 states to 5108 states and 12730 transitions. [2022-03-15 21:14:36,027 INFO L78 Accepts]: Start accepts. Automaton has 5108 states and 12730 transitions. Word has length 44 [2022-03-15 21:14:36,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:36,027 INFO L470 AbstractCegarLoop]: Abstraction has 5108 states and 12730 transitions. [2022-03-15 21:14:36,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 12 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 21:14:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 5108 states and 12730 transitions. [2022-03-15 21:14:36,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:36,035 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:36,035 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:36,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-15 21:14:36,035 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:36,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:36,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1966816360, now seen corresponding path program 17 times [2022-03-15 21:14:36,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:36,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652357361] [2022-03-15 21:14:36,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:36,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:36,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:36,054 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:36,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652357361] [2022-03-15 21:14:36,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652357361] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:36,054 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:36,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:14:36,054 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1468928533] [2022-03-15 21:14:36,054 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:36,057 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:36,079 INFO L252 McrAutomatonBuilder]: Finished intersection with 158 states and 300 transitions. [2022-03-15 21:14:36,079 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:36,277 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:14:36,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:14:36,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:36,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:14:36,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:14:36,278 INFO L87 Difference]: Start difference. First operand 5108 states and 12730 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:36,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:36,309 INFO L93 Difference]: Finished difference Result 4720 states and 11575 transitions. [2022-03-15 21:14:36,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:14:36,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:14:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:36,315 INFO L225 Difference]: With dead ends: 4720 [2022-03-15 21:14:36,315 INFO L226 Difference]: Without dead ends: 4720 [2022-03-15 21:14:36,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:14:36,316 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 19 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:36,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 78 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:14:36,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4720 states. [2022-03-15 21:14:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4720 to 4713. [2022-03-15 21:14:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4713 states, 4712 states have (on average 2.4539473684210527) internal successors, (11563), 4712 states have internal predecessors, (11563), 0 states have call successors, (0), 0 states have 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:14:36,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4713 states to 4713 states and 11563 transitions. [2022-03-15 21:14:36,365 INFO L78 Accepts]: Start accepts. Automaton has 4713 states and 11563 transitions. Word has length 44 [2022-03-15 21:14:36,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:36,366 INFO L470 AbstractCegarLoop]: Abstraction has 4713 states and 11563 transitions. [2022-03-15 21:14:36,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:36,366 INFO L276 IsEmpty]: Start isEmpty. Operand 4713 states and 11563 transitions. [2022-03-15 21:14:36,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:36,370 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:36,370 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:36,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-15 21:14:36,370 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:36,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:36,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1829753276, now seen corresponding path program 18 times [2022-03-15 21:14:36,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:36,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000802338] [2022-03-15 21:14:36,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:36,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:36,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:36,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000802338] [2022-03-15 21:14:36,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000802338] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:36,435 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:36,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 21:14:36,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [127365680] [2022-03-15 21:14:36,435 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:36,438 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:36,458 INFO L252 McrAutomatonBuilder]: Finished intersection with 206 states and 420 transitions. [2022-03-15 21:14:36,459 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:39,729 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [337083#(and (not (= n1 0)) (or (< n1 n2) (= n2 n1))), 337082#(and (or (= n3 n2) (= n3 n1) (< n2 n3) (< n1 n3)) (or (not (= n2 0)) (= n3 n1) (< n1 n3)) (or (not (= n2 0)) (not (= n1 0))) (or (= n3 n2) (not (= n1 0)) (< n2 n3))), 337084#(and (or (<= 1 n2) (< n1 n2) (= n2 n1)) (or (<= 1 n2) (not (= n1 0))) (or (<= (+ n2 1) n3) (not (= n1 0))) (or (< n1 n2) (<= (+ n2 1) n3) (= n2 n1))), 337081#(and (not (= n2 0)) (or (= n3 n2) (< n2 n3))), 337085#(and (or (<= 1 n2) (< n1 n2) (= n2 n1)) (or (< n1 n2) (= n3 n2) (= n2 n1)) (or (<= 1 n2) (not (= n1 0))) (or (= n3 n2) (not (= n1 0)))), 337086#(and (or (<= 0 n3) (not (= n1 0))) (or (not (= n1 0)) (<= (+ n3 1) n2)) (or (<= 0 n3) (< n1 n2) (= n2 n1)) (or (< n1 n2) (= n2 n1) (<= (+ n3 1) n2))), 337087#(and (or (not (= n3 0)) (<= (+ n3 1) n2)) (or (< n3 n1) (<= (+ n3 1) n2)) (or (<= 0 n3) (< n3 n1)))] [2022-03-15 21:14:39,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 21:14:39,730 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:39,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 21:14:39,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:14:39,730 INFO L87 Difference]: Start difference. First operand 4713 states and 11563 transitions. Second operand has 15 states, 15 states have (on average 6.2) internal successors, (93), 14 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:14:39,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:39,937 INFO L93 Difference]: Finished difference Result 7342 states and 17693 transitions. [2022-03-15 21:14:39,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:14:39,937 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.2) internal successors, (93), 14 states have internal predecessors, (93), 0 states have call successors, (0), 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 44 [2022-03-15 21:14:39,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:39,945 INFO L225 Difference]: With dead ends: 7342 [2022-03-15 21:14:39,945 INFO L226 Difference]: Without dead ends: 7049 [2022-03-15 21:14:39,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:14:39,946 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 249 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:39,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 420 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:14:39,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7049 states. [2022-03-15 21:14:40,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7049 to 4827. [2022-03-15 21:14:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4827 states, 4826 states have (on average 2.4537919602154994) internal successors, (11842), 4826 states have internal predecessors, (11842), 0 states have call successors, (0), 0 states have 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:14:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4827 states to 4827 states and 11842 transitions. [2022-03-15 21:14:40,014 INFO L78 Accepts]: Start accepts. Automaton has 4827 states and 11842 transitions. Word has length 44 [2022-03-15 21:14:40,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:40,014 INFO L470 AbstractCegarLoop]: Abstraction has 4827 states and 11842 transitions. [2022-03-15 21:14:40,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.2) internal successors, (93), 14 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:14:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 4827 states and 11842 transitions. [2022-03-15 21:14:40,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:40,020 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:40,020 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:40,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-15 21:14:40,021 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:40,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:40,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1686237682, now seen corresponding path program 19 times [2022-03-15 21:14:40,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:40,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025697320] [2022-03-15 21:14:40,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:40,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:40,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:40,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:40,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025697320] [2022-03-15 21:14:40,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025697320] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:40,194 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:40,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 21:14:40,194 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1658565304] [2022-03-15 21:14:40,194 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:40,197 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:40,220 INFO L252 McrAutomatonBuilder]: Finished intersection with 221 states and 458 transitions. [2022-03-15 21:14:40,220 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:44,046 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [354097#(and (or (not (= n2 0)) (not (<= n2 n3))) (or (<= n2 0) (= n3 n2) (<= 2 n3))), 354101#(and (or (not (= n2 0)) (< n1 (+ n3 1)) (< n3 n2) (= n1 (+ n3 1))) (or (not (= n2 0)) (= (+ n2 1) n1) (< n1 (+ n2 1)) (not (< n3 n2))) (or (not (= n2 0)) (not (= n1 0)))), 354105#(and (<= n3 0) (<= 0 n2) (<= n1 n2) (<= n2 n3)), 354102#(<= 1 n2), 354106#(and (<= (+ n2 1) n1) (or (<= 0 n3) (not (< n2 n3))) (or (<= 0 n2) (< n2 n3)) (<= (+ n3 1) n1)), 354100#(and (or (not (= n2 0)) (< (+ n3 1) n2) (not (= n1 0))) (or (not (= n2 0)) (< (+ n3 1) n2) (< n1 (+ n3 1)) (= n1 (+ n3 1))) (or (<= n2 0) (= n2 (+ n3 1)) (< n1 (+ n3 1)) (<= 1 n3) (= n1 (+ n3 1))) (or (<= n2 0) (= n2 (+ n3 1)) (not (= n1 0)) (<= 1 n3))), 354098#(and (or (= n3 n2) (= n3 n1) (< n2 n3) (< n1 n3)) (or (not (= n2 0)) (= n3 n1) (< n1 n3)) (or (not (= n2 0)) (not (= n1 0))) (or (= n3 n2) (not (= n1 0)) (< n2 n3))), 354096#(and (not (= n2 0)) (or (= n3 n2) (< n2 n3))), 354104#(and (<= (+ n2 1) n1) (<= 0 n2) (<= (+ n3 1) n1)), 354095#(and (or (not (<= n2 n3)) (not (= n1 0))) (or (< n1 n2) (not (<= n2 n3)) (= n2 n1)) (or (<= n2 0) (< n1 n2) (= n2 n1) (<= 2 n3)) (or (<= n2 0) (not (= n1 0)) (<= 2 n3))), 354099#(and (or (<= n2 0) (= n3 n2) (not (= n1 0)) (<= 2 n3)) (or (not (= n2 0)) (not (= n1 0)) (< n3 n2)) (or (<= n2 0) (= n3 n2) (= n3 n1) (<= 2 n3) (< n1 n3)) (or (not (= n2 0)) (= n3 n1) (< n3 n2) (< n1 n3))), 354103#(and (or (not (= n3 0)) (<= n2 n1)) (or (<= 1 n2) (not (= n3 0))) (< n3 n1))] [2022-03-15 21:14:44,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:14:44,046 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:44,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:14:44,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:14:44,047 INFO L87 Difference]: Start difference. First operand 4827 states and 11842 transitions. Second operand has 23 states, 23 states have (on average 5.043478260869565) internal successors, (116), 22 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:45,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:45,747 INFO L93 Difference]: Finished difference Result 7859 states and 18459 transitions. [2022-03-15 21:14:45,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 21:14:45,748 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.043478260869565) internal successors, (116), 22 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:14:45,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:45,756 INFO L225 Difference]: With dead ends: 7859 [2022-03-15 21:14:45,756 INFO L226 Difference]: Without dead ends: 7180 [2022-03-15 21:14:45,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 145 SyntacticMatches, 17 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=667, Invalid=2639, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 21:14:45,757 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 786 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:45,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [786 Valid, 1737 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:14:45,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7180 states. [2022-03-15 21:14:45,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7180 to 4319. [2022-03-15 21:14:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4319 states, 4318 states have (on average 2.4187123668364983) internal successors, (10444), 4318 states have internal predecessors, (10444), 0 states have call successors, (0), 0 states have 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:14:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4319 states to 4319 states and 10444 transitions. [2022-03-15 21:14:45,820 INFO L78 Accepts]: Start accepts. Automaton has 4319 states and 10444 transitions. Word has length 44 [2022-03-15 21:14:45,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:45,820 INFO L470 AbstractCegarLoop]: Abstraction has 4319 states and 10444 transitions. [2022-03-15 21:14:45,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.043478260869565) internal successors, (116), 22 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:45,820 INFO L276 IsEmpty]: Start isEmpty. Operand 4319 states and 10444 transitions. [2022-03-15 21:14:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:45,825 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:45,825 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:45,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-15 21:14:45,825 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:45,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:45,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1072812612, now seen corresponding path program 20 times [2022-03-15 21:14:45,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:45,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756389337] [2022-03-15 21:14:45,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:45,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:45,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:45,881 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:45,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756389337] [2022-03-15 21:14:45,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756389337] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:45,881 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:45,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 21:14:45,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1121909271] [2022-03-15 21:14:45,882 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:45,885 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:45,902 INFO L252 McrAutomatonBuilder]: Finished intersection with 181 states and 355 transitions. [2022-03-15 21:14:45,902 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:46,973 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:14:46,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:14:46,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:46,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:14:46,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:14:46,974 INFO L87 Difference]: Start difference. First operand 4319 states and 10444 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:47,138 INFO L93 Difference]: Finished difference Result 4468 states and 10685 transitions. [2022-03-15 21:14:47,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 21:14:47,138 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:14:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:47,143 INFO L225 Difference]: With dead ends: 4468 [2022-03-15 21:14:47,144 INFO L226 Difference]: Without dead ends: 4377 [2022-03-15 21:14:47,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:14:47,144 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 142 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:47,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 524 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:14:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4377 states. [2022-03-15 21:14:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4377 to 4265. [2022-03-15 21:14:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4265 states, 4264 states have (on average 2.4209662288930582) internal successors, (10323), 4264 states have internal predecessors, (10323), 0 states have call successors, (0), 0 states have 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:14:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4265 states to 4265 states and 10323 transitions. [2022-03-15 21:14:47,191 INFO L78 Accepts]: Start accepts. Automaton has 4265 states and 10323 transitions. Word has length 44 [2022-03-15 21:14:47,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:47,191 INFO L470 AbstractCegarLoop]: Abstraction has 4265 states and 10323 transitions. [2022-03-15 21:14:47,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 4265 states and 10323 transitions. [2022-03-15 21:14:47,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:47,196 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:47,196 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:47,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-15 21:14:47,196 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:47,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:47,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1028821188, now seen corresponding path program 21 times [2022-03-15 21:14:47,197 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:47,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141626895] [2022-03-15 21:14:47,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:47,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:47,257 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:47,257 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141626895] [2022-03-15 21:14:47,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141626895] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:47,257 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:47,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 21:14:47,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1682276158] [2022-03-15 21:14:47,258 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:47,261 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:47,280 INFO L252 McrAutomatonBuilder]: Finished intersection with 193 states and 375 transitions. [2022-03-15 21:14:47,281 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:50,187 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [383720#(and (or (<= 0 n3) (not (< n1 n2)) (not (< n2 n3))) (or (<= 0 n2) (not (< n1 n2)) (< n2 n3)) (or (<= 0 n3) (not (< n1 n3)) (< n1 n2)) (or (< n1 n2) (<= 0 n1) (< n1 n3))), 383722#(and (<= 0 n2) (<= n1 n2) (<= n3 n2)), 383706#(and (not (= n1 0)) (or (= n3 n1) (< n1 n3))), 383712#(and (not (= n1 0)) (or (= n3 n1) (< n1 (+ n2 1)) (< n1 n3)) (or (= n3 n1) (< n1 n3) (<= 1 n1))), 383710#(and (or (< (+ n3 1) n2) (not (= n1 0))) (or (not (= (+ n3 1) 0)) (< n1 (+ n3 1))) (or (< (+ n3 1) n2) (< n1 (+ n3 1)) (= n1 (+ n3 1)))), 383714#(and (or (< n1 (+ n3 1)) (= n1 (+ n3 1)) (<= 1 n1)) (not (= n1 0)) (or (< n1 (+ n3 1)) (< n1 (+ n2 1)) (= n1 (+ n3 1)))), 383704#(and (not (= n2 0)) (or (= n3 n2) (< n2 n3))), 383713#(and (not (= n1 0)) (or (< n1 (+ n3 1)) (= n1 (+ n3 1)))), 383708#(and (or (< n1 n2) (= n2 n1) (< n3 n2)) (or (not (= n1 0)) (< n3 n2)) (or (not (= n1 0)) (not (= n3 0))) (or (< n1 n2) (not (= n3 0)) (= n2 n1))), 383709#(and (or (not (= n1 0)) (< n3 n2)) (or (< n1 n2) (not (= n3 0)) (= n2 n1) (< n1 n3)) (or (not (= n1 0)) (not (= n3 0))) (or (= n3 n1) (< n3 n2) (< n1 n3))), 383719#(and (or (<= 0 n1) (< n1 n3)) (or (<= 0 n3) (not (< n1 n3)))), 383715#(and (not (= n1 0)) (or (= (+ n2 1) n1) (< n1 (+ n2 1)) (not (< n3 n2))) (or (< n1 (+ n3 1)) (< n3 n2) (= n1 (+ n3 1)))), 383718#(<= 0 n1), 383705#(and (or (= n3 n2) (= n3 n1) (< n2 n3) (< n1 n3)) (or (not (= n2 0)) (= n3 n1) (< n1 n3)) (or (not (= n2 0)) (not (= n1 0))) (or (= n3 n2) (not (= n1 0)) (< n2 n3))), 383721#(and (or (<= 0 n1) (< n1 n3)) (or (<= 0 n3) (not (< n1 n3))) (<= n1 n2) (<= n3 n2)), 383703#(and (not (= n3 0)) (< n3 n2)), 383717#(and (or (<= n1 n3) (not (< n2 n3))) (<= 0 n1) (or (<= n1 n2) (< n2 n3))), 383711#(and (or (< (+ n3 1) n2) (not (= n1 0))) (or (not (= (+ n3 1) 0)) (< n1 n2) (< n1 (+ n3 1)) (= n2 n1)) (or (not (= (+ n3 1) 0)) (not (= n1 0))) (or (< (+ n3 1) n2) (< n1 (+ n3 1)) (= n1 (+ n3 1)))), 383707#(and (or (not (= n1 0)) (< n3 n2)) (or (not (= n3 0)) (< n1 n3)) (or (= n3 n1) (< n3 n2) (< n1 n3))), 383716#(and (< n1 (+ 2 n2)) (<= 1 n1))] [2022-03-15 21:14:50,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:14:50,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:50,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:14:50,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:14:50,188 INFO L87 Difference]: Start difference. First operand 4265 states and 10323 transitions. Second operand has 28 states, 28 states have (on average 5.142857142857143) internal successors, (144), 27 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:51,945 INFO L93 Difference]: Finished difference Result 8563 states and 19561 transitions. [2022-03-15 21:14:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 21:14:51,945 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.142857142857143) internal successors, (144), 27 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:14:51,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:51,954 INFO L225 Difference]: With dead ends: 8563 [2022-03-15 21:14:51,955 INFO L226 Difference]: Without dead ends: 7647 [2022-03-15 21:14:51,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 121 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1135, Invalid=3421, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 21:14:51,956 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 1437 mSDsluCounter, 2150 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 2124 SdHoareTripleChecker+Invalid, 2352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:51,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1437 Valid, 2124 Invalid, 2352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:14:51,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7647 states. [2022-03-15 21:14:52,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7647 to 3797. [2022-03-15 21:14:52,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3797 states, 3796 states have (on average 2.353003161222339) internal successors, (8932), 3796 states have internal predecessors, (8932), 0 states have call successors, (0), 0 states have 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:14:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 8932 transitions. [2022-03-15 21:14:52,033 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 8932 transitions. Word has length 44 [2022-03-15 21:14:52,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:52,033 INFO L470 AbstractCegarLoop]: Abstraction has 3797 states and 8932 transitions. [2022-03-15 21:14:52,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.142857142857143) internal successors, (144), 27 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 8932 transitions. [2022-03-15 21:14:52,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:52,038 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:52,038 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:52,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-15 21:14:52,038 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:52,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:52,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2118800228, now seen corresponding path program 22 times [2022-03-15 21:14:52,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:52,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074676861] [2022-03-15 21:14:52,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:52,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:52,138 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:52,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074676861] [2022-03-15 21:14:52,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074676861] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:52,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:52,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 21:14:52,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1374434242] [2022-03-15 21:14:52,138 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:52,141 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:52,163 INFO L252 McrAutomatonBuilder]: Finished intersection with 200 states and 403 transitions. [2022-03-15 21:14:52,164 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:54,957 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [399973#(and (<= (+ n2 1) n1) (or (<= 0 n3) (not (< n2 n3))) (or (<= 0 n2) (< n2 n3)) (<= (+ n3 1) n1)), 399978#(and (or (<= 0 n3) (not (< n1 n2)) (not (< n2 n3))) (or (<= 0 n2) (not (< n1 n2)) (< n2 n3)) (or (<= 0 n3) (not (< n1 n3)) (< n1 n2)) (or (< n1 n2) (<= 0 n1) (< n1 n3))), 399970#(and (or (= n3 n2) (= n3 n1) (< n2 n3) (< n1 n3)) (or (not (= n2 0)) (= n3 n1) (< n1 n3)) (or (not (= n2 0)) (not (= n1 0))) (or (= n3 n2) (not (= n1 0)) (< n2 n3))), 399976#(and (<= 0 n1) (<= n3 n1) (<= n2 n1)), 399969#(and (not (= n2 0)) (or (= n3 n2) (< n2 n3))), 399979#(and (<= 0 n3) (<= n1 n3) (<= n2 n3) (<= n3 n2)), 399977#(and (or (<= n2 n1) (< n1 n3)) (or (<= 0 n1) (< n1 n3)) (or (not (< n1 n3)) (<= n2 n3)) (or (<= 0 n3) (not (< n1 n3)))), 399971#(and (not (= n1 0)) (or (< n1 n2) (= n2 n1))), 399975#(and (or (<= 0 n3) (not (< n2 n3))) (or (<= 0 n2) (< n2 n3)) (<= n3 n1) (<= n2 n1)), 399972#(and (<= (+ 2 n2) n3) (<= 0 n2)), 399974#(and (<= 0 n2) (<= n3 n1) (<= n2 n1))] [2022-03-15 21:14:54,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 21:14:54,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:54,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 21:14:54,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:14:54,958 INFO L87 Difference]: Start difference. First operand 3797 states and 8932 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:55,581 INFO L93 Difference]: Finished difference Result 5467 states and 12151 transitions. [2022-03-15 21:14:55,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 21:14:55,581 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:14:55,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:55,586 INFO L225 Difference]: With dead ends: 5467 [2022-03-15 21:14:55,586 INFO L226 Difference]: Without dead ends: 4729 [2022-03-15 21:14:55,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 134 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2022-03-15 21:14:55,587 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 430 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:55,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 1080 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:14:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4729 states. [2022-03-15 21:14:55,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4729 to 3020. [2022-03-15 21:14:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3020 states, 3019 states have (on average 2.3269294468367008) internal successors, (7025), 3019 states have internal predecessors, (7025), 0 states have call successors, (0), 0 states have 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:14:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 7025 transitions. [2022-03-15 21:14:55,624 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 7025 transitions. Word has length 44 [2022-03-15 21:14:55,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:55,624 INFO L470 AbstractCegarLoop]: Abstraction has 3020 states and 7025 transitions. [2022-03-15 21:14:55,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:14:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 7025 transitions. [2022-03-15 21:14:55,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:55,626 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:55,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:55,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-15 21:14:55,627 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:55,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:55,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1214106424, now seen corresponding path program 23 times [2022-03-15 21:14:55,628 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:55,628 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587473583] [2022-03-15 21:14:55,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:55,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:55,683 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:55,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587473583] [2022-03-15 21:14:55,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587473583] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:55,683 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:55,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 21:14:55,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1935109455] [2022-03-15 21:14:55,683 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:55,686 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:55,703 INFO L252 McrAutomatonBuilder]: Finished intersection with 168 states and 329 transitions. [2022-03-15 21:14:55,703 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:14:56,684 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:14:56,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:14:56,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:14:56,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:14:56,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:14:56,685 INFO L87 Difference]: Start difference. First operand 3020 states and 7025 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 8 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 21:14:56,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:14:56,869 INFO L93 Difference]: Finished difference Result 3273 states and 7504 transitions. [2022-03-15 21:14:56,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 21:14:56,869 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 8 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 44 [2022-03-15 21:14:56,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:14:56,872 INFO L225 Difference]: With dead ends: 3273 [2022-03-15 21:14:56,872 INFO L226 Difference]: Without dead ends: 2724 [2022-03-15 21:14:56,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:14:56,872 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 150 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:14:56,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 519 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:14:56,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2724 states. [2022-03-15 21:14:56,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2724 to 2479. [2022-03-15 21:14:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2479 states, 2478 states have (on average 2.2711864406779663) internal successors, (5628), 2478 states have internal predecessors, (5628), 0 states have call successors, (0), 0 states have 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:14:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 5628 transitions. [2022-03-15 21:14:56,895 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 5628 transitions. Word has length 44 [2022-03-15 21:14:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:14:56,895 INFO L470 AbstractCegarLoop]: Abstraction has 2479 states and 5628 transitions. [2022-03-15 21:14:56,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 8 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 21:14:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 5628 transitions. [2022-03-15 21:14:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:14:56,897 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:14:56,897 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:14:56,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-15 21:14:56,898 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:14:56,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:14:56,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1760199724, now seen corresponding path program 24 times [2022-03-15 21:14:56,898 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:14:56,899 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693418917] [2022-03-15 21:14:56,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:14:56,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:14:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:14:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:14:57,007 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:14:57,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693418917] [2022-03-15 21:14:57,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693418917] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:14:57,007 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:14:57,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 21:14:57,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [419884788] [2022-03-15 21:14:57,008 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:14:57,021 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:14:57,043 INFO L252 McrAutomatonBuilder]: Finished intersection with 196 states and 389 transitions. [2022-03-15 21:14:57,043 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:15:00,370 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [419776#(and (or (= n3 n2) (= n3 n1) (< n2 n3) (<= 1 n3) (< n1 n3)) (or (not (= n2 0)) (not (= n1 0))) (or (not (= n2 0)) (not (= n3 0)) (< n1 n3)) (or (= n3 n2) (not (= n1 0)) (< n2 n3))), 419774#(and (or (= n3 n2) (< n3 n1) (< n2 n3)) (or (not (= n2 0)) (not (= n3 0))) (or (not (= n2 0)) (< n3 n1)) (or (= n3 n2) (< n2 n3) (<= 1 n3))), 419780#(and (<= 0 n3) (<= n1 n3) (<= n2 n3)), 419781#(and (or (<= 0 n2) (not (< n3 n2))) (< 0 n1) (or (<= 0 n3) (< n3 n2))), 419773#(and (not (= n2 0)) (or (= n3 n2) (< n2 n3))), 419777#(and (< 0 (+ n1 1)) (<= 1 n3)), 419778#(and (<= 0 n3) (<= n1 n3)), 419775#(and (or (= n3 n2) (= n3 n1) (< n2 n3) (< n1 n3)) (or (not (= n2 0)) (= n3 n1) (< n1 n3)) (or (not (= n2 0)) (not (= n1 0))) (or (= n3 n2) (not (= n1 0)) (< n2 n3))), 419779#(and (or (= n2 (+ n3 1)) (< n2 (+ n3 1)) (not (= n1 0))) (or (not (= n2 0)) (not (= (+ n3 1) 0)) (< n1 (+ n3 1))) (or (not (= n2 0)) (not (= n1 0))) (or (<= 0 n3) (= n2 (+ n3 1)) (< n2 (+ n3 1)) (< n1 (+ n3 1)) (= n1 (+ n3 1))))] [2022-03-15 21:15:00,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 21:15:00,370 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:15:00,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 21:15:00,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:15:00,371 INFO L87 Difference]: Start difference. First operand 2479 states and 5628 transitions. Second operand has 17 states, 17 states have (on average 6.176470588235294) internal successors, (105), 16 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:15:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:15:00,779 INFO L93 Difference]: Finished difference Result 2858 states and 6287 transitions. [2022-03-15 21:15:00,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 21:15:00,779 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.176470588235294) internal successors, (105), 16 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:15:00,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:15:00,781 INFO L225 Difference]: With dead ends: 2858 [2022-03-15 21:15:00,781 INFO L226 Difference]: Without dead ends: 1576 [2022-03-15 21:15:00,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 129 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:15:00,781 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 419 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:15:00,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 495 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:15:00,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2022-03-15 21:15:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1251. [2022-03-15 21:15:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1250 states have (on average 2.1552) internal successors, (2694), 1250 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have 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:15:00,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 2694 transitions. [2022-03-15 21:15:00,793 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 2694 transitions. Word has length 44 [2022-03-15 21:15:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:15:00,793 INFO L470 AbstractCegarLoop]: Abstraction has 1251 states and 2694 transitions. [2022-03-15 21:15:00,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.176470588235294) internal successors, (105), 16 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:15:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 2694 transitions. [2022-03-15 21:15:00,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:15:00,794 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:15:00,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:15:00,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-15 21:15:00,794 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:15:00,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:15:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1620085718, now seen corresponding path program 25 times [2022-03-15 21:15:00,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:15:00,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121248548] [2022-03-15 21:15:00,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:15:00,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:15:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:15:00,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:15:00,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:15:00,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121248548] [2022-03-15 21:15:00,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121248548] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:15:00,948 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:15:00,948 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 21:15:00,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [636900030] [2022-03-15 21:15:00,948 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:15:00,951 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:15:00,971 INFO L252 McrAutomatonBuilder]: Finished intersection with 198 states and 399 transitions. [2022-03-15 21:15:00,971 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:15:02,398 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [425172#(and (not (= n2 0)) (or (= n3 n2) (< n2 n3))), 425171#(and (or (<= 0 n3) (not (< n2 n3))) (or (<= 0 n2) (< n2 n3))), 425173#(and (<= (+ n2 1) n3) (<= 0 n2))] [2022-03-15 21:15:02,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 21:15:02,398 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:15:02,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 21:15:02,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-03-15 21:15:02,399 INFO L87 Difference]: Start difference. First operand 1251 states and 2694 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 9 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 21:15:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:15:02,491 INFO L93 Difference]: Finished difference Result 2054 states and 4376 transitions. [2022-03-15 21:15:02,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:15:02,492 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 9 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 44 [2022-03-15 21:15:02,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:15:02,493 INFO L225 Difference]: With dead ends: 2054 [2022-03-15 21:15:02,493 INFO L226 Difference]: Without dead ends: 1737 [2022-03-15 21:15:02,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:15:02,494 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 229 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:15:02,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 157 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:15:02,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2022-03-15 21:15:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1243. [2022-03-15 21:15:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1242 states have (on average 2.14170692431562) internal successors, (2660), 1242 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have 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:15:02,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 2660 transitions. [2022-03-15 21:15:02,506 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 2660 transitions. Word has length 44 [2022-03-15 21:15:02,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:15:02,506 INFO L470 AbstractCegarLoop]: Abstraction has 1243 states and 2660 transitions. [2022-03-15 21:15:02,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 9 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 21:15:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 2660 transitions. [2022-03-15 21:15:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:15:02,507 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:15:02,507 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:15:02,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-15 21:15:02,507 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:15:02,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:15:02,508 INFO L85 PathProgramCache]: Analyzing trace with hash -779621580, now seen corresponding path program 26 times [2022-03-15 21:15:02,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:15:02,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850720513] [2022-03-15 21:15:02,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:15:02,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:15:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:15:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:15:02,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:15:02,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850720513] [2022-03-15 21:15:02,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850720513] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:15:02,610 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:15:02,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 21:15:02,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [273243793] [2022-03-15 21:15:02,610 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:15:02,612 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:15:02,632 INFO L252 McrAutomatonBuilder]: Finished intersection with 196 states and 395 transitions. [2022-03-15 21:15:02,632 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:15:05,279 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [429729#(and (<= 0 n3) (<= n1 n3) (<= n2 n3)), 429724#(and (not (= n2 0)) (or (= n3 n2) (< n2 n3))), 429726#(and (or (= n3 n2) (= n3 n1) (< n2 n3) (< n1 n3)) (or (not (= n2 0)) (= n3 n1) (< n1 n3)) (or (not (= n2 0)) (not (= n1 0))) (or (= n3 n2) (not (= n1 0)) (< n2 n3))), 429725#(and (not (= n2 0)) (or (= n3 n2) (< n2 n3) (<= 1 n3))), 429728#(and (or (not (<= n2 n3)) (not (= n1 0))) (or (< n1 n2) (not (<= n2 n3)) (= n2 n1)) (or (not (= n1 0)) (<= 1 n3)) (or (< n1 n2) (= n2 n1) (<= 1 n3))), 429727#(and (or (= n3 n2) (= n3 n1) (< n2 n3) (<= 1 n3) (< n1 n3)) (or (= n3 n2) (not (= n1 0)) (< n2 n3) (<= 1 n3)) (or (not (= n2 0)) (= n3 n1) (< n1 n3)) (or (not (= n2 0)) (not (= n1 0)))), 429730#(and (<= 0 n2) (<= 1 n3))] [2022-03-15 21:15:05,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 21:15:05,279 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:15:05,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 21:15:05,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:15:05,280 INFO L87 Difference]: Start difference. First operand 1243 states and 2660 transitions. Second operand has 15 states, 15 states have (on average 6.4) internal successors, (96), 14 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:15:05,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:15:05,528 INFO L93 Difference]: Finished difference Result 1333 states and 2866 transitions. [2022-03-15 21:15:05,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 21:15:05,528 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.4) internal successors, (96), 14 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:15:05,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:15:05,529 INFO L225 Difference]: With dead ends: 1333 [2022-03-15 21:15:05,529 INFO L226 Difference]: Without dead ends: 1045 [2022-03-15 21:15:05,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 129 SyntacticMatches, 14 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:15:05,530 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 208 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:15:05,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 363 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:15:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2022-03-15 21:15:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 831. [2022-03-15 21:15:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 830 states have (on average 2.125301204819277) internal successors, (1764), 830 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have 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:15:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1764 transitions. [2022-03-15 21:15:05,538 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1764 transitions. Word has length 44 [2022-03-15 21:15:05,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:15:05,538 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1764 transitions. [2022-03-15 21:15:05,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.4) internal successors, (96), 14 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:15:05,538 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1764 transitions. [2022-03-15 21:15:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:15:05,539 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:15:05,539 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:15:05,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-15 21:15:05,539 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:15:05,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:15:05,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1576259092, now seen corresponding path program 27 times [2022-03-15 21:15:05,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:15:05,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016491601] [2022-03-15 21:15:05,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:15:05,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:15:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:15:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:15:05,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:15:05,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016491601] [2022-03-15 21:15:05,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016491601] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:15:05,596 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:15:05,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 21:15:05,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1045060301] [2022-03-15 21:15:05,596 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:15:05,598 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:15:05,615 INFO L252 McrAutomatonBuilder]: Finished intersection with 154 states and 298 transitions. [2022-03-15 21:15:05,615 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:15:06,545 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:15:06,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:15:06,545 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:15:06,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:15:06,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:15:06,545 INFO L87 Difference]: Start difference. First operand 831 states and 1764 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:15:06,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:15:06,668 INFO L93 Difference]: Finished difference Result 857 states and 1792 transitions. [2022-03-15 21:15:06,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 21:15:06,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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 44 [2022-03-15 21:15:06,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:15:06,669 INFO L225 Difference]: With dead ends: 857 [2022-03-15 21:15:06,669 INFO L226 Difference]: Without dead ends: 430 [2022-03-15 21:15:06,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:15:06,670 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 116 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:15:06,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 491 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:15:06,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-03-15 21:15:06,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 408. [2022-03-15 21:15:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.9582309582309583) internal successors, (797), 407 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have 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:15:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 797 transitions. [2022-03-15 21:15:06,674 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 797 transitions. Word has length 44 [2022-03-15 21:15:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:15:06,674 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 797 transitions. [2022-03-15 21:15:06,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:15:06,674 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 797 transitions. [2022-03-15 21:15:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:15:06,674 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:15:06,674 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:15:06,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-15 21:15:06,675 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:15:06,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:15:06,675 INFO L85 PathProgramCache]: Analyzing trace with hash -535344720, now seen corresponding path program 28 times [2022-03-15 21:15:06,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:15:06,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86131852] [2022-03-15 21:15:06,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:15:06,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:15:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:15:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:15:06,804 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:15:06,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86131852] [2022-03-15 21:15:06,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86131852] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:15:06,805 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:15:06,805 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 21:15:06,805 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1117326175] [2022-03-15 21:15:06,805 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:15:06,807 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:15:06,819 INFO L252 McrAutomatonBuilder]: Finished intersection with 117 states and 193 transitions. [2022-03-15 21:15:06,819 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:15:08,128 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [434442#(and (not (= n2 0)) (or (= n3 n2) (< n2 n3))), 434443#(and (or (= n3 n2) (< n3 n1) (< n2 n3)) (or (not (= n2 0)) (not (= n3 0))) (or (not (= n2 0)) (< n3 n1)) (or (= n3 n2) (< n2 n3) (<= 1 n3))), 434441#(and (or (<= 1 n3) (< n3 n2)) (not (= n3 0)) (or (<= (+ n3 1) n1) (< n3 n2))), 434446#(and (or (not (= n1 0)) (< n3 n2)) (or (not (= n1 0)) (not (= n3 0))) (or (< n1 n2) (not (= n3 0)) (= n2 n1)) (or (< n1 n2) (= n2 n1) (<= (+ n3 1) n1)) (or (< n1 n2) (= n2 n1) (<= 1 n3) (< n3 n2))), 434451#(and (or (<= 0 n3) (not (= n1 0))) (or (not (= n1 0)) (<= (+ n3 1) n2)) (or (< n1 n2) (< n1 (+ n3 1)) (= n2 n1) (= n1 (+ n3 1))) (or (<= 0 n3) (< n1 (+ n3 1)) (= n1 (+ n3 1)))), 434444#(and (or (< n1 n2) (= n2 n1)) (<= n3 n2) (<= 1 n3)), 434447#(and (<= n3 (+ n2 1)) (<= n1 n2) (<= 1 n3)), 434449#(and (or (not (= n1 0)) (<= 1 n3)) (or (= n3 n1) (<= 1 n3) (< n1 n3)) (or (<= n3 (+ n2 1)) (not (= n1 0))) (or (= n3 n1) (<= n1 n2) (< n1 n3))), 434448#(and (or (<= (+ n1 1) n2) (= n3 n1) (< n1 n3)) (or (not (= n1 0)) (<= n3 n2)) (or (not (= n1 0)) (<= 1 n3)) (or (= n3 n1) (<= 1 n3) (< n1 n3))), 434445#(and (or (not (= n1 0)) (<= n3 n2)) (or (not (= n1 0)) (<= 1 n3)) (or (< n1 n2) (= n3 n1) (= n2 n1) (< n1 n3)) (or (= n3 n1) (<= 1 n3) (< n1 n3))), 434450#(and (<= 0 n3) (< n2 (+ n3 1)) (<= n1 n3))] [2022-03-15 21:15:08,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 21:15:08,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:15:08,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 21:15:08,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:15:08,129 INFO L87 Difference]: Start difference. First operand 408 states and 797 transitions. Second operand has 20 states, 20 states have (on average 4.6) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:15:08,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:15:08,512 INFO L93 Difference]: Finished difference Result 434 states and 842 transitions. [2022-03-15 21:15:08,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 21:15:08,513 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:15:08,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:15:08,513 INFO L225 Difference]: With dead ends: 434 [2022-03-15 21:15:08,513 INFO L226 Difference]: Without dead ends: 242 [2022-03-15 21:15:08,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2022-03-15 21:15:08,514 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 286 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:15:08,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 479 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:15:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-03-15 21:15:08,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 237. [2022-03-15 21:15:08,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.9533898305084745) internal successors, (461), 236 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have 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:15:08,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 461 transitions. [2022-03-15 21:15:08,516 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 461 transitions. Word has length 44 [2022-03-15 21:15:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:15:08,516 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 461 transitions. [2022-03-15 21:15:08,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:15:08,517 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 461 transitions. [2022-03-15 21:15:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:15:08,517 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:15:08,517 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:15:08,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-15 21:15:08,517 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:15:08,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:15:08,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1686622518, now seen corresponding path program 29 times [2022-03-15 21:15:08,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:15:08,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086894811] [2022-03-15 21:15:08,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:15:08,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:15:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:15:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:15:08,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:15:08,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086894811] [2022-03-15 21:15:08,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086894811] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:15:08,602 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:15:08,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 21:15:08,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1599242627] [2022-03-15 21:15:08,602 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:15:08,604 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:15:08,623 INFO L252 McrAutomatonBuilder]: Finished intersection with 193 states and 380 transitions. [2022-03-15 21:15:08,624 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:15:11,485 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [435400#(and (or (not (= n2 0)) (= n3 n1) (< n1 n3)) (or (<= 1 n2) (= n3 n2) (= n3 n1) (< n2 n3) (< n1 n3)) (or (not (= n2 0)) (not (= n1 0)))), 435393#(and (not (= n2 0)) (< n2 (+ n1 1))), 435397#(<= 1 n2), 435394#(and (not (= n2 0)) (or (= n3 n2) (< n2 n3) (<= n2 n1)) (or (<= 1 n2) (= n3 n2) (< n2 n3))), 435398#(and (not (= n2 0)) (or (<= 1 n2) (= n3 n2) (< n2 n3))), 435399#(and (not (= n2 0)) (or (<= (+ n1 1) n2) (= n3 n2) (< n2 n3)) (or (<= 1 n2) (= n3 n2) (< n2 n3))), 435389#(and (or (<= (+ n2 1) n1) (not (= n3 0))) (or (<= 1 n2) (< n3 n2)) (or (<= (+ n2 1) n1) (< n3 n2))), 435390#(and (not (= n2 0)) (< n2 n1)), 435401#(and (or (not (= n2 0)) (= n3 n1) (< n1 n3)) (or (<= (+ n1 1) n2) (= n3 n2) (< n2 n3)) (or (<= 1 n2) (= n3 n2) (= n3 n1) (< n2 n3) (< n1 n3)) (or (not (= n2 0)) (not (= n1 0)))), 435396#(and (not (= n2 0)) (or (= n3 n2) (= n2 n1) (< n2 n3)) (or (<= 1 n2) (= n3 n2) (< n2 n3))), 435391#(and (not (= n2 0)) (or (= n3 n2) (< n2 n3))), 435388#(and (not (= n3 0)) (< n3 n2)), 435402#(and (or (not (= n1 0)) (<= (+ n3 1) n2)) (or (<= (+ n1 1) n2) (= n3 n1) (< n1 n3)) (or (<= 1 n2) (= n3 n1) (< n1 n3))), 435403#(and (or (<= 1 n2) (< n1 n2) (= n2 n1)) (or (<= 1 n2) (not (= n1 0)))), 435404#(and (or (<= n1 n3) (not (< n2 n3))) (or (<= 0 n3) (not (< n2 n3))) (or (<= n1 n2) (< n2 n3)) (or (<= 0 n2) (< n2 n3))), 435395#(and (or (<= n2 n1) (< n1 n3)) (<= 1 n2) (or (not (< n1 n3)) (<= n2 n3))), 435405#(and (or (<= 0 n1) (not (< n2 n1))) (or (<= 0 n2) (< n2 n1))), 435392#(and (not (= n2 0)) (or (= n3 n2) (<= (+ n2 1) n1) (< n2 n3)) (or (<= 1 n2) (= n3 n2) (< n2 n3)))] [2022-03-15 21:15:11,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 21:15:11,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:15:11,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 21:15:11,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:15:11,486 INFO L87 Difference]: Start difference. First operand 237 states and 461 transitions. Second operand has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 25 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:15:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:15:11,569 INFO L93 Difference]: Finished difference Result 207 states and 413 transitions. [2022-03-15 21:15:11,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:15:11,569 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 25 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:15:11,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:15:11,570 INFO L225 Difference]: With dead ends: 207 [2022-03-15 21:15:11,570 INFO L226 Difference]: Without dead ends: 0 [2022-03-15 21:15:11,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 124 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:15:11,570 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 184 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:15:11,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 245 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:15:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-15 21:15:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-15 21:15:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have 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:15:11,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-15 21:15:11,571 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2022-03-15 21:15:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:15:11,571 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-15 21:15:11,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 25 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:15:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-15 21:15:11,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-15 21:15:11,573 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 21:15:11,574 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 21:15:11,575 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 21:15:11,575 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 21:15:11,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-15 21:15:11,576 INFO L732 BasicCegarLoop]: Path program histogram: [29] [2022-03-15 21:15:11,578 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 21:15:11,578 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 21:15:11,583 INFO L202 PluginConnector]: Adding new model bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 09:15:11 BasicIcfg [2022-03-15 21:15:11,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 21:15:11,584 INFO L158 Benchmark]: Toolchain (without parser) took 83351.18ms. Allocated memory was 255.9MB in the beginning and 794.8MB in the end (delta: 539.0MB). Free memory was 214.9MB in the beginning and 252.8MB in the end (delta: -37.9MB). Peak memory consumption was 501.2MB. Max. memory is 8.0GB. [2022-03-15 21:15:11,584 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 255.9MB. Free memory is still 216.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 21:15:11,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.40ms. Allocated memory is still 255.9MB. Free memory was 214.8MB in the beginning and 213.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:15:11,584 INFO L158 Benchmark]: Boogie Preprocessor took 18.91ms. Allocated memory is still 255.9MB. Free memory was 213.3MB in the beginning and 212.3MB in the end (delta: 938.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:15:11,586 INFO L158 Benchmark]: RCFGBuilder took 180.33ms. Allocated memory is still 255.9MB. Free memory was 212.3MB in the beginning and 202.7MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 21:15:11,588 INFO L158 Benchmark]: TraceAbstraction took 83115.24ms. Allocated memory was 255.9MB in the beginning and 794.8MB in the end (delta: 539.0MB). Free memory was 202.1MB in the beginning and 252.8MB in the end (delta: -50.7MB). Peak memory consumption was 488.6MB. Max. memory is 8.0GB. [2022-03-15 21:15:11,590 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.09ms. Allocated memory is still 255.9MB. Free memory is still 216.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.40ms. Allocated memory is still 255.9MB. Free memory was 214.8MB in the beginning and 213.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.91ms. Allocated memory is still 255.9MB. Free memory was 213.3MB in the beginning and 212.3MB in the end (delta: 938.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 180.33ms. Allocated memory is still 255.9MB. Free memory was 212.3MB in the beginning and 202.7MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 83115.24ms. Allocated memory was 255.9MB in the beginning and 794.8MB in the end (delta: 539.0MB). Free memory was 202.1MB in the beginning and 252.8MB in the end (delta: -50.7MB). Peak memory consumption was 488.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 63 PlacesBefore, 58 PlacesAfterwards, 53 TransitionsBefore, 48 TransitionsAfterwards, 1170 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 5676 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1571, positive: 1366, positive conditional: 0, positive unconditional: 1366, negative: 205, negative conditional: 0, negative unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 332, positive: 296, positive conditional: 0, positive unconditional: 296, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1571, positive: 1070, positive conditional: 0, positive unconditional: 1070, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 332, unknown conditional: 0, unknown unconditional: 332] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 205, Positive conditional cache size: 0, Positive unconditional cache size: 205, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33 - 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 - PositiveResult [Line: 82]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 99 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 83.0s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 29, EmptinessCheckTime: 0.2s, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12116 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12116 mSDsluCounter, 22421 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23171 mSDsCounter, 3285 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21049 IncrementalHoareTripleChecker+Invalid, 24334 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3285 mSolverCounterUnsat, 2875 mSDtfsCounter, 21049 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4670 GetRequests, 3794 SyntacticMatches, 144 SemanticMatches, 732 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7443 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7176occurred in iteration=11, InterpolantAutomatonStates: 591, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 63999 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1276 NumberOfCodeBlocks, 1276 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1247 ConstructedInterpolants, 0 QuantifiedInterpolants, 8456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-03-15 21:15:11,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...