/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/mult-comm.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:42:24,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:42:24,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:42:24,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:42:24,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:42:24,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:42:24,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:42:24,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:42:24,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:42:24,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:42:24,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:42:24,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:42:24,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:42:24,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:42:24,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:42:24,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:42:24,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:42:24,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:42:24,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:42:24,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:42:24,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:42:24,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:42:24,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:42:24,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:42:24,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:42:24,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:42:24,496 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:42:24,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:42:24,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:42:24,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:42:24,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:42:24,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:42:24,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:42:24,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:42:24,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:42:24,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:42:24,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:42:24,501 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:42:24,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:42:24,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:42:24,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:42:24,503 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 20:42:24,526 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:42:24,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:42:24,527 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:42:24,528 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:42:24,528 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:42:24,528 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:42:24,528 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:42:24,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:42:24,528 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:42:24,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:42:24,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:42:24,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:42:24,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:42:24,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:42:24,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:42:24,529 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:42:24,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:42:24,530 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:42:24,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:42:24,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:42:24,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:42:24,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:42:24,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:42:24,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:42:24,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:42:24,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:42:24,530 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:42:24,530 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:42:24,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:42:24,531 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:42:24,531 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:42:24,531 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:42:24,531 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 20:42:24,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:42:24,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:42:24,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:42:24,741 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 20:42:24,741 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 20:42:24,742 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/mult-comm.wvr.bpl [2022-03-15 20:42:24,743 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/mult-comm.wvr.bpl' [2022-03-15 20:42:24,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:42:24,767 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 20:42:24,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:42:24,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:42:24,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:42:24,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "mult-comm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:24" (1/1) ... [2022-03-15 20:42:24,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "mult-comm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:24" (1/1) ... [2022-03-15 20:42:24,789 INFO L137 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 20:42:24,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:42:24,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:42:24,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:42:24,792 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:42:24,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "mult-comm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:24" (1/1) ... [2022-03-15 20:42:24,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "mult-comm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:24" (1/1) ... [2022-03-15 20:42:24,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "mult-comm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:24" (1/1) ... [2022-03-15 20:42:24,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "mult-comm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:24" (1/1) ... [2022-03-15 20:42:24,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "mult-comm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:24" (1/1) ... [2022-03-15 20:42:24,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "mult-comm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:24" (1/1) ... [2022-03-15 20:42:24,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "mult-comm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:24" (1/1) ... [2022-03-15 20:42:24,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:42:24,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:42:24,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:42:24,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:42:24,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mult-comm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:24" (1/1) ... [2022-03-15 20:42:24,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:42:24,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:24,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 20:42:24,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 20:42:24,876 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 20:42:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 20:42:24,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 20:42:24,876 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 20:42:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 20:42:24,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 20:42:24,877 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 20:42:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:42:24,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:42:24,877 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 20:42:24,911 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:42:24,912 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:42:25,024 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:42:25,032 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:42:25,033 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 20:42:25,034 INFO L202 PluginConnector]: Adding new model mult-comm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:42:25 BoogieIcfgContainer [2022-03-15 20:42:25,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:42:25,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:42:25,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:42:25,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:42:25,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "mult-comm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:42:24" (1/2) ... [2022-03-15 20:42:25,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3aae7 and model type mult-comm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:42:25, skipping insertion in model container [2022-03-15 20:42:25,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "mult-comm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:42:25" (2/2) ... [2022-03-15 20:42:25,042 INFO L111 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.bpl [2022-03-15 20:42:25,045 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:42:25,045 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:42:25,045 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 20:42:25,045 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:42:25,086 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 20:42:25,113 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:42:25,118 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:42:25,118 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 20:42:25,124 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:42:25,130 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 19 transitions, 54 flow [2022-03-15 20:42:25,132 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 19 transitions, 54 flow [2022-03-15 20:42:25,133 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 19 transitions, 54 flow [2022-03-15 20:42:25,146 INFO L129 PetriNetUnfolder]: 2/17 cut-off events. [2022-03-15 20:42:25,146 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 20:42:25,148 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 17 events. 2/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2022-03-15 20:42:25,148 INFO L116 LiptonReduction]: Number of co-enabled transitions 48 [2022-03-15 20:42:25,269 INFO L131 LiptonReduction]: Checked pairs total: 37 [2022-03-15 20:42:25,270 INFO L133 LiptonReduction]: Total number of compositions: 7 [2022-03-15 20:42:25,284 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 13 transitions, 42 flow [2022-03-15 20:42:25,292 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:25,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-03-15 20:42:25,296 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:25,297 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:25,297 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:25,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1381483942, now seen corresponding path program 1 times [2022-03-15 20:42:25,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:25,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151413035] [2022-03-15 20:42:25,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:25,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:25,423 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:25,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151413035] [2022-03-15 20:42:25,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151413035] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:42:25,423 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:42:25,423 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 20:42:25,424 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1074594875] [2022-03-15 20:42:25,425 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:25,427 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:25,435 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 14 transitions. [2022-03-15 20:42:25,435 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:25,524 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:42:25,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:42:25,527 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:25,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:42:25,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:42:25,542 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:25,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:25,561 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2022-03-15 20:42:25,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:42:25,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-03-15 20:42:25,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:25,569 INFO L225 Difference]: With dead ends: 21 [2022-03-15 20:42:25,570 INFO L226 Difference]: Without dead ends: 18 [2022-03-15 20:42:25,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:42:25,578 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:25,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:42:25,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-03-15 20:42:25,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-03-15 20:42:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-03-15 20:42:25,604 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 32 transitions. Word has length 8 [2022-03-15 20:42:25,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:25,605 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 32 transitions. [2022-03-15 20:42:25,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 32 transitions. [2022-03-15 20:42:25,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:42:25,606 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:25,606 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:25,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:42:25,606 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:25,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:25,607 INFO L85 PathProgramCache]: Analyzing trace with hash 121107708, now seen corresponding path program 1 times [2022-03-15 20:42:25,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:25,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805720770] [2022-03-15 20:42:25,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:25,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:25,710 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:25,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805720770] [2022-03-15 20:42:25,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805720770] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:25,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173308334] [2022-03-15 20:42:25,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:25,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:25,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:25,728 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:25,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 20:42:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:25,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:42:25,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:25,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:25,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173308334] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:25,975 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:25,976 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-03-15 20:42:25,976 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [718489717] [2022-03-15 20:42:25,976 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:25,977 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:25,979 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2022-03-15 20:42:25,979 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:26,142 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [168#(and (or (< 0 (+ x_1 1)) (< i_2 a)) (or (= x_2 x_1) (< i_2 a)) (or (< i_2 a) (<= x_1 0)))] [2022-03-15 20:42:26,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:42:26,143 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:26,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:42:26,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:42:26,145 INFO L87 Difference]: Start difference. First operand 18 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:26,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:26,191 INFO L93 Difference]: Finished difference Result 31 states and 53 transitions. [2022-03-15 20:42:26,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:42:26,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-03-15 20:42:26,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:26,192 INFO L225 Difference]: With dead ends: 31 [2022-03-15 20:42:26,192 INFO L226 Difference]: Without dead ends: 23 [2022-03-15 20:42:26,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:42:26,193 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:26,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 1 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:42:26,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-03-15 20:42:26,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-03-15 20:42:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 38 transitions. [2022-03-15 20:42:26,196 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 38 transitions. Word has length 9 [2022-03-15 20:42:26,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:26,197 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 38 transitions. [2022-03-15 20:42:26,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:26,197 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 38 transitions. [2022-03-15 20:42:26,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:42:26,197 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:26,197 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:26,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:26,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:26,412 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:26,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:26,412 INFO L85 PathProgramCache]: Analyzing trace with hash 206071640, now seen corresponding path program 1 times [2022-03-15 20:42:26,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:26,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516277009] [2022-03-15 20:42:26,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:26,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:26,501 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:26,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516277009] [2022-03-15 20:42:26,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516277009] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:26,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903057315] [2022-03-15 20:42:26,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:26,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:26,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:26,502 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:26,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 20:42:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:26,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:42:26,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:26,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:26,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:26,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903057315] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:26,660 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:26,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2022-03-15 20:42:26,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1247745321] [2022-03-15 20:42:26,660 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:26,661 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:26,662 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2022-03-15 20:42:26,662 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:26,778 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [300#(and (< 0 (+ x_2 b 1)) (= (+ x_2 b) x_1) (<= (+ x_2 b) 0))] [2022-03-15 20:42:26,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:42:26,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:26,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:42:26,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:42:26,779 INFO L87 Difference]: Start difference. First operand 20 states and 38 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:26,836 INFO L93 Difference]: Finished difference Result 35 states and 62 transitions. [2022-03-15 20:42:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:42:26,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-03-15 20:42:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:26,837 INFO L225 Difference]: With dead ends: 35 [2022-03-15 20:42:26,837 INFO L226 Difference]: Without dead ends: 24 [2022-03-15 20:42:26,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:42:26,840 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 13 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:26,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 1 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:42:26,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-03-15 20:42:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-03-15 20:42:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 36 transitions. [2022-03-15 20:42:26,842 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 36 transitions. Word has length 9 [2022-03-15 20:42:26,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:26,843 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 36 transitions. [2022-03-15 20:42:26,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 36 transitions. [2022-03-15 20:42:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:42:26,843 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:26,843 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:26,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:27,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-03-15 20:42:27,052 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:27,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:27,052 INFO L85 PathProgramCache]: Analyzing trace with hash 315683132, now seen corresponding path program 2 times [2022-03-15 20:42:27,054 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:27,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13517060] [2022-03-15 20:42:27,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:27,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:27,144 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:27,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13517060] [2022-03-15 20:42:27,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13517060] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:27,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395037411] [2022-03-15 20:42:27,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:42:27,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:27,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:27,148 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:27,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 20:42:27,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:42:27,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:27,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:42:27,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:27,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:27,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395037411] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:27,345 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:27,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-03-15 20:42:27,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1473802025] [2022-03-15 20:42:27,345 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:27,345 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:27,347 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2022-03-15 20:42:27,347 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:27,515 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [445#(and (or (< 0 (+ x_1 1)) (< i_2 a)) (or (= x_2 x_1) (< i_2 a)) (or (< i_2 a) (<= x_1 0))), 446#(and (<= (+ x_1 (* 2 a)) 0) (= x_2 0) (<= 0 (+ x_1 (* 2 a))))] [2022-03-15 20:42:27,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:42:27,515 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:27,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:42:27,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:42:27,516 INFO L87 Difference]: Start difference. First operand 20 states and 36 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:27,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:27,573 INFO L93 Difference]: Finished difference Result 37 states and 65 transitions. [2022-03-15 20:42:27,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:42:27,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 20:42:27,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:27,574 INFO L225 Difference]: With dead ends: 37 [2022-03-15 20:42:27,574 INFO L226 Difference]: Without dead ends: 29 [2022-03-15 20:42:27,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:42:27,577 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:27,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 1 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:42:27,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-03-15 20:42:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2022-03-15 20:42:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 42 transitions. [2022-03-15 20:42:27,587 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 42 transitions. Word has length 10 [2022-03-15 20:42:27,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:27,591 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 42 transitions. [2022-03-15 20:42:27,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 42 transitions. [2022-03-15 20:42:27,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:42:27,591 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:27,592 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:27,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:27,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:27,792 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:27,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:27,793 INFO L85 PathProgramCache]: Analyzing trace with hash 400647064, now seen corresponding path program 1 times [2022-03-15 20:42:27,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:27,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042209844] [2022-03-15 20:42:27,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:27,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:27,863 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:27,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042209844] [2022-03-15 20:42:27,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042209844] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:27,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632351757] [2022-03-15 20:42:27,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:27,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:27,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:27,864 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:27,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 20:42:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:27,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:42:27,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:28,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:28,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:28,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632351757] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:28,174 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:28,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-03-15 20:42:28,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1213457937] [2022-03-15 20:42:28,174 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:28,175 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:28,176 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 26 transitions. [2022-03-15 20:42:28,176 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:28,404 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [603#(and (or (<= (+ i_2 x_1) x_2) (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ i_1 x_2 1) (+ x_1 b a)) (not (< i_1 b)))), 601#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 602#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ i_1 x_2 1) (+ x_1 b a)) (not (< i_1 b)))), 600#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a)))] [2022-03-15 20:42:28,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:42:28,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:28,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:42:28,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:42:28,405 INFO L87 Difference]: Start difference. First operand 22 states and 42 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:28,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:28,780 INFO L93 Difference]: Finished difference Result 54 states and 88 transitions. [2022-03-15 20:42:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:42:28,780 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 20:42:28,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:28,780 INFO L225 Difference]: With dead ends: 54 [2022-03-15 20:42:28,780 INFO L226 Difference]: Without dead ends: 45 [2022-03-15 20:42:28,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:42:28,781 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 60 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:28,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 1 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:28,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-03-15 20:42:28,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 27. [2022-03-15 20:42:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:28,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 51 transitions. [2022-03-15 20:42:28,790 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 51 transitions. Word has length 10 [2022-03-15 20:42:28,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:28,790 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 51 transitions. [2022-03-15 20:42:28,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:28,790 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 51 transitions. [2022-03-15 20:42:28,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:42:28,790 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:28,790 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:28,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 20:42:29,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:29,006 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:29,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:29,006 INFO L85 PathProgramCache]: Analyzing trace with hash -2119312870, now seen corresponding path program 2 times [2022-03-15 20:42:29,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:29,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372565622] [2022-03-15 20:42:29,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:29,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:29,086 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:29,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372565622] [2022-03-15 20:42:29,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372565622] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:29,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22070936] [2022-03-15 20:42:29,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:42:29,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:29,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:29,088 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:29,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 20:42:29,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:42:29,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:29,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:42:29,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:29,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:29,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22070936] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:29,278 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:29,278 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-03-15 20:42:29,278 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1172539451] [2022-03-15 20:42:29,278 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:29,279 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:29,280 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2022-03-15 20:42:29,280 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:29,405 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [799#(and (< 0 (+ x_2 b 1)) (= (+ x_2 b) x_1) (<= (+ x_2 b) 0)), 800#(and (< 0 (+ (* 2 b) x_2 1)) (<= (+ (* 2 b) x_2) 0) (= (+ (* 2 b) x_2) x_1))] [2022-03-15 20:42:29,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:42:29,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:29,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:42:29,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:42:29,406 INFO L87 Difference]: Start difference. First operand 27 states and 51 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:29,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:29,481 INFO L93 Difference]: Finished difference Result 41 states and 74 transitions. [2022-03-15 20:42:29,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:42:29,482 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 20:42:29,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:29,484 INFO L225 Difference]: With dead ends: 41 [2022-03-15 20:42:29,484 INFO L226 Difference]: Without dead ends: 31 [2022-03-15 20:42:29,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:42:29,485 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:29,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 1 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:42:29,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-03-15 20:42:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-03-15 20:42:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 50 transitions. [2022-03-15 20:42:29,493 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 50 transitions. Word has length 10 [2022-03-15 20:42:29,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:29,493 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 50 transitions. [2022-03-15 20:42:29,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 50 transitions. [2022-03-15 20:42:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:42:29,497 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:29,497 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:29,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:29,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:29,711 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:29,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:29,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2052553980, now seen corresponding path program 3 times [2022-03-15 20:42:29,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:29,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009426954] [2022-03-15 20:42:29,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:29,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:29,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:29,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009426954] [2022-03-15 20:42:29,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009426954] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:29,775 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231860200] [2022-03-15 20:42:29,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:42:29,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:29,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:29,776 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:29,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 20:42:29,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:42:29,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:29,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:42:29,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:29,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:30,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:30,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231860200] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:30,001 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:30,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-03-15 20:42:30,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2057994351] [2022-03-15 20:42:30,001 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:30,001 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:30,003 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 29 transitions. [2022-03-15 20:42:30,003 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:30,213 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [978#(and (or (< 0 (+ x_1 1)) (< i_2 a)) (or (= x_2 x_1) (< i_2 a)) (or (< i_2 a) (<= x_1 0))), 977#(and (<= (+ x_1 (* 3 a)) 0) (= x_2 0) (<= 0 (+ x_1 (* 3 a)))), 976#(and (<= (+ x_1 (* 2 a)) 0) (= x_2 0) (<= 0 (+ x_1 (* 2 a))))] [2022-03-15 20:42:30,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:42:30,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:30,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:42:30,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-03-15 20:42:30,214 INFO L87 Difference]: Start difference. First operand 27 states and 50 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:30,295 INFO L93 Difference]: Finished difference Result 44 states and 79 transitions. [2022-03-15 20:42:30,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:42:30,295 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:42:30,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:30,296 INFO L225 Difference]: With dead ends: 44 [2022-03-15 20:42:30,296 INFO L226 Difference]: Without dead ends: 36 [2022-03-15 20:42:30,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:42:30,296 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 26 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:30,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 1 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:42:30,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-15 20:42:30,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-03-15 20:42:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.0) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 56 transitions. [2022-03-15 20:42:30,298 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 56 transitions. Word has length 11 [2022-03-15 20:42:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:30,298 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 56 transitions. [2022-03-15 20:42:30,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 56 transitions. [2022-03-15 20:42:30,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:42:30,299 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:30,299 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:30,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:30,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:30,504 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:30,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:30,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2137517912, now seen corresponding path program 2 times [2022-03-15 20:42:30,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:30,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197247076] [2022-03-15 20:42:30,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:30,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:30,594 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:30,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197247076] [2022-03-15 20:42:30,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197247076] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:30,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611773250] [2022-03-15 20:42:30,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:42:30,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:30,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:30,595 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:30,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 20:42:30,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:42:30,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:30,620 WARN L261 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 20:42:30,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:30,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:30,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611773250] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:30,935 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:30,935 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-03-15 20:42:30,935 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1526651998] [2022-03-15 20:42:30,936 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:30,936 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:30,937 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 33 transitions. [2022-03-15 20:42:30,937 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:31,272 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1166#(and (or (<= (+ i_1 x_2 1) (+ x_1 b a)) (not (< i_1 b))) (or (<= (+ x_1 (* 2 i_2)) (+ x_2 a)) (<= (+ x_1 a) x_2) (not (< i_1 b)))), 1163#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 1165#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ i_1 x_2 1) (+ x_1 b a)) (not (< i_1 b)))), 1167#(and (or (not (< (+ i_1 1) b)) (<= (+ 2 i_1 x_2) (+ x_1 b (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 1164#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 1168#(and (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ x_1 (* 2 i_2)) x_2)) (or (not (< (+ i_1 1) b)) (<= (+ 2 i_1 x_2) (+ x_1 b (* 2 a)))))] [2022-03-15 20:42:31,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:42:31,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:31,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:42:31,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:42:31,273 INFO L87 Difference]: Start difference. First operand 29 states and 56 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:32,045 INFO L93 Difference]: Finished difference Result 68 states and 114 transitions. [2022-03-15 20:42:32,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 20:42:32,045 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:42:32,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:32,046 INFO L225 Difference]: With dead ends: 68 [2022-03-15 20:42:32,046 INFO L226 Difference]: Without dead ends: 59 [2022-03-15 20:42:32,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=293, Invalid=1429, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:42:32,047 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 91 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:32,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 1 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-15 20:42:32,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2022-03-15 20:42:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 61 transitions. [2022-03-15 20:42:32,049 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 61 transitions. Word has length 11 [2022-03-15 20:42:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:32,049 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 61 transitions. [2022-03-15 20:42:32,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 61 transitions. [2022-03-15 20:42:32,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:42:32,050 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:32,050 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:32,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-15 20:42:32,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:32,261 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:32,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:32,261 INFO L85 PathProgramCache]: Analyzing trace with hash -382442022, now seen corresponding path program 3 times [2022-03-15 20:42:32,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:32,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719111743] [2022-03-15 20:42:32,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:32,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:32,341 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:32,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719111743] [2022-03-15 20:42:32,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719111743] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:32,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106577198] [2022-03-15 20:42:32,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:42:32,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:32,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:32,342 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:32,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 20:42:32,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:42:32,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:32,364 WARN L261 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 20:42:32,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:32,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:32,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106577198] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:32,739 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:32,739 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-03-15 20:42:32,739 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [458693501] [2022-03-15 20:42:32,739 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:32,740 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:32,741 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 33 transitions. [2022-03-15 20:42:32,741 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:33,141 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1419#(and (or (not (< i_1 b)) (<= (+ i_2 x_1 1) (+ x_2 b))) (or (not (< i_1 b)) (<= (+ (* 2 i_1) x_2 1) (+ i_2 x_1 b)))), 1416#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 1414#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* 2 i_1) 2 x_2) (+ (* 2 b) x_1 a)))), 1417#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 1418#(and (or (<= (+ i_2 x_1) x_2) (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* 2 i_1) 2 x_2) (+ (* 2 b) x_1 a)))), 1415#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a)))] [2022-03-15 20:42:33,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:42:33,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:33,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:42:33,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:42:33,142 INFO L87 Difference]: Start difference. First operand 31 states and 61 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:34,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:34,067 INFO L93 Difference]: Finished difference Result 82 states and 133 transitions. [2022-03-15 20:42:34,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 20:42:34,068 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:42:34,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:34,068 INFO L225 Difference]: With dead ends: 82 [2022-03-15 20:42:34,068 INFO L226 Difference]: Without dead ends: 70 [2022-03-15 20:42:34,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=358, Invalid=1712, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 20:42:34,069 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 102 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:34,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 1 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-03-15 20:42:34,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 35. [2022-03-15 20:42:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 69 transitions. [2022-03-15 20:42:34,072 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 69 transitions. Word has length 11 [2022-03-15 20:42:34,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:34,072 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 69 transitions. [2022-03-15 20:42:34,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 69 transitions. [2022-03-15 20:42:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:42:34,072 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:34,072 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:34,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 20:42:34,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-03-15 20:42:34,283 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:34,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:34,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1191788648, now seen corresponding path program 3 times [2022-03-15 20:42:34,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:34,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782153450] [2022-03-15 20:42:34,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:34,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:34,377 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:34,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782153450] [2022-03-15 20:42:34,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782153450] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:34,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135108051] [2022-03-15 20:42:34,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:42:34,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:34,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:34,379 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:34,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 20:42:34,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:42:34,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:34,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:42:34,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:34,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:34,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135108051] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:34,584 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:34,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-03-15 20:42:34,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [306184358] [2022-03-15 20:42:34,584 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:34,584 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:34,586 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 29 transitions. [2022-03-15 20:42:34,586 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:34,786 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [1690#(and (< 0 (+ x_2 b 1)) (= (+ x_2 b) x_1) (<= (+ x_2 b) 0)), 1692#(and (<= (+ x_2 (* 3 b)) 0) (= (+ x_2 (* 3 b)) x_1) (< 0 (+ x_2 (* 3 b) 1))), 1691#(and (< 0 (+ (* 2 b) x_2 1)) (<= (+ (* 2 b) x_2) 0) (= (+ (* 2 b) x_2) x_1))] [2022-03-15 20:42:34,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:42:34,787 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:34,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:42:34,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-03-15 20:42:34,787 INFO L87 Difference]: Start difference. First operand 35 states and 69 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:34,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:34,894 INFO L93 Difference]: Finished difference Result 50 states and 93 transitions. [2022-03-15 20:42:34,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:42:34,894 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:42:34,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:34,895 INFO L225 Difference]: With dead ends: 50 [2022-03-15 20:42:34,895 INFO L226 Difference]: Without dead ends: 40 [2022-03-15 20:42:34,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:42:34,895 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:34,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 1 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-15 20:42:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-03-15 20:42:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 68 transitions. [2022-03-15 20:42:34,897 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 68 transitions. Word has length 11 [2022-03-15 20:42:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:34,898 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 68 transitions. [2022-03-15 20:42:34,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 68 transitions. [2022-03-15 20:42:34,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:42:34,898 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:34,898 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:34,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:35,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 20:42:35,111 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:35,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:35,112 INFO L85 PathProgramCache]: Analyzing trace with hash 60975420, now seen corresponding path program 4 times [2022-03-15 20:42:35,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:35,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259979854] [2022-03-15 20:42:35,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:35,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:35,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:35,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259979854] [2022-03-15 20:42:35,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259979854] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:35,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203439233] [2022-03-15 20:42:35,189 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:42:35,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:35,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:35,190 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:35,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 20:42:35,210 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:42:35,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:35,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 20:42:35,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:35,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:35,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:35,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:35,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203439233] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:35,439 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:35,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-03-15 20:42:35,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1033759185] [2022-03-15 20:42:35,439 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:35,440 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:35,441 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 34 transitions. [2022-03-15 20:42:35,441 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:35,701 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1906#(and (<= (+ x_1 (* 3 a)) 0) (= x_2 0) (<= 0 (+ x_1 (* 3 a)))), 1907#(and (<= 0 (+ x_1 (* a 4))) (= x_2 0) (<= (+ x_1 (* a 4)) 0)), 1904#(and (or (< 0 (+ x_1 1)) (< i_2 a)) (or (= x_2 x_1) (< i_2 a)) (or (< i_2 a) (<= x_1 0))), 1905#(and (<= (+ x_1 (* 2 a)) 0) (= x_2 0) (<= 0 (+ x_1 (* 2 a))))] [2022-03-15 20:42:35,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:42:35,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:35,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:42:35,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:42:35,702 INFO L87 Difference]: Start difference. First operand 35 states and 68 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:35,815 INFO L93 Difference]: Finished difference Result 54 states and 100 transitions. [2022-03-15 20:42:35,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 20:42:35,815 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:42:35,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:35,815 INFO L225 Difference]: With dead ends: 54 [2022-03-15 20:42:35,815 INFO L226 Difference]: Without dead ends: 46 [2022-03-15 20:42:35,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2022-03-15 20:42:35,816 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 38 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:35,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 1 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-03-15 20:42:35,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2022-03-15 20:42:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:35,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 74 transitions. [2022-03-15 20:42:35,818 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 74 transitions. Word has length 12 [2022-03-15 20:42:35,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:35,818 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 74 transitions. [2022-03-15 20:42:35,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:35,819 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 74 transitions. [2022-03-15 20:42:35,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:42:35,819 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:35,819 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:35,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:36,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 20:42:36,035 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:36,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:36,036 INFO L85 PathProgramCache]: Analyzing trace with hash 145939352, now seen corresponding path program 4 times [2022-03-15 20:42:36,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:36,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784924158] [2022-03-15 20:42:36,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:36,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:36,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:36,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784924158] [2022-03-15 20:42:36,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784924158] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:36,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978594304] [2022-03-15 20:42:36,131 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:42:36,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:36,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:36,132 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:36,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 20:42:36,151 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:42:36,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:36,152 WARN L261 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 20:42:36,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:36,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:36,502 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978594304] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:36,502 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:36,502 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-03-15 20:42:36,502 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [47242231] [2022-03-15 20:42:36,502 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:36,502 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:36,504 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 40 transitions. [2022-03-15 20:42:36,504 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:36,948 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [2134#(and (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ (* 3 i_2) x_1) (+ x_2 a))) (or (not (< (+ i_1 1) b)) (<= (+ 2 i_1 x_2) (+ x_1 b (* 2 a))))), 2131#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ i_1 x_2 1) (+ x_1 b a)) (not (< i_1 b)))), 2135#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ 3 i_1 x_2) (+ x_1 b (* 3 a))))), 2133#(and (or (<= (+ (* 3 i_2) x_1) (+ x_2 (* 2 a))) (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ i_1 x_2 1) (+ x_1 b a)) (not (< i_1 b)))), 2132#(and (or (not (< (+ i_1 1) b)) (<= (+ 2 i_1 x_2) (+ x_1 b (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 2130#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 2136#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 3 i_2) x_1) x_2) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ 3 i_1 x_2) (+ x_1 b (* 3 a))))), 2129#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a)))] [2022-03-15 20:42:36,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 20:42:36,948 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:36,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 20:42:36,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:42:36,949 INFO L87 Difference]: Start difference. First operand 37 states and 74 transitions. Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:38,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:38,183 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2022-03-15 20:42:38,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 20:42:38,184 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:42:38,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:38,184 INFO L225 Difference]: With dead ends: 90 [2022-03-15 20:42:38,184 INFO L226 Difference]: Without dead ends: 81 [2022-03-15 20:42:38,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=415, Invalid=2341, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 20:42:38,185 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 123 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:38,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 1 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:42:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-03-15 20:42:38,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 39. [2022-03-15 20:42:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 38 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 79 transitions. [2022-03-15 20:42:38,188 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 79 transitions. Word has length 12 [2022-03-15 20:42:38,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:38,188 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 79 transitions. [2022-03-15 20:42:38,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 79 transitions. [2022-03-15 20:42:38,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:42:38,188 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:38,188 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:38,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:38,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 20:42:38,399 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:38,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:38,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1920946714, now seen corresponding path program 5 times [2022-03-15 20:42:38,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:38,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235832986] [2022-03-15 20:42:38,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:38,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:38,497 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:38,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235832986] [2022-03-15 20:42:38,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235832986] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:38,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287566747] [2022-03-15 20:42:38,497 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:42:38,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:38,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:38,498 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:38,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 20:42:38,519 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 20:42:38,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:38,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 20:42:38,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:38,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:39,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287566747] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:39,113 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:39,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-03-15 20:42:39,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1832835295] [2022-03-15 20:42:39,113 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:39,114 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:39,115 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 42 transitions. [2022-03-15 20:42:39,115 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:39,631 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [2446#(and (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ x_1 (* 2 i_2)) x_2)) (or (not (< (+ i_1 1) b)) (<= (+ (* 2 i_1) x_2 4) (+ (* 2 b) x_1 (* 2 a))))), 2440#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 2448#(and (or (not (< (+ i_1 1) b)) (<= (+ 2 x_1 (* 2 i_2)) (+ x_2 b))) (or (not (< (+ i_1 1) b)) (<= (+ (* 2 i_1) 2 x_2) (+ x_1 b (* 2 i_2))))), 2444#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 2 i_1) x_2 4) (+ (* 2 b) x_1 (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 2447#(and (or (<= (+ 2 x_1 (* 2 i_2)) (+ x_2 b a)) (not (< i_1 b))) (or (<= (+ (* 2 i_1) x_2 a) (+ x_1 b (* 2 i_2))) (not (< i_1 b)))), 2443#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* 2 i_1) 2 x_2) (+ (* 2 b) x_1 a)))), 2442#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 2445#(and (or (<= (+ x_1 (* 2 i_2)) (+ x_2 a)) (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* 2 i_1) 2 x_2) (+ (* 2 b) x_1 a)))), 2441#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a))))] [2022-03-15 20:42:39,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 20:42:39,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:39,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 20:42:39,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:42:39,632 INFO L87 Difference]: Start difference. First operand 39 states and 79 transitions. Second operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:41,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:41,577 INFO L93 Difference]: Finished difference Result 101 states and 168 transitions. [2022-03-15 20:42:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 20:42:41,577 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:42:41,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:41,578 INFO L225 Difference]: With dead ends: 101 [2022-03-15 20:42:41,578 INFO L226 Difference]: Without dead ends: 89 [2022-03-15 20:42:41,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=579, Invalid=3327, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 20:42:41,579 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 179 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:41,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 1 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:42:41,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-03-15 20:42:41,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 40. [2022-03-15 20:42:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 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 20:42:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 83 transitions. [2022-03-15 20:42:41,581 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 83 transitions. Word has length 12 [2022-03-15 20:42:41,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:41,582 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 83 transitions. [2022-03-15 20:42:41,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:41,582 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 83 transitions. [2022-03-15 20:42:41,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:42:41,582 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:41,582 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:41,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:41,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 20:42:41,791 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:41,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:41,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1111600088, now seen corresponding path program 6 times [2022-03-15 20:42:41,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:41,792 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613292385] [2022-03-15 20:42:41,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:41,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:41,872 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:41,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613292385] [2022-03-15 20:42:41,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613292385] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:41,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72296826] [2022-03-15 20:42:41,872 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:42:41,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:41,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:41,873 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:41,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 20:42:41,896 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:42:41,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:41,896 WARN L261 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 20:42:41,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:42,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:42,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72296826] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:42,282 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:42,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 20:42:42,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1261996113] [2022-03-15 20:42:42,283 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:42,283 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:42,284 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 40 transitions. [2022-03-15 20:42:42,284 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:42,749 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [2790#(and (or (<= (+ 2 x_2 (* 3 i_1)) (+ (* 2 b) i_2 x_1)) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ i_2 x_1 1) (+ x_2 b)))), 2788#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ 3 x_2 (* 3 i_1)) (+ x_1 a (* 3 b))) (not (< i_1 b)))), 2791#(and (or (not (< i_1 b)) (<= (+ x_2 (* 3 i_1) 1) (+ i_2 x_1 b))) (or (<= (+ 2 i_2 x_1) (+ (* 2 b) x_2)) (not (< i_1 b)))), 2786#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 2784#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 2785#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 2787#(and (or (< (+ 3 i_2) a) (not (< (+ 2 i_2) a)) (< (+ x_2 (* 3 b)) (+ x_1 1))) (or (< (+ 3 i_2) a) (<= x_1 (+ x_2 (* 3 b))) (not (< (+ 2 i_2) a)))), 2789#(and (or (<= (+ i_2 x_1) x_2) (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ 3 x_2 (* 3 i_1)) (+ x_1 a (* 3 b))) (not (< i_1 b))))] [2022-03-15 20:42:42,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 20:42:42,749 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:42,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 20:42:42,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:42:42,750 INFO L87 Difference]: Start difference. First operand 40 states and 83 transitions. Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:44,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:44,655 INFO L93 Difference]: Finished difference Result 119 states and 195 transitions. [2022-03-15 20:42:44,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 20:42:44,655 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:42:44,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:44,655 INFO L225 Difference]: With dead ends: 119 [2022-03-15 20:42:44,655 INFO L226 Difference]: Without dead ends: 104 [2022-03-15 20:42:44,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=606, Invalid=3054, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 20:42:44,657 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 174 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:44,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 1 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:42:44,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-03-15 20:42:44,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 43. [2022-03-15 20:42:44,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 42 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 87 transitions. [2022-03-15 20:42:44,660 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 87 transitions. Word has length 12 [2022-03-15 20:42:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:44,660 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 87 transitions. [2022-03-15 20:42:44,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:44,660 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 87 transitions. [2022-03-15 20:42:44,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:42:44,660 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:44,661 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:44,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:44,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 20:42:44,876 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:44,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:44,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1791658458, now seen corresponding path program 4 times [2022-03-15 20:42:44,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:44,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491191223] [2022-03-15 20:42:44,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:44,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:44,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:44,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491191223] [2022-03-15 20:42:44,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491191223] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:44,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21945953] [2022-03-15 20:42:44,995 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:42:44,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:44,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:44,997 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:44,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 20:42:45,016 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:42:45,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:45,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 20:42:45,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:45,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:45,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:45,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21945953] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:45,254 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:45,254 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-03-15 20:42:45,254 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1596398842] [2022-03-15 20:42:45,254 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:45,255 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:45,256 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 34 transitions. [2022-03-15 20:42:45,256 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:45,526 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [3147#(and (<= (+ x_2 (* b 4)) 0) (< 0 (+ x_2 (* b 4) 1)) (= (+ x_2 (* b 4)) x_1)), 3144#(and (< 0 (+ x_2 b 1)) (= (+ x_2 b) x_1) (<= (+ x_2 b) 0)), 3145#(and (< 0 (+ (* 2 b) x_2 1)) (<= (+ (* 2 b) x_2) 0) (= (+ (* 2 b) x_2) x_1)), 3146#(and (<= (+ x_2 (* 3 b)) 0) (= (+ x_2 (* 3 b)) x_1) (< 0 (+ x_2 (* 3 b) 1)))] [2022-03-15 20:42:45,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:42:45,527 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:45,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:42:45,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:42:45,527 INFO L87 Difference]: Start difference. First operand 43 states and 87 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:45,680 INFO L93 Difference]: Finished difference Result 59 states and 112 transitions. [2022-03-15 20:42:45,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 20:42:45,681 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 20:42:45,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:45,681 INFO L225 Difference]: With dead ends: 59 [2022-03-15 20:42:45,681 INFO L226 Difference]: Without dead ends: 49 [2022-03-15 20:42:45,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:42:45,682 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:45,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 1 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:45,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-03-15 20:42:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2022-03-15 20:42:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:45,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 86 transitions. [2022-03-15 20:42:45,683 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 86 transitions. Word has length 12 [2022-03-15 20:42:45,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:45,684 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 86 transitions. [2022-03-15 20:42:45,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 86 transitions. [2022-03-15 20:42:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:42:45,684 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:45,684 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:45,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:45,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:45,895 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1548417796, now seen corresponding path program 5 times [2022-03-15 20:42:45,896 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:45,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468723320] [2022-03-15 20:42:45,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:45,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:46,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:46,011 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:46,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468723320] [2022-03-15 20:42:46,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468723320] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:46,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670539908] [2022-03-15 20:42:46,012 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:42:46,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:46,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:46,013 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:46,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 20:42:46,040 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:42:46,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:46,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:42:46,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:46,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:46,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670539908] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:46,326 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:46,326 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 20:42:46,326 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [325019061] [2022-03-15 20:42:46,326 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:46,326 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:46,328 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 39 transitions. [2022-03-15 20:42:46,328 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:46,635 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [3395#(and (or (< 0 (+ x_1 1)) (< i_2 a)) (or (= x_2 x_1) (< i_2 a)) (or (< i_2 a) (<= x_1 0))), 3397#(and (<= (+ x_1 (* 3 a)) 0) (= x_2 0) (<= 0 (+ x_1 (* 3 a)))), 3399#(and (= x_2 0) (<= 0 (+ x_1 (* 5 a))) (<= (+ x_1 (* 5 a)) 0)), 3398#(and (<= 0 (+ x_1 (* a 4))) (= x_2 0) (<= (+ x_1 (* a 4)) 0)), 3396#(and (<= (+ x_1 (* 2 a)) 0) (= x_2 0) (<= 0 (+ x_1 (* 2 a))))] [2022-03-15 20:42:46,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:42:46,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:46,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:42:46,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:42:46,636 INFO L87 Difference]: Start difference. First operand 43 states and 86 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:46,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:46,778 INFO L93 Difference]: Finished difference Result 66 states and 124 transitions. [2022-03-15 20:42:46,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 20:42:46,778 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:42:46,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:46,779 INFO L225 Difference]: With dead ends: 66 [2022-03-15 20:42:46,779 INFO L226 Difference]: Without dead ends: 58 [2022-03-15 20:42:46,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:42:46,779 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 50 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:46,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 1 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:42:46,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-03-15 20:42:46,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2022-03-15 20:42:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 2.090909090909091) internal successors, (92), 44 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 20:42:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 92 transitions. [2022-03-15 20:42:46,781 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 92 transitions. Word has length 13 [2022-03-15 20:42:46,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:46,782 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 92 transitions. [2022-03-15 20:42:46,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 92 transitions. [2022-03-15 20:42:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:42:46,782 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:46,782 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:46,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:46,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 20:42:46,999 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:46,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:46,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1463453864, now seen corresponding path program 7 times [2022-03-15 20:42:47,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:47,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459095990] [2022-03-15 20:42:47,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:47,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:47,111 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:47,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459095990] [2022-03-15 20:42:47,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459095990] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:47,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893852953] [2022-03-15 20:42:47,112 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:42:47,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:47,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:47,113 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:47,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 20:42:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:47,139 WARN L261 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 20:42:47,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:47,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:47,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893852953] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:47,595 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:47,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 20:42:47,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1759058202] [2022-03-15 20:42:47,596 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:47,596 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:47,598 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2022-03-15 20:42:47,598 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:48,156 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [3664#(and (or (not (< (+ i_1 1) b)) (<= (+ 2 i_1 x_2) (+ x_1 b (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ (* i_2 4) x_1) (+ x_2 (* 2 a))))), 3669#(and (or (<= (+ i_1 x_2 4) (+ x_1 b (* a 4))) (not (< (+ 3 i_1) b))) (or (<= (+ x_1 (* a 4)) x_2) (<= (+ (* i_2 4) x_1) x_2) (not (< (+ 3 i_1) b)))), 3665#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 3667#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* i_2 4) x_1) (+ x_2 a)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ 3 i_1 x_2) (+ x_1 b (* 3 a))))), 3668#(and (or (<= (+ x_1 (* a 4)) x_2) (not (< (+ 3 i_1) b))) (or (<= (+ i_1 x_2 4) (+ x_1 b (* a 4))) (not (< (+ 3 i_1) b)))), 3661#(and (or (<= (+ i_1 x_2 1) (+ x_1 b a)) (not (< i_1 b))) (or (<= (+ (* i_2 4) x_1) (+ x_2 (* 3 a))) (<= (+ x_1 a) x_2) (not (< i_1 b)))), 3666#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ 3 i_1 x_2) (+ x_1 b (* 3 a))))), 3663#(and (or (not (< (+ i_1 1) b)) (<= (+ 2 i_1 x_2) (+ x_1 b (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 3660#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ i_1 x_2 1) (+ x_1 b a)) (not (< i_1 b)))), 3662#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a)))] [2022-03-15 20:42:48,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:42:48,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:48,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:42:48,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:42:48,158 INFO L87 Difference]: Start difference. First operand 45 states and 92 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:50,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:42:50,009 INFO L93 Difference]: Finished difference Result 115 states and 199 transitions. [2022-03-15 20:42:50,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 20:42:50,010 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:42:50,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:42:50,010 INFO L225 Difference]: With dead ends: 115 [2022-03-15 20:42:50,010 INFO L226 Difference]: Without dead ends: 106 [2022-03-15 20:42:50,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=559, Invalid=3473, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 20:42:50,012 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 196 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:42:50,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 1 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:42:50,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-03-15 20:42:50,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 48. [2022-03-15 20:42:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 2.148936170212766) internal successors, (101), 47 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 101 transitions. [2022-03-15 20:42:50,020 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 101 transitions. Word has length 13 [2022-03-15 20:42:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:42:50,020 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 101 transitions. [2022-03-15 20:42:50,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:42:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 101 transitions. [2022-03-15 20:42:50,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:42:50,021 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:42:50,021 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:42:50,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 20:42:50,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 20:42:50,235 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:42:50,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:42:50,236 INFO L85 PathProgramCache]: Analyzing trace with hash 311553498, now seen corresponding path program 8 times [2022-03-15 20:42:50,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:42:50,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420046998] [2022-03-15 20:42:50,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:42:50,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:42:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:42:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:50,339 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:42:50,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420046998] [2022-03-15 20:42:50,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420046998] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:42:50,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741293995] [2022-03-15 20:42:50,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:42:50,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:42:50,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:42:50,341 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:42:50,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 20:42:50,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:42:50,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:42:50,367 WARN L261 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 20:42:50,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:42:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:50,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:42:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:42:54,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741293995] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:42:54,083 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:42:54,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 20:42:54,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [724606882] [2022-03-15 20:42:54,083 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:42:54,084 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:42:54,086 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 51 transitions. [2022-03-15 20:42:54,086 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:42:57,610 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [4040#(and (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ (* 3 i_2) x_1) (+ x_2 a))) (or (not (< (+ i_1 1) b)) (<= (+ (* 2 i_1) x_2 4) (+ (* 2 b) x_1 (* 2 a))))), 4047#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 4044#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 4042#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 3 i_2) x_1) x_2) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ (* 2 i_1) 6 x_2) (+ (* 2 b) x_1 (* 3 a))))), 4037#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* 2 i_1) 2 x_2) (+ (* 2 b) x_1 a)))), 4039#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 2 i_1) x_2 4) (+ (* 2 b) x_1 (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 4038#(and (or (<= (+ (* 3 i_2) x_1) (+ x_2 (* 2 a))) (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* 2 i_1) 2 x_2) (+ (* 2 b) x_1 a)))), 4041#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ (* 2 i_1) 6 x_2) (+ (* 2 b) x_1 (* 3 a))))), 4043#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 4045#(and (or (not (< i_1 b)) (<= (+ (* 3 i_2) 3 x_1) (+ x_2 b (* 2 a)))) (or (<= (+ (* 2 i_1) x_2 (* 2 a)) (+ (* 3 i_2) x_1 b 1)) (not (< i_1 b)))), 4048#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 2 i_1) 3 x_2) (+ (* 3 i_2) x_1 b))) (or (not (< (+ 2 i_1) b)) (<= (+ (* 3 i_2) 3 x_1) (+ x_2 b)))), 4046#(and (or (<= (+ (* 3 i_2) 3 x_1) (+ x_2 b a)) (not (< (+ i_1 1) b))) (or (not (< (+ i_1 1) b)) (<= (+ (* 2 i_1) x_2 a 1) (+ (* 3 i_2) x_1 b))))] [2022-03-15 20:42:57,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 20:42:57,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:42:57,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 20:42:57,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1134, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:42:57,612 INFO L87 Difference]: Start difference. First operand 48 states and 101 transitions. Second operand has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:09,442 INFO L93 Difference]: Finished difference Result 131 states and 221 transitions. [2022-03-15 20:43:09,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 20:43:09,442 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:43:09,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:09,443 INFO L225 Difference]: With dead ends: 131 [2022-03-15 20:43:09,443 INFO L226 Difference]: Without dead ends: 119 [2022-03-15 20:43:09,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1644 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=816, Invalid=5346, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 20:43:09,444 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 255 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:09,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 1 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 20:43:09,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-03-15 20:43:09,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 49. [2022-03-15 20:43:09,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 2.1875) internal successors, (105), 48 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 20:43:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 105 transitions. [2022-03-15 20:43:09,446 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 105 transitions. Word has length 13 [2022-03-15 20:43:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:09,446 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 105 transitions. [2022-03-15 20:43:09,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:09,446 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 105 transitions. [2022-03-15 20:43:09,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:43:09,447 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:09,447 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:09,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 20:43:09,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 20:43:09,660 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:09,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:09,661 INFO L85 PathProgramCache]: Analyzing trace with hash -497793128, now seen corresponding path program 9 times [2022-03-15 20:43:09,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:09,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330823388] [2022-03-15 20:43:09,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:09,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:10,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:10,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330823388] [2022-03-15 20:43:10,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330823388] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:10,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421008531] [2022-03-15 20:43:10,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:43:10,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:10,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:10,088 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:10,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 20:43:10,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:43:10,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:10,121 WARN L261 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 20:43:10,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:10,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:14,438 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:14,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421008531] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:14,439 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:14,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 20:43:14,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1353195057] [2022-03-15 20:43:14,439 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:14,439 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:14,441 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 51 transitions. [2022-03-15 20:43:14,441 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:16,853 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [4461#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 4462#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 4464#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ 3 x_2 (* 3 i_1)) (+ x_1 a (* 3 b))) (not (< i_1 b)))), 4460#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 4469#(and (or (<= (+ x_2 a (* 3 i_1)) (+ x_1 b (* 2 i_2) 1)) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ x_1 (* 2 i_2) 4) (+ (* 2 b) x_2 a)))), 4468#(and (or (not (< (+ i_1 1) b)) (<= (+ 6 x_2 (* 3 i_1)) (+ x_1 (* 3 b) (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ x_1 (* 2 i_2)) x_2))), 4466#(and (or (not (< i_1 b)) (<= (+ x_2 a (* 3 i_1) 1) (+ (* 2 b) x_1 (* 2 i_2)))) (or (<= (+ 2 x_1 (* 2 i_2)) (+ x_2 b a)) (not (< i_1 b)))), 4471#(and (or (not (< (+ i_1 1) b)) (<= (+ 2 x_2 (* 3 i_1)) (+ x_1 b (* 2 i_2)))) (or (not (< (+ i_1 1) b)) (<= (+ x_1 (* 2 i_2) 4) (+ (* 2 b) x_2)))), 4467#(and (or (not (< (+ i_1 1) b)) (<= (+ 6 x_2 (* 3 i_1)) (+ x_1 (* 3 b) (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 4470#(and (or (not (< (+ i_1 1) b)) (<= (+ 2 x_1 (* 2 i_2)) (+ x_2 b))) (or (not (< (+ i_1 1) b)) (<= (+ x_2 (* 3 i_1) 4) (+ (* 2 b) x_1 (* 2 i_2))))), 4465#(and (or (<= (+ x_1 (* 2 i_2)) (+ x_2 a)) (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ 3 x_2 (* 3 i_1)) (+ x_1 a (* 3 b))) (not (< i_1 b)))), 4463#(and (or (< (+ 3 i_2) a) (not (< (+ 2 i_2) a)) (< (+ x_2 (* 3 b)) (+ x_1 1))) (or (< (+ 3 i_2) a) (<= x_1 (+ x_2 (* 3 b))) (not (< (+ 2 i_2) a))))] [2022-03-15 20:43:16,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 20:43:16,854 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:16,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 20:43:16,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1130, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:43:16,855 INFO L87 Difference]: Start difference. First operand 49 states and 105 transitions. Second operand has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:33,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:33,182 INFO L93 Difference]: Finished difference Result 151 states and 251 transitions. [2022-03-15 20:43:33,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 20:43:33,183 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:43:33,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:33,183 INFO L225 Difference]: With dead ends: 151 [2022-03-15 20:43:33,183 INFO L226 Difference]: Without dead ends: 136 [2022-03-15 20:43:33,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1991 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=1036, Invalid=6104, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 20:43:33,185 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 282 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:33,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 1 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:43:33,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-03-15 20:43:33,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 49. [2022-03-15 20:43:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 2.1875) internal successors, (105), 48 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 20:43:33,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 105 transitions. [2022-03-15 20:43:33,187 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 105 transitions. Word has length 13 [2022-03-15 20:43:33,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:33,187 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 105 transitions. [2022-03-15 20:43:33,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:33,188 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 105 transitions. [2022-03-15 20:43:33,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:43:33,188 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:33,188 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:33,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-03-15 20:43:33,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:33,403 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:33,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:33,404 INFO L85 PathProgramCache]: Analyzing trace with hash 182265242, now seen corresponding path program 10 times [2022-03-15 20:43:33,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:33,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081270333] [2022-03-15 20:43:33,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:33,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:33,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:33,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081270333] [2022-03-15 20:43:33,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081270333] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:33,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133796799] [2022-03-15 20:43:33,794 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:43:33,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:33,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:33,795 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:33,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 20:43:33,816 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:43:33,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:33,816 WARN L261 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 20:43:33,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:34,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:35,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133796799] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:35,576 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:35,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-03-15 20:43:35,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [547751827] [2022-03-15 20:43:35,576 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:35,576 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:35,578 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2022-03-15 20:43:35,578 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:37,688 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [4917#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 4919#(and (or (< (+ 3 i_2) a) (not (< (+ 2 i_2) a)) (< (+ x_2 (* 3 b)) (+ x_1 1))) (or (< (+ 3 i_2) a) (<= x_1 (+ x_2 (* 3 b))) (not (< (+ 2 i_2) a)))), 4924#(and (or (not (< i_1 b)) (<= (+ (* i_1 4) 2 x_2) (+ (* 2 b) i_2 x_1))) (or (<= (+ 2 i_2 x_1) (+ (* 2 b) x_2)) (not (< i_1 b)))), 4920#(and (or (< (+ x_2 (* b 4)) (+ x_1 1)) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a)) (or (<= x_1 (+ x_2 (* b 4))) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a))), 4921#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* i_1 4) x_2 4) (+ x_1 a (* b 4))))), 4922#(and (or (<= (+ i_2 x_1) x_2) (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* i_1 4) x_2 4) (+ x_1 a (* b 4))))), 4918#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 4925#(and (or (<= (+ (* i_1 4) x_2 1) (+ i_2 x_1 b)) (not (< i_1 b))) (or (<= (+ 3 i_2 x_1) (+ x_2 (* 3 b))) (not (< i_1 b)))), 4916#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 4923#(and (or (not (< i_1 b)) (<= (+ (* i_1 4) 3 x_2) (+ i_2 x_1 (* 3 b)))) (or (not (< i_1 b)) (<= (+ i_2 x_1 1) (+ x_2 b))))] [2022-03-15 20:43:37,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:43:37,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:37,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:43:37,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 20:43:37,689 INFO L87 Difference]: Start difference. First operand 49 states and 105 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:49,630 INFO L93 Difference]: Finished difference Result 160 states and 261 transitions. [2022-03-15 20:43:49,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 20:43:49,631 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:43:49,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:49,632 INFO L225 Difference]: With dead ends: 160 [2022-03-15 20:43:49,632 INFO L226 Difference]: Without dead ends: 142 [2022-03-15 20:43:49,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1442 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=898, Invalid=4652, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 20:43:49,633 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 250 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:49,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 1 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:43:49,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-03-15 20:43:49,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 52. [2022-03-15 20:43:49,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.1372549019607843) internal successors, (109), 51 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 109 transitions. [2022-03-15 20:43:49,635 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 109 transitions. Word has length 13 [2022-03-15 20:43:49,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:49,635 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 109 transitions. [2022-03-15 20:43:49,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:49,636 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 109 transitions. [2022-03-15 20:43:49,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:43:49,636 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:49,636 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:49,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-03-15 20:43:49,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:49,843 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:49,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:49,844 INFO L85 PathProgramCache]: Analyzing trace with hash -210761768, now seen corresponding path program 5 times [2022-03-15 20:43:49,846 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:49,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123072873] [2022-03-15 20:43:49,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:49,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:50,310 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:50,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123072873] [2022-03-15 20:43:50,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123072873] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:50,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750802728] [2022-03-15 20:43:50,310 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:43:50,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:50,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:50,311 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:50,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 20:43:50,333 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:43:50,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:50,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:43:50,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:50,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:51,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750802728] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:51,450 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:51,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 20:43:51,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1501630563] [2022-03-15 20:43:51,450 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:51,451 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:51,452 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 39 transitions. [2022-03-15 20:43:51,452 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:52,483 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [5364#(and (< 0 (+ x_2 b 1)) (= (+ x_2 b) x_1) (<= (+ x_2 b) 0)), 5368#(and (< 0 (+ x_2 (* 5 b) 1)) (= (+ x_2 (* 5 b)) x_1) (<= (+ x_2 (* 5 b)) 0)), 5365#(and (< 0 (+ (* 2 b) x_2 1)) (<= (+ (* 2 b) x_2) 0) (= (+ (* 2 b) x_2) x_1)), 5366#(and (<= (+ x_2 (* 3 b)) 0) (= (+ x_2 (* 3 b)) x_1) (< 0 (+ x_2 (* 3 b) 1))), 5367#(and (<= (+ x_2 (* b 4)) 0) (< 0 (+ x_2 (* b 4) 1)) (= (+ x_2 (* b 4)) x_1))] [2022-03-15 20:43:52,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:43:52,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:52,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:43:52,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:43:52,484 INFO L87 Difference]: Start difference. First operand 52 states and 109 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:53,251 INFO L93 Difference]: Finished difference Result 69 states and 135 transitions. [2022-03-15 20:43:53,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 20:43:53,251 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:43:53,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:53,251 INFO L225 Difference]: With dead ends: 69 [2022-03-15 20:43:53,251 INFO L226 Difference]: Without dead ends: 59 [2022-03-15 20:43:53,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=223, Invalid=769, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:43:53,252 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 49 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:53,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 1 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:43:53,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-15 20:43:53,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2022-03-15 20:43:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.1176470588235294) internal successors, (108), 51 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:53,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 108 transitions. [2022-03-15 20:43:53,254 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 108 transitions. Word has length 13 [2022-03-15 20:43:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:53,254 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 108 transitions. [2022-03-15 20:43:53,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 108 transitions. [2022-03-15 20:43:53,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:43:53,254 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:53,254 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:53,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 20:43:53,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-03-15 20:43:53,467 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:53,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:53,467 INFO L85 PathProgramCache]: Analyzing trace with hash 100000060, now seen corresponding path program 6 times [2022-03-15 20:43:53,470 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:53,470 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002861042] [2022-03-15 20:43:53,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:53,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:53,992 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:53,993 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:53,993 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002861042] [2022-03-15 20:43:53,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002861042] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:53,993 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945460790] [2022-03-15 20:43:53,993 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:43:53,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:53,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:53,994 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:53,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 20:43:54,014 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:43:54,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:54,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 20:43:54,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:54,747 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:54,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:43:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:55,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945460790] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:43:55,435 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:43:55,436 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-03-15 20:43:55,436 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [752236995] [2022-03-15 20:43:55,436 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:43:55,436 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:43:55,438 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 44 transitions. [2022-03-15 20:43:55,438 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:43:56,680 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [5657#(and (<= 0 (+ x_1 (* a 4))) (= x_2 0) (<= (+ x_1 (* a 4)) 0)), 5656#(and (<= (+ x_1 (* 3 a)) 0) (= x_2 0) (<= 0 (+ x_1 (* 3 a)))), 5658#(and (= x_2 0) (<= 0 (+ x_1 (* 5 a))) (<= (+ x_1 (* 5 a)) 0)), 5660#(and (or (< 0 (+ x_1 1)) (< i_2 a)) (or (= x_2 x_1) (< i_2 a)) (or (< i_2 a) (<= x_1 0))), 5655#(and (<= (+ x_1 (* 2 a)) 0) (= x_2 0) (<= 0 (+ x_1 (* 2 a)))), 5659#(and (<= (+ (* 6 a) x_1) 0) (= x_2 0) (<= 0 (+ (* 6 a) x_1)))] [2022-03-15 20:43:56,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:43:56,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:43:56,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:43:56,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:43:56,681 INFO L87 Difference]: Start difference. First operand 52 states and 108 transitions. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:57,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:43:57,523 INFO L93 Difference]: Finished difference Result 77 states and 149 transitions. [2022-03-15 20:43:57,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:43:57,524 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:43:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:43:57,524 INFO L225 Difference]: With dead ends: 77 [2022-03-15 20:43:57,524 INFO L226 Difference]: Without dead ends: 69 [2022-03-15 20:43:57,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=273, Invalid=987, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:43:57,525 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 65 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:43:57,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 1 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:43:57,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-03-15 20:43:57,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2022-03-15 20:43:57,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.150943396226415) internal successors, (114), 53 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 114 transitions. [2022-03-15 20:43:57,527 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 114 transitions. Word has length 14 [2022-03-15 20:43:57,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:43:57,527 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 114 transitions. [2022-03-15 20:43:57,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:43:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 114 transitions. [2022-03-15 20:43:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:43:57,527 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:43:57,527 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:43:57,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 20:43:57,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-03-15 20:43:57,743 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:43:57,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:43:57,743 INFO L85 PathProgramCache]: Analyzing trace with hash 184963992, now seen corresponding path program 11 times [2022-03-15 20:43:57,746 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:43:57,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194669826] [2022-03-15 20:43:57,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:43:57,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:43:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:43:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:58,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:43:58,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194669826] [2022-03-15 20:43:58,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194669826] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:43:58,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307551600] [2022-03-15 20:43:58,232 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:43:58,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:43:58,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:43:58,233 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:43:58,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 20:43:58,254 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:43:58,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:43:58,255 WARN L261 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 20:43:58,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:43:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:43:59,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:00,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307551600] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:00,077 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:00,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 20:44:00,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [992341513] [2022-03-15 20:44:00,077 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:00,078 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:00,080 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2022-03-15 20:44:00,080 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:02,605 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [5962#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 5969#(and (or (<= (+ x_1 (* a 4)) x_2) (not (< (+ 3 i_1) b))) (or (<= (+ i_1 x_2 4) (+ x_1 b (* a 4))) (not (< (+ 3 i_1) b)))), 5965#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ 3 i_1 x_2) (+ x_1 b (* 3 a))))), 5968#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 5 i_2)) (+ x_2 (* 2 a))) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ 3 i_1 x_2) (+ x_1 b (* 3 a))))), 5971#(and (or (<= (+ i_1 x_2 4) (+ x_1 b (* a 4))) (not (< (+ 3 i_1) b))) (or (<= (+ x_1 (* 5 i_2)) (+ x_2 a)) (<= (+ x_1 (* a 4)) x_2) (not (< (+ 3 i_1) b)))), 5963#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ i_1 x_2 1) (+ x_1 b a)) (not (< i_1 b)))), 5964#(and (or (not (< (+ i_1 1) b)) (<= (+ 2 i_1 x_2) (+ x_1 b (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 5966#(and (or (<= (+ i_1 x_2 1) (+ x_1 b a)) (not (< i_1 b))) (or (<= (+ x_1 (* 5 i_2)) (+ x_2 (* a 4))) (<= (+ x_1 a) x_2) (not (< i_1 b)))), 5967#(and (or (not (< (+ i_1 1) b)) (<= (+ 2 i_1 x_2) (+ x_1 b (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (<= (+ x_1 (* 5 i_2)) (+ x_2 (* 3 a))) (not (< (+ i_1 1) b)))), 5972#(and (or (<= (+ 5 i_1 x_2) (+ x_1 b (* 5 a))) (not (< (+ i_1 4) b))) (or (not (< (+ i_1 4) b)) (<= (+ x_1 (* 5 i_2)) x_2) (<= (+ x_1 (* 5 a)) x_2))), 5961#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 5970#(and (or (not (< (+ i_1 4) b)) (<= (+ x_1 (* 5 a)) x_2)) (or (<= (+ 5 i_1 x_2) (+ x_1 b (* 5 a))) (not (< (+ i_1 4) b))))] [2022-03-15 20:44:02,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:44:02,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:02,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:44:02,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1340, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 20:44:02,606 INFO L87 Difference]: Start difference. First operand 54 states and 114 transitions. Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:12,793 INFO L93 Difference]: Finished difference Result 138 states and 242 transitions. [2022-03-15 20:44:12,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 20:44:12,793 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:44:12,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:12,794 INFO L225 Difference]: With dead ends: 138 [2022-03-15 20:44:12,794 INFO L226 Difference]: Without dead ends: 129 [2022-03-15 20:44:12,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1465 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=725, Invalid=4825, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 20:44:12,795 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 193 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:12,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 1 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 20:44:12,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-03-15 20:44:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 57. [2022-03-15 20:44:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 2.1964285714285716) internal successors, (123), 56 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 123 transitions. [2022-03-15 20:44:12,797 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 123 transitions. Word has length 14 [2022-03-15 20:44:12,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:12,797 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 123 transitions. [2022-03-15 20:44:12,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 123 transitions. [2022-03-15 20:44:12,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:44:12,798 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:12,798 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:12,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 20:44:12,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:12,998 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:12,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:12,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1959971354, now seen corresponding path program 12 times [2022-03-15 20:44:13,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:13,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548419689] [2022-03-15 20:44:13,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:13,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:13,611 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:13,612 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:13,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548419689] [2022-03-15 20:44:13,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548419689] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:13,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676138815] [2022-03-15 20:44:13,612 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:44:13,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:13,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:13,613 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:44:13,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 20:44:13,637 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:44:13,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:44:13,638 WARN L261 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 20:44:13,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:14,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:15,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676138815] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:15,805 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:15,805 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 20:44:15,805 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [845203668] [2022-03-15 20:44:15,805 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:15,806 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:15,808 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 60 transitions. [2022-03-15 20:44:15,808 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:18,621 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [6416#(and (or (not (< (+ 3 i_1) b)) (<= (+ (* i_2 4) x_1 4) (+ x_2 b))) (or (<= (+ (* 2 i_1) x_2 4) (+ (* i_2 4) x_1 b)) (not (< (+ 3 i_1) b)))), 6407#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 6414#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 2 i_1) x_2 (* 2 a)) (+ (* i_2 4) x_1 b))) (or (not (< (+ i_1 1) b)) (<= (+ (* i_2 4) x_1 4) (+ x_2 b (* 2 a))))), 6403#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 2 i_1) x_2 4) (+ (* 2 b) x_1 (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 6409#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ (* 2 i_1) 6 x_2) (+ (* 2 b) x_1 (* 3 a))))), 6405#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 2 i_1) x_2 4) (+ (* 2 b) x_1 (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ (* i_2 4) x_1) (+ x_2 (* 2 a))))), 6412#(and (or (<= (+ (* 2 i_1) x_2 8) (+ (* 2 b) x_1 (* a 4))) (not (< (+ 3 i_1) b))) (or (<= (+ x_1 (* a 4)) x_2) (<= (+ (* i_2 4) x_1) x_2) (not (< (+ 3 i_1) b)))), 6408#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 6406#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 6415#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 2 i_1) 2 x_2 a) (+ (* i_2 4) x_1 b))) (or (not (< (+ 2 i_1) b)) (<= (+ (* i_2 4) x_1 4) (+ x_2 b a)))), 6411#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* i_2 4) x_1) (+ x_2 a)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ (* 2 i_1) 6 x_2) (+ (* 2 b) x_1 (* 3 a))))), 6410#(and (or (<= (+ x_1 (* a 4)) x_2) (not (< (+ 3 i_1) b))) (or (<= (+ (* 2 i_1) x_2 8) (+ (* 2 b) x_1 (* a 4))) (not (< (+ 3 i_1) b)))), 6404#(and (or (<= (+ (* i_2 4) x_1) (+ x_2 (* 3 a))) (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* 2 i_1) 2 x_2) (+ (* 2 b) x_1 a)))), 6413#(and (or (not (< i_1 b)) (<= (+ (* i_2 4) x_1 4) (+ x_2 b (* 3 a)))) (or (<= (+ (* 2 i_1) x_2 (* 3 a)) (+ (* i_2 4) 2 x_1 b)) (not (< i_1 b)))), 6402#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* 2 i_1) 2 x_2) (+ (* 2 b) x_1 a))))] [2022-03-15 20:44:18,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 20:44:18,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:18,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 20:44:18,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1574, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:44:18,622 INFO L87 Difference]: Start difference. First operand 57 states and 123 transitions. Second operand has 26 states, 25 states have (on average 2.08) internal successors, (52), 25 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 20:44:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:44:34,669 INFO L93 Difference]: Finished difference Result 161 states and 276 transitions. [2022-03-15 20:44:34,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-15 20:44:34,669 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 25 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 14 [2022-03-15 20:44:34,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:44:34,670 INFO L225 Difference]: With dead ends: 161 [2022-03-15 20:44:34,670 INFO L226 Difference]: Without dead ends: 149 [2022-03-15 20:44:34,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2416 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=1073, Invalid=7857, Unknown=0, NotChecked=0, Total=8930 [2022-03-15 20:44:34,671 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 320 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:44:34,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 1 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 20:44:34,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-03-15 20:44:34,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 58. [2022-03-15 20:44:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 2.2280701754385963) internal successors, (127), 57 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:44:34,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 127 transitions. [2022-03-15 20:44:34,673 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 127 transitions. Word has length 14 [2022-03-15 20:44:34,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:44:34,673 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 127 transitions. [2022-03-15 20:44:34,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 25 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 20:44:34,673 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 127 transitions. [2022-03-15 20:44:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:44:34,673 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:44:34,673 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:44:34,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 20:44:34,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:34,887 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:44:34,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:44:34,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1150624728, now seen corresponding path program 13 times [2022-03-15 20:44:34,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:44:34,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478539917] [2022-03-15 20:44:34,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:44:34,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:44:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:35,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:44:35,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478539917] [2022-03-15 20:44:35,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478539917] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:44:35,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134965914] [2022-03-15 20:44:35,404 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:44:35,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:44:35,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:44:35,405 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:44:35,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 20:44:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:44:35,428 WARN L261 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 20:44:35,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:44:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:36,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:44:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:44:37,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134965914] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:44:37,583 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:44:37,583 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 20:44:37,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [55417267] [2022-03-15 20:44:37,584 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:44:37,584 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:44:37,586 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 62 transitions. [2022-03-15 20:44:37,586 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:44:40,921 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [6917#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 6918#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 6907#(and (or (not (< i_1 b)) (<= (+ x_2 (* 3 i_1) (* 2 a)) (+ (* 3 i_2) (* 2 b) x_1))) (or (not (< i_1 b)) (<= (+ (* 3 i_2) 3 x_1) (+ x_2 b (* 2 a))))), 6910#(and (or (<= (+ (* 3 i_2) 3 x_1) (+ x_2 b a)) (not (< (+ i_1 1) b))) (or (not (< (+ i_1 1) b)) (<= (+ 3 x_2 a (* 3 i_1)) (+ (* 3 i_2) (* 2 b) x_1)))), 6919#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 6905#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ 3 x_2 (* 3 i_1)) (+ x_1 a (* 3 b))) (not (< i_1 b)))), 6915#(and (or (not (< (+ 2 i_1) b)) (<= (+ 6 x_2 (* 3 i_1)) (+ (* 3 i_2) (* 2 b) x_1))) (or (not (< (+ 2 i_1) b)) (<= (+ (* 3 i_2) 3 x_1) (+ x_2 b)))), 6909#(and (or (not (< (+ i_1 1) b)) (<= (+ 6 x_2 (* 3 i_1)) (+ x_1 (* 3 b) (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ (* 3 i_2) x_1) (+ x_2 a)))), 6916#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 3 i_2) 6 x_1) (+ (* 2 b) x_2))) (or (not (< (+ 2 i_1) b)) (<= (+ 3 x_2 (* 3 i_1)) (+ (* 3 i_2) x_1 b)))), 6913#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ 9 x_2 (* 3 i_1)) (+ x_1 (* 3 b) (* 3 a))))), 6911#(and (or (<= (+ (* 3 i_2) 6 x_1) (+ (* 2 b) x_2 (* 2 a))) (not (< i_1 b))) (or (<= (+ x_2 (* 3 i_1) (* 2 a)) (+ (* 3 i_2) 3 x_1 b)) (not (< i_1 b)))), 6906#(and (or (<= (+ (* 3 i_2) x_1) (+ x_2 (* 2 a))) (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ 3 x_2 (* 3 i_1)) (+ x_1 a (* 3 b))) (not (< i_1 b)))), 6920#(and (or (< (+ 3 i_2) a) (not (< (+ 2 i_2) a)) (< (+ x_2 (* 3 b)) (+ x_1 1))) (or (< (+ 3 i_2) a) (<= x_1 (+ x_2 (* 3 b))) (not (< (+ 2 i_2) a)))), 6908#(and (or (not (< (+ i_1 1) b)) (<= (+ 6 x_2 (* 3 i_1)) (+ x_1 (* 3 b) (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 6914#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 3 i_2) x_1) x_2) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ 9 x_2 (* 3 i_1)) (+ x_1 (* 3 b) (* 3 a))))), 6912#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 3 i_2) 6 x_1) (+ (* 2 b) x_2 a))) (or (not (< (+ i_1 1) b)) (<= (+ x_2 a (* 3 i_1)) (+ (* 3 i_2) x_1 b))))] [2022-03-15 20:44:40,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 20:44:40,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:44:40,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 20:44:40,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1672, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 20:44:40,922 INFO L87 Difference]: Start difference. First operand 58 states and 127 transitions. Second operand has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 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 20:45:01,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:01,820 INFO L93 Difference]: Finished difference Result 180 states and 303 transitions. [2022-03-15 20:45:01,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-15 20:45:01,820 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 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 14 [2022-03-15 20:45:01,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:01,821 INFO L225 Difference]: With dead ends: 180 [2022-03-15 20:45:01,821 INFO L226 Difference]: Without dead ends: 165 [2022-03-15 20:45:01,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2890 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=1340, Invalid=9166, Unknown=0, NotChecked=0, Total=10506 [2022-03-15 20:45:01,822 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 383 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:01,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 1 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 20:45:01,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-03-15 20:45:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 59. [2022-03-15 20:45:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 2.2586206896551726) internal successors, (131), 58 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 131 transitions. [2022-03-15 20:45:01,824 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 131 transitions. Word has length 14 [2022-03-15 20:45:01,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:01,825 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 131 transitions. [2022-03-15 20:45:01,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 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 20:45:01,825 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 131 transitions. [2022-03-15 20:45:01,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:45:01,825 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:01,825 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:01,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 20:45:02,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-15 20:45:02,039 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:02,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:02,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1830683098, now seen corresponding path program 14 times [2022-03-15 20:45:02,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:02,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895875689] [2022-03-15 20:45:02,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:02,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:02,527 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:02,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895875689] [2022-03-15 20:45:02,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895875689] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:02,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408834193] [2022-03-15 20:45:02,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:45:02,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:02,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:02,528 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:45:02,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 20:45:02,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:45:02,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:02,551 WARN L261 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 20:45:02,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:03,470 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:03,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:05,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408834193] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:05,085 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:05,085 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 20:45:05,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [896291156] [2022-03-15 20:45:05,086 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:05,086 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:05,088 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 60 transitions. [2022-03-15 20:45:05,088 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:08,376 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [7453#(and (or (not (< i_1 b)) (<= (+ (* i_1 4) x_2 a) (+ 2 x_1 b (* 2 i_2)))) (or (<= (+ 6 x_1 (* 2 i_2)) (+ x_2 a (* 3 b))) (not (< i_1 b)))), 7447#(and (or (< (+ 3 i_2) a) (not (< (+ 2 i_2) a)) (< (+ x_2 (* 3 b)) (+ x_1 1))) (or (< (+ 3 i_2) a) (<= x_1 (+ x_2 (* 3 b))) (not (< (+ 2 i_2) a)))), 7458#(and (or (not (< (+ i_1 1) b)) (<= (+ 6 x_1 (* 2 i_2)) (+ x_2 (* 3 b)))) (or (not (< (+ i_1 1) b)) (<= (+ (* i_1 4) 2 x_2) (+ x_1 b (* 2 i_2))))), 7456#(and (or (not (< (+ i_1 1) b)) (<= (+ 2 x_1 (* 2 i_2)) (+ x_2 b))) (or (<= (+ (* i_1 4) 6 x_2) (+ x_1 (* 2 i_2) (* 3 b))) (not (< (+ i_1 1) b)))), 7455#(and (or (not (< (+ i_1 1) b)) (<= (+ (* i_1 4) x_2 8) (+ x_1 (* b 4) (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ x_1 (* 2 i_2)) x_2))), 7452#(and (or (not (< i_1 b)) (<= (+ (* i_1 4) x_2 a) (+ (* 2 b) x_1 (* 2 i_2)))) (or (not (< i_1 b)) (<= (+ x_1 (* 2 i_2) 4) (+ (* 2 b) x_2 a)))), 7444#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 7451#(and (or (<= (+ 2 x_1 (* 2 i_2)) (+ x_2 b a)) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* i_1 4) 2 x_2 a) (+ x_1 (* 2 i_2) (* 3 b))))), 7457#(and (or (not (< (+ i_1 1) b)) (<= (+ (* i_1 4) x_2 4) (+ (* 2 b) x_1 (* 2 i_2)))) (or (not (< (+ i_1 1) b)) (<= (+ x_1 (* 2 i_2) 4) (+ (* 2 b) x_2)))), 7448#(and (or (< (+ x_2 (* b 4)) (+ x_1 1)) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a)) (or (<= x_1 (+ x_2 (* b 4))) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a))), 7445#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 7454#(and (or (not (< (+ i_1 1) b)) (<= (+ (* i_1 4) x_2 8) (+ x_1 (* b 4) (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 7449#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* i_1 4) x_2 4) (+ x_1 a (* b 4))))), 7450#(and (or (not (< i_1 b)) (<= (+ (* i_1 4) x_2 4) (+ x_1 a (* b 4)))) (or (<= (+ x_1 (* 2 i_2)) (+ x_2 a)) (<= (+ x_1 a) x_2) (not (< i_1 b)))), 7446#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)))] [2022-03-15 20:45:08,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 20:45:08,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:08,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 20:45:08,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1565, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:45:08,377 INFO L87 Difference]: Start difference. First operand 59 states and 131 transitions. Second operand has 26 states, 25 states have (on average 2.08) internal successors, (52), 25 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 20:45:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:32,562 INFO L93 Difference]: Finished difference Result 199 states and 329 transitions. [2022-03-15 20:45:32,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-03-15 20:45:32,563 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 25 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 14 [2022-03-15 20:45:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:32,564 INFO L225 Difference]: With dead ends: 199 [2022-03-15 20:45:32,564 INFO L226 Difference]: Without dead ends: 181 [2022-03-15 20:45:32,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3220 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=1581, Invalid=9549, Unknown=0, NotChecked=0, Total=11130 [2022-03-15 20:45:32,565 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 376 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:32,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 1 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 20:45:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-03-15 20:45:32,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 59. [2022-03-15 20:45:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 2.2586206896551726) internal successors, (131), 58 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:32,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 131 transitions. [2022-03-15 20:45:32,568 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 131 transitions. Word has length 14 [2022-03-15 20:45:32,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:32,568 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 131 transitions. [2022-03-15 20:45:32,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 25 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 20:45:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 131 transitions. [2022-03-15 20:45:32,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:45:32,569 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:32,569 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:32,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 20:45:32,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 20:45:32,776 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:32,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:32,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1437656088, now seen corresponding path program 15 times [2022-03-15 20:45:32,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:32,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821804295] [2022-03-15 20:45:32,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:32,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:33,400 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:33,401 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:33,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821804295] [2022-03-15 20:45:33,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821804295] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:33,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777708] [2022-03-15 20:45:33,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:45:33,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:33,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:33,402 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:45:33,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 20:45:33,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 20:45:33,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:33,427 WARN L261 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 20:45:33,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:34,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:36,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777708] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:36,058 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:36,058 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 20:45:36,058 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [231477619] [2022-03-15 20:45:36,058 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:36,059 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:36,061 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2022-03-15 20:45:36,061 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:38,940 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [8012#(and (or (not (< i_1 b)) (<= (+ i_2 x_1 1) (+ x_2 b))) (or (not (< i_1 b)) (<= (+ (* 5 i_1) x_2 4) (+ i_2 x_1 (* b 4))))), 8021#(and (or (<= (+ (* 5 i_1) x_2 1) (+ i_2 x_1 b)) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ i_2 x_1 4) (+ x_2 (* b 4))))), 8010#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ (* 5 i_1) 5 x_2) (+ x_1 a (* 5 b))) (not (< i_1 b)))), 8011#(and (or (<= (+ i_2 x_1) x_2) (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ (* 5 i_1) 5 x_2) (+ x_1 a (* 5 b))) (not (< i_1 b)))), 8014#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 8018#(and (or (< (+ x_2 (* b 4)) (+ x_1 1)) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a)) (or (<= x_1 (+ x_2 (* b 4))) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a))), 8017#(and (or (< (+ 3 i_2) a) (not (< (+ 2 i_2) a)) (< (+ x_2 (* 3 b)) (+ x_1 1))) (or (< (+ 3 i_2) a) (<= x_1 (+ x_2 (* 3 b))) (not (< (+ 2 i_2) a)))), 8019#(and (or (< (+ 5 i_2) a) (<= x_1 (+ x_2 (* 5 b))) (not (< (+ i_2 4) a))) (or (< (+ 5 i_2) a) (< (+ x_2 (* 5 b)) (+ x_1 1)) (not (< (+ i_2 4) a)))), 8016#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 8015#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 8020#(and (or (<= (+ 3 i_2 x_1) (+ x_2 (* 3 b))) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* 5 i_1) 2 x_2) (+ (* 2 b) i_2 x_1)))), 8013#(and (or (<= (+ (* 5 i_1) 3 x_2) (+ i_2 x_1 (* 3 b))) (not (< i_1 b))) (or (<= (+ 2 i_2 x_1) (+ (* 2 b) x_2)) (not (< i_1 b))))] [2022-03-15 20:45:38,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:45:38,940 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:38,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:45:38,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1392, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 20:45:38,941 INFO L87 Difference]: Start difference. First operand 59 states and 131 transitions. Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:54,980 INFO L93 Difference]: Finished difference Result 198 states and 325 transitions. [2022-03-15 20:45:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 20:45:54,980 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:45:54,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:54,981 INFO L225 Difference]: With dead ends: 198 [2022-03-15 20:45:54,981 INFO L226 Difference]: Without dead ends: 177 [2022-03-15 20:45:54,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2073 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=1262, Invalid=6570, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 20:45:54,982 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 342 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:54,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 1 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:45:54,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-03-15 20:45:54,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 62. [2022-03-15 20:45:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 2.2131147540983607) internal successors, (135), 61 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 135 transitions. [2022-03-15 20:45:54,984 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 135 transitions. Word has length 14 [2022-03-15 20:45:54,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:54,984 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 135 transitions. [2022-03-15 20:45:54,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 135 transitions. [2022-03-15 20:45:54,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:45:54,985 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:54,985 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:55,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 20:45:55,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 20:45:55,199 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:55,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:55,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2138720666, now seen corresponding path program 6 times [2022-03-15 20:45:55,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:55,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952083828] [2022-03-15 20:45:55,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:55,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:55,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:55,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952083828] [2022-03-15 20:45:55,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952083828] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:55,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288099037] [2022-03-15 20:45:55,629 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:45:55,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:55,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:55,630 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:45:55,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 20:45:55,658 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:45:55,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:45:55,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 20:45:55,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:45:56,256 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:56,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:45:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:56,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288099037] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:45:56,800 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:45:56,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-03-15 20:45:56,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1375276240] [2022-03-15 20:45:56,800 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:45:56,801 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:45:56,802 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 44 transitions. [2022-03-15 20:45:56,802 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:45:57,841 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [8549#(and (< 0 (+ x_2 (* 5 b) 1)) (= (+ x_2 (* 5 b)) x_1) (<= (+ x_2 (* 5 b)) 0)), 8548#(and (<= (+ x_2 (* b 4)) 0) (< 0 (+ x_2 (* b 4) 1)) (= (+ x_2 (* b 4)) x_1)), 8547#(and (<= (+ x_2 (* 3 b)) 0) (= (+ x_2 (* 3 b)) x_1) (< 0 (+ x_2 (* 3 b) 1))), 8545#(and (< 0 (+ x_2 b 1)) (= (+ x_2 b) x_1) (<= (+ x_2 b) 0)), 8550#(and (<= (+ x_2 (* 6 b)) 0) (= (+ x_2 (* 6 b)) x_1) (< 0 (+ x_2 (* 6 b) 1))), 8546#(and (< 0 (+ (* 2 b) x_2 1)) (<= (+ (* 2 b) x_2) 0) (= (+ (* 2 b) x_2) x_1))] [2022-03-15 20:45:57,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:45:57,841 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:45:57,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:45:57,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:45:57,842 INFO L87 Difference]: Start difference. First operand 62 states and 135 transitions. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:58,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:45:58,739 INFO L93 Difference]: Finished difference Result 80 states and 162 transitions. [2022-03-15 20:45:58,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:45:58,739 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:45:58,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:45:58,740 INFO L225 Difference]: With dead ends: 80 [2022-03-15 20:45:58,740 INFO L226 Difference]: Without dead ends: 70 [2022-03-15 20:45:58,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=287, Invalid=1045, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 20:45:58,741 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 48 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:45:58,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 1 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:45:58,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-03-15 20:45:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2022-03-15 20:45:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 2.19672131147541) internal successors, (134), 61 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 134 transitions. [2022-03-15 20:45:58,742 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 134 transitions. Word has length 14 [2022-03-15 20:45:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:45:58,742 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 134 transitions. [2022-03-15 20:45:58,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:45:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 134 transitions. [2022-03-15 20:45:58,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:45:58,743 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:45:58,743 INFO L514 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:45:58,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-03-15 20:45:58,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 20:45:58,955 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:45:58,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:45:58,956 INFO L85 PathProgramCache]: Analyzing trace with hash -338653956, now seen corresponding path program 7 times [2022-03-15 20:45:58,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:45:58,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486087303] [2022-03-15 20:45:58,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:45:58,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:45:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:45:59,417 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:45:59,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486087303] [2022-03-15 20:45:59,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486087303] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:45:59,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453243186] [2022-03-15 20:45:59,417 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:45:59,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:45:59,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:45:59,418 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:45:59,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 20:45:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:45:59,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 20:45:59,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:46:00,138 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:00,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:46:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:00,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453243186] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:46:00,813 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:46:00,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 20:46:00,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2046715494] [2022-03-15 20:46:00,813 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:46:00,814 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:46:00,816 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 49 transitions. [2022-03-15 20:46:00,816 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:46:02,266 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [8883#(and (= x_2 0) (<= 0 (+ x_1 (* 5 a))) (<= (+ x_1 (* 5 a)) 0)), 8884#(and (<= (+ (* 6 a) x_1) 0) (= x_2 0) (<= 0 (+ (* 6 a) x_1))), 8880#(and (<= (+ x_1 (* 3 a)) 0) (= x_2 0) (<= 0 (+ x_1 (* 3 a)))), 8882#(and (or (< 0 (+ x_1 1)) (< i_2 a)) (or (= x_2 x_1) (< i_2 a)) (or (< i_2 a) (<= x_1 0))), 8879#(and (<= (+ x_1 (* 2 a)) 0) (= x_2 0) (<= 0 (+ x_1 (* 2 a)))), 8881#(and (<= 0 (+ x_1 (* a 4))) (= x_2 0) (<= (+ x_1 (* a 4)) 0)), 8885#(and (= x_2 0) (<= 0 (+ x_1 (* 7 a))) (<= (+ x_1 (* 7 a)) 0))] [2022-03-15 20:46:02,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 20:46:02,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:46:02,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 20:46:02,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 20:46:02,267 INFO L87 Difference]: Start difference. First operand 62 states and 134 transitions. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:46:03,164 INFO L93 Difference]: Finished difference Result 89 states and 178 transitions. [2022-03-15 20:46:03,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 20:46:03,165 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:46:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:46:03,165 INFO L225 Difference]: With dead ends: 89 [2022-03-15 20:46:03,165 INFO L226 Difference]: Without dead ends: 81 [2022-03-15 20:46:03,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=343, Invalid=1297, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 20:46:03,166 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 83 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:46:03,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 1 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:46:03,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-03-15 20:46:03,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2022-03-15 20:46:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.2222222222222223) internal successors, (140), 63 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 140 transitions. [2022-03-15 20:46:03,168 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 140 transitions. Word has length 15 [2022-03-15 20:46:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:46:03,168 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 140 transitions. [2022-03-15 20:46:03,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 140 transitions. [2022-03-15 20:46:03,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:46:03,168 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:46:03,168 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:46:03,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 20:46:03,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 20:46:03,379 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:46:03,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:46:03,380 INFO L85 PathProgramCache]: Analyzing trace with hash -253690024, now seen corresponding path program 16 times [2022-03-15 20:46:03,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:46:03,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112037014] [2022-03-15 20:46:03,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:46:03,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:46:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:03,977 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:03,977 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:46:03,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112037014] [2022-03-15 20:46:03,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112037014] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:46:03,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967307522] [2022-03-15 20:46:03,978 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:46:03,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:03,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:46:03,979 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:46:03,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 20:46:03,998 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:46:03,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:46:03,999 WARN L261 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 20:46:03,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:46:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:04,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:46:06,112 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:06,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967307522] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:46:06,113 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:46:06,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-03-15 20:46:06,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1620067762] [2022-03-15 20:46:06,113 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:46:06,114 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:46:06,116 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 61 transitions. [2022-03-15 20:46:06,116 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:46:09,299 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [9240#(and (or (<= (+ 5 i_1 x_2) (+ x_1 b (* 5 a))) (not (< (+ i_1 4) b))) (or (<= (+ (* 6 i_2) x_1) (+ x_2 a)) (not (< (+ i_1 4) b)) (<= (+ x_1 (* 5 a)) x_2))), 9234#(and (or (<= (+ i_1 x_2 1) (+ x_1 b a)) (not (< i_1 b))) (or (<= (+ x_1 a) x_2) (not (< i_1 b)) (<= (+ (* 6 i_2) x_1) (+ x_2 (* 5 a))))), 9232#(and (or (not (< (+ i_1 1) b)) (<= (+ 2 i_1 x_2) (+ x_1 b (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 9241#(and (or (<= (+ (* 6 a) x_1) x_2) (not (< (+ 5 i_1) b))) (or (<= (+ 6 i_1 x_2) (+ (* 6 a) x_1 b)) (not (< (+ 5 i_1) b)))), 9236#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 6 i_2) x_1) (+ x_2 (* 3 a))) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ 3 i_1 x_2) (+ x_1 b (* 3 a))))), 9239#(and (or (not (< (+ i_1 4) b)) (<= (+ x_1 (* 5 a)) x_2)) (or (<= (+ 5 i_1 x_2) (+ x_1 b (* 5 a))) (not (< (+ i_1 4) b)))), 9237#(and (or (<= (+ x_1 (* a 4)) x_2) (not (< (+ 3 i_1) b))) (or (<= (+ i_1 x_2 4) (+ x_1 b (* a 4))) (not (< (+ 3 i_1) b)))), 9230#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 9238#(and (or (<= (+ x_1 (* a 4)) x_2) (<= (+ (* 6 i_2) x_1) (+ x_2 (* 2 a))) (not (< (+ 3 i_1) b))) (or (<= (+ i_1 x_2 4) (+ x_1 b (* a 4))) (not (< (+ 3 i_1) b)))), 9242#(and (or (<= (+ 6 i_1 x_2) (+ (* 6 a) x_1 b)) (not (< (+ 5 i_1) b))) (or (<= (+ (* 6 i_2) x_1) x_2) (<= (+ (* 6 a) x_1) x_2) (not (< (+ 5 i_1) b)))), 9235#(and (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ (* 6 i_2) x_1) (+ x_2 (* a 4)))) (or (not (< (+ i_1 1) b)) (<= (+ 2 i_1 x_2) (+ x_1 b (* 2 a))))), 9233#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ 3 i_1 x_2) (+ x_1 b (* 3 a))))), 9231#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ i_1 x_2 1) (+ x_1 b a)) (not (< i_1 b)))), 9229#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a)))] [2022-03-15 20:46:09,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 20:46:09,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:46:09,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 20:46:09,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1727, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:46:09,300 INFO L87 Difference]: Start difference. First operand 64 states and 140 transitions. Second operand has 26 states, 25 states have (on average 2.08) internal successors, (52), 25 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 20:46:22,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:46:22,799 INFO L93 Difference]: Finished difference Result 162 states and 289 transitions. [2022-03-15 20:46:22,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 20:46:22,799 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 25 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 15 [2022-03-15 20:46:22,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:46:22,800 INFO L225 Difference]: With dead ends: 162 [2022-03-15 20:46:22,800 INFO L226 Difference]: Without dead ends: 153 [2022-03-15 20:46:22,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1950 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=913, Invalid=6397, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 20:46:22,801 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 275 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:46:22,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 1 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 20:46:22,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-03-15 20:46:22,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 67. [2022-03-15 20:46:22,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 2.257575757575758) internal successors, (149), 66 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:22,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 149 transitions. [2022-03-15 20:46:22,803 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 149 transitions. Word has length 15 [2022-03-15 20:46:22,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:46:22,803 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 149 transitions. [2022-03-15 20:46:22,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 25 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 20:46:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 149 transitions. [2022-03-15 20:46:22,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:46:22,803 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:46:22,803 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:46:22,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-03-15 20:46:23,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:23,019 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:46:23,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:46:23,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1521317338, now seen corresponding path program 17 times [2022-03-15 20:46:23,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:46:23,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168375508] [2022-03-15 20:46:23,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:46:23,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:46:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:23,564 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:46:23,564 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168375508] [2022-03-15 20:46:23,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168375508] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:46:23,564 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382071363] [2022-03-15 20:46:23,564 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:46:23,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:23,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:46:23,566 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:46:23,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 20:46:23,588 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:46:23,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:46:23,589 WARN L261 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 20:46:23,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:46:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:24,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:46:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:29,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382071363] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:46:29,403 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:46:29,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-03-15 20:46:29,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [314284118] [2022-03-15 20:46:29,403 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:46:29,404 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:46:29,407 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 69 transitions. [2022-03-15 20:46:29,407 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:46:33,027 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [9742#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 2 i_1) x_2 (* 3 a)) (+ x_1 b (* 5 i_2) 1))) (or (<= (+ 5 x_1 (* 5 i_2)) (+ x_2 b (* 3 a))) (not (< (+ i_1 1) b)))), 9751#(and (or (<= (+ x_1 (* 5 i_2)) (+ x_2 a)) (<= (+ x_1 (* a 4)) x_2) (not (< (+ 3 i_1) b))) (or (<= (+ (* 2 i_1) x_2 8) (+ (* 2 b) x_1 (* a 4))) (not (< (+ 3 i_1) b)))), 9753#(and (or (not (< (+ i_1 4) b)) (<= (+ (* 2 i_1) x_2 10) (+ (* 2 b) x_1 (* 5 a)))) (or (not (< (+ i_1 4) b)) (<= (+ x_1 (* 5 i_2)) x_2) (<= (+ x_1 (* 5 a)) x_2))), 9750#(and (or (not (< (+ i_1 4) b)) (<= (+ x_1 (* 5 a)) x_2)) (or (not (< (+ i_1 4) b)) (<= (+ (* 2 i_1) x_2 10) (+ (* 2 b) x_1 (* 5 a))))), 9737#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* 2 i_1) 2 x_2) (+ (* 2 b) x_1 a)))), 9754#(and (or (not (< (+ i_1 4) b)) (<= (+ 5 (* 2 i_1) x_2) (+ x_1 b (* 5 i_2)))) (or (not (< (+ i_1 4) b)) (<= (+ 5 x_1 (* 5 i_2)) (+ x_2 b)))), 9744#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 5 i_2)) (+ x_2 (* 2 a))) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ (* 2 i_1) 6 x_2) (+ (* 2 b) x_1 (* 3 a))))), 9747#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 9745#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 2 i_1) x_2 (* 2 a) 1) (+ x_1 b (* 5 i_2)))) (or (not (< (+ 2 i_1) b)) (<= (+ 5 x_1 (* 5 i_2)) (+ x_2 b (* 2 a))))), 9738#(and (or (not (< i_1 b)) (<= (+ (* 2 i_1) 2 x_2) (+ (* 2 b) x_1 a))) (or (<= (+ x_1 (* 5 i_2)) (+ x_2 (* a 4))) (<= (+ x_1 a) x_2) (not (< i_1 b)))), 9740#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 2 i_1) x_2 4) (+ (* 2 b) x_1 (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (<= (+ x_1 (* 5 i_2)) (+ x_2 (* 3 a))) (not (< (+ i_1 1) b)))), 9749#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 9741#(and (or (<= (+ (* 2 i_1) x_2 (* a 4)) (+ 3 x_1 b (* 5 i_2))) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ 5 x_1 (* 5 i_2)) (+ x_2 b (* a 4))))), 9743#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ (* 2 i_1) 6 x_2) (+ (* 2 b) x_1 (* 3 a))))), 9739#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 2 i_1) x_2 4) (+ (* 2 b) x_1 (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 9752#(and (or (<= (+ 5 x_1 (* 5 i_2)) (+ x_2 b a)) (not (< (+ 3 i_1) b))) (or (<= (+ (* 2 i_1) 3 x_2 a) (+ x_1 b (* 5 i_2))) (not (< (+ 3 i_1) b)))), 9746#(and (or (<= (+ x_1 (* a 4)) x_2) (not (< (+ 3 i_1) b))) (or (<= (+ (* 2 i_1) x_2 8) (+ (* 2 b) x_1 (* a 4))) (not (< (+ 3 i_1) b)))), 9748#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a))))] [2022-03-15 20:46:33,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 20:46:33,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:46:33,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 20:46:33,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2084, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 20:46:33,028 INFO L87 Difference]: Start difference. First operand 67 states and 149 transitions. Second operand has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 29 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:53,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:46:53,765 INFO L93 Difference]: Finished difference Result 191 states and 331 transitions. [2022-03-15 20:46:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-03-15 20:46:53,766 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 29 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:46:53,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:46:53,766 INFO L225 Difference]: With dead ends: 191 [2022-03-15 20:46:53,766 INFO L226 Difference]: Without dead ends: 179 [2022-03-15 20:46:53,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3336 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=1357, Invalid=10853, Unknown=0, NotChecked=0, Total=12210 [2022-03-15 20:46:53,767 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 442 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:46:53,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [442 Valid, 1 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-03-15 20:46:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-03-15 20:46:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 68. [2022-03-15 20:46:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 2.283582089552239) internal successors, (153), 67 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 153 transitions. [2022-03-15 20:46:53,770 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 153 transitions. Word has length 15 [2022-03-15 20:46:53,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:46:53,770 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 153 transitions. [2022-03-15 20:46:53,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 29 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:53,770 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 153 transitions. [2022-03-15 20:46:53,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:46:53,770 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:46:53,770 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:46:53,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 20:46:53,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-03-15 20:46:53,983 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:46:53,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:46:53,984 INFO L85 PathProgramCache]: Analyzing trace with hash 711970712, now seen corresponding path program 18 times [2022-03-15 20:46:53,986 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:46:53,986 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915906863] [2022-03-15 20:46:53,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:46:53,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:46:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:54,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:46:54,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915906863] [2022-03-15 20:46:54,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915906863] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:46:54,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482665433] [2022-03-15 20:46:54,494 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:46:54,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:54,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:46:54,495 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:46:54,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 20:46:54,517 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:46:54,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:46:54,518 WARN L261 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 20:46:54,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:46:55,443 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:55,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:46:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:56,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482665433] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:46:56,914 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:46:56,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-03-15 20:46:56,914 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1840200265] [2022-03-15 20:46:56,914 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:46:56,915 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:46:56,917 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 73 transitions. [2022-03-15 20:46:56,917 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:01,171 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [10337#(and (or (<= (+ x_2 (* 3 i_1) 8) (+ (* 2 b) (* i_2 4) x_1)) (not (< (+ 3 i_1) b))) (or (not (< (+ 3 i_1) b)) (<= (+ (* i_2 4) x_1 4) (+ x_2 b)))), 10328#(and (or (not (< (+ i_1 1) b)) (<= (+ 6 x_2 (* 3 i_1)) (+ x_1 (* 3 b) (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 10327#(and (or (<= (+ (* i_2 4) x_1) (+ x_2 (* 3 a))) (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ 3 x_2 (* 3 i_1)) (+ x_1 a (* 3 b))) (not (< i_1 b)))), 10330#(and (or (not (< i_1 b)) (<= (+ (* i_2 4) x_1 4) (+ x_2 b (* 3 a)))) (or (<= (+ x_2 (* 3 i_1) (* 3 a)) (+ (* 2 b) (* i_2 4) x_1 1)) (not (< i_1 b)))), 10332#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ 9 x_2 (* 3 i_1)) (+ x_1 (* 3 b) (* 3 a))))), 10340#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* i_2 4) x_1 8) (+ (* 2 b) x_2 a))) (or (not (< (+ 2 i_1) b)) (<= (+ x_2 a (* 3 i_1) 1) (+ (* i_2 4) x_1 b)))), 10334#(and (or (<= (+ 5 x_2 a (* 3 i_1)) (+ (* 2 b) (* i_2 4) x_1)) (not (< (+ 2 i_1) b))) (or (not (< (+ 2 i_1) b)) (<= (+ (* i_2 4) x_1 4) (+ x_2 b a)))), 10331#(and (or (not (< (+ i_1 1) b)) (<= (+ 2 x_2 (* 3 i_1) (* 2 a)) (+ (* 2 b) (* i_2 4) x_1))) (or (not (< (+ i_1 1) b)) (<= (+ (* i_2 4) x_1 4) (+ x_2 b (* 2 a))))), 10335#(and (or (<= (+ x_1 (* a 4)) x_2) (not (< (+ 3 i_1) b))) (or (not (< (+ 3 i_1) b)) (<= (+ x_2 (* 3 i_1) 12) (+ x_1 (* a 4) (* 3 b))))), 10333#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* i_2 4) x_1) (+ x_2 a)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ 9 x_2 (* 3 i_1)) (+ x_1 (* 3 b) (* 3 a))))), 10323#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 10329#(and (or (not (< (+ i_1 1) b)) (<= (+ 6 x_2 (* 3 i_1)) (+ x_1 (* 3 b) (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ (* i_2 4) x_1) (+ x_2 (* 2 a))))), 10338#(and (or (<= (+ x_2 (* 3 i_1) (* 3 a)) (+ 5 (* i_2 4) x_1 b)) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* i_2 4) x_1 8) (+ (* 2 b) x_2 (* 3 a))))), 10336#(and (or (not (< (+ 3 i_1) b)) (<= (+ x_2 (* 3 i_1) 12) (+ x_1 (* a 4) (* 3 b)))) (or (<= (+ x_1 (* a 4)) x_2) (<= (+ (* i_2 4) x_1) x_2) (not (< (+ 3 i_1) b)))), 10339#(and (or (not (< (+ i_1 1) b)) (<= (+ x_2 (* 3 i_1) (* 2 a)) (+ (* i_2 4) 2 x_1 b))) (or (not (< (+ i_1 1) b)) (<= (+ (* i_2 4) x_1 8) (+ (* 2 b) x_2 (* 2 a))))), 10341#(and (or (<= (+ (* i_2 4) x_1 8) (+ (* 2 b) x_2)) (not (< (+ 3 i_1) b))) (or (<= (+ x_2 (* 3 i_1) 4) (+ (* i_2 4) x_1 b)) (not (< (+ 3 i_1) b)))), 10322#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 10324#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 10325#(and (or (< (+ 3 i_2) a) (not (< (+ 2 i_2) a)) (< (+ x_2 (* 3 b)) (+ x_1 1))) (or (< (+ 3 i_2) a) (<= x_1 (+ x_2 (* 3 b))) (not (< (+ 2 i_2) a)))), 10326#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ 3 x_2 (* 3 i_1)) (+ x_1 a (* 3 b))) (not (< i_1 b))))] [2022-03-15 20:47:01,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 20:47:01,172 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:01,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 20:47:01,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2272, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 20:47:01,172 INFO L87 Difference]: Start difference. First operand 68 states and 153 transitions. Second operand has 32 states, 31 states have (on average 2.064516129032258) internal successors, (64), 31 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:30,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:30,953 INFO L93 Difference]: Finished difference Result 220 states and 374 transitions. [2022-03-15 20:47:30,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-15 20:47:30,953 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.064516129032258) internal successors, (64), 31 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:47:30,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:30,954 INFO L225 Difference]: With dead ends: 220 [2022-03-15 20:47:30,954 INFO L226 Difference]: Without dead ends: 205 [2022-03-15 20:47:30,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4598 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=1883, Invalid=14119, Unknown=0, NotChecked=0, Total=16002 [2022-03-15 20:47:30,955 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 482 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:30,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 1 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-03-15 20:47:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-03-15 20:47:30,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 69. [2022-03-15 20:47:30,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 2.3088235294117645) internal successors, (157), 68 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 157 transitions. [2022-03-15 20:47:30,957 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 157 transitions. Word has length 15 [2022-03-15 20:47:30,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:30,957 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 157 transitions. [2022-03-15 20:47:30,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.064516129032258) internal successors, (64), 31 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:30,958 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 157 transitions. [2022-03-15 20:47:30,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:47:30,958 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:30,958 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:30,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 20:47:31,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:31,174 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:31,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:31,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1392029082, now seen corresponding path program 19 times [2022-03-15 20:47:31,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:31,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860286168] [2022-03-15 20:47:31,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:31,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:31,718 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:31,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860286168] [2022-03-15 20:47:31,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860286168] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:31,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349671436] [2022-03-15 20:47:31,719 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:47:31,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:31,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:31,720 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:47:31,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 20:47:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:31,744 WARN L261 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 20:47:31,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:32,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:41,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349671436] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:41,239 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:41,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-03-15 20:47:41,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [814199933] [2022-03-15 20:47:41,240 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:41,241 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:41,244 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 73 transitions. [2022-03-15 20:47:41,244 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:46,322 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [10970#(and (or (<= (+ (* 3 i_2) x_1) (+ x_2 (* 2 a))) (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* i_1 4) x_2 4) (+ x_1 a (* b 4))))), 10981#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 3 i_2) 6 x_1) (+ (* 2 b) x_2 a))) (or (not (< (+ i_1 1) b)) (<= (+ (* i_1 4) 2 x_2 a) (+ (* 3 i_2) (* 2 b) x_1)))), 10972#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 10973#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 10968#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 10976#(and (or (<= (+ (* 3 i_2) 6 x_1) (+ (* 2 b) x_2 (* 2 a))) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* i_1 4) x_2 (* 2 a)) (+ (* 3 i_2) (* 2 b) 2 x_1)))), 10984#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 3 i_2) x_1) x_2) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ (* i_1 4) x_2 12) (+ x_1 (* b 4) (* 3 a))))), 10977#(and (or (not (< i_1 b)) (<= (+ (* 3 i_2) 9 x_1) (+ x_2 (* 3 b) (* 2 a)))) (or (<= (+ (* i_1 4) x_2 (* 2 a)) (+ (* 3 i_2) 5 x_1 b)) (not (< i_1 b)))), 10969#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* i_1 4) x_2 4) (+ x_1 a (* b 4))))), 10971#(and (or (not (< i_1 b)) (<= (+ (* 3 i_2) 3 x_1) (+ x_2 b (* 2 a)))) (or (not (< i_1 b)) (<= (+ (* i_1 4) x_2 (* 2 a) 1) (+ (* 3 i_2) x_1 (* 3 b))))), 10987#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 3 i_2) 9 x_1) (+ x_2 (* 3 b)))) (or (not (< (+ 2 i_1) b)) (<= (+ (* i_1 4) 3 x_2) (+ (* 3 i_2) x_1 b)))), 10975#(and (or (< (+ x_2 (* b 4)) (+ x_1 1)) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a)) (or (<= x_1 (+ x_2 (* b 4))) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a))), 10978#(and (or (not (< (+ i_1 1) b)) (<= (+ (* i_1 4) x_2 8) (+ x_1 (* b 4) (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 10983#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ (* i_1 4) x_2 12) (+ x_1 (* b 4) (* 3 a))))), 10985#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* i_1 4) 9 x_2) (+ (* 3 i_2) x_1 (* 3 b)))) (or (not (< (+ 2 i_1) b)) (<= (+ (* 3 i_2) 3 x_1) (+ x_2 b)))), 10982#(and (or (not (< (+ i_1 1) b)) (<= (+ (* i_1 4) x_2 a) (+ (* 3 i_2) x_1 b 1))) (or (not (< (+ i_1 1) b)) (<= (+ (* 3 i_2) 9 x_1) (+ x_2 a (* 3 b))))), 10986#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 3 i_2) 6 x_1) (+ (* 2 b) x_2))) (or (not (< (+ 2 i_1) b)) (<= (+ (* i_1 4) 6 x_2) (+ (* 3 i_2) (* 2 b) x_1)))), 10979#(and (or (not (< (+ i_1 1) b)) (<= (+ (* i_1 4) x_2 8) (+ x_1 (* b 4) (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ (* 3 i_2) x_1) (+ x_2 a)))), 10974#(and (or (< (+ 3 i_2) a) (not (< (+ 2 i_2) a)) (< (+ x_2 (* 3 b)) (+ x_1 1))) (or (< (+ 3 i_2) a) (<= x_1 (+ x_2 (* 3 b))) (not (< (+ 2 i_2) a)))), 10980#(and (or (<= (+ (* 3 i_2) 3 x_1) (+ x_2 b a)) (not (< (+ i_1 1) b))) (or (not (< (+ i_1 1) b)) (<= (+ (* i_1 4) 5 x_2 a) (+ (* 3 i_2) x_1 (* 3 b)))))] [2022-03-15 20:47:46,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 20:47:46,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:46,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 20:47:46,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2266, Unknown=1, NotChecked=0, Total=2450 [2022-03-15 20:47:46,323 INFO L87 Difference]: Start difference. First operand 69 states and 157 transitions. Second operand has 32 states, 31 states have (on average 2.064516129032258) internal successors, (64), 31 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:22,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:48:22,473 INFO L93 Difference]: Finished difference Result 240 states and 402 transitions. [2022-03-15 20:48:22,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-15 20:48:22,473 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.064516129032258) internal successors, (64), 31 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:48:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:48:22,474 INFO L225 Difference]: With dead ends: 240 [2022-03-15 20:48:22,474 INFO L226 Difference]: Without dead ends: 222 [2022-03-15 20:48:22,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5102 ImplicationChecksByTransitivity, 45.6s TimeCoverageRelationStatistics Valid=2191, Invalid=15100, Unknown=1, NotChecked=0, Total=17292 [2022-03-15 20:48:22,475 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 549 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:48:22,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [549 Valid, 1 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 20:48:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-03-15 20:48:22,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 70. [2022-03-15 20:48:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.3333333333333335) internal successors, (161), 69 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 161 transitions. [2022-03-15 20:48:22,478 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 161 transitions. Word has length 15 [2022-03-15 20:48:22,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:48:22,478 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 161 transitions. [2022-03-15 20:48:22,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.064516129032258) internal successors, (64), 31 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:22,478 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 161 transitions. [2022-03-15 20:48:22,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:48:22,478 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:48:22,478 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:48:22,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 20:48:22,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:48:22,695 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:48:22,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:48:22,695 INFO L85 PathProgramCache]: Analyzing trace with hash 999002072, now seen corresponding path program 20 times [2022-03-15 20:48:22,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:48:22,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975835210] [2022-03-15 20:48:22,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:48:22,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:48:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:48:23,251 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:23,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:48:23,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975835210] [2022-03-15 20:48:23,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975835210] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:48:23,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443130625] [2022-03-15 20:48:23,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:48:23,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:48:23,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:48:23,253 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:48:23,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 20:48:23,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:48:23,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:48:23,276 WARN L261 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 20:48:23,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:48:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:24,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:48:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:28,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443130625] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:48:28,576 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:48:28,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-03-15 20:48:28,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [3861346] [2022-03-15 20:48:28,576 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:48:28,576 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:48:28,579 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 69 transitions. [2022-03-15 20:48:28,579 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:48:36,212 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [11647#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 11662#(and (or (not (< i_1 b)) (<= (+ x_1 (* 2 i_2) 8) (+ x_2 a (* b 4)))) (or (not (< i_1 b)) (<= (+ (* 5 i_1) x_2 a) (+ 3 x_1 b (* 2 i_2))))), 11663#(and (or (<= (+ x_1 (* 2 i_2) 8) (+ x_2 (* b 4))) (not (< (+ i_1 1) b))) (or (not (< (+ i_1 1) b)) (<= (+ (* 5 i_1) 2 x_2) (+ x_1 b (* 2 i_2))))), 11650#(and (or (< (+ x_2 (* b 4)) (+ x_1 1)) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a)) (or (<= x_1 (+ x_2 (* b 4))) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a))), 11659#(and (or (<= (+ 6 x_1 (* 2 i_2)) (+ x_2 a (* 3 b))) (not (< i_1 b))) (or (<= (+ (* 5 i_1) x_2 a) (+ (* 2 b) x_1 (* 2 i_2) 1)) (not (< i_1 b)))), 11658#(and (or (not (< i_1 b)) (<= (+ x_1 (* 2 i_2) 4) (+ (* 2 b) x_2 a))) (or (not (< i_1 b)) (<= (+ (* 5 i_1) x_2 a 1) (+ x_1 (* 2 i_2) (* 3 b))))), 11656#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 5 i_1) x_2 10) (+ x_1 (* 5 b) (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ x_1 (* 2 i_2)) x_2))), 11661#(and (or (not (< (+ i_1 1) b)) (<= (+ 6 x_1 (* 2 i_2)) (+ x_2 (* 3 b)))) (or (not (< (+ i_1 1) b)) (<= (+ (* 5 i_1) x_2 4) (+ (* 2 b) x_1 (* 2 i_2))))), 11654#(and (or (<= (+ 2 x_1 (* 2 i_2)) (+ x_2 b a)) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* 5 i_1) 3 x_2 a) (+ x_1 (* 2 i_2) (* b 4))))), 11652#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ (* 5 i_1) 5 x_2) (+ x_1 a (* 5 b))) (not (< i_1 b)))), 11660#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 5 i_1) 6 x_2) (+ x_1 (* 2 i_2) (* 3 b)))) (or (not (< (+ i_1 1) b)) (<= (+ x_1 (* 2 i_2) 4) (+ (* 2 b) x_2)))), 11653#(and (or (<= (+ (* 5 i_1) 5 x_2) (+ x_1 a (* 5 b))) (not (< i_1 b))) (or (<= (+ x_1 (* 2 i_2)) (+ x_2 a)) (<= (+ x_1 a) x_2) (not (< i_1 b)))), 11646#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 11649#(and (or (< (+ 3 i_2) a) (not (< (+ 2 i_2) a)) (< (+ x_2 (* 3 b)) (+ x_1 1))) (or (< (+ 3 i_2) a) (<= x_1 (+ x_2 (* 3 b))) (not (< (+ 2 i_2) a)))), 11651#(and (or (< (+ 5 i_2) a) (<= x_1 (+ x_2 (* 5 b))) (not (< (+ i_2 4) a))) (or (< (+ 5 i_2) a) (< (+ x_2 (* 5 b)) (+ x_1 1)) (not (< (+ i_2 4) a)))), 11648#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 11655#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 5 i_1) x_2 10) (+ x_1 (* 5 b) (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 11657#(and (or (not (< (+ i_1 1) b)) (<= (+ 2 x_1 (* 2 i_2)) (+ x_2 b))) (or (<= (+ (* 5 i_1) x_2 8) (+ x_1 (* 2 i_2) (* b 4))) (not (< (+ i_1 1) b))))] [2022-03-15 20:48:36,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 20:48:36,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:48:36,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 20:48:36,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2068, Unknown=1, NotChecked=0, Total=2256 [2022-03-15 20:48:36,213 INFO L87 Difference]: Start difference. First operand 70 states and 161 transitions. Second operand has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 29 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:08,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:49:08,021 INFO L93 Difference]: Finished difference Result 244 states and 405 transitions. [2022-03-15 20:49:08,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-15 20:49:08,021 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 29 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:49:08,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:49:08,022 INFO L225 Difference]: With dead ends: 244 [2022-03-15 20:49:08,022 INFO L226 Difference]: Without dead ends: 223 [2022-03-15 20:49:08,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4741 ImplicationChecksByTransitivity, 41.0s TimeCoverageRelationStatistics Valid=2256, Invalid=13745, Unknown=1, NotChecked=0, Total=16002 [2022-03-15 20:49:08,027 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 515 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:49:08,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [515 Valid, 1 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 20:49:08,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-03-15 20:49:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 70. [2022-03-15 20:49:08,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.3333333333333335) internal successors, (161), 69 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 161 transitions. [2022-03-15 20:49:08,029 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 161 transitions. Word has length 15 [2022-03-15 20:49:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:49:08,029 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 161 transitions. [2022-03-15 20:49:08,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 29 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:08,029 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 161 transitions. [2022-03-15 20:49:08,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:49:08,030 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:49:08,030 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:49:08,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 20:49:08,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-03-15 20:49:08,236 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:49:08,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:49:08,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1700066650, now seen corresponding path program 21 times [2022-03-15 20:49:08,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:49:08,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189586338] [2022-03-15 20:49:08,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:49:08,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:49:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:49:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:08,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:49:08,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189586338] [2022-03-15 20:49:08,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189586338] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:49:08,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244380106] [2022-03-15 20:49:08,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:49:08,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:49:08,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:49:08,744 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:49:08,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 20:49:08,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 20:49:08,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:49:08,769 WARN L261 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 20:49:08,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:49:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:09,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:49:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:11,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244380106] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:49:11,043 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:49:11,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-03-15 20:49:11,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [849630185] [2022-03-15 20:49:11,043 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:49:11,043 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:49:11,046 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 61 transitions. [2022-03-15 20:49:11,046 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:49:13,923 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [12323#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 12333#(and (or (not (< i_1 b)) (<= (+ (* 6 i_1) 2 x_2) (+ (* 2 b) i_2 x_1))) (or (not (< i_1 b)) (<= (+ i_2 x_1 4) (+ x_2 (* b 4))))), 12331#(and (or (<= (+ 2 i_2 x_1) (+ (* 2 b) x_2)) (not (< i_1 b))) (or (<= (+ (* 6 i_1) x_2 4) (+ i_2 x_1 (* b 4))) (not (< i_1 b)))), 12329#(and (or (<= (+ i_2 x_1) x_2) (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ (* 6 i_1) 6 x_2) (+ x_1 a (* 6 b))) (not (< i_1 b)))), 12324#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 12322#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ (* 6 i_1) 6 x_2) (+ x_1 a (* 6 b))) (not (< i_1 b)))), 12330#(and (or (not (< i_1 b)) (<= (+ i_2 x_1 1) (+ x_2 b))) (or (not (< i_1 b)) (<= (+ (* 6 i_1) 5 x_2) (+ i_2 x_1 (* 5 b))))), 12325#(and (or (< (+ 3 i_2) a) (not (< (+ 2 i_2) a)) (< (+ x_2 (* 3 b)) (+ x_1 1))) (or (< (+ 3 i_2) a) (<= x_1 (+ x_2 (* 3 b))) (not (< (+ 2 i_2) a)))), 12321#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 12327#(and (or (< (+ 5 i_2) a) (<= x_1 (+ x_2 (* 5 b))) (not (< (+ i_2 4) a))) (or (< (+ 5 i_2) a) (< (+ x_2 (* 5 b)) (+ x_1 1)) (not (< (+ i_2 4) a)))), 12328#(and (or (< (+ x_2 (* 6 b)) (+ x_1 1)) (not (< (+ 5 i_2) a)) (< (+ 6 i_2) a)) (or (not (< (+ 5 i_2) a)) (<= x_1 (+ x_2 (* 6 b))) (< (+ 6 i_2) a))), 12334#(and (or (<= (+ 5 i_2 x_1) (+ x_2 (* 5 b))) (not (< i_1 b))) (or (<= (+ (* 6 i_1) x_2 1) (+ i_2 x_1 b)) (not (< i_1 b)))), 12332#(and (or (not (< i_1 b)) (<= (+ (* 6 i_1) 3 x_2) (+ i_2 x_1 (* 3 b)))) (or (<= (+ 3 i_2 x_1) (+ x_2 (* 3 b))) (not (< i_1 b)))), 12326#(and (or (< (+ x_2 (* b 4)) (+ x_1 1)) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a)) (or (<= x_1 (+ x_2 (* b 4))) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a)))] [2022-03-15 20:49:13,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 20:49:13,923 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:49:13,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 20:49:13,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1781, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 20:49:13,924 INFO L87 Difference]: Start difference. First operand 70 states and 161 transitions. Second operand has 26 states, 25 states have (on average 2.08) internal successors, (52), 25 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 20:49:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:49:34,125 INFO L93 Difference]: Finished difference Result 239 states and 396 transitions. [2022-03-15 20:49:34,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 20:49:34,125 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 25 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 15 [2022-03-15 20:49:34,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:49:34,126 INFO L225 Difference]: With dead ends: 239 [2022-03-15 20:49:34,126 INFO L226 Difference]: Without dead ends: 215 [2022-03-15 20:49:34,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2840 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=1698, Invalid=8808, Unknown=0, NotChecked=0, Total=10506 [2022-03-15 20:49:34,127 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 466 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:49:34,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [466 Valid, 1 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:49:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-03-15 20:49:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 73. [2022-03-15 20:49:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 2.2916666666666665) internal successors, (165), 72 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 165 transitions. [2022-03-15 20:49:34,129 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 165 transitions. Word has length 15 [2022-03-15 20:49:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:49:34,129 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 165 transitions. [2022-03-15 20:49:34,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 25 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 20:49:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 165 transitions. [2022-03-15 20:49:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:49:34,129 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:49:34,129 INFO L514 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:49:34,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 20:49:34,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-03-15 20:49:34,330 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:49:34,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:49:34,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1958232088, now seen corresponding path program 7 times [2022-03-15 20:49:34,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:49:34,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178619418] [2022-03-15 20:49:34,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:49:34,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:49:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:49:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:34,792 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:49:34,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178619418] [2022-03-15 20:49:34,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178619418] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:49:34,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647078229] [2022-03-15 20:49:34,792 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:49:34,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:49:34,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:49:34,793 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:49:34,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 20:49:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:49:34,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 20:49:34,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:49:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:35,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:49:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:36,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647078229] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:49:36,163 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:49:36,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 20:49:36,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [876369518] [2022-03-15 20:49:36,163 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:49:36,164 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:49:36,166 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 49 transitions. [2022-03-15 20:49:36,166 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:49:37,448 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [12949#(and (< 0 (+ (* 2 b) x_2 1)) (<= (+ (* 2 b) x_2) 0) (= (+ (* 2 b) x_2) x_1)), 12953#(and (<= (+ x_2 (* 6 b)) 0) (= (+ x_2 (* 6 b)) x_1) (< 0 (+ x_2 (* 6 b) 1))), 12952#(and (< 0 (+ x_2 (* 5 b) 1)) (= (+ x_2 (* 5 b)) x_1) (<= (+ x_2 (* 5 b)) 0)), 12948#(and (< 0 (+ x_2 b 1)) (= (+ x_2 b) x_1) (<= (+ x_2 b) 0)), 12954#(and (= x_1 (+ x_2 (* 7 b))) (< 0 (+ x_2 (* 7 b) 1)) (<= (+ x_2 (* 7 b)) 0)), 12950#(and (<= (+ x_2 (* 3 b)) 0) (= (+ x_2 (* 3 b)) x_1) (< 0 (+ x_2 (* 3 b) 1))), 12951#(and (<= (+ x_2 (* b 4)) 0) (< 0 (+ x_2 (* b 4) 1)) (= (+ x_2 (* b 4)) x_1))] [2022-03-15 20:49:37,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 20:49:37,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:49:37,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 20:49:37,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=980, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 20:49:37,449 INFO L87 Difference]: Start difference. First operand 73 states and 165 transitions. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:49:38,557 INFO L93 Difference]: Finished difference Result 92 states and 193 transitions. [2022-03-15 20:49:38,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 20:49:38,557 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:49:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:49:38,558 INFO L225 Difference]: With dead ends: 92 [2022-03-15 20:49:38,558 INFO L226 Difference]: Without dead ends: 82 [2022-03-15 20:49:38,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=359, Invalid=1363, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:49:38,558 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 64 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:49:38,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 1 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:49:38,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-03-15 20:49:38,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2022-03-15 20:49:38,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 2.2777777777777777) internal successors, (164), 72 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 164 transitions. [2022-03-15 20:49:38,560 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 164 transitions. Word has length 15 [2022-03-15 20:49:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:49:38,560 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 164 transitions. [2022-03-15 20:49:38,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:38,560 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 164 transitions. [2022-03-15 20:49:38,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:49:38,560 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:49:38,560 INFO L514 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:49:38,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 20:49:38,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 20:49:38,777 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:49:38,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:49:38,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1052026564, now seen corresponding path program 8 times [2022-03-15 20:49:38,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:49:38,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587295629] [2022-03-15 20:49:38,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:49:38,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:49:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:49:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:39,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:49:39,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587295629] [2022-03-15 20:49:39,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587295629] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:49:39,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378058312] [2022-03-15 20:49:39,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:49:39,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:49:39,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:49:39,406 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:49:39,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 20:49:39,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:49:39,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:49:39,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 20:49:39,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:49:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:40,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:49:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:41,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378058312] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:49:41,217 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:49:41,217 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-03-15 20:49:41,217 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1810180603] [2022-03-15 20:49:41,217 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:49:41,218 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:49:41,220 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 54 transitions. [2022-03-15 20:49:41,220 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:49:43,044 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [13328#(and (or (< 0 (+ x_1 1)) (< i_2 a)) (or (= x_2 x_1) (< i_2 a)) (or (< i_2 a) (<= x_1 0))), 13335#(and (= x_2 0) (<= (+ (* a 8) x_1) 0) (<= 0 (+ (* a 8) x_1))), 13334#(and (= x_2 0) (<= 0 (+ x_1 (* 7 a))) (<= (+ x_1 (* 7 a)) 0)), 13330#(and (<= (+ x_1 (* 3 a)) 0) (= x_2 0) (<= 0 (+ x_1 (* 3 a)))), 13331#(and (<= 0 (+ x_1 (* a 4))) (= x_2 0) (<= (+ x_1 (* a 4)) 0)), 13333#(and (<= (+ (* 6 a) x_1) 0) (= x_2 0) (<= 0 (+ (* 6 a) x_1))), 13329#(and (<= (+ x_1 (* 2 a)) 0) (= x_2 0) (<= 0 (+ x_1 (* 2 a)))), 13332#(and (= x_2 0) (<= 0 (+ x_1 (* 5 a))) (<= (+ x_1 (* 5 a)) 0))] [2022-03-15 20:49:43,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:49:43,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:49:43,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:49:43,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1220, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 20:49:43,046 INFO L87 Difference]: Start difference. First operand 73 states and 164 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:49:44,554 INFO L93 Difference]: Finished difference Result 102 states and 211 transitions. [2022-03-15 20:49:44,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 20:49:44,554 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:49:44,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:49:44,555 INFO L225 Difference]: With dead ends: 102 [2022-03-15 20:49:44,555 INFO L226 Difference]: Without dead ends: 94 [2022-03-15 20:49:44,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=421, Invalid=1649, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 20:49:44,555 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 99 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:49:44,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 1 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:49:44,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-03-15 20:49:44,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2022-03-15 20:49:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 2.2972972972972974) internal successors, (170), 74 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 170 transitions. [2022-03-15 20:49:44,557 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 170 transitions. Word has length 16 [2022-03-15 20:49:44,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:49:44,558 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 170 transitions. [2022-03-15 20:49:44,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:44,558 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 170 transitions. [2022-03-15 20:49:44,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:49:44,558 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:49:44,558 INFO L514 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:49:44,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-03-15 20:49:44,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:49:44,759 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:49:44,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:49:44,760 INFO L85 PathProgramCache]: Analyzing trace with hash -967062632, now seen corresponding path program 22 times [2022-03-15 20:49:44,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:49:44,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688717003] [2022-03-15 20:49:44,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:49:44,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:49:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:49:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:45,763 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:49:45,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688717003] [2022-03-15 20:49:45,763 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688717003] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:49:45,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428426486] [2022-03-15 20:49:45,763 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:49:45,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:49:45,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:49:45,764 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:49:45,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 20:49:45,786 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:49:45,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:49:45,787 WARN L261 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 20:49:45,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:49:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:47,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:49:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:48,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428426486] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:49:48,361 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:49:48,361 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 20:49:48,361 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1203699443] [2022-03-15 20:49:48,361 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:49:48,362 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:49:48,365 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 68 transitions. [2022-03-15 20:49:48,365 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:49:51,812 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [13740#(and (or (<= (+ 7 i_1 x_2) (+ x_1 b (* 7 a))) (not (< (+ 6 i_1) b))) (or (not (< (+ 6 i_1) b)) (<= (+ (* 7 i_2) x_1) x_2) (<= (+ x_1 (* 7 a)) x_2))), 13739#(and (or (<= (+ 6 i_1 x_2) (+ (* 6 a) x_1 b)) (not (< (+ 5 i_1) b))) (or (<= (+ (* 7 i_2) x_1) (+ x_2 a)) (<= (+ (* 6 a) x_1) x_2) (not (< (+ 5 i_1) b)))), 13738#(and (or (<= (+ 7 i_1 x_2) (+ x_1 b (* 7 a))) (not (< (+ 6 i_1) b))) (or (not (< (+ 6 i_1) b)) (<= (+ x_1 (* 7 a)) x_2))), 13737#(and (or (<= (+ (* 6 a) x_1) x_2) (not (< (+ 5 i_1) b))) (or (<= (+ 6 i_1 x_2) (+ (* 6 a) x_1 b)) (not (< (+ 5 i_1) b)))), 13729#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ 3 i_1 x_2) (+ x_1 b (* 3 a))))), 13728#(and (or (not (< (+ i_1 1) b)) (<= (+ 2 i_1 x_2) (+ x_1 b (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 13726#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 13733#(and (or (not (< (+ i_1 1) b)) (<= (+ 2 i_1 x_2) (+ x_1 b (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ (* 7 i_2) x_1) (+ x_2 (* 5 a))))), 13735#(and (or (<= (+ i_1 x_2 4) (+ x_1 b (* a 4))) (not (< (+ 3 i_1) b))) (or (<= (+ (* 7 i_2) x_1) (+ x_2 (* 3 a))) (<= (+ x_1 (* a 4)) x_2) (not (< (+ 3 i_1) b)))), 13727#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ i_1 x_2 1) (+ x_1 b a)) (not (< i_1 b)))), 13736#(and (or (<= (+ 5 i_1 x_2) (+ x_1 b (* 5 a))) (not (< (+ i_1 4) b))) (or (not (< (+ i_1 4) b)) (<= (+ (* 7 i_2) x_1) (+ x_2 (* 2 a))) (<= (+ x_1 (* 5 a)) x_2))), 13725#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 13732#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b)) (<= (+ (* 7 i_2) x_1) (+ (* 6 a) x_2))) (or (<= (+ i_1 x_2 1) (+ x_1 b a)) (not (< i_1 b)))), 13731#(and (or (not (< (+ i_1 4) b)) (<= (+ x_1 (* 5 a)) x_2)) (or (<= (+ 5 i_1 x_2) (+ x_1 b (* 5 a))) (not (< (+ i_1 4) b)))), 13734#(and (or (not (< (+ 2 i_1) b)) (<= (+ 3 i_1 x_2) (+ x_1 b (* 3 a)))) (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2) (<= (+ (* 7 i_2) x_1) (+ x_2 (* a 4))))), 13730#(and (or (<= (+ x_1 (* a 4)) x_2) (not (< (+ 3 i_1) b))) (or (<= (+ i_1 x_2 4) (+ x_1 b (* a 4))) (not (< (+ 3 i_1) b))))] [2022-03-15 20:49:51,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 20:49:51,812 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:49:51,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 20:49:51,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2162, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 20:49:51,813 INFO L87 Difference]: Start difference. First operand 75 states and 170 transitions. Second operand has 29 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 28 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 20:50:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:08,881 INFO L93 Difference]: Finished difference Result 187 states and 340 transitions. [2022-03-15 20:50:08,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-15 20:50:08,881 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 28 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 16 [2022-03-15 20:50:08,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:08,882 INFO L225 Difference]: With dead ends: 187 [2022-03-15 20:50:08,882 INFO L226 Difference]: Without dead ends: 178 [2022-03-15 20:50:08,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2495 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=1123, Invalid=8189, Unknown=0, NotChecked=0, Total=9312 [2022-03-15 20:50:08,884 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 334 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:08,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 1 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 20:50:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-03-15 20:50:08,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 78. [2022-03-15 20:50:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 2.324675324675325) internal successors, (179), 77 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 179 transitions. [2022-03-15 20:50:08,886 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 179 transitions. Word has length 16 [2022-03-15 20:50:08,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:08,887 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 179 transitions. [2022-03-15 20:50:08,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 28 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 20:50:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 179 transitions. [2022-03-15 20:50:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:50:08,887 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:08,887 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:08,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-03-15 20:50:09,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 20:50:09,107 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:09,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:09,108 INFO L85 PathProgramCache]: Analyzing trace with hash 807944730, now seen corresponding path program 23 times [2022-03-15 20:50:09,110 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:09,110 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158725221] [2022-03-15 20:50:09,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:09,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:09,768 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:09,768 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:09,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158725221] [2022-03-15 20:50:09,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158725221] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:09,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292562790] [2022-03-15 20:50:09,768 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:50:09,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:09,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:09,770 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:50:09,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 20:50:09,794 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:50:09,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:09,794 WARN L261 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 20:50:09,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:10,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:13,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292562790] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:13,369 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:13,369 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 20:50:13,369 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [466883673] [2022-03-15 20:50:13,369 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:13,370 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:13,373 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 78 transitions. [2022-03-15 20:50:13,373 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:17,735 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [14310#(and (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ (* 6 i_2) x_1) (+ x_2 (* a 4)))) (or (not (< (+ i_1 1) b)) (<= (+ (* 2 i_1) x_2 4) (+ (* 2 b) x_1 (* 2 a))))), 14313#(and (or (<= (+ (* 2 i_1) x_2 (* a 4)) (+ 2 (* 6 i_2) x_1 b)) (not (< (+ i_1 1) b))) (or (not (< (+ i_1 1) b)) (<= (+ (* 6 i_2) 6 x_1) (+ x_2 b (* a 4))))), 14314#(and (or (<= (+ x_1 (* a 4)) x_2) (not (< (+ 3 i_1) b))) (or (<= (+ (* 2 i_1) x_2 8) (+ (* 2 b) x_1 (* a 4))) (not (< (+ 3 i_1) b)))), 14322#(and (or (<= (+ (* 2 i_1) x_2 12) (+ (* 2 b) (* 6 a) x_1)) (not (< (+ 5 i_1) b))) (or (<= (+ (* 6 i_2) x_1) x_2) (<= (+ (* 6 a) x_1) x_2) (not (< (+ 5 i_1) b)))), 14309#(and (or (not (< i_1 b)) (<= (+ (* 2 i_1) 2 x_2) (+ (* 2 b) x_1 a))) (or (<= (+ x_1 a) x_2) (not (< i_1 b)) (<= (+ (* 6 i_2) x_1) (+ x_2 (* 5 a))))), 14323#(and (or (<= (+ (* 6 i_2) 6 x_1) (+ x_2 b)) (not (< (+ 5 i_1) b))) (or (<= (+ (* 2 i_1) 6 x_2) (+ (* 6 i_2) x_1 b)) (not (< (+ 5 i_1) b)))), 14318#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 2 i_1) x_2 (* 3 a)) (+ (* 6 i_2) x_1 b))) (or (not (< (+ 2 i_1) b)) (<= (+ (* 6 i_2) 6 x_1) (+ x_2 b (* 3 a))))), 14306#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* 2 i_1) 2 x_2) (+ (* 2 b) x_1 a)))), 14307#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 2 i_1) x_2 4) (+ (* 2 b) x_1 (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 14308#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ (* 2 i_1) 6 x_2) (+ (* 2 b) x_1 (* 3 a))))), 14316#(and (or (<= (+ x_1 (* a 4)) x_2) (<= (+ (* 6 i_2) x_1) (+ x_2 (* 2 a))) (not (< (+ 3 i_1) b))) (or (<= (+ (* 2 i_1) x_2 8) (+ (* 2 b) x_1 (* a 4))) (not (< (+ 3 i_1) b)))), 14321#(and (or (<= (+ (* 2 i_1) x_2 12) (+ (* 2 b) (* 6 a) x_1)) (not (< (+ 5 i_1) b))) (or (<= (+ (* 6 a) x_1) x_2) (not (< (+ 5 i_1) b)))), 14303#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 14315#(and (or (not (< (+ i_1 4) b)) (<= (+ x_1 (* 5 a)) x_2)) (or (not (< (+ i_1 4) b)) (<= (+ (* 2 i_1) x_2 10) (+ (* 2 b) x_1 (* 5 a))))), 14320#(and (or (not (< (+ i_1 4) b)) (<= (+ (* 6 i_2) 6 x_1) (+ x_2 b a))) (or (not (< (+ i_1 4) b)) (<= (+ (* 2 i_1) x_2 a 4) (+ (* 6 i_2) x_1 b)))), 14305#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 14312#(and (or (not (< i_1 b)) (<= (+ (* 2 i_1) x_2 (* 5 a)) (+ (* 6 i_2) x_1 b 4))) (or (not (< i_1 b)) (<= (+ (* 6 i_2) 6 x_1) (+ x_2 b (* 5 a))))), 14311#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 6 i_2) x_1) (+ x_2 (* 3 a))) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ (* 2 i_1) 6 x_2) (+ (* 2 b) x_1 (* 3 a))))), 14319#(and (or (<= (+ (* 6 i_2) 6 x_1) (+ x_2 b (* 2 a))) (not (< (+ 3 i_1) b))) (or (<= (+ (* 2 i_1) 2 x_2 (* 2 a)) (+ (* 6 i_2) x_1 b)) (not (< (+ 3 i_1) b)))), 14304#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 14317#(and (or (not (< (+ i_1 4) b)) (<= (+ (* 2 i_1) x_2 10) (+ (* 2 b) x_1 (* 5 a)))) (or (<= (+ (* 6 i_2) x_1) (+ x_2 a)) (not (< (+ i_1 4) b)) (<= (+ x_1 (* 5 a)) x_2)))] [2022-03-15 20:50:17,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 20:50:17,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:17,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 20:50:17,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2664, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 20:50:17,736 INFO L87 Difference]: Start difference. First operand 78 states and 179 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:50:44,151 INFO L93 Difference]: Finished difference Result 222 states and 390 transitions. [2022-03-15 20:50:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-15 20:50:44,152 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:50:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:50:44,153 INFO L225 Difference]: With dead ends: 222 [2022-03-15 20:50:44,153 INFO L226 Difference]: Without dead ends: 210 [2022-03-15 20:50:44,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4423 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=1668, Invalid=14334, Unknown=0, NotChecked=0, Total=16002 [2022-03-15 20:50:44,154 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 494 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 1899 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:50:44,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 1 Invalid, 2085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1899 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-03-15 20:50:44,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-03-15 20:50:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 79. [2022-03-15 20:50:44,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 2.3461538461538463) internal successors, (183), 78 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 183 transitions. [2022-03-15 20:50:44,156 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 183 transitions. Word has length 16 [2022-03-15 20:50:44,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:50:44,156 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 183 transitions. [2022-03-15 20:50:44,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:50:44,156 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 183 transitions. [2022-03-15 20:50:44,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:50:44,156 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:50:44,156 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:50:44,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 20:50:44,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 20:50:44,373 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:50:44,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:50:44,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1401896, now seen corresponding path program 24 times [2022-03-15 20:50:44,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:50:44,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805482809] [2022-03-15 20:50:44,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:50:44,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:50:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:50:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:44,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:50:44,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805482809] [2022-03-15 20:50:44,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805482809] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:50:44,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207934775] [2022-03-15 20:50:44,956 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:50:44,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:50:44,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:50:44,957 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:50:44,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 20:50:44,982 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:50:44,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:50:44,982 WARN L261 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 20:50:44,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:50:46,085 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:46,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:50:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:50:49,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207934775] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:50:49,734 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:50:49,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 20:50:49,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [768497118] [2022-03-15 20:50:49,734 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:50:49,735 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:50:49,738 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 84 transitions. [2022-03-15 20:50:49,738 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:50:54,862 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [14974#(and (or (<= (+ 3 x_2 (* 3 i_1)) (+ x_1 a (* 3 b))) (not (< i_1 b))) (or (<= (+ x_1 (* 5 i_2)) (+ x_2 (* a 4))) (<= (+ x_1 a) x_2) (not (< i_1 b)))), 14978#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 14981#(and (or (not (< (+ i_1 1) b)) (<= (+ 6 x_2 (* 3 i_1)) (+ x_1 (* 3 b) (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 14996#(and (or (<= (+ x_1 10 (* 5 i_2)) (+ (* 2 b) x_2)) (not (< (+ i_1 4) b))) (or (not (< (+ i_1 4) b)) (<= (+ 5 x_2 (* 3 i_1)) (+ x_1 b (* 5 i_2))))), 14990#(and (or (not (< (+ 2 i_1) b)) (<= (+ 5 x_1 (* 5 i_2)) (+ x_2 b (* 2 a)))) (or (not (< (+ 2 i_1) b)) (<= (+ x_2 (* 3 i_1) 4 (* 2 a)) (+ (* 2 b) x_1 (* 5 i_2))))), 14982#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ 9 x_2 (* 3 i_1)) (+ x_1 (* 3 b) (* 3 a))))), 14985#(and (or (<= (+ x_1 (* a 4)) x_2) (not (< (+ 3 i_1) b))) (or (not (< (+ 3 i_1) b)) (<= (+ x_2 (* 3 i_1) 12) (+ x_1 (* a 4) (* 3 b))))), 14984#(and (or (not (< (+ 2 i_1) b)) (<= (+ 9 x_2 (* 3 i_1)) (+ x_1 (* 3 b) (* 3 a)))) (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 5 i_2)) (+ x_2 (* 2 a))) (<= (+ x_1 (* 3 a)) x_2))), 14994#(and (or (<= (+ 2 x_2 a (* 3 i_1)) (+ x_1 b (* 5 i_2))) (not (< (+ 3 i_1) b))) (or (<= (+ x_1 10 (* 5 i_2)) (+ (* 2 b) x_2 a)) (not (< (+ 3 i_1) b)))), 14988#(and (or (not (< (+ i_1 4) b)) (<= (+ x_2 15 (* 3 i_1)) (+ x_1 (* 3 b) (* 5 a)))) (or (not (< (+ i_1 4) b)) (<= (+ x_1 (* 5 i_2)) x_2) (<= (+ x_1 (* 5 a)) x_2))), 14980#(and (or (< (+ 3 i_2) a) (not (< (+ 2 i_2) a)) (< (+ x_2 (* 3 b)) (+ x_1 1))) (or (< (+ 3 i_2) a) (<= x_1 (+ x_2 (* 3 b))) (not (< (+ 2 i_2) a)))), 14991#(and (or (<= (+ 5 x_1 (* 5 i_2)) (+ x_2 b a)) (not (< (+ 3 i_1) b))) (or (<= (+ 7 x_2 a (* 3 i_1)) (+ (* 2 b) x_1 (* 5 i_2))) (not (< (+ 3 i_1) b)))), 14976#(and (or (not (< i_1 b)) (<= (+ x_1 10 (* 5 i_2)) (+ (* 2 b) x_2 (* a 4)))) (or (<= (+ x_2 (* 3 i_1) (* a 4)) (+ 7 x_1 b (* 5 i_2))) (not (< i_1 b)))), 14987#(and (or (not (< (+ i_1 4) b)) (<= (+ x_1 (* 5 a)) x_2)) (or (not (< (+ i_1 4) b)) (<= (+ x_2 15 (* 3 i_1)) (+ x_1 (* 3 b) (* 5 a))))), 14977#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 14986#(and (or (not (< (+ 3 i_1) b)) (<= (+ x_2 (* 3 i_1) 12) (+ x_1 (* a 4) (* 3 b)))) (or (<= (+ x_1 (* 5 i_2)) (+ x_2 a)) (<= (+ x_1 (* a 4)) x_2) (not (< (+ 3 i_1) b)))), 14983#(and (or (not (< (+ i_1 1) b)) (<= (+ 6 x_2 (* 3 i_1)) (+ x_1 (* 3 b) (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (<= (+ x_1 (* 5 i_2)) (+ x_2 (* 3 a))) (not (< (+ i_1 1) b)))), 14979#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 14989#(and (or (<= (+ 5 x_1 (* 5 i_2)) (+ x_2 b (* 3 a))) (not (< (+ i_1 1) b))) (or (not (< (+ i_1 1) b)) (<= (+ x_2 (* 3 i_1) 1 (* 3 a)) (+ (* 2 b) x_1 (* 5 i_2))))), 14993#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_2 (* 3 i_1) (* 2 a)) (+ x_1 b (* 5 i_2) 1))) (or (not (< (+ 2 i_1) b)) (<= (+ x_1 10 (* 5 i_2)) (+ (* 2 b) x_2 (* 2 a))))), 14995#(and (or (not (< (+ i_1 4) b)) (<= (+ x_2 (* 3 i_1) 10) (+ (* 2 b) x_1 (* 5 i_2)))) (or (not (< (+ i_1 4) b)) (<= (+ 5 x_1 (* 5 i_2)) (+ x_2 b)))), 14975#(and (or (not (< i_1 b)) (<= (+ 5 x_1 (* 5 i_2)) (+ x_2 b (* a 4)))) (or (not (< i_1 b)) (<= (+ x_2 (* 3 i_1) (* a 4)) (+ (* 2 b) 2 x_1 (* 5 i_2))))), 14973#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ 3 x_2 (* 3 i_1)) (+ x_1 a (* 3 b))) (not (< i_1 b)))), 14992#(and (or (not (< (+ i_1 1) b)) (<= (+ x_1 10 (* 5 i_2)) (+ (* 2 b) x_2 (* 3 a)))) (or (not (< (+ i_1 1) b)) (<= (+ x_2 (* 3 i_1) (* 3 a)) (+ x_1 b 4 (* 5 i_2)))))] [2022-03-15 20:50:54,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 20:50:54,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:50:54,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 20:50:54,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2987, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 20:50:54,864 INFO L87 Difference]: Start difference. First operand 79 states and 183 transitions. Second operand has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:51:31,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:51:31,697 INFO L93 Difference]: Finished difference Result 257 states and 441 transitions. [2022-03-15 20:51:31,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-03-15 20:51:31,697 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:51:31,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:51:31,698 INFO L225 Difference]: With dead ends: 257 [2022-03-15 20:51:31,698 INFO L226 Difference]: Without dead ends: 242 [2022-03-15 20:51:31,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6292 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=2374, Invalid=19382, Unknown=0, NotChecked=0, Total=21756 [2022-03-15 20:51:31,699 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 626 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1788 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 1788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:51:31,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [626 Valid, 1 Invalid, 2086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 1788 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-03-15 20:51:31,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-03-15 20:51:31,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 80. [2022-03-15 20:51:31,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 2.367088607594937) internal successors, (187), 79 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:51:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 187 transitions. [2022-03-15 20:51:31,701 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 187 transitions. Word has length 16 [2022-03-15 20:51:31,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:51:31,701 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 187 transitions. [2022-03-15 20:51:31,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:51:31,701 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 187 transitions. [2022-03-15 20:51:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:51:31,702 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:51:31,702 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:51:31,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 20:51:31,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 20:51:31,902 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:51:31,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:51:31,903 INFO L85 PathProgramCache]: Analyzing trace with hash 678656474, now seen corresponding path program 25 times [2022-03-15 20:51:31,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:51:31,913 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746207844] [2022-03-15 20:51:31,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:51:31,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:51:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:51:32,535 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:51:32,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:51:32,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746207844] [2022-03-15 20:51:32,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746207844] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:51:32,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971465985] [2022-03-15 20:51:32,535 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:51:32,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:51:32,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:51:32,536 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:51:32,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 20:51:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:51:32,558 WARN L261 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 20:51:32,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:51:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:51:33,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:51:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:51:35,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971465985] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:51:35,504 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:51:35,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 20:51:35,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1112996245] [2022-03-15 20:51:35,505 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:51:35,505 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:51:35,509 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 86 transitions. [2022-03-15 20:51:35,509 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:51:41,303 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [15743#(and (or (< (+ x_2 (* b 4)) (+ x_1 1)) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a)) (or (<= x_1 (+ x_2 (* b 4))) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a))), 15724#(and (or (not (< (+ i_1 1) b)) (<= (+ (* i_1 4) x_2 4 (* 2 a)) (+ (* i_2 4) x_1 (* 3 b)))) (or (not (< (+ i_1 1) b)) (<= (+ (* i_2 4) x_1 4) (+ x_2 b (* 2 a))))), 15733#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* i_1 4) x_2 a) (+ (* i_2 4) x_1 b))) (or (not (< (+ 2 i_1) b)) (<= (+ (* i_2 4) x_1 12) (+ x_2 a (* 3 b))))), 15738#(and (or (not (< (+ 3 i_1) b)) (<= (+ (* i_2 4) x_1 12) (+ x_2 (* 3 b)))) (or (<= (+ (* i_1 4) x_2 4) (+ (* i_2 4) x_1 b)) (not (< (+ 3 i_1) b)))), 15730#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* i_2 4) x_1 8) (+ (* 2 b) x_2 a))) (or (not (< (+ 2 i_1) b)) (<= (+ (* i_1 4) x_2 a 4) (+ (* 2 b) (* i_2 4) x_1)))), 15720#(and (or (not (< (+ i_1 1) b)) (<= (+ (* i_1 4) x_2 8) (+ x_1 (* b 4) (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 15741#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 15725#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ (* i_1 4) x_2 12) (+ x_1 (* b 4) (* 3 a))))), 15739#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 15731#(and (or (not (< i_1 b)) (<= (+ (* i_2 4) x_1 12) (+ x_2 (* 3 b) (* 3 a)))) (or (not (< i_1 b)) (<= (+ (* i_1 4) x_2 (* 3 a)) (+ (* i_2 4) x_1 b 8)))), 15728#(and (or (<= (+ (* i_1 4) x_2 (* 3 a)) (+ (* 2 b) (* i_2 4) x_1 4)) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* i_2 4) x_1 8) (+ (* 2 b) x_2 (* 3 a))))), 15722#(and (or (not (< (+ i_1 1) b)) (<= (+ (* i_1 4) x_2 8) (+ x_1 (* b 4) (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ (* i_2 4) x_1) (+ x_2 (* 2 a))))), 15721#(and (or (not (< i_1 b)) (<= (+ (* i_1 4) x_2 4) (+ x_1 a (* b 4)))) (or (<= (+ (* i_2 4) x_1) (+ x_2 (* 3 a))) (<= (+ x_1 a) x_2) (not (< i_1 b)))), 15736#(and (or (not (< (+ 3 i_1) b)) (<= (+ (* i_2 4) x_1 4) (+ x_2 b))) (or (<= (+ (* i_1 4) x_2 12) (+ (* i_2 4) x_1 (* 3 b))) (not (< (+ 3 i_1) b)))), 15734#(and (or (<= (+ x_1 (* a 4)) x_2) (not (< (+ 3 i_1) b))) (or (not (< (+ 3 i_1) b)) (<= (+ (* i_1 4) 16 x_2) (+ x_1 (* b 4) (* a 4))))), 15727#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* i_2 4) x_1 4) (+ x_2 b a))) (or (not (< (+ 2 i_1) b)) (<= (+ (* i_1 4) x_2 a 8) (+ (* i_2 4) x_1 (* 3 b))))), 15732#(and (or (not (< (+ i_1 1) b)) (<= (+ (* i_2 4) x_1 12) (+ x_2 (* 3 b) (* 2 a)))) (or (not (< (+ i_1 1) b)) (<= (+ (* i_1 4) x_2 (* 2 a)) (+ (* i_2 4) x_1 b 4)))), 15740#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 15726#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* i_2 4) x_1) (+ x_2 a)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ (* i_1 4) x_2 12) (+ x_1 (* b 4) (* 3 a))))), 15742#(and (or (< (+ 3 i_2) a) (not (< (+ 2 i_2) a)) (< (+ x_2 (* 3 b)) (+ x_1 1))) (or (< (+ 3 i_2) a) (<= x_1 (+ x_2 (* 3 b))) (not (< (+ 2 i_2) a)))), 15737#(and (or (<= (+ (* i_2 4) x_1 8) (+ (* 2 b) x_2)) (not (< (+ 3 i_1) b))) (or (not (< (+ 3 i_1) b)) (<= (+ (* i_1 4) x_2 8) (+ (* 2 b) (* i_2 4) x_1)))), 15719#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* i_1 4) x_2 4) (+ x_1 a (* b 4))))), 15735#(and (or (not (< (+ 3 i_1) b)) (<= (+ (* i_1 4) 16 x_2) (+ x_1 (* b 4) (* a 4)))) (or (<= (+ x_1 (* a 4)) x_2) (<= (+ (* i_2 4) x_1) x_2) (not (< (+ 3 i_1) b)))), 15723#(and (or (<= (+ (* i_1 4) x_2 (* 3 a)) (+ (* i_2 4) x_1 (* 3 b))) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* i_2 4) x_1 4) (+ x_2 b (* 3 a))))), 15729#(and (or (not (< (+ i_1 1) b)) (<= (+ (* i_1 4) x_2 (* 2 a)) (+ (* 2 b) (* i_2 4) x_1))) (or (not (< (+ i_1 1) b)) (<= (+ (* i_2 4) x_1 8) (+ (* 2 b) x_2 (* 2 a)))))] [2022-03-15 20:51:41,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 20:51:41,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:51:41,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 20:51:41,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=3134, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 20:51:41,304 INFO L87 Difference]: Start difference. First operand 80 states and 187 transitions. Second operand has 38 states, 37 states have (on average 2.054054054054054) internal successors, (76), 37 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:52:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:52:25,250 INFO L93 Difference]: Finished difference Result 271 states and 457 transitions. [2022-03-15 20:52:25,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-03-15 20:52:25,251 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.054054054054054) internal successors, (76), 37 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:52:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:52:25,252 INFO L225 Difference]: With dead ends: 271 [2022-03-15 20:52:25,252 INFO L226 Difference]: Without dead ends: 253 [2022-03-15 20:52:25,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6585 ImplicationChecksByTransitivity, 47.2s TimeCoverageRelationStatistics Valid=2647, Invalid=20305, Unknown=0, NotChecked=0, Total=22952 [2022-03-15 20:52:25,253 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 679 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:52:25,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [679 Valid, 1 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-03-15 20:52:25,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-03-15 20:52:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 81. [2022-03-15 20:52:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 2.3875) internal successors, (191), 80 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:52:25,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 191 transitions. [2022-03-15 20:52:25,255 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 191 transitions. Word has length 16 [2022-03-15 20:52:25,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:52:25,255 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 191 transitions. [2022-03-15 20:52:25,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.054054054054054) internal successors, (76), 37 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:52:25,255 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 191 transitions. [2022-03-15 20:52:25,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:52:25,255 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:52:25,256 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:52:25,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-15 20:52:25,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-03-15 20:52:25,462 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:52:25,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:52:25,462 INFO L85 PathProgramCache]: Analyzing trace with hash 285629464, now seen corresponding path program 26 times [2022-03-15 20:52:25,466 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:52:25,466 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716433403] [2022-03-15 20:52:25,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:52:25,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:52:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:52:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:52:26,077 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:52:26,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716433403] [2022-03-15 20:52:26,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716433403] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:52:26,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807894249] [2022-03-15 20:52:26,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:52:26,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:52:26,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:52:26,078 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:52:26,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 20:52:26,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:52:26,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:52:26,102 WARN L261 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 20:52:26,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:52:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:52:27,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:52:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:52:36,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807894249] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:52:36,312 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:52:36,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 20:52:36,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1432252550] [2022-03-15 20:52:36,312 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:52:36,313 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:52:36,317 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 84 transitions. [2022-03-15 20:52:36,317 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:52:44,470 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [16501#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 5 i_1) x_2 12) (+ (* 3 i_2) x_1 (* b 4)))) (or (not (< (+ 2 i_1) b)) (<= (+ (* 3 i_2) 3 x_1) (+ x_2 b)))), 16496#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 5 i_1) x_2 10) (+ x_1 (* 5 b) (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 16505#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 3 i_2) 9 x_1) (+ x_2 a (* 3 b)))) (or (not (< (+ i_1 1) b)) (<= (+ (* 5 i_1) x_2 a 1) (+ (* 3 i_2) (* 2 b) x_1)))), 16509#(and (or (< (+ 5 i_2) a) (<= x_1 (+ x_2 (* 5 b))) (not (< (+ i_2 4) a))) (or (< (+ 5 i_2) a) (< (+ x_2 (* 5 b)) (+ x_1 1)) (not (< (+ i_2 4) a)))), 16491#(and (or (< (+ 3 i_2) a) (not (< (+ 2 i_2) a)) (< (+ x_2 (* 3 b)) (+ x_1 1))) (or (< (+ 3 i_2) a) (<= x_1 (+ x_2 (* 3 b))) (not (< (+ 2 i_2) a)))), 16510#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 5 i_1) x_2 a) (+ (* 3 i_2) 2 x_1 b))) (or (not (< (+ i_1 1) b)) (<= (+ (* 3 i_2) x_1 12) (+ x_2 a (* b 4))))), 16494#(and (or (<= (+ (* 3 i_2) x_1) (+ x_2 (* 2 a))) (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ (* 5 i_1) 5 x_2) (+ x_1 a (* 5 b))) (not (< i_1 b)))), 16506#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 3 i_2) 6 x_1) (+ (* 2 b) x_2))) (or (not (< (+ 2 i_1) b)) (<= (+ (* 5 i_1) 9 x_2) (+ (* 3 i_2) x_1 (* 3 b))))), 16492#(and (or (< (+ x_2 (* b 4)) (+ x_1 1)) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a)) (or (<= x_1 (+ x_2 (* b 4))) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a))), 16497#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 5 i_1) x_2 10) (+ x_1 (* 5 b) (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ (* 3 i_2) x_1) (+ x_2 a)))), 16490#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 16498#(and (or (<= (+ (* 3 i_2) 3 x_1) (+ x_2 b a)) (not (< (+ i_1 1) b))) (or (<= (+ (* 5 i_1) 7 x_2 a) (+ (* 3 i_2) x_1 (* b 4))) (not (< (+ i_1 1) b)))), 16504#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 3 i_2) 6 x_1) (+ (* 2 b) x_2 a))) (or (<= (+ (* 5 i_1) x_2 a 4) (+ (* 3 i_2) x_1 (* 3 b))) (not (< (+ i_1 1) b)))), 16502#(and (or (<= (+ (* 3 i_2) 6 x_1) (+ (* 2 b) x_2 (* 2 a))) (not (< i_1 b))) (or (<= (+ (* 5 i_1) x_2 (* 2 a)) (+ (* 3 i_2) x_1 (* 3 b) 1)) (not (< i_1 b)))), 16508#(and (or (not (< i_1 b)) (<= (+ (* 3 i_2) x_1 12) (+ x_2 (* b 4) (* 2 a)))) (or (<= (+ (* 5 i_1) x_2 (* 2 a)) (+ (* 3 i_2) 7 x_1 b)) (not (< i_1 b)))), 16503#(and (or (not (< i_1 b)) (<= (+ (* 3 i_2) 9 x_1) (+ x_2 (* 3 b) (* 2 a)))) (or (<= (+ (* 5 i_1) x_2 (* 2 a)) (+ (* 3 i_2) (* 2 b) x_1 4)) (not (< i_1 b)))), 16495#(and (or (<= (+ (* 5 i_1) 2 x_2 (* 2 a)) (+ (* 3 i_2) x_1 (* b 4))) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* 3 i_2) 3 x_1) (+ x_2 b (* 2 a))))), 16489#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 16499#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ (* 5 i_1) x_2 15) (+ x_1 (* 5 b) (* 3 a))))), 16493#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ (* 5 i_1) 5 x_2) (+ x_1 a (* 5 b))) (not (< i_1 b)))), 16488#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 16507#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 5 i_1) 6 x_2) (+ (* 3 i_2) (* 2 b) x_1))) (or (not (< (+ 2 i_1) b)) (<= (+ (* 3 i_2) 9 x_1) (+ x_2 (* 3 b))))), 16511#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 3 i_2) x_1 12) (+ x_2 (* b 4)))) (or (not (< (+ 2 i_1) b)) (<= (+ (* 5 i_1) 3 x_2) (+ (* 3 i_2) x_1 b)))), 16500#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 3 i_2) x_1) x_2) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ (* 5 i_1) x_2 15) (+ x_1 (* 5 b) (* 3 a)))))] [2022-03-15 20:52:44,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 20:52:44,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:52:44,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 20:52:44,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2974, Unknown=2, NotChecked=0, Total=3192 [2022-03-15 20:52:44,471 INFO L87 Difference]: Start difference. First operand 81 states and 191 transitions. Second operand has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:53:30,780 INFO L93 Difference]: Finished difference Result 292 states and 490 transitions. [2022-03-15 20:53:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-03-15 20:53:30,780 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:53:30,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:53:30,781 INFO L225 Difference]: With dead ends: 292 [2022-03-15 20:53:30,781 INFO L226 Difference]: Without dead ends: 271 [2022-03-15 20:53:30,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7512 ImplicationChecksByTransitivity, 59.4s TimeCoverageRelationStatistics Valid=3121, Invalid=21683, Unknown=2, NotChecked=0, Total=24806 [2022-03-15 20:53:30,782 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 709 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:53:30,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [709 Valid, 1 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-03-15 20:53:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-03-15 20:53:30,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 82. [2022-03-15 20:53:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 2.4074074074074074) internal successors, (195), 81 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 195 transitions. [2022-03-15 20:53:30,784 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 195 transitions. Word has length 16 [2022-03-15 20:53:30,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:53:30,785 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 195 transitions. [2022-03-15 20:53:30,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:53:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 195 transitions. [2022-03-15 20:53:30,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:53:30,785 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:53:30,785 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:53:30,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-15 20:53:30,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:30,999 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:53:30,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:53:31,000 INFO L85 PathProgramCache]: Analyzing trace with hash 986694042, now seen corresponding path program 27 times [2022-03-15 20:53:31,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:53:31,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152998302] [2022-03-15 20:53:31,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:53:31,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:53:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:53:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:31,560 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:53:31,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152998302] [2022-03-15 20:53:31,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152998302] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:53:31,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611702740] [2022-03-15 20:53:31,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:53:31,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:53:31,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:53:31,561 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:53:31,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 20:53:31,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 20:53:31,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:53:31,585 WARN L261 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 20:53:31,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:53:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:32,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:53:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:53:36,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611702740] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:53:36,835 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:53:36,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 20:53:36,835 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2047923875] [2022-03-15 20:53:36,835 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:53:36,836 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:53:36,839 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 78 transitions. [2022-03-15 20:53:36,839 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:53:41,953 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [17311#(and (or (not (< (+ i_1 1) b)) (<= (+ 6 x_1 (* 2 i_2)) (+ x_2 (* 3 b)))) (or (<= (+ (* 6 i_1) 6 x_2) (+ x_1 (* 2 i_2) (* 3 b))) (not (< (+ i_1 1) b)))), 17309#(and (or (not (< (+ i_1 1) b)) (<= (+ 2 x_1 (* 2 i_2)) (+ x_2 b))) (or (not (< (+ i_1 1) b)) (<= (+ (* 6 i_1) x_2 10) (+ x_1 (* 5 b) (* 2 i_2))))), 17293#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 17310#(and (or (<= (+ (* 6 i_1) x_2 8) (+ x_1 (* 2 i_2) (* b 4))) (not (< (+ i_1 1) b))) (or (not (< (+ i_1 1) b)) (<= (+ x_1 (* 2 i_2) 4) (+ (* 2 b) x_2)))), 17313#(and (or (<= (+ x_1 (* 2 i_2) 10) (+ x_2 (* 5 b))) (not (< (+ i_1 1) b))) (or (not (< (+ i_1 1) b)) (<= (+ (* 6 i_1) 2 x_2) (+ x_1 b (* 2 i_2))))), 17304#(and (or (<= (+ (* 6 i_1) x_2 a) (+ (* 2 b) 2 x_1 (* 2 i_2))) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ x_1 (* 2 i_2) 8) (+ x_2 a (* b 4))))), 17298#(and (or (<= (+ 2 x_1 (* 2 i_2)) (+ x_2 b a)) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* 6 i_1) x_2 a 4) (+ x_1 (* 5 b) (* 2 i_2))))), 17295#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 17308#(and (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ x_1 (* 2 i_2)) x_2)) (or (not (< (+ i_1 1) b)) (<= (+ (* 6 i_1) x_2 12) (+ x_1 (* 6 b) (* 2 a))))), 17305#(and (or (<= (+ x_1 (* 2 i_2) 10) (+ x_2 a (* 5 b))) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* 6 i_1) x_2 a) (+ x_1 b (* 2 i_2) 4)))), 17303#(and (or (not (< i_1 b)) (<= (+ (* 6 i_1) x_2 a) (+ x_1 (* 2 i_2) (* 3 b)))) (or (<= (+ 6 x_1 (* 2 i_2)) (+ x_2 a (* 3 b))) (not (< i_1 b)))), 17312#(and (or (<= (+ x_1 (* 2 i_2) 8) (+ x_2 (* b 4))) (not (< (+ i_1 1) b))) (or (<= (+ (* 6 i_1) x_2 4) (+ (* 2 b) x_1 (* 2 i_2))) (not (< (+ i_1 1) b)))), 17302#(and (or (< (+ 5 i_2) a) (<= x_1 (+ x_2 (* 5 b))) (not (< (+ i_2 4) a))) (or (< (+ 5 i_2) a) (< (+ x_2 (* 5 b)) (+ x_1 1)) (not (< (+ i_2 4) a)))), 17301#(and (or (< (+ x_2 (* b 4)) (+ x_1 1)) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a)) (or (<= x_1 (+ x_2 (* b 4))) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a))), 17297#(and (or (<= (+ x_1 (* 2 i_2)) (+ x_2 a)) (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ (* 6 i_1) 6 x_2) (+ x_1 a (* 6 b))) (not (< i_1 b)))), 17294#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 17296#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ (* 6 i_1) 6 x_2) (+ x_1 a (* 6 b))) (not (< i_1 b)))), 17306#(and (or (< (+ x_2 (* 6 b)) (+ x_1 1)) (not (< (+ 5 i_2) a)) (< (+ 6 i_2) a)) (or (not (< (+ 5 i_2) a)) (<= x_1 (+ x_2 (* 6 b))) (< (+ 6 i_2) a))), 17300#(and (or (< (+ 3 i_2) a) (not (< (+ 2 i_2) a)) (< (+ x_2 (* 3 b)) (+ x_1 1))) (or (< (+ 3 i_2) a) (<= x_1 (+ x_2 (* 3 b))) (not (< (+ 2 i_2) a)))), 17307#(and (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b))) (or (not (< (+ i_1 1) b)) (<= (+ (* 6 i_1) x_2 12) (+ x_1 (* 6 b) (* 2 a))))), 17299#(and (or (not (< i_1 b)) (<= (+ (* 6 i_1) 2 x_2 a) (+ x_1 (* 2 i_2) (* b 4)))) (or (not (< i_1 b)) (<= (+ x_1 (* 2 i_2) 4) (+ (* 2 b) x_2 a))))] [2022-03-15 20:53:41,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 20:53:41,953 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:53:41,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 20:53:41,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2642, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 20:53:41,954 INFO L87 Difference]: Start difference. First operand 82 states and 195 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:54:26,092 INFO L93 Difference]: Finished difference Result 292 states and 488 transitions. [2022-03-15 20:54:26,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-03-15 20:54:26,092 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:54:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:54:26,093 INFO L225 Difference]: With dead ends: 292 [2022-03-15 20:54:26,093 INFO L226 Difference]: Without dead ends: 268 [2022-03-15 20:54:26,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6582 ImplicationChecksByTransitivity, 50.2s TimeCoverageRelationStatistics Valid=3061, Invalid=18695, Unknown=0, NotChecked=0, Total=21756 [2022-03-15 20:54:26,094 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 685 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:54:26,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [685 Valid, 1 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 20:54:26,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-03-15 20:54:26,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 82. [2022-03-15 20:54:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 2.4074074074074074) internal successors, (195), 81 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 195 transitions. [2022-03-15 20:54:26,097 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 195 transitions. Word has length 16 [2022-03-15 20:54:26,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:54:26,097 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 195 transitions. [2022-03-15 20:54:26,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:54:26,097 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 195 transitions. [2022-03-15 20:54:26,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:54:26,097 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:54:26,097 INFO L514 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:54:26,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 20:54:26,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:54:26,312 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:54:26,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:54:26,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1244859480, now seen corresponding path program 28 times [2022-03-15 20:54:26,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:54:26,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733118992] [2022-03-15 20:54:26,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:54:26,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:54:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:54:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:54:26,808 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:54:26,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733118992] [2022-03-15 20:54:26,808 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733118992] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:54:26,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086032053] [2022-03-15 20:54:26,808 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:54:26,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:54:26,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:54:26,810 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:54:26,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 20:54:26,832 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:54:26,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:54:26,833 WARN L261 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 20:54:26,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:54:28,008 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:54:28,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:54:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:54:29,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086032053] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:54:29,295 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:54:29,295 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-03-15 20:54:29,295 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [864124863] [2022-03-15 20:54:29,295 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:54:29,296 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:54:29,299 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 68 transitions. [2022-03-15 20:54:29,299 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:54:32,727 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [18095#(and (or (<= (+ 3 x_2 (* 7 i_1)) (+ i_2 x_1 (* 3 b))) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ i_2 x_1 4) (+ x_2 (* b 4))))), 18096#(and (or (<= (+ 2 x_2 (* 7 i_1)) (+ (* 2 b) i_2 x_1)) (not (< i_1 b))) (or (<= (+ 5 i_2 x_1) (+ x_2 (* 5 b))) (not (< i_1 b)))), 18093#(and (or (<= (+ x_2 (* 7 i_1) 4) (+ i_2 x_1 (* b 4))) (not (< i_1 b))) (or (<= (+ 3 i_2 x_1) (+ x_2 (* 3 b))) (not (< i_1 b)))), 18092#(and (or (not (< i_1 b)) (<= (+ 5 x_2 (* 7 i_1)) (+ i_2 x_1 (* 5 b)))) (or (<= (+ 2 i_2 x_1) (+ (* 2 b) x_2)) (not (< i_1 b)))), 18083#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 18089#(and (or (< (+ x_2 (* 6 b)) (+ x_1 1)) (not (< (+ 5 i_2) a)) (< (+ 6 i_2) a)) (or (not (< (+ 5 i_2) a)) (<= x_1 (+ x_2 (* 6 b))) (< (+ 6 i_2) a))), 18086#(and (or (< (+ 3 i_2) a) (not (< (+ 2 i_2) a)) (< (+ x_2 (* 3 b)) (+ x_1 1))) (or (< (+ 3 i_2) a) (<= x_1 (+ x_2 (* 3 b))) (not (< (+ 2 i_2) a)))), 18090#(and (or (<= (+ i_2 x_1) x_2) (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ 7 x_2 (* 7 i_1)) (+ x_1 a (* 7 b))))), 18097#(and (or (not (< i_1 b)) (<= (+ x_2 (* 7 i_1) 1) (+ i_2 x_1 b))) (or (not (< i_1 b)) (<= (+ 6 i_2 x_1) (+ x_2 (* 6 b))))), 18094#(and (or (<= x_1 (+ x_2 (* 7 b))) (< (+ 7 i_2) a) (not (< (+ 6 i_2) a))) (or (< (+ x_2 (* 7 b)) (+ x_1 1)) (< (+ 7 i_2) a) (not (< (+ 6 i_2) a)))), 18084#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ 7 x_2 (* 7 i_1)) (+ x_1 a (* 7 b))))), 18082#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 18091#(and (or (not (< i_1 b)) (<= (+ 6 x_2 (* 7 i_1)) (+ i_2 x_1 (* 6 b)))) (or (not (< i_1 b)) (<= (+ i_2 x_1 1) (+ x_2 b)))), 18085#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 18087#(and (or (< (+ x_2 (* b 4)) (+ x_1 1)) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a)) (or (<= x_1 (+ x_2 (* b 4))) (not (< (+ 3 i_2) a)) (< (+ i_2 4) a))), 18088#(and (or (< (+ 5 i_2) a) (<= x_1 (+ x_2 (* 5 b))) (not (< (+ i_2 4) a))) (or (< (+ 5 i_2) a) (< (+ x_2 (* 5 b)) (+ x_1 1)) (not (< (+ i_2 4) a))))] [2022-03-15 20:54:32,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 20:54:32,728 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:54:32,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 20:54:32,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=2217, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 20:54:32,728 INFO L87 Difference]: Start difference. First operand 82 states and 195 transitions. Second operand has 29 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 28 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 20:55:01,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:55:01,076 INFO L93 Difference]: Finished difference Result 283 states and 474 transitions. [2022-03-15 20:55:01,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-15 20:55:01,077 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 28 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 16 [2022-03-15 20:55:01,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:55:01,077 INFO L225 Difference]: With dead ends: 283 [2022-03-15 20:55:01,077 INFO L226 Difference]: Without dead ends: 256 [2022-03-15 20:55:01,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3734 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=2206, Invalid=11366, Unknown=0, NotChecked=0, Total=13572 [2022-03-15 20:55:01,078 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 580 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:55:01,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [580 Valid, 1 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 20:55:01,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-03-15 20:55:01,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 85. [2022-03-15 20:55:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 2.369047619047619) internal successors, (199), 84 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 199 transitions. [2022-03-15 20:55:01,081 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 199 transitions. Word has length 16 [2022-03-15 20:55:01,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:55:01,081 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 199 transitions. [2022-03-15 20:55:01,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 28 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 20:55:01,081 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 199 transitions. [2022-03-15 20:55:01,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:55:01,081 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:55:01,081 INFO L514 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:55:01,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-03-15 20:55:01,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-03-15 20:55:01,295 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:55:01,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:55:01,296 INFO L85 PathProgramCache]: Analyzing trace with hash 658053466, now seen corresponding path program 8 times [2022-03-15 20:55:01,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:55:01,299 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840354854] [2022-03-15 20:55:01,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:55:01,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:55:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:55:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:01,911 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:55:01,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840354854] [2022-03-15 20:55:01,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840354854] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:55:01,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855277243] [2022-03-15 20:55:01,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:55:01,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:01,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:55:01,912 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:55:01,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 20:55:01,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:55:01,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:55:01,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 20:55:01,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:55:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:02,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:55:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:03,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855277243] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:55:03,652 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:55:03,652 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-03-15 20:55:03,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1780347249] [2022-03-15 20:55:03,652 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:55:03,653 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:55:03,655 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 54 transitions. [2022-03-15 20:55:03,655 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:55:05,119 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [18806#(and (< 0 (+ x_2 b 1)) (= (+ x_2 b) x_1) (<= (+ x_2 b) 0)), 18809#(and (<= (+ x_2 (* b 4)) 0) (< 0 (+ x_2 (* b 4) 1)) (= (+ x_2 (* b 4)) x_1)), 18811#(and (<= (+ x_2 (* 6 b)) 0) (= (+ x_2 (* 6 b)) x_1) (< 0 (+ x_2 (* 6 b) 1))), 18807#(and (< 0 (+ (* 2 b) x_2 1)) (<= (+ (* 2 b) x_2) 0) (= (+ (* 2 b) x_2) x_1)), 18810#(and (< 0 (+ x_2 (* 5 b) 1)) (= (+ x_2 (* 5 b)) x_1) (<= (+ x_2 (* 5 b)) 0)), 18813#(and (<= (+ (* b 8) x_2) 0) (= x_1 (+ (* b 8) x_2)) (< 0 (+ (* b 8) x_2 1))), 18812#(and (= x_1 (+ x_2 (* 7 b))) (< 0 (+ x_2 (* 7 b) 1)) (<= (+ x_2 (* 7 b)) 0)), 18808#(and (<= (+ x_2 (* 3 b)) 0) (= (+ x_2 (* 3 b)) x_1) (< 0 (+ x_2 (* 3 b) 1)))] [2022-03-15 20:55:05,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:55:05,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:55:05,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:55:05,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1229, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 20:55:05,120 INFO L87 Difference]: Start difference. First operand 85 states and 199 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:06,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:55:06,317 INFO L93 Difference]: Finished difference Result 105 states and 228 transitions. [2022-03-15 20:55:06,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 20:55:06,317 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:55:06,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:55:06,318 INFO L225 Difference]: With dead ends: 105 [2022-03-15 20:55:06,318 INFO L226 Difference]: Without dead ends: 95 [2022-03-15 20:55:06,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=439, Invalid=1723, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 20:55:06,318 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 70 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:55:06,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 1 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:55:06,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-03-15 20:55:06,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2022-03-15 20:55:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 2.357142857142857) internal successors, (198), 84 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 198 transitions. [2022-03-15 20:55:06,320 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 198 transitions. Word has length 16 [2022-03-15 20:55:06,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:55:06,320 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 198 transitions. [2022-03-15 20:55:06,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 198 transitions. [2022-03-15 20:55:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:55:06,320 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:55:06,320 INFO L514 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:55:06,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-03-15 20:55:06,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-03-15 20:55:06,532 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:55:06,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:55:06,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1691740932, now seen corresponding path program 9 times [2022-03-15 20:55:06,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:55:06,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072122339] [2022-03-15 20:55:06,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:55:06,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:55:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:55:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:07,071 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:55:07,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072122339] [2022-03-15 20:55:07,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072122339] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:55:07,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729917429] [2022-03-15 20:55:07,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:55:07,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:07,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:55:07,072 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:55:07,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 20:55:07,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 20:55:07,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:55:07,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 20:55:07,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:55:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:08,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:55:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:09,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729917429] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:55:09,093 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:55:09,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-03-15 20:55:09,093 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [240536603] [2022-03-15 20:55:09,093 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:55:09,094 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:55:09,098 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 59 transitions. [2022-03-15 20:55:09,098 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:55:10,975 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [19236#(and (<= (+ x_1 (* 2 a)) 0) (= x_2 0) (<= 0 (+ x_1 (* 2 a)))), 19240#(and (<= (+ (* 6 a) x_1) 0) (= x_2 0) (<= 0 (+ (* 6 a) x_1))), 19242#(and (= x_2 0) (<= (+ (* a 8) x_1) 0) (<= 0 (+ (* a 8) x_1))), 19241#(and (= x_2 0) (<= 0 (+ x_1 (* 7 a))) (<= (+ x_1 (* 7 a)) 0)), 19243#(and (<= 0 (+ x_1 (* 9 a))) (<= (+ x_1 (* 9 a)) 0) (= x_2 0)), 19237#(and (<= (+ x_1 (* 3 a)) 0) (= x_2 0) (<= 0 (+ x_1 (* 3 a)))), 19238#(and (<= 0 (+ x_1 (* a 4))) (= x_2 0) (<= (+ x_1 (* a 4)) 0)), 19235#(and (or (< 0 (+ x_1 1)) (< i_2 a)) (or (= x_2 x_1) (< i_2 a)) (or (< i_2 a) (<= x_1 0))), 19239#(and (= x_2 0) (<= 0 (+ x_1 (* 5 a))) (<= (+ x_1 (* 5 a)) 0))] [2022-03-15 20:55:10,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 20:55:10,976 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:55:10,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 20:55:10,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1496, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 20:55:10,976 INFO L87 Difference]: Start difference. First operand 85 states and 198 transitions. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:55:12,245 INFO L93 Difference]: Finished difference Result 116 states and 248 transitions. [2022-03-15 20:55:12,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 20:55:12,245 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:55:12,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:55:12,246 INFO L225 Difference]: With dead ends: 116 [2022-03-15 20:55:12,246 INFO L226 Difference]: Without dead ends: 108 [2022-03-15 20:55:12,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=507, Invalid=2043, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 20:55:12,246 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 114 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:55:12,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 1 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:55:12,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-03-15 20:55:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 87. [2022-03-15 20:55:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 2.372093023255814) internal successors, (204), 86 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 204 transitions. [2022-03-15 20:55:12,248 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 204 transitions. Word has length 17 [2022-03-15 20:55:12,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:55:12,248 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 204 transitions. [2022-03-15 20:55:12,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:12,248 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 204 transitions. [2022-03-15 20:55:12,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:55:12,249 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:55:12,249 INFO L514 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:55:12,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 20:55:12,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 20:55:12,465 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:55:12,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:55:12,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1606777000, now seen corresponding path program 29 times [2022-03-15 20:55:12,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:55:12,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911380757] [2022-03-15 20:55:12,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:55:12,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:55:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:55:13,275 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:13,275 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:55:13,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911380757] [2022-03-15 20:55:13,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911380757] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:55:13,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939606918] [2022-03-15 20:55:13,275 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:55:13,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:13,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:55:13,276 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:55:13,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 20:55:13,298 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 20:55:13,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:55:13,298 WARN L261 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:55:13,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:55:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:14,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:55:16,037 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:16,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939606918] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:55:16,037 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:55:16,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-03-15 20:55:16,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1598981611] [2022-03-15 20:55:16,037 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:55:16,038 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:55:16,042 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 75 transitions. [2022-03-15 20:55:16,042 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:55:20,120 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [19695#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 19687#(and (or (<= (+ x_1 (* a 4)) x_2) (not (< (+ 3 i_1) b))) (or (<= (+ i_1 x_2 4) (+ x_1 b (* a 4))) (not (< (+ 3 i_1) b)))), 19686#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ 3 i_1 x_2) (+ x_1 b (* 3 a))))), 19697#(and (or (not (< (+ 7 i_1) b)) (<= (+ i_1 x_2 8) (+ (* a 8) x_1 b))) (or (not (< (+ 7 i_1) b)) (<= (+ (* a 8) x_1) x_2))), 19693#(and (or (<= (+ 6 i_1 x_2) (+ (* 6 a) x_1 b)) (not (< (+ 5 i_1) b))) (or (<= (+ (* i_2 8) x_1) (+ x_2 (* 2 a))) (<= (+ (* 6 a) x_1) x_2) (not (< (+ 5 i_1) b)))), 19692#(and (or (<= (+ 5 i_1 x_2) (+ x_1 b (* 5 a))) (not (< (+ i_1 4) b))) (or (not (< (+ i_1 4) b)) (<= (+ (* i_2 8) x_1) (+ x_2 (* 3 a))) (<= (+ x_1 (* 5 a)) x_2))), 19689#(and (or (<= (+ (* 6 a) x_1) x_2) (not (< (+ 5 i_1) b))) (or (<= (+ 6 i_1 x_2) (+ (* 6 a) x_1 b)) (not (< (+ 5 i_1) b)))), 19685#(and (or (not (< (+ i_1 1) b)) (<= (+ 2 i_1 x_2) (+ x_1 b (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (<= (+ (* i_2 8) x_1) (+ (* 6 a) x_2)) (not (< (+ i_1 1) b)))), 19683#(and (or (not (< (+ i_1 1) b)) (<= (+ 2 i_1 x_2) (+ x_1 b (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 19688#(and (or (not (< (+ i_1 4) b)) (<= (+ x_1 (* 5 a)) x_2)) (or (<= (+ 5 i_1 x_2) (+ x_1 b (* 5 a))) (not (< (+ i_1 4) b)))), 19684#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b)) (<= (+ (* i_2 8) x_1) (+ x_2 (* 7 a)))) (or (<= (+ i_1 x_2 1) (+ x_1 b a)) (not (< i_1 b)))), 19699#(and (or (not (< (+ 7 i_1) b)) (<= (+ i_1 x_2 8) (+ (* a 8) x_1 b))) (or (not (< (+ 7 i_1) b)) (<= (+ (* i_2 8) x_1) x_2) (<= (+ (* a 8) x_1) x_2))), 19682#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (<= (+ i_1 x_2 1) (+ x_1 b a)) (not (< i_1 b)))), 19690#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* i_2 8) x_1) (+ x_2 (* 5 a))) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ 3 i_1 x_2) (+ x_1 b (* 3 a))))), 19696#(and (or (<= (+ 7 i_1 x_2) (+ x_1 b (* 7 a))) (not (< (+ 6 i_1) b))) (or (not (< (+ 6 i_1) b)) (<= (+ x_1 (* 7 a)) x_2))), 19694#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 19691#(and (or (<= (+ i_1 x_2 4) (+ x_1 b (* a 4))) (not (< (+ 3 i_1) b))) (or (<= (+ (* i_2 8) x_1) (+ x_2 (* a 4))) (<= (+ x_1 (* a 4)) x_2) (not (< (+ 3 i_1) b)))), 19698#(and (or (<= (+ 7 i_1 x_2) (+ x_1 b (* 7 a))) (not (< (+ 6 i_1) b))) (or (<= (+ (* i_2 8) x_1) (+ x_2 a)) (not (< (+ 6 i_1) b)) (<= (+ x_1 (* 7 a)) x_2)))] [2022-03-15 20:55:20,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 20:55:20,120 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:55:20,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 20:55:20,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2645, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 20:55:20,121 INFO L87 Difference]: Start difference. First operand 87 states and 204 transitions. Second operand has 32 states, 31 states have (on average 2.064516129032258) internal successors, (64), 31 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:40,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:55:40,344 INFO L93 Difference]: Finished difference Result 213 states and 395 transitions. [2022-03-15 20:55:40,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 20:55:40,345 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.064516129032258) internal successors, (64), 31 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:55:40,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:55:40,346 INFO L225 Difference]: With dead ends: 213 [2022-03-15 20:55:40,346 INFO L226 Difference]: Without dead ends: 204 [2022-03-15 20:55:40,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 11 SyntacticMatches, 10 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3096 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=1355, Invalid=10201, Unknown=0, NotChecked=0, Total=11556 [2022-03-15 20:55:40,347 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 382 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:55:40,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 1 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-03-15 20:55:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-03-15 20:55:40,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 90. [2022-03-15 20:55:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.393258426966292) internal successors, (213), 89 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 213 transitions. [2022-03-15 20:55:40,349 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 213 transitions. Word has length 17 [2022-03-15 20:55:40,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:55:40,349 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 213 transitions. [2022-03-15 20:55:40,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.064516129032258) internal successors, (64), 31 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:40,349 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 213 transitions. [2022-03-15 20:55:40,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:55:40,349 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:55:40,349 INFO L514 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:55:40,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-03-15 20:55:40,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:40,566 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:55:40,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:55:40,566 INFO L85 PathProgramCache]: Analyzing trace with hash 168230362, now seen corresponding path program 30 times [2022-03-15 20:55:40,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:55:40,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338460195] [2022-03-15 20:55:40,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:55:40,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:55:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:55:41,229 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:41,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:55:41,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338460195] [2022-03-15 20:55:41,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338460195] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:55:41,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402420282] [2022-03-15 20:55:41,229 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:55:41,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:41,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:55:41,230 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:55:41,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 20:55:41,254 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 20:55:41,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:55:41,255 WARN L261 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:55:41,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:55:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:42,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:55:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:46,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402420282] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:55:46,926 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:55:46,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-03-15 20:55:46,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [500495104] [2022-03-15 20:55:46,927 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:55:46,928 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:55:46,932 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 87 transitions. [2022-03-15 20:55:46,932 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:55:52,931 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [20333#(and (or (<= x_1 x_2) (< i_2 a)) (or (< x_2 (+ x_1 1)) (< i_2 a))), 20346#(and (or (<= (+ (* 7 i_2) x_1) (+ x_2 (* 3 a))) (<= (+ x_1 (* a 4)) x_2) (not (< (+ 3 i_1) b))) (or (<= (+ (* 2 i_1) x_2 8) (+ (* 2 b) x_1 (* a 4))) (not (< (+ 3 i_1) b)))), 20340#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 2 i_1) x_2 4) (+ (* 2 b) x_1 (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)) (<= (+ (* 7 i_2) x_1) (+ x_2 (* 5 a))))), 20348#(and (or (not (< (+ i_1 4) b)) (<= (+ x_1 (* 5 a)) x_2)) (or (not (< (+ i_1 4) b)) (<= (+ (* 2 i_1) x_2 10) (+ (* 2 b) x_1 (* 5 a))))), 20335#(and (or (<= x_1 (+ (* 2 b) x_2)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a)) (or (< (+ (* 2 b) x_2) (+ x_1 1)) (not (< (+ i_2 1) a)) (< (+ 2 i_2) a))), 20343#(and (or (<= (+ 7 (* 7 i_2) x_1) (+ x_2 b (* 5 a))) (not (< (+ i_1 1) b))) (or (not (< (+ i_1 1) b)) (<= (+ (* 2 i_1) x_2 (* 5 a)) (+ (* 7 i_2) 3 x_1 b)))), 20344#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 2 i_1) x_2 (* a 4)) (+ (* 7 i_2) x_1 b 1))) (or (not (< (+ 2 i_1) b)) (<= (+ 7 (* 7 i_2) x_1) (+ x_2 b (* a 4))))), 20345#(and (or (<= (+ x_1 (* a 4)) x_2) (not (< (+ 3 i_1) b))) (or (<= (+ (* 2 i_1) x_2 8) (+ (* 2 b) x_1 (* a 4))) (not (< (+ 3 i_1) b)))), 20347#(and (or (<= (+ 7 (* 7 i_2) x_1) (+ x_2 b (* 3 a))) (not (< (+ 3 i_1) b))) (or (<= (+ (* 2 i_1) x_2 1 (* 3 a)) (+ (* 7 i_2) x_1 b)) (not (< (+ 3 i_1) b)))), 20353#(and (or (not (< (+ 6 i_1) b)) (<= (+ (* 7 i_2) x_1) x_2) (<= (+ x_1 (* 7 a)) x_2)) (or (not (< (+ 6 i_1) b)) (<= (+ (* 2 i_1) 14 x_2) (+ (* 2 b) x_1 (* 7 a))))), 20339#(and (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2)) (or (not (< (+ 2 i_1) b)) (<= (+ (* 2 i_1) 6 x_2) (+ (* 2 b) x_1 (* 3 a))))), 20342#(and (or (not (< i_1 b)) (<= (+ (* 2 i_1) (* 6 a) x_2) (+ 5 (* 7 i_2) x_1 b))) (or (not (< i_1 b)) (<= (+ 7 (* 7 i_2) x_1) (+ (* 6 a) x_2 b)))), 20350#(and (or (<= (+ (* 2 i_1) x_2 12) (+ (* 2 b) (* 6 a) x_1)) (not (< (+ 5 i_1) b))) (or (<= (+ (* 6 a) x_1) x_2) (not (< (+ 5 i_1) b)))), 20337#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b)) (<= (+ (* 7 i_2) x_1) (+ (* 6 a) x_2))) (or (not (< i_1 b)) (<= (+ (* 2 i_1) 2 x_2) (+ (* 2 b) x_1 a)))), 20336#(and (or (<= (+ x_1 a) x_2) (not (< i_1 b))) (or (not (< i_1 b)) (<= (+ (* 2 i_1) 2 x_2) (+ (* 2 b) x_1 a)))), 20349#(and (or (not (< (+ i_1 4) b)) (<= (+ (* 2 i_1) x_2 10) (+ (* 2 b) x_1 (* 5 a)))) (or (not (< (+ i_1 4) b)) (<= (+ (* 7 i_2) x_1) (+ x_2 (* 2 a))) (<= (+ x_1 (* 5 a)) x_2))), 20352#(and (or (<= (+ (* 2 i_1) x_2 12) (+ (* 2 b) (* 6 a) x_1)) (not (< (+ 5 i_1) b))) (or (<= (+ (* 7 i_2) x_1) (+ x_2 a)) (<= (+ (* 6 a) x_1) x_2) (not (< (+ 5 i_1) b)))), 20356#(and (or (<= (+ 7 (* 2 i_1) x_2) (+ (* 7 i_2) x_1 b)) (not (< (+ 6 i_1) b))) (or (not (< (+ 6 i_1) b)) (<= (+ 7 (* 7 i_2) x_1) (+ x_2 b)))), 20338#(and (or (not (< (+ i_1 1) b)) (<= (+ (* 2 i_1) x_2 4) (+ (* 2 b) x_1 (* 2 a)))) (or (<= (+ x_1 (* 2 a)) x_2) (not (< (+ i_1 1) b)))), 20354#(and (or (not (< (+ i_1 4) b)) (<= (+ 7 (* 7 i_2) x_1) (+ x_2 b (* 2 a)))) (or (not (< (+ i_1 4) b)) (<= (+ (* 2 i_1) 3 x_2 (* 2 a)) (+ (* 7 i_2) x_1 b)))), 20355#(and (or (<= (+ 5 (* 2 i_1) x_2 a) (+ (* 7 i_2) x_1 b)) (not (< (+ 5 i_1) b))) (or (<= (+ 7 (* 7 i_2) x_1) (+ x_2 b a)) (not (< (+ 5 i_1) b)))), 20351#(and (or (not (< (+ 6 i_1) b)) (<= (+ x_1 (* 7 a)) x_2)) (or (not (< (+ 6 i_1) b)) (<= (+ (* 2 i_1) 14 x_2) (+ (* 2 b) x_1 (* 7 a))))), 20334#(and (or (< (+ i_2 1) a) (< (+ x_2 b) (+ x_1 1)) (not (< i_2 a))) (or (<= x_1 (+ x_2 b)) (< (+ i_2 1) a) (not (< i_2 a)))), 20341#(and (or (not (< (+ 2 i_1) b)) (<= (+ (* 2 i_1) 6 x_2) (+ (* 2 b) x_1 (* 3 a)))) (or (not (< (+ 2 i_1) b)) (<= (+ x_1 (* 3 a)) x_2) (<= (+ (* 7 i_2) x_1) (+ x_2 (* a 4)))))] [2022-03-15 20:55:52,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 20:55:52,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:55:52,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 20:55:52,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3313, Unknown=1, NotChecked=0, Total=3540 [2022-03-15 20:55:52,932 INFO L87 Difference]: Start difference. First operand 90 states and 213 transitions. Second operand has 38 states, 37 states have (on average 2.054054054054054) internal successors, (76), 37 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 20:56:26,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-03-15 20:56:26,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 12 SyntacticMatches, 9 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5542 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=1908, Invalid=17831, Unknown=1, NotChecked=0, Total=19740 [2022-03-15 20:56:26,601 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 424 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:56:26,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 1 Invalid, 2455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-03-15 20:56:26,602 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2022-03-15 20:56:26,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-03-15 20:56:26,620 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 20:56:26,642 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 20:56:26,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-15 20:56:26,802 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (90states) and FLOYD_HOARE automaton (currently 98 states, 38 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 141 known predicates. [2022-03-15 20:56:26,804 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 20:56:26,804 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 20:56:26,805 INFO L732 BasicCegarLoop]: Path program histogram: [30, 9, 8, 1] [2022-03-15 20:56:26,807 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:56:26,807 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:56:26,808 INFO L202 PluginConnector]: Adding new model mult-comm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:56:26 BasicIcfg [2022-03-15 20:56:26,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:56:26,808 INFO L158 Benchmark]: Toolchain (without parser) took 842041.52ms. Allocated memory was 202.4MB in the beginning and 313.5MB in the end (delta: 111.1MB). Free memory was 167.8MB in the beginning and 111.3MB in the end (delta: 56.5MB). Peak memory consumption was 168.9MB. Max. memory is 8.0GB. [2022-03-15 20:56:26,808 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 202.4MB. Free memory is still 168.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:56:26,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.16ms. Allocated memory is still 202.4MB. Free memory was 167.7MB in the beginning and 166.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:56:26,808 INFO L158 Benchmark]: Boogie Preprocessor took 13.05ms. Allocated memory is still 202.4MB. Free memory was 166.2MB in the beginning and 165.3MB in the end (delta: 873.2kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:56:26,808 INFO L158 Benchmark]: RCFGBuilder took 228.63ms. Allocated memory is still 202.4MB. Free memory was 165.1MB in the beginning and 156.4MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-03-15 20:56:26,809 INFO L158 Benchmark]: TraceAbstraction took 841772.94ms. Allocated memory was 202.4MB in the beginning and 313.5MB in the end (delta: 111.1MB). Free memory was 156.0MB in the beginning and 111.3MB in the end (delta: 44.7MB). Peak memory consumption was 156.3MB. Max. memory is 8.0GB. [2022-03-15 20:56:26,809 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.12ms. Allocated memory is still 202.4MB. Free memory is still 168.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.16ms. Allocated memory is still 202.4MB. Free memory was 167.7MB in the beginning and 166.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.05ms. Allocated memory is still 202.4MB. Free memory was 166.2MB in the beginning and 165.3MB in the end (delta: 873.2kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 228.63ms. Allocated memory is still 202.4MB. Free memory was 165.1MB in the beginning and 156.4MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 841772.94ms. Allocated memory was 202.4MB in the beginning and 313.5MB in the end (delta: 111.1MB). Free memory was 156.0MB in the beginning and 111.3MB in the end (delta: 44.7MB). Peak memory consumption was 156.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 24 PlacesBefore, 18 PlacesAfterwards, 19 TransitionsBefore, 13 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 37 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 23, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 37, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (90states) and FLOYD_HOARE automaton (currently 98 states, 38 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 141 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (90states) and FLOYD_HOARE automaton (currently 98 states, 38 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 141 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (90states) and FLOYD_HOARE automaton (currently 98 states, 38 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 141 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 28 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 841.7s, OverallIterations: 48, TraceHistogramMax: 9, PathProgramHistogramMax: 30, EmptinessCheckTime: 0.0s, AutomataDifference: 595.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11788 SdHoareTripleChecker+Valid, 61.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11788 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 57.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8376 mSDsCounter, 3238 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28868 IncrementalHoareTripleChecker+Invalid, 32106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3238 mSolverCounterUnsat, 48 mSDtfsCounter, 28868 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4233 GetRequests, 692 SyntacticMatches, 170 SemanticMatches, 3370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93503 ImplicationChecksByTransitivity, 697.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=47, InterpolantAutomatonStates: 2049, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 47 MinimizatonAttempts, 3213 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 123.3s InterpolantComputationTime, 1294 NumberOfCodeBlocks, 1294 NumberOfCodeBlocksAsserted, 172 NumberOfCheckSat, 1795 ConstructedInterpolants, 48 QuantifiedInterpolants, 39958 SizeOfPredicates, 214 NumberOfNonLiveVariables, 2792 ConjunctsInSsa, 1347 ConjunctsInUnsatCore, 142 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2319 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown