/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/popl20/figure1.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:27:50,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:27:50,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:27:50,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:27:50,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:27:50,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:27:50,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:27:50,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:27:50,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:27:50,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:27:50,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:27:50,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:27:50,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:27:50,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:27:50,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:27:50,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:27:50,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:27:50,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:27:50,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:27:50,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:27:50,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:27:50,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:27:50,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:27:50,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:27:50,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:27:50,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:27:50,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:27:50,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:27:50,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:27:50,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:27:50,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:27:50,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:27:50,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:27:50,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:27:50,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:27:50,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:27:50,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:27:50,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:27:50,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:27:50,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:27:50,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:27:50,222 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 21:27:50,244 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:27:50,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:27:50,245 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:27:50,245 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:27:50,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:27:50,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:27:50,245 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:27:50,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:27:50,246 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:27:50,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:27:50,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:27:50,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:27:50,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:27:50,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:27:50,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:27:50,247 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:27:50,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:27:50,247 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:27:50,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:27:50,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:27:50,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:27:50,247 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:27:50,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:27:50,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:27:50,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:27:50,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:27:50,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:27:50,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:27:50,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:27:50,249 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:27:50,249 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:27:50,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:27:50,249 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 21:27:50,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:27:50,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:27:50,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:27:50,464 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:27:50,473 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:27:50,474 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/figure1.wvr.bpl [2022-03-15 21:27:50,474 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/figure1.wvr.bpl' [2022-03-15 21:27:50,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:27:50,491 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:27:50,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:27:50,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:27:50,492 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:27:50,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:27:50" (1/1) ... [2022-03-15 21:27:50,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:27:50" (1/1) ... [2022-03-15 21:27:50,508 INFO L137 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:27:50,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:27:50,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:27:50,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:27:50,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:27:50,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:27:50" (1/1) ... [2022-03-15 21:27:50,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:27:50" (1/1) ... [2022-03-15 21:27:50,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:27:50" (1/1) ... [2022-03-15 21:27:50,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:27:50" (1/1) ... [2022-03-15 21:27:50,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:27:50" (1/1) ... [2022-03-15 21:27:50,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:27:50" (1/1) ... [2022-03-15 21:27:50,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:27:50" (1/1) ... [2022-03-15 21:27:50,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:27:50,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:27:50,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:27:50,523 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:27:50,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:27:50" (1/1) ... [2022-03-15 21:27:50,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:27:50,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:27:50,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 21:27:50,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 21:27:50,579 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:27:50,579 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:27:50,579 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:27:50,579 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:27:50,579 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:27:50,580 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:27:50,580 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:27:50,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:27:50,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:27:50,580 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 21:27:50,609 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:27:50,610 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:27:50,691 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:27:50,713 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:27:50,713 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 21:27:50,714 INFO L202 PluginConnector]: Adding new model figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:27:50 BoogieIcfgContainer [2022-03-15 21:27:50,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:27:50,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:27:50,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:27:50,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:27:50,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:27:50" (1/2) ... [2022-03-15 21:27:50,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187fd662 and model type figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:27:50, skipping insertion in model container [2022-03-15 21:27:50,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:27:50" (2/2) ... [2022-03-15 21:27:50,720 INFO L111 eAbstractionObserver]: Analyzing ICFG figure1.wvr.bpl [2022-03-15 21:27:50,727 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:27:50,727 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:27:50,727 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:27:50,727 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:27:50,763 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 21:27:50,805 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:27:50,811 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 21:27:50,811 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 21:27:50,819 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:27:50,827 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 22 transitions, 60 flow [2022-03-15 21:27:50,829 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 22 transitions, 60 flow [2022-03-15 21:27:50,830 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 27 places, 22 transitions, 60 flow [2022-03-15 21:27:50,847 INFO L129 PetriNetUnfolder]: 2/20 cut-off events. [2022-03-15 21:27:50,847 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 21:27:50,849 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 2/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 13 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2022-03-15 21:27:50,851 INFO L116 LiptonReduction]: Number of co-enabled transitions 48 [2022-03-15 21:27:51,056 INFO L131 LiptonReduction]: Checked pairs total: 42 [2022-03-15 21:27:51,056 INFO L133 LiptonReduction]: Total number of compositions: 10 [2022-03-15 21:27:51,062 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 13 transitions, 42 flow [2022-03-15 21:27:51,073 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 21:27:51,075 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 21:27:51,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-03-15 21:27:51,078 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:27:51,078 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:27:51,079 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:27:51,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:27:51,082 INFO L85 PathProgramCache]: Analyzing trace with hash 450279001, now seen corresponding path program 1 times [2022-03-15 21:27:51,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:27:51,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524153076] [2022-03-15 21:27:51,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:27:51,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:27:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:27:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:51,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:27:51,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524153076] [2022-03-15 21:27:51,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524153076] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:27:51,178 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:27:51,178 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 21:27:51,179 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1987023533] [2022-03-15 21:27:51,179 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:27:51,181 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:27:51,188 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 14 transitions. [2022-03-15 21:27:51,188 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:27:51,305 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:27:51,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:27:51,307 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:27:51,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:27:51,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:27:51,327 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 21:27:51,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:27:51,348 INFO L93 Difference]: Finished difference Result 21 states and 34 transitions. [2022-03-15 21:27:51,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:27:51,349 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 21:27:51,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:27:51,355 INFO L225 Difference]: With dead ends: 21 [2022-03-15 21:27:51,355 INFO L226 Difference]: Without dead ends: 15 [2022-03-15 21:27:51,356 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 21:27:51,359 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:27:51,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:27:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-03-15 21:27:51,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-03-15 21:27:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 25 transitions. [2022-03-15 21:27:51,379 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 25 transitions. Word has length 8 [2022-03-15 21:27:51,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:27:51,380 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 25 transitions. [2022-03-15 21:27:51,380 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 21:27:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 25 transitions. [2022-03-15 21:27:51,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 21:27:51,380 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:27:51,380 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:27:51,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:27:51,381 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:27:51,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:27:51,381 INFO L85 PathProgramCache]: Analyzing trace with hash -473324648, now seen corresponding path program 1 times [2022-03-15 21:27:51,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:27:51,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151196585] [2022-03-15 21:27:51,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:27:51,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:27:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:27:51,427 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 21:27:51,427 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:27:51,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151196585] [2022-03-15 21:27:51,428 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151196585] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:27:51,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379142350] [2022-03-15 21:27:51,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:27:51,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:51,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:27:51,447 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 21:27:51,450 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 21:27:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:27:51,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:27:51,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:27:51,596 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 21:27:51,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:27:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:51,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379142350] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 21:27:51,658 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 21:27:51,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 7 [2022-03-15 21:27:51,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1584793187] [2022-03-15 21:27:51,659 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:27:51,660 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:27:51,661 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2022-03-15 21:27:51,661 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:27:51,752 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [164#(< i1 N1), 165#(or (< i2 N2) (< i1 N1)), 166#(or (< (+ i1 1) N1) (<= N1 i1)), 167#(or (< (+ i1 1) N1) (< i2 N2) (<= N1 i1))] [2022-03-15 21:27:51,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:27:51,753 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:27:51,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:27:51,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:27:51,753 INFO L87 Difference]: Start difference. First operand 15 states and 25 transitions. Second operand has 8 states, 8 states have (on average 2.25) 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 21:27:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:27:51,838 INFO L93 Difference]: Finished difference Result 30 states and 45 transitions. [2022-03-15 21:27:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:27:51,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) 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 9 [2022-03-15 21:27:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:27:51,839 INFO L225 Difference]: With dead ends: 30 [2022-03-15 21:27:51,839 INFO L226 Difference]: Without dead ends: 30 [2022-03-15 21:27:51,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:27:51,840 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:27:51,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:27:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-03-15 21:27:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2022-03-15 21:27:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 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 21:27:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2022-03-15 21:27:51,844 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 32 transitions. Word has length 9 [2022-03-15 21:27:51,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:27:51,845 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 32 transitions. [2022-03-15 21:27:51,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) 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 21:27:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 32 transitions. [2022-03-15 21:27:51,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 21:27:51,845 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:27:51,845 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:27:51,873 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 21:27:52,064 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 21:27:52,065 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:27:52,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:27:52,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1788246943, now seen corresponding path program 1 times [2022-03-15 21:27:52,067 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:27:52,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136609830] [2022-03-15 21:27:52,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:27:52,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:27:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:27:52,114 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 21:27:52,115 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:27:52,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136609830] [2022-03-15 21:27:52,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136609830] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:27:52,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817557188] [2022-03-15 21:27:52,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:27:52,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:52,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:27:52,140 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 21:27:52,141 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 21:27:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:27:52,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:27:52,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:27:52,244 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 21:27:52,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:27:52,298 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 21:27:52,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817557188] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:27:52,299 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:27:52,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2022-03-15 21:27:52,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [265638694] [2022-03-15 21:27:52,299 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:27:52,300 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:27:52,301 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2022-03-15 21:27:52,302 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:27:52,409 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:27:52,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:27:52,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:27:52,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:27:52,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:27:52,411 INFO L87 Difference]: Start difference. First operand 19 states and 32 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:27:52,441 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2022-03-15 21:27:52,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:27:52,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 21:27:52,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:27:52,443 INFO L225 Difference]: With dead ends: 39 [2022-03-15 21:27:52,443 INFO L226 Difference]: Without dead ends: 31 [2022-03-15 21:27:52,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:27:52,446 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:27:52,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 0 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:27:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-03-15 21:27:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-03-15 21:27:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:52,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 45 transitions. [2022-03-15 21:27:52,455 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 45 transitions. Word has length 10 [2022-03-15 21:27:52,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:27:52,456 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 45 transitions. [2022-03-15 21:27:52,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:52,456 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 45 transitions. [2022-03-15 21:27:52,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 21:27:52,456 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:27:52,456 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:27:52,475 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 21:27:52,675 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 21:27:52,675 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:27:52,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:27:52,676 INFO L85 PathProgramCache]: Analyzing trace with hash -71204837, now seen corresponding path program 2 times [2022-03-15 21:27:52,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:27:52,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029251705] [2022-03-15 21:27:52,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:27:52,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:27:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:27:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:27:52,703 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:27:52,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029251705] [2022-03-15 21:27:52,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029251705] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:27:52,704 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:27:52,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:27:52,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [354614227] [2022-03-15 21:27:52,704 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:27:52,705 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:27:52,706 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2022-03-15 21:27:52,706 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:27:52,740 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [393#(< i2 N2)] [2022-03-15 21:27:52,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 21:27:52,740 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:27:52,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 21:27:52,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:27:52,741 INFO L87 Difference]: Start difference. First operand 25 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:27:52,788 INFO L93 Difference]: Finished difference Result 31 states and 52 transitions. [2022-03-15 21:27:52,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:27:52,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 21:27:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:27:52,789 INFO L225 Difference]: With dead ends: 31 [2022-03-15 21:27:52,789 INFO L226 Difference]: Without dead ends: 30 [2022-03-15 21:27:52,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:27:52,790 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:27:52,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:27:52,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-03-15 21:27:52,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-03-15 21:27:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 43 transitions. [2022-03-15 21:27:52,793 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 43 transitions. Word has length 10 [2022-03-15 21:27:52,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:27:52,793 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 43 transitions. [2022-03-15 21:27:52,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:52,793 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 43 transitions. [2022-03-15 21:27:52,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 21:27:52,794 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:27:52,794 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:27:52,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 21:27:52,794 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:27:52,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:27:52,794 INFO L85 PathProgramCache]: Analyzing trace with hash -313123360, now seen corresponding path program 2 times [2022-03-15 21:27:52,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:27:52,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187855706] [2022-03-15 21:27:52,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:27:52,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:27:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:27:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:52,860 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:27:52,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187855706] [2022-03-15 21:27:52,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187855706] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:27:52,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030078973] [2022-03-15 21:27:52,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:27:52,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:52,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:27:52,862 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 21:27:52,885 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 21:27:52,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:27:52,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:27:52,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:27:52,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:27:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:52,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:27:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:53,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030078973] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:27:53,024 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:27:53,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-03-15 21:27:53,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1201992948] [2022-03-15 21:27:53,024 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:27:53,024 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:27:53,026 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 25 transitions. [2022-03-15 21:27:53,026 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:27:53,139 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [553#(or (< i2 N2) (< i1 N1)), 555#(or (< (+ i1 1) N1) (<= N1 i1) (<= (+ 2 i2) N2)), 554#(or (< i1 N1) (<= (+ 2 i2) N2)), 556#(or (<= N1 (+ i1 1)) (< (+ 2 i1) N1) (<= (+ 2 i2) N2)), 552#(< i1 N1)] [2022-03-15 21:27:53,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:27:53,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:27:53,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:27:53,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:27:53,140 INFO L87 Difference]: Start difference. First operand 24 states and 43 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:27:53,270 INFO L93 Difference]: Finished difference Result 54 states and 90 transitions. [2022-03-15 21:27:53,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:27:53,271 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 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 21:27:53,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:27:53,271 INFO L225 Difference]: With dead ends: 54 [2022-03-15 21:27:53,271 INFO L226 Difference]: Without dead ends: 52 [2022-03-15 21:27:53,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:27:53,272 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:27:53,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:27:53,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-03-15 21:27:53,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 26. [2022-03-15 21:27:53,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 49 transitions. [2022-03-15 21:27:53,275 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 49 transitions. Word has length 11 [2022-03-15 21:27:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:27:53,275 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 49 transitions. [2022-03-15 21:27:53,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:53,275 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 49 transitions. [2022-03-15 21:27:53,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 21:27:53,276 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:27:53,276 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:27:53,291 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 21:27:53,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:53,486 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:27:53,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:27:53,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1229963146, now seen corresponding path program 3 times [2022-03-15 21:27:53,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:27:53,487 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960987158] [2022-03-15 21:27:53,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:27:53,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:27:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:27:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:53,520 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:27:53,520 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960987158] [2022-03-15 21:27:53,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960987158] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:27:53,520 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585088147] [2022-03-15 21:27:53,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:27:53,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:53,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:27:53,522 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 21:27:53,523 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 21:27:53,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:27:53,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:27:53,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:27:53,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:27:53,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:53,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:27:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:53,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585088147] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:27:53,677 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:27:53,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2022-03-15 21:27:53,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [785182148] [2022-03-15 21:27:53,678 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:27:53,678 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:27:53,679 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 19 transitions. [2022-03-15 21:27:53,679 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:27:53,723 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [746#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= N1 i1) (<= i2 i1))), 745#(< i2 N2)] [2022-03-15 21:27:53,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 21:27:53,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:27:53,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 21:27:53,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:27:53,724 INFO L87 Difference]: Start difference. First operand 26 states and 49 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:53,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:27:53,788 INFO L93 Difference]: Finished difference Result 35 states and 60 transitions. [2022-03-15 21:27:53,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:27:53,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 21:27:53,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:27:53,789 INFO L225 Difference]: With dead ends: 35 [2022-03-15 21:27:53,789 INFO L226 Difference]: Without dead ends: 34 [2022-03-15 21:27:53,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:27:53,790 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:27:53,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:27:53,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-03-15 21:27:53,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2022-03-15 21:27:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 47 transitions. [2022-03-15 21:27:53,792 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 47 transitions. Word has length 11 [2022-03-15 21:27:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:27:53,792 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 47 transitions. [2022-03-15 21:27:53,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 47 transitions. [2022-03-15 21:27:53,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 21:27:53,793 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:27:53,793 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:27:53,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 21:27:54,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:54,009 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:27:54,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:27:54,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1116974311, now seen corresponding path program 4 times [2022-03-15 21:27:54,010 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:27:54,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8184508] [2022-03-15 21:27:54,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:27:54,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:27:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:27:54,054 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 21:27:54,054 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:27:54,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8184508] [2022-03-15 21:27:54,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8184508] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:27:54,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023829452] [2022-03-15 21:27:54,054 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:27:54,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:54,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:27:54,056 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 21:27:54,057 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 21:27:54,075 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:27:54,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:27:54,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 21:27:54,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:27:54,117 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 21:27:54,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:27:54,154 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 21:27:54,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023829452] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:27:54,155 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:27:54,155 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-03-15 21:27:54,155 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [816010184] [2022-03-15 21:27:54,155 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:27:54,155 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:27:54,157 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 30 transitions. [2022-03-15 21:27:54,157 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:27:54,270 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:27:54,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 21:27:54,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:27:54,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 21:27:54,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:27:54,271 INFO L87 Difference]: Start difference. First operand 25 states and 47 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 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 21:27:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:27:54,308 INFO L93 Difference]: Finished difference Result 61 states and 112 transitions. [2022-03-15 21:27:54,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 21:27:54,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 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 12 [2022-03-15 21:27:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:27:54,309 INFO L225 Difference]: With dead ends: 61 [2022-03-15 21:27:54,309 INFO L226 Difference]: Without dead ends: 51 [2022-03-15 21:27:54,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:27:54,310 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:27:54,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:27:54,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-03-15 21:27:54,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-03-15 21:27:54,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 39 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2022-03-15 21:27:54,313 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 82 transitions. Word has length 12 [2022-03-15 21:27:54,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:27:54,313 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 82 transitions. [2022-03-15 21:27:54,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 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 21:27:54,313 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 82 transitions. [2022-03-15 21:27:54,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:27:54,314 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:27:54,314 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:27:54,332 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 21:27:54,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:54,530 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:27:54,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:27:54,530 INFO L85 PathProgramCache]: Analyzing trace with hash -862418728, now seen corresponding path program 5 times [2022-03-15 21:27:54,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:27:54,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326639100] [2022-03-15 21:27:54,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:27:54,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:27:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:27:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:54,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:27:54,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326639100] [2022-03-15 21:27:54,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326639100] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:27:54,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462063917] [2022-03-15 21:27:54,615 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:27:54,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:54,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:27:54,616 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 21:27:54,618 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 21:27:54,641 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:27:54,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:27:54,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:27:54,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:27:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:54,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:27:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:54,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462063917] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:27:54,837 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:27:54,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2022-03-15 21:27:54,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [190640948] [2022-03-15 21:27:54,838 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:27:54,839 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:27:54,840 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 33 transitions. [2022-03-15 21:27:54,840 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:27:55,045 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [1144#(or (< (+ i1 1) N1) (<= (+ 3 i2) N2) (<= N1 i1)), 1140#(< i1 N1), 1146#(or (<= N1 (+ 2 i1)) (< (+ 3 i1) N1) (<= (+ 3 i2) N2)), 1145#(or (<= N1 (+ i1 1)) (<= (+ 3 i2) N2) (< (+ 2 i1) N1)), 1142#(or (< i1 N1) (<= (+ 2 i2) N2)), 1141#(or (< i2 N2) (< i1 N1)), 1143#(or (< i1 N1) (<= (+ 3 i2) N2))] [2022-03-15 21:27:55,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:27:55,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:27:55,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:27:55,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2022-03-15 21:27:55,046 INFO L87 Difference]: Start difference. First operand 40 states and 82 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 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 21:27:55,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:27:55,249 INFO L93 Difference]: Finished difference Result 82 states and 144 transitions. [2022-03-15 21:27:55,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 21:27:55,249 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 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 21:27:55,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:27:55,250 INFO L225 Difference]: With dead ends: 82 [2022-03-15 21:27:55,250 INFO L226 Difference]: Without dead ends: 74 [2022-03-15 21:27:55,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=280, Invalid=842, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:27:55,251 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:27:55,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:27:55,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-03-15 21:27:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 33. [2022-03-15 21:27:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.0) internal successors, (64), 32 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 21:27:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 64 transitions. [2022-03-15 21:27:55,254 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 64 transitions. Word has length 13 [2022-03-15 21:27:55,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:27:55,254 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 64 transitions. [2022-03-15 21:27:55,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 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 21:27:55,254 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 64 transitions. [2022-03-15 21:27:55,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:27:55,254 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:27:55,255 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:27:55,271 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 21:27:55,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:55,463 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:27:55,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:27:55,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1855117812, now seen corresponding path program 6 times [2022-03-15 21:27:55,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:27:55,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378460306] [2022-03-15 21:27:55,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:27:55,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:27:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:27:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:55,518 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:27:55,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378460306] [2022-03-15 21:27:55,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378460306] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:27:55,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990049904] [2022-03-15 21:27:55,518 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:27:55,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:55,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:27:55,519 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 21:27:55,520 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 21:27:55,538 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:27:55,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:27:55,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:27:55,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:27:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:55,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:27:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:55,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990049904] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:27:55,749 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:27:55,749 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2022-03-15 21:27:55,749 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [160362139] [2022-03-15 21:27:55,750 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:27:55,750 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:27:55,752 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 23 transitions. [2022-03-15 21:27:55,752 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:27:55,835 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [1404#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 1)) (<= i2 i1))), 1403#(and (or (<= N1 i1) (<= (+ i2 1) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1))), 1402#(< i2 N2)] [2022-03-15 21:27:55,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:27:55,835 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:27:55,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:27:55,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:27:55,836 INFO L87 Difference]: Start difference. First operand 33 states and 64 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:55,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:27:55,947 INFO L93 Difference]: Finished difference Result 48 states and 86 transitions. [2022-03-15 21:27:55,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 21:27:55,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 21:27:55,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:27:55,948 INFO L225 Difference]: With dead ends: 48 [2022-03-15 21:27:55,948 INFO L226 Difference]: Without dead ends: 47 [2022-03-15 21:27:55,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:27:55,949 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:27:55,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:27:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-03-15 21:27:55,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2022-03-15 21:27:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 60 transitions. [2022-03-15 21:27:55,952 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 60 transitions. Word has length 13 [2022-03-15 21:27:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:27:55,952 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 60 transitions. [2022-03-15 21:27:55,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 60 transitions. [2022-03-15 21:27:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:27:55,952 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:27:55,952 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:27:55,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 21:27:56,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:56,166 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:27:56,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:27:56,166 INFO L85 PathProgramCache]: Analyzing trace with hash -965261535, now seen corresponding path program 7 times [2022-03-15 21:27:56,167 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:27:56,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155992152] [2022-03-15 21:27:56,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:27:56,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:27:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:27:56,245 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 21:27:56,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:27:56,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155992152] [2022-03-15 21:27:56,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155992152] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:27:56,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575470109] [2022-03-15 21:27:56,246 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:27:56,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:56,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:27:56,247 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 21:27:56,248 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 21:27:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:27:56,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 21:27:56,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:27:56,312 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 21:27:56,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:27:56,359 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 21:27:56,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575470109] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:27:56,359 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:27:56,359 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-03-15 21:27:56,359 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [210253776] [2022-03-15 21:27:56,359 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:27:56,360 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:27:56,362 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 38 transitions. [2022-03-15 21:27:56,362 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:27:56,515 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:27:56,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:27:56,515 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:27:56,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:27:56,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:27:56,516 INFO L87 Difference]: Start difference. First operand 31 states and 60 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:56,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:27:56,576 INFO L93 Difference]: Finished difference Result 81 states and 151 transitions. [2022-03-15 21:27:56,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:27:56,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 21:27:56,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:27:56,577 INFO L225 Difference]: With dead ends: 81 [2022-03-15 21:27:56,577 INFO L226 Difference]: Without dead ends: 69 [2022-03-15 21:27:56,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:27:56,577 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:27:56,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:27:56,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-03-15 21:27:56,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 53. [2022-03-15 21:27:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 2.1538461538461537) internal successors, (112), 52 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:56,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 112 transitions. [2022-03-15 21:27:56,580 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 112 transitions. Word has length 14 [2022-03-15 21:27:56,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:27:56,581 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 112 transitions. [2022-03-15 21:27:56,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:56,581 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 112 transitions. [2022-03-15 21:27:56,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:27:56,581 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:27:56,581 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:27:56,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 21:27:56,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 21:27:56,798 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:27:56,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:27:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1150482144, now seen corresponding path program 8 times [2022-03-15 21:27:56,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:27:56,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255503915] [2022-03-15 21:27:56,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:27:56,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:27:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:27:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:56,876 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:27:56,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255503915] [2022-03-15 21:27:56,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255503915] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:27:56,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095783411] [2022-03-15 21:27:56,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:27:56,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:56,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:27:56,892 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 21:27:56,893 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 21:27:56,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:27:56,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:27:56,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 21:27:56,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:27:57,043 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:57,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:27:57,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:57,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095783411] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:27:57,126 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:27:57,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-03-15 21:27:57,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1759140716] [2022-03-15 21:27:57,126 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:27:57,127 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:27:57,128 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 41 transitions. [2022-03-15 21:27:57,129 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:27:57,370 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [1906#(or (< i2 N2) (< i1 N1)), 1907#(or (< i1 N1) (<= (+ 2 i2) N2)), 1912#(or (<= (+ i2 4) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 1911#(or (<= (+ i2 4) N2) (<= N1 (+ i1 1)) (< (+ 2 i1) N1)), 1908#(or (< i1 N1) (<= (+ 3 i2) N2)), 1910#(or (<= (+ i2 4) N2) (< (+ i1 1) N1) (<= N1 i1)), 1909#(or (<= (+ i2 4) N2) (< i1 N1)), 1905#(< i1 N1), 1913#(or (<= (+ i2 4) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1))] [2022-03-15 21:27:57,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 21:27:57,370 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:27:57,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 21:27:57,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=779, Unknown=0, NotChecked=0, Total=992 [2022-03-15 21:27:57,371 INFO L87 Difference]: Start difference. First operand 53 states and 112 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:27:57,649 INFO L93 Difference]: Finished difference Result 112 states and 200 transitions. [2022-03-15 21:27:57,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 21:27:57,649 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:27:57,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:27:57,649 INFO L225 Difference]: With dead ends: 112 [2022-03-15 21:27:57,649 INFO L226 Difference]: Without dead ends: 96 [2022-03-15 21:27:57,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=474, Invalid=1506, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:27:57,651 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:27:57,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:27:57,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-03-15 21:27:57,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 40. [2022-03-15 21:27:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 79 transitions. [2022-03-15 21:27:57,653 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 79 transitions. Word has length 15 [2022-03-15 21:27:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:27:57,653 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 79 transitions. [2022-03-15 21:27:57,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:57,654 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 79 transitions. [2022-03-15 21:27:57,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:27:57,654 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:27:57,654 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:27:57,685 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 21:27:57,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:57,863 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:27:57,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:27:57,864 INFO L85 PathProgramCache]: Analyzing trace with hash -199852170, now seen corresponding path program 9 times [2022-03-15 21:27:57,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:27:57,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130172432] [2022-03-15 21:27:57,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:27:57,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:27:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:27:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:57,927 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:27:57,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130172432] [2022-03-15 21:27:57,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130172432] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:27:57,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977476547] [2022-03-15 21:27:57,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:27:57,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:57,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:27:57,929 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 21:27:57,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 21:27:57,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:27:57,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 21:27:57,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:27:57,958 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 21:27:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:58,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:27:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:58,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977476547] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:27:58,217 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:27:58,217 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 21 [2022-03-15 21:27:58,218 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [208922372] [2022-03-15 21:27:58,218 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:27:58,219 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:27:58,221 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 27 transitions. [2022-03-15 21:27:58,221 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:27:58,331 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [2238#(< i2 N2), 2241#(and (or (<= N1 (+ 2 i1)) (<= i2 i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 2239#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ 2 i2) i1) (<= N1 i1))), 2240#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 1)) (<= (+ i2 1) i1)))] [2022-03-15 21:27:58,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 21:27:58,332 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:27:58,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 21:27:58,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:27:58,332 INFO L87 Difference]: Start difference. First operand 40 states and 79 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:58,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:27:58,504 INFO L93 Difference]: Finished difference Result 62 states and 114 transitions. [2022-03-15 21:27:58,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:27:58,505 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:27:58,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:27:58,505 INFO L225 Difference]: With dead ends: 62 [2022-03-15 21:27:58,505 INFO L226 Difference]: Without dead ends: 61 [2022-03-15 21:27:58,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=334, Invalid=856, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:27:58,506 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:27:58,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:27:58,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-15 21:27:58,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 37. [2022-03-15 21:27:58,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 73 transitions. [2022-03-15 21:27:58,508 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 73 transitions. Word has length 15 [2022-03-15 21:27:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:27:58,508 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 73 transitions. [2022-03-15 21:27:58,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:58,508 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 73 transitions. [2022-03-15 21:27:58,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:27:58,509 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:27:58,509 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:27:58,525 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 21:27:58,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 21:27:58,715 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:27:58,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:27:58,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1305292839, now seen corresponding path program 10 times [2022-03-15 21:27:58,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:27:58,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392456145] [2022-03-15 21:27:58,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:27:58,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:27:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:27:58,793 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 21:27:58,793 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:27:58,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392456145] [2022-03-15 21:27:58,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392456145] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:27:58,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961697781] [2022-03-15 21:27:58,793 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:27:58,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:58,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:27:58,820 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 21:27:58,821 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 21:27:58,842 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:27:58,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:27:58,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:27:58,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:27:58,888 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 21:27:58,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:27:58,938 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 21:27:58,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961697781] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:27:58,938 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:27:58,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-03-15 21:27:58,938 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [713741210] [2022-03-15 21:27:58,939 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:27:58,940 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:27:58,942 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 46 transitions. [2022-03-15 21:27:58,942 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:27:59,111 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:27:59,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 21:27:59,111 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:27:59,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 21:27:59,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:27:59,112 INFO L87 Difference]: Start difference. First operand 37 states and 73 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 21:27:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:27:59,193 INFO L93 Difference]: Finished difference Result 101 states and 190 transitions. [2022-03-15 21:27:59,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 21:27:59,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 16 [2022-03-15 21:27:59,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:27:59,194 INFO L225 Difference]: With dead ends: 101 [2022-03-15 21:27:59,194 INFO L226 Difference]: Without dead ends: 87 [2022-03-15 21:27:59,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:27:59,195 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:27:59,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:27:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-03-15 21:27:59,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 66. [2022-03-15 21:27:59,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.1846153846153844) internal successors, (142), 65 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:27:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 142 transitions. [2022-03-15 21:27:59,198 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 142 transitions. Word has length 16 [2022-03-15 21:27:59,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:27:59,199 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 142 transitions. [2022-03-15 21:27:59,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 21:27:59,199 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 142 transitions. [2022-03-15 21:27:59,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:27:59,199 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:27:59,199 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:27:59,217 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 21:27:59,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 21:27:59,415 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:27:59,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:27:59,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1086328344, now seen corresponding path program 11 times [2022-03-15 21:27:59,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:27:59,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768904465] [2022-03-15 21:27:59,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:27:59,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:27:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:27:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:59,514 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:27:59,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768904465] [2022-03-15 21:27:59,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768904465] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:27:59,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022462364] [2022-03-15 21:27:59,514 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:27:59,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:27:59,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:27:59,516 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 21:27:59,517 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 21:27:59,537 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:27:59,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:27:59,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 21:27:59,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:27:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:59,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:27:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:27:59,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022462364] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:27:59,813 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:27:59,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2022-03-15 21:27:59,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [930935124] [2022-03-15 21:27:59,813 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:27:59,814 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:27:59,816 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 49 transitions. [2022-03-15 21:27:59,816 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:00,122 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [2858#(or (<= N1 (+ 2 i1)) (< (+ 3 i1) N1) (<= (+ 5 i2) N2)), 2853#(or (< i1 N1) (<= (+ 3 i2) N2)), 2857#(or (<= N1 (+ i1 1)) (<= (+ 5 i2) N2) (< (+ 2 i1) N1)), 2851#(or (< i2 N2) (< i1 N1)), 2859#(or (<= N1 (+ 3 i1)) (<= (+ 5 i2) N2) (< (+ i1 4) N1)), 2852#(or (< i1 N1) (<= (+ 2 i2) N2)), 2854#(or (<= (+ i2 4) N2) (< i1 N1)), 2856#(or (< (+ i1 1) N1) (<= (+ 5 i2) N2) (<= N1 i1)), 2860#(or (<= N1 (+ i1 4)) (<= (+ 5 i2) N2) (< (+ 5 i1) N1)), 2855#(or (< i1 N1) (<= (+ 5 i2) N2)), 2850#(< i1 N1)] [2022-03-15 21:28:00,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:28:00,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:00,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:28:00,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1182, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 21:28:00,123 INFO L87 Difference]: Start difference. First operand 66 states and 142 transitions. Second operand has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 23 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 21:28:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:00,540 INFO L93 Difference]: Finished difference Result 142 states and 256 transitions. [2022-03-15 21:28:00,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 21:28:00,540 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 23 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 17 [2022-03-15 21:28:00,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:00,541 INFO L225 Difference]: With dead ends: 142 [2022-03-15 21:28:00,541 INFO L226 Difference]: Without dead ends: 118 [2022-03-15 21:28:00,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=719, Invalid=2361, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 21:28:00,542 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 132 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:00,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 0 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:28:00,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-03-15 21:28:00,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 47. [2022-03-15 21:28:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 2.0434782608695654) internal successors, (94), 46 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 94 transitions. [2022-03-15 21:28:00,544 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 94 transitions. Word has length 17 [2022-03-15 21:28:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:00,545 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 94 transitions. [2022-03-15 21:28:00,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 23 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 21:28:00,545 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 94 transitions. [2022-03-15 21:28:00,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:28:00,545 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:00,545 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:00,569 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 21:28:00,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 21:28:00,746 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:00,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:00,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2144350324, now seen corresponding path program 12 times [2022-03-15 21:28:00,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:00,747 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538950010] [2022-03-15 21:28:00,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:00,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:00,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:00,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538950010] [2022-03-15 21:28:00,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538950010] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:00,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183018180] [2022-03-15 21:28:00,822 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:28:00,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:00,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:00,823 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 21:28:00,826 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 21:28:00,863 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 21:28:00,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:00,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 21:28:00,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:01,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:01,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183018180] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:01,173 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:01,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 26 [2022-03-15 21:28:01,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [874333882] [2022-03-15 21:28:01,174 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:01,174 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:01,176 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 31 transitions. [2022-03-15 21:28:01,176 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:01,329 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [3258#(and (or (<= N1 (+ 3 i1)) (<= i2 i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 3255#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= N1 i1) (<= (+ 3 i2) i1))), 3256#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 1)) (<= (+ 2 i2) i1))), 3254#(< i2 N2), 3257#(and (or (<= N1 (+ 2 i1)) (<= (+ i2 1) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0)))] [2022-03-15 21:28:01,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 21:28:01,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:01,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 21:28:01,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2022-03-15 21:28:01,330 INFO L87 Difference]: Start difference. First operand 47 states and 94 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:01,502 INFO L93 Difference]: Finished difference Result 76 states and 142 transitions. [2022-03-15 21:28:01,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 21:28:01,502 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 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 21:28:01,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:01,503 INFO L225 Difference]: With dead ends: 76 [2022-03-15 21:28:01,503 INFO L226 Difference]: Without dead ends: 75 [2022-03-15 21:28:01,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=514, Invalid=1378, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 21:28:01,504 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:01,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:28:01,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-03-15 21:28:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 43. [2022-03-15 21:28:01,509 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 21:28:01,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 86 transitions. [2022-03-15 21:28:01,509 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 86 transitions. Word has length 17 [2022-03-15 21:28:01,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:01,510 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 86 transitions. [2022-03-15 21:28:01,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 86 transitions. [2022-03-15 21:28:01,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:28:01,510 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:01,510 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:01,528 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 21:28:01,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 21:28:01,722 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:01,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:01,722 INFO L85 PathProgramCache]: Analyzing trace with hash -683644447, now seen corresponding path program 13 times [2022-03-15 21:28:01,723 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:01,723 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134914264] [2022-03-15 21:28:01,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:01,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:01,804 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:01,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:01,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134914264] [2022-03-15 21:28:01,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134914264] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:01,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295639390] [2022-03-15 21:28:01,805 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:28:01,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:01,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:01,806 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 21:28:01,807 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 21:28:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:01,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:28:01,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:01,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:01,944 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295639390] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:01,944 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:01,944 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2022-03-15 21:28:01,944 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [162372442] [2022-03-15 21:28:01,944 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:01,945 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:01,948 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 54 transitions. [2022-03-15 21:28:01,948 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:02,180 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:28:02,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 21:28:02,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:02,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 21:28:02,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:28:02,181 INFO L87 Difference]: Start difference. First operand 43 states and 86 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:02,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:02,315 INFO L93 Difference]: Finished difference Result 121 states and 229 transitions. [2022-03-15 21:28:02,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:28:02,316 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:28:02,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:02,316 INFO L225 Difference]: With dead ends: 121 [2022-03-15 21:28:02,316 INFO L226 Difference]: Without dead ends: 105 [2022-03-15 21:28:02,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-03-15 21:28:02,317 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:02,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:28:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-03-15 21:28:02,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 79. [2022-03-15 21:28:02,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 2.2051282051282053) internal successors, (172), 78 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:02,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 172 transitions. [2022-03-15 21:28:02,319 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 172 transitions. Word has length 18 [2022-03-15 21:28:02,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:02,320 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 172 transitions. [2022-03-15 21:28:02,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 172 transitions. [2022-03-15 21:28:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:28:02,320 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:02,320 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:02,336 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 21:28:02,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:02,536 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:02,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:02,536 INFO L85 PathProgramCache]: Analyzing trace with hash -143190944, now seen corresponding path program 14 times [2022-03-15 21:28:02,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:02,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681845859] [2022-03-15 21:28:02,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:02,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:02,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:02,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681845859] [2022-03-15 21:28:02,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681845859] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:02,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915391348] [2022-03-15 21:28:02,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:28:02,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:02,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:02,658 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 21:28:02,659 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 21:28:02,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:28:02,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:02,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 21:28:02,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:02,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:02,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915391348] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:02,994 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:02,994 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 32 [2022-03-15 21:28:02,994 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1819946631] [2022-03-15 21:28:02,994 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:02,995 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:03,012 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 57 transitions. [2022-03-15 21:28:03,012 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:03,420 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [3977#(or (< i1 N1) (<= (+ 2 i2) N2)), 3981#(or (< i1 N1) (<= (+ 6 i2) N2)), 3975#(< i1 N1), 3982#(or (< (+ i1 1) N1) (<= (+ 6 i2) N2) (<= N1 i1)), 3979#(or (<= (+ i2 4) N2) (< i1 N1)), 3983#(or (<= N1 (+ i1 1)) (<= (+ 6 i2) N2) (< (+ 2 i1) N1)), 3984#(or (<= N1 (+ 2 i1)) (<= (+ 6 i2) N2) (< (+ 3 i1) N1)), 3985#(or (<= N1 (+ 3 i1)) (<= (+ 6 i2) N2) (< (+ i1 4) N1)), 3978#(or (< i1 N1) (<= (+ 3 i2) N2)), 3980#(or (< i1 N1) (<= (+ 5 i2) N2)), 3976#(or (< i2 N2) (< i1 N1)), 3986#(or (<= N1 (+ i1 4)) (<= (+ 6 i2) N2) (< (+ 5 i1) N1)), 3987#(or (<= N1 (+ 5 i1)) (<= (+ 6 i2) N2) (< (+ 6 i1) N1))] [2022-03-15 21:28:03,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:28:03,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:03,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:28:03,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=1669, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:28:03,422 INFO L87 Difference]: Start difference. First operand 79 states and 172 transitions. Second operand has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 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 21:28:03,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:03,942 INFO L93 Difference]: Finished difference Result 172 states and 312 transitions. [2022-03-15 21:28:03,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 21:28:03,942 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 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) Word has length 19 [2022-03-15 21:28:03,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:03,943 INFO L225 Difference]: With dead ends: 172 [2022-03-15 21:28:03,943 INFO L226 Difference]: Without dead ends: 140 [2022-03-15 21:28:03,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1015, Invalid=3407, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 21:28:03,944 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 123 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:03,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 0 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:28:03,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-03-15 21:28:03,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 54. [2022-03-15 21:28:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.056603773584906) internal successors, (109), 53 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 21:28:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 109 transitions. [2022-03-15 21:28:03,946 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 109 transitions. Word has length 19 [2022-03-15 21:28:03,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:03,946 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 109 transitions. [2022-03-15 21:28:03,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 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 21:28:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 109 transitions. [2022-03-15 21:28:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:28:03,947 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:03,947 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:03,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-15 21:28:04,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 21:28:04,161 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:04,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:04,161 INFO L85 PathProgramCache]: Analyzing trace with hash 149548662, now seen corresponding path program 15 times [2022-03-15 21:28:04,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:04,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608680157] [2022-03-15 21:28:04,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:04,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:04,252 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:04,253 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:04,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608680157] [2022-03-15 21:28:04,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608680157] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:04,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427788312] [2022-03-15 21:28:04,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:28:04,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:04,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:04,262 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 21:28:04,263 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 21:28:04,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 21:28:04,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:04,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 21:28:04,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:04,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:04,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427788312] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:04,674 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:04,674 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 31 [2022-03-15 21:28:04,674 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [932886428] [2022-03-15 21:28:04,674 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:04,675 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:04,677 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 35 transitions. [2022-03-15 21:28:04,677 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:04,857 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [4450#(< i2 N2), 4451#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ i2 4) i1) (<= N1 i1))), 4452#(and (or (<= N1 (+ i1 1)) (<= (+ 3 i2) i1)) (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0))), 4453#(and (or (<= N1 (+ 2 i1)) (<= (+ 2 i2) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 4455#(and (or (<= N1 (+ i1 4)) (<= i2 i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 4454#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1))) (or (<= N1 (+ 3 i1)) (<= (+ i2 1) i1)))] [2022-03-15 21:28:04,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 21:28:04,858 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:04,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 21:28:04,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=1062, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 21:28:04,858 INFO L87 Difference]: Start difference. First operand 54 states and 109 transitions. Second operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:05,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:05,093 INFO L93 Difference]: Finished difference Result 90 states and 170 transitions. [2022-03-15 21:28:05,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 21:28:05,094 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:28:05,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:05,094 INFO L225 Difference]: With dead ends: 90 [2022-03-15 21:28:05,094 INFO L226 Difference]: Without dead ends: 89 [2022-03-15 21:28:05,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=731, Invalid=2025, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:28:05,095 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:05,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:28:05,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-03-15 21:28:05,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 49. [2022-03-15 21:28:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 99 transitions. [2022-03-15 21:28:05,097 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 99 transitions. Word has length 19 [2022-03-15 21:28:05,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:05,097 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 99 transitions. [2022-03-15 21:28:05,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 99 transitions. [2022-03-15 21:28:05,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:28:05,098 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:05,098 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:05,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-15 21:28:05,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 21:28:05,308 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:05,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:05,308 INFO L85 PathProgramCache]: Analyzing trace with hash -144036711, now seen corresponding path program 16 times [2022-03-15 21:28:05,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:05,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927368555] [2022-03-15 21:28:05,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:05,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:05,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:05,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927368555] [2022-03-15 21:28:05,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927368555] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:05,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711864724] [2022-03-15 21:28:05,396 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:28:05,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:05,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:05,397 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 21:28:05,398 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 21:28:05,423 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:28:05,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:05,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:28:05,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:05,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:05,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711864724] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:05,555 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:05,555 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-03-15 21:28:05,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [503759950] [2022-03-15 21:28:05,556 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:05,557 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:05,560 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 62 transitions. [2022-03-15 21:28:05,560 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:05,834 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:28:05,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:28:05,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:05,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:28:05,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:28:05,835 INFO L87 Difference]: Start difference. First operand 49 states and 99 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 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 21:28:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:05,973 INFO L93 Difference]: Finished difference Result 141 states and 268 transitions. [2022-03-15 21:28:05,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 21:28:05,974 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 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 20 [2022-03-15 21:28:05,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:05,974 INFO L225 Difference]: With dead ends: 141 [2022-03-15 21:28:05,974 INFO L226 Difference]: Without dead ends: 123 [2022-03-15 21:28:05,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:28:05,975 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:05,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:28:05,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-03-15 21:28:05,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 92. [2022-03-15 21:28:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.21978021978022) internal successors, (202), 91 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 202 transitions. [2022-03-15 21:28:05,977 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 202 transitions. Word has length 20 [2022-03-15 21:28:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:05,977 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 202 transitions. [2022-03-15 21:28:05,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 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 21:28:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 202 transitions. [2022-03-15 21:28:05,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:28:05,978 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:05,978 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:05,994 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 21:28:06,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:06,187 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:06,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:06,188 INFO L85 PathProgramCache]: Analyzing trace with hash -459263144, now seen corresponding path program 17 times [2022-03-15 21:28:06,189 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:06,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508787448] [2022-03-15 21:28:06,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:06,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:06,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:06,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508787448] [2022-03-15 21:28:06,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508787448] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:06,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992948752] [2022-03-15 21:28:06,329 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:28:06,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:06,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:06,330 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 21:28:06,331 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 21:28:06,354 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:28:06,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:06,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 21:28:06,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:06,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:06,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992948752] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:06,726 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:06,726 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 37 [2022-03-15 21:28:06,726 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [199670514] [2022-03-15 21:28:06,726 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:06,727 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:06,731 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 65 transitions. [2022-03-15 21:28:06,731 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:07,211 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [5286#(or (< i1 N1) (<= (+ 6 i2) N2)), 5280#(< i1 N1), 5282#(or (< i1 N1) (<= (+ 2 i2) N2)), 5283#(or (< i1 N1) (<= (+ 3 i2) N2)), 5290#(or (<= (+ 7 i2) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 5285#(or (< i1 N1) (<= (+ 5 i2) N2)), 5287#(or (<= (+ 7 i2) N2) (< i1 N1)), 5294#(or (<= (+ 7 i2) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 5291#(or (<= (+ 7 i2) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 5289#(or (<= N1 (+ i1 1)) (<= (+ 7 i2) N2) (< (+ 2 i1) N1)), 5288#(or (< (+ i1 1) N1) (<= (+ 7 i2) N2) (<= N1 i1)), 5281#(or (< i2 N2) (< i1 N1)), 5293#(or (<= N1 (+ 5 i1)) (<= (+ 7 i2) N2) (< (+ 6 i1) N1)), 5292#(or (<= N1 (+ i1 4)) (<= (+ 7 i2) N2) (< (+ 5 i1) N1)), 5284#(or (<= (+ i2 4) N2) (< i1 N1))] [2022-03-15 21:28:07,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:28:07,212 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:07,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:28:07,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=2240, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:28:07,213 INFO L87 Difference]: Start difference. First operand 92 states and 202 transitions. Second operand has 32 states, 32 states have (on average 1.8125) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:07,855 INFO L93 Difference]: Finished difference Result 202 states and 368 transitions. [2022-03-15 21:28:07,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 21:28:07,855 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.8125) internal successors, (58), 31 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 21 [2022-03-15 21:28:07,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:07,856 INFO L225 Difference]: With dead ends: 202 [2022-03-15 21:28:07,856 INFO L226 Difference]: Without dead ends: 162 [2022-03-15 21:28:07,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1896 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1362, Invalid=4644, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 21:28:07,858 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 148 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:07,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 0 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:28:07,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-03-15 21:28:07,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 61. [2022-03-15 21:28:07,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 2.066666666666667) internal successors, (124), 60 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 124 transitions. [2022-03-15 21:28:07,860 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 124 transitions. Word has length 21 [2022-03-15 21:28:07,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:07,860 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 124 transitions. [2022-03-15 21:28:07,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.8125) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:07,861 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 124 transitions. [2022-03-15 21:28:07,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:28:07,861 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:07,861 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:07,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 21:28:08,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:08,075 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:08,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:08,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1685260556, now seen corresponding path program 18 times [2022-03-15 21:28:08,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:08,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753765645] [2022-03-15 21:28:08,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:08,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:08,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:08,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753765645] [2022-03-15 21:28:08,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753765645] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:08,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367880361] [2022-03-15 21:28:08,153 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:28:08,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:08,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:08,154 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 21:28:08,159 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 21:28:08,198 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 21:28:08,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:08,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 21:28:08,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:08,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:08,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367880361] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:08,580 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:08,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 36 [2022-03-15 21:28:08,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1800902465] [2022-03-15 21:28:08,580 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:08,581 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:08,583 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2022-03-15 21:28:08,583 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:08,794 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [5830#(and (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 4)) (<= (+ i2 1) i1))), 5827#(and (or (<= (+ i2 4) i1) (<= N1 (+ i1 1))) (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0))), 5831#(and (or (<= N1 (+ 5 i1)) (<= i2 i1)) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 5826#(and (or (<= (+ 5 i2) i1) (<= N1 i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1))), 5832#(< i2 N2), 5828#(and (or (<= N1 (+ 2 i1)) (<= (+ 3 i2) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 5829#(and (or (<= N1 (+ 3 i1)) (<= (+ 2 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1))))] [2022-03-15 21:28:08,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 21:28:08,794 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:08,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 21:28:08,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1441, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 21:28:08,795 INFO L87 Difference]: Start difference. First operand 61 states and 124 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:09,093 INFO L93 Difference]: Finished difference Result 104 states and 198 transitions. [2022-03-15 21:28:09,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 21:28:09,093 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:28:09,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:09,093 INFO L225 Difference]: With dead ends: 104 [2022-03-15 21:28:09,094 INFO L226 Difference]: Without dead ends: 103 [2022-03-15 21:28:09,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=985, Invalid=2797, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 21:28:09,095 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:09,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:28:09,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-03-15 21:28:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 55. [2022-03-15 21:28:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.074074074074074) internal successors, (112), 54 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 112 transitions. [2022-03-15 21:28:09,097 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 112 transitions. Word has length 21 [2022-03-15 21:28:09,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:09,097 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 112 transitions. [2022-03-15 21:28:09,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 112 transitions. [2022-03-15 21:28:09,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:28:09,097 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:09,097 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:09,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 21:28:09,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:09,298 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:09,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:09,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1352340319, now seen corresponding path program 19 times [2022-03-15 21:28:09,299 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:09,299 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356505758] [2022-03-15 21:28:09,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:09,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:09,400 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:09,400 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:09,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356505758] [2022-03-15 21:28:09,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356505758] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:09,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294516499] [2022-03-15 21:28:09,400 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:28:09,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:09,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:09,401 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 21:28:09,402 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 21:28:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:09,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 21:28:09,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:09,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:09,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294516499] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:09,577 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:09,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2022-03-15 21:28:09,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [102946502] [2022-03-15 21:28:09,577 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:09,578 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:09,582 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 70 transitions. [2022-03-15 21:28:09,582 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:09,814 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:28:09,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 21:28:09,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:09,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 21:28:09,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-03-15 21:28:09,816 INFO L87 Difference]: Start difference. First operand 55 states and 112 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:09,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:09,962 INFO L93 Difference]: Finished difference Result 161 states and 307 transitions. [2022-03-15 21:28:09,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 21:28:09,962 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 21:28:09,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:09,962 INFO L225 Difference]: With dead ends: 161 [2022-03-15 21:28:09,963 INFO L226 Difference]: Without dead ends: 141 [2022-03-15 21:28:09,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-03-15 21:28:09,963 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:09,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:28:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-03-15 21:28:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2022-03-15 21:28:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 2.230769230769231) internal successors, (232), 104 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 232 transitions. [2022-03-15 21:28:09,965 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 232 transitions. Word has length 22 [2022-03-15 21:28:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:09,966 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 232 transitions. [2022-03-15 21:28:09,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 232 transitions. [2022-03-15 21:28:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:28:09,966 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:09,966 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:09,989 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 21:28:10,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-03-15 21:28:10,182 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:10,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:10,182 INFO L85 PathProgramCache]: Analyzing trace with hash 657735584, now seen corresponding path program 20 times [2022-03-15 21:28:10,183 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:10,183 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343734321] [2022-03-15 21:28:10,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:10,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:10,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:10,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343734321] [2022-03-15 21:28:10,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343734321] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:10,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850073404] [2022-03-15 21:28:10,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:28:10,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:10,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:10,340 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 21:28:10,340 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 21:28:10,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:28:10,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:10,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:28:10,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:10,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:10,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850073404] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:10,810 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:10,810 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 42 [2022-03-15 21:28:10,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [881027600] [2022-03-15 21:28:10,810 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:10,811 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:10,816 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 73 transitions. [2022-03-15 21:28:10,816 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:11,337 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [6779#(or (<= N1 (+ 5 i1)) (<= (+ i2 8) N2) (< (+ 6 i1) N1)), 6769#(or (<= (+ i2 4) N2) (< i1 N1)), 6776#(or (<= N1 (+ 2 i1)) (< (+ 3 i1) N1) (<= (+ i2 8) N2)), 6781#(or (<= N1 (+ 7 i1)) (< (+ i1 8) N1) (<= (+ i2 8) N2)), 6771#(or (< i1 N1) (<= (+ 6 i2) N2)), 6770#(or (< i1 N1) (<= (+ 5 i2) N2)), 6774#(or (< (+ i1 1) N1) (<= (+ i2 8) N2) (<= N1 i1)), 6780#(or (< (+ 7 i1) N1) (<= N1 (+ 6 i1)) (<= (+ i2 8) N2)), 6773#(or (< i1 N1) (<= (+ i2 8) N2)), 6768#(or (< i1 N1) (<= (+ 3 i2) N2)), 6775#(or (<= N1 (+ i1 1)) (<= (+ i2 8) N2) (< (+ 2 i1) N1)), 6778#(or (<= N1 (+ i1 4)) (< (+ 5 i1) N1) (<= (+ i2 8) N2)), 6777#(or (<= N1 (+ 3 i1)) (< (+ i1 4) N1) (<= (+ i2 8) N2)), 6765#(< i1 N1), 6767#(or (< i1 N1) (<= (+ 2 i2) N2)), 6772#(or (<= (+ 7 i2) N2) (< i1 N1)), 6766#(or (< i2 N2) (< i1 N1))] [2022-03-15 21:28:11,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:28:11,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:11,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:28:11,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=2895, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 21:28:11,338 INFO L87 Difference]: Start difference. First operand 105 states and 232 transitions. Second operand has 36 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:12,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:12,075 INFO L93 Difference]: Finished difference Result 232 states and 424 transitions. [2022-03-15 21:28:12,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 21:28:12,075 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 21:28:12,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:12,076 INFO L225 Difference]: With dead ends: 232 [2022-03-15 21:28:12,076 INFO L226 Difference]: Without dead ends: 184 [2022-03-15 21:28:12,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2516 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1760, Invalid=6072, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 21:28:12,078 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 196 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:12,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 0 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:28:12,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-03-15 21:28:12,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 68. [2022-03-15 21:28:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 2.074626865671642) internal successors, (139), 67 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:12,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 139 transitions. [2022-03-15 21:28:12,080 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 139 transitions. Word has length 23 [2022-03-15 21:28:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:12,081 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 139 transitions. [2022-03-15 21:28:12,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:12,081 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 139 transitions. [2022-03-15 21:28:12,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:28:12,081 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:12,081 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:12,098 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 21:28:12,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 21:28:12,282 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:12,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:12,282 INFO L85 PathProgramCache]: Analyzing trace with hash 78024054, now seen corresponding path program 21 times [2022-03-15 21:28:12,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:12,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089522960] [2022-03-15 21:28:12,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:12,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:12,386 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:12,386 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:12,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089522960] [2022-03-15 21:28:12,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089522960] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:12,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509637845] [2022-03-15 21:28:12,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:28:12,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:12,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:12,392 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 21:28:12,393 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 21:28:12,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 21:28:12,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:12,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:28:12,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:12,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:12,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509637845] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:12,924 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:12,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 17] total 41 [2022-03-15 21:28:12,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1811402750] [2022-03-15 21:28:12,924 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:12,925 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:12,928 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 43 transitions. [2022-03-15 21:28:12,928 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:13,103 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [7386#(and (or (<= N1 (+ 3 i1)) (<= (+ 3 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 7382#(< i2 N2), 7387#(and (or (<= N1 (+ i1 4)) (<= (+ 2 i2) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 7383#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ 6 i2) i1) (<= N1 i1))), 7385#(and (or (<= (+ i2 4) i1) (<= N1 (+ 2 i1))) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 7388#(and (or (<= N1 (+ 5 i1)) (<= (+ i2 1) i1)) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 7384#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 1)) (<= (+ 5 i2) i1))), 7389#(and (or (<= N1 (+ 6 i1)) (<= i2 i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1))))] [2022-03-15 21:28:13,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:28:13,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:13,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:28:13,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=1878, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:28:13,104 INFO L87 Difference]: Start difference. First operand 68 states and 139 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:13,447 INFO L93 Difference]: Finished difference Result 118 states and 226 transitions. [2022-03-15 21:28:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 21:28:13,448 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 21:28:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:13,448 INFO L225 Difference]: With dead ends: 118 [2022-03-15 21:28:13,448 INFO L226 Difference]: Without dead ends: 117 [2022-03-15 21:28:13,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1276, Invalid=3694, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 21:28:13,450 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:13,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:28:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-03-15 21:28:13,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 61. [2022-03-15 21:28:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 60 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 125 transitions. [2022-03-15 21:28:13,452 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 125 transitions. Word has length 23 [2022-03-15 21:28:13,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:13,452 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 125 transitions. [2022-03-15 21:28:13,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 125 transitions. [2022-03-15 21:28:13,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 21:28:13,452 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:13,452 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:13,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-03-15 21:28:13,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:13,653 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:13,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:13,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1085118119, now seen corresponding path program 22 times [2022-03-15 21:28:13,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:13,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736400902] [2022-03-15 21:28:13,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:13,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:13,753 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:13,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736400902] [2022-03-15 21:28:13,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736400902] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:13,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590761396] [2022-03-15 21:28:13,753 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:28:13,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:13,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:13,754 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 21:28:13,755 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 21:28:13,778 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:28:13,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:13,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 21:28:13,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:13,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:13,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590761396] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:13,943 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:13,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2022-03-15 21:28:13,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [605919113] [2022-03-15 21:28:13,943 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:13,944 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:13,949 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 78 transitions. [2022-03-15 21:28:13,949 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:14,305 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:28:14,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 21:28:14,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:14,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 21:28:14,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:28:14,306 INFO L87 Difference]: Start difference. First operand 61 states and 125 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:14,574 INFO L93 Difference]: Finished difference Result 181 states and 346 transitions. [2022-03-15 21:28:14,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 21:28:14,575 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 21:28:14,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:14,575 INFO L225 Difference]: With dead ends: 181 [2022-03-15 21:28:14,575 INFO L226 Difference]: Without dead ends: 159 [2022-03-15 21:28:14,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:28:14,579 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:14,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:28:14,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-03-15 21:28:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 118. [2022-03-15 21:28:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.2393162393162394) internal successors, (262), 117 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 262 transitions. [2022-03-15 21:28:14,582 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 262 transitions. Word has length 24 [2022-03-15 21:28:14,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:14,582 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 262 transitions. [2022-03-15 21:28:14,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 262 transitions. [2022-03-15 21:28:14,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:28:14,583 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:14,583 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:14,619 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 21:28:14,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:14,798 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:14,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:14,799 INFO L85 PathProgramCache]: Analyzing trace with hash -2137458536, now seen corresponding path program 23 times [2022-03-15 21:28:14,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:14,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932473895] [2022-03-15 21:28:14,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:14,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:14,966 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:14,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932473895] [2022-03-15 21:28:14,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932473895] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:14,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691958335] [2022-03-15 21:28:14,967 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:28:14,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:14,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:14,969 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 21:28:14,969 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 21:28:14,998 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 21:28:14,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:15,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:28:15,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:15,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:15,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691958335] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:15,510 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:15,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 47 [2022-03-15 21:28:15,510 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [591646764] [2022-03-15 21:28:15,510 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:15,512 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:15,517 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 81 transitions. [2022-03-15 21:28:15,517 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:16,214 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [8431#(or (< i2 N2) (< i1 N1)), 8436#(or (< i1 N1) (<= (+ 6 i2) N2)), 8440#(or (< (+ i1 1) N1) (<= (+ 9 i2) N2) (<= N1 i1)), 8432#(or (< i1 N1) (<= (+ 2 i2) N2)), 8433#(or (< i1 N1) (<= (+ 3 i2) N2)), 8445#(or (<= N1 (+ 5 i1)) (<= (+ 9 i2) N2) (< (+ 6 i1) N1)), 8439#(or (<= (+ 9 i2) N2) (< i1 N1)), 8444#(or (<= N1 (+ i1 4)) (<= (+ 9 i2) N2) (< (+ 5 i1) N1)), 8434#(or (<= (+ i2 4) N2) (< i1 N1)), 8435#(or (< i1 N1) (<= (+ 5 i2) N2)), 8446#(or (<= (+ 9 i2) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 8437#(or (<= (+ 7 i2) N2) (< i1 N1)), 8448#(or (< (+ 9 i1) N1) (<= (+ 9 i2) N2) (<= N1 (+ i1 8))), 8443#(or (<= (+ 9 i2) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 8447#(or (<= N1 (+ 7 i1)) (<= (+ 9 i2) N2) (< (+ i1 8) N1)), 8438#(or (< i1 N1) (<= (+ i2 8) N2)), 8430#(< i1 N1), 8442#(or (<= (+ 9 i2) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 8441#(or (<= N1 (+ i1 1)) (<= (+ 9 i2) N2) (< (+ 2 i1) N1))] [2022-03-15 21:28:16,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 21:28:16,214 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:16,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 21:28:16,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=788, Invalid=3634, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 21:28:16,215 INFO L87 Difference]: Start difference. First operand 118 states and 262 transitions. Second operand has 40 states, 40 states have (on average 1.8) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:17,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:17,136 INFO L93 Difference]: Finished difference Result 262 states and 480 transitions. [2022-03-15 21:28:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 21:28:17,137 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.8) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:28:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:17,137 INFO L225 Difference]: With dead ends: 262 [2022-03-15 21:28:17,137 INFO L226 Difference]: Without dead ends: 206 [2022-03-15 21:28:17,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3224 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2209, Invalid=7691, Unknown=0, NotChecked=0, Total=9900 [2022-03-15 21:28:17,138 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 210 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:17,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 0 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:28:17,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-03-15 21:28:17,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 75. [2022-03-15 21:28:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 2.081081081081081) internal successors, (154), 74 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 154 transitions. [2022-03-15 21:28:17,141 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 154 transitions. Word has length 25 [2022-03-15 21:28:17,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:17,141 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 154 transitions. [2022-03-15 21:28:17,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.8) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 154 transitions. [2022-03-15 21:28:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:28:17,141 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:17,141 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:17,159 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 21:28:17,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 21:28:17,348 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:17,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:17,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1269116276, now seen corresponding path program 24 times [2022-03-15 21:28:17,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:17,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112539057] [2022-03-15 21:28:17,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:17,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:17,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:17,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112539057] [2022-03-15 21:28:17,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112539057] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:17,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948367095] [2022-03-15 21:28:17,469 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:28:17,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:17,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:17,470 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 21:28:17,471 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 21:28:17,495 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 21:28:17,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:17,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:28:17,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:17,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:18,057 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:18,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948367095] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:18,058 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:18,058 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 19] total 46 [2022-03-15 21:28:18,058 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1251636783] [2022-03-15 21:28:18,058 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:18,060 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:18,063 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 47 transitions. [2022-03-15 21:28:18,063 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:18,384 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [9119#(and (or (<= N1 (+ i1 1)) (<= (+ 6 i2) i1)) (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0))), 9118#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ 7 i2) i1) (<= N1 i1))), 9120#(and (or (<= N1 (+ 2 i1)) (<= (+ 5 i2) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 9124#(and (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 5 i1)) (<= (+ 2 i2) i1))), 9123#(< i2 N2), 9122#(and (or (<= N1 (+ i1 4)) (<= (+ 3 i2) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 9121#(and (or (<= (+ i2 4) i1) (<= N1 (+ 3 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 9125#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1))) (or (<= N1 (+ 6 i1)) (<= (+ i2 1) i1))), 9126#(and (or (<= N1 (+ 7 i1)) (<= i2 i1)) (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)))] [2022-03-15 21:28:18,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 21:28:18,384 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:18,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 21:28:18,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=707, Invalid=2373, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 21:28:18,385 INFO L87 Difference]: Start difference. First operand 75 states and 154 transitions. Second operand has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:18,689 INFO L93 Difference]: Finished difference Result 132 states and 254 transitions. [2022-03-15 21:28:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:28:18,689 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:28:18,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:18,690 INFO L225 Difference]: With dead ends: 132 [2022-03-15 21:28:18,690 INFO L226 Difference]: Without dead ends: 131 [2022-03-15 21:28:18,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1954 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1604, Invalid=4716, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 21:28:18,691 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:18,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:28:18,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-03-15 21:28:18,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 67. [2022-03-15 21:28:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 2.090909090909091) internal successors, (138), 66 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 138 transitions. [2022-03-15 21:28:18,693 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 138 transitions. Word has length 25 [2022-03-15 21:28:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:18,693 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 138 transitions. [2022-03-15 21:28:18,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 138 transitions. [2022-03-15 21:28:18,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 21:28:18,694 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:18,694 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:18,725 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 21:28:18,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 21:28:18,903 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:18,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:18,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1836789919, now seen corresponding path program 25 times [2022-03-15 21:28:18,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:18,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718889338] [2022-03-15 21:28:18,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:18,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:19,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:19,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718889338] [2022-03-15 21:28:19,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718889338] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:19,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053470934] [2022-03-15 21:28:19,023 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:28:19,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:19,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:19,033 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 21:28:19,034 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 21:28:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:19,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 21:28:19,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:19,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:19,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053470934] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:19,184 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:19,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2022-03-15 21:28:19,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [261821892] [2022-03-15 21:28:19,184 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:19,186 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:19,191 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 86 transitions. [2022-03-15 21:28:19,192 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:19,499 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:28:19,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:28:19,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:19,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:28:19,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:28:19,500 INFO L87 Difference]: Start difference. First operand 67 states and 138 transitions. Second operand has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:19,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:19,723 INFO L93 Difference]: Finished difference Result 201 states and 385 transitions. [2022-03-15 21:28:19,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 21:28:19,724 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 21:28:19,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:19,725 INFO L225 Difference]: With dead ends: 201 [2022-03-15 21:28:19,725 INFO L226 Difference]: Without dead ends: 177 [2022-03-15 21:28:19,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:28:19,725 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:19,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:28:19,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-03-15 21:28:19,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 131. [2022-03-15 21:28:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 2.246153846153846) internal successors, (292), 130 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 292 transitions. [2022-03-15 21:28:19,730 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 292 transitions. Word has length 26 [2022-03-15 21:28:19,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:19,730 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 292 transitions. [2022-03-15 21:28:19,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 292 transitions. [2022-03-15 21:28:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:28:19,731 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:19,731 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:19,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-03-15 21:28:19,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 21:28:19,946 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:19,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:19,947 INFO L85 PathProgramCache]: Analyzing trace with hash 476351200, now seen corresponding path program 26 times [2022-03-15 21:28:19,947 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:19,947 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122181773] [2022-03-15 21:28:19,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:19,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:20,145 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:20,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122181773] [2022-03-15 21:28:20,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122181773] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:20,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748914988] [2022-03-15 21:28:20,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:28:20,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:20,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:20,146 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 21:28:20,147 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 21:28:20,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:28:20,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:20,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:28:20,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:20,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:20,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748914988] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:20,575 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:20,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 52 [2022-03-15 21:28:20,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [167368906] [2022-03-15 21:28:20,576 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:20,578 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:20,584 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 89 transitions. [2022-03-15 21:28:20,584 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:21,113 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [10294#(or (<= (+ i2 10) N2) (< (+ 9 i1) N1) (<= N1 (+ i1 8))), 10286#(or (<= (+ i2 10) N2) (< (+ i1 1) N1) (<= N1 i1)), 10283#(or (< i1 N1) (<= (+ i2 8) N2)), 10285#(or (<= (+ i2 10) N2) (< i1 N1)), 10282#(or (<= (+ 7 i2) N2) (< i1 N1)), 10289#(or (<= (+ i2 10) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 10280#(or (< i1 N1) (<= (+ 5 i2) N2)), 10290#(or (<= N1 (+ i1 4)) (<= (+ i2 10) N2) (< (+ 5 i1) N1)), 10277#(or (< i1 N1) (<= (+ 2 i2) N2)), 10278#(or (< i1 N1) (<= (+ 3 i2) N2)), 10288#(or (<= (+ i2 10) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 10281#(or (< i1 N1) (<= (+ 6 i2) N2)), 10276#(or (< i2 N2) (< i1 N1)), 10291#(or (<= (+ i2 10) N2) (<= N1 (+ 5 i1)) (< (+ 6 i1) N1)), 10284#(or (<= (+ 9 i2) N2) (< i1 N1)), 10275#(< i1 N1), 10292#(or (<= (+ i2 10) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 10293#(or (<= N1 (+ 7 i1)) (<= (+ i2 10) N2) (< (+ i1 8) N1)), 10279#(or (<= (+ i2 4) N2) (< i1 N1)), 10295#(or (<= (+ i2 10) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 10287#(or (<= (+ i2 10) N2) (<= N1 (+ i1 1)) (< (+ 2 i1) N1))] [2022-03-15 21:28:21,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 21:28:21,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:21,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 21:28:21,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=945, Invalid=4457, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 21:28:21,115 INFO L87 Difference]: Start difference. First operand 131 states and 292 transitions. Second operand has 44 states, 44 states have (on average 1.7954545454545454) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:22,126 INFO L93 Difference]: Finished difference Result 292 states and 536 transitions. [2022-03-15 21:28:22,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 21:28:22,126 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.7954545454545454) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:28:22,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:22,127 INFO L225 Difference]: With dead ends: 292 [2022-03-15 21:28:22,127 INFO L226 Difference]: Without dead ends: 228 [2022-03-15 21:28:22,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4020 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2709, Invalid=9501, Unknown=0, NotChecked=0, Total=12210 [2022-03-15 21:28:22,129 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 234 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:22,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 0 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:28:22,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-03-15 21:28:22,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 82. [2022-03-15 21:28:22,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 2.0864197530864197) internal successors, (169), 81 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 169 transitions. [2022-03-15 21:28:22,132 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 169 transitions. Word has length 27 [2022-03-15 21:28:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:22,132 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 169 transitions. [2022-03-15 21:28:22,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.7954545454545454) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 169 transitions. [2022-03-15 21:28:22,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:28:22,132 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:22,132 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:22,148 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 21:28:22,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 21:28:22,341 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:22,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:22,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1010279306, now seen corresponding path program 27 times [2022-03-15 21:28:22,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:22,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110324057] [2022-03-15 21:28:22,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:22,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:22,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:22,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110324057] [2022-03-15 21:28:22,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110324057] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:22,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482554322] [2022-03-15 21:28:22,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:28:22,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:22,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:22,481 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:28:22,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 21:28:22,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-03-15 21:28:22,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:22,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:28:22,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:22,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:23,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482554322] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:23,240 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:23,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 21] total 51 [2022-03-15 21:28:23,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [325739621] [2022-03-15 21:28:23,240 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:23,242 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:23,247 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 51 transitions. [2022-03-15 21:28:23,247 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:23,520 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [11040#(and (or (<= N1 (+ 5 i1)) (<= (+ 3 i2) i1)) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 11035#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ i2 8) i1) (<= N1 i1))), 11043#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= N1 (+ i1 8)) (<= i2 i1))), 11036#(and (or (<= (+ 7 i2) i1) (<= N1 (+ i1 1))) (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0))), 11037#(and (or (<= N1 (+ 2 i1)) (<= (+ 6 i2) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 11038#(and (or (<= N1 (+ 3 i1)) (<= (+ 5 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 11041#(and (or (<= N1 (+ 6 i1)) (<= (+ 2 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 11039#(and (or (<= N1 (+ i1 4)) (<= (+ i2 4) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 11034#(< i2 N2), 11042#(and (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 7 i1)) (<= (+ i2 1) i1)))] [2022-03-15 21:28:23,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:28:23,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:23,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:28:23,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=856, Invalid=2926, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 21:28:23,521 INFO L87 Difference]: Start difference. First operand 82 states and 169 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:23,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:23,930 INFO L93 Difference]: Finished difference Result 146 states and 282 transitions. [2022-03-15 21:28:23,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 21:28:23,930 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:28:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:23,930 INFO L225 Difference]: With dead ends: 146 [2022-03-15 21:28:23,931 INFO L226 Difference]: Without dead ends: 145 [2022-03-15 21:28:23,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2451 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1969, Invalid=5863, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 21:28:23,932 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:23,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:28:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-03-15 21:28:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 73. [2022-03-15 21:28:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 2.0972222222222223) internal successors, (151), 72 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 151 transitions. [2022-03-15 21:28:23,934 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 151 transitions. Word has length 27 [2022-03-15 21:28:23,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:23,934 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 151 transitions. [2022-03-15 21:28:23,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:23,935 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 151 transitions. [2022-03-15 21:28:23,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 21:28:23,935 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:23,935 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:23,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-03-15 21:28:24,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:24,140 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:24,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:24,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1881900569, now seen corresponding path program 28 times [2022-03-15 21:28:24,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:24,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913042866] [2022-03-15 21:28:24,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:24,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:24,260 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:24,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913042866] [2022-03-15 21:28:24,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913042866] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:24,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760563845] [2022-03-15 21:28:24,261 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:28:24,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:24,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:24,262 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:28:24,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 21:28:24,286 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:28:24,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:24,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 21:28:24,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:24,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:24,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760563845] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:24,420 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:24,420 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2022-03-15 21:28:24,420 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1911640140] [2022-03-15 21:28:24,420 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:24,422 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:24,429 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 94 transitions. [2022-03-15 21:28:24,429 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:24,724 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:28:24,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 21:28:24,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:24,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 21:28:24,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:28:24,726 INFO L87 Difference]: Start difference. First operand 73 states and 151 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:24,922 INFO L93 Difference]: Finished difference Result 221 states and 424 transitions. [2022-03-15 21:28:24,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 21:28:24,923 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 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 28 [2022-03-15 21:28:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:24,923 INFO L225 Difference]: With dead ends: 221 [2022-03-15 21:28:24,923 INFO L226 Difference]: Without dead ends: 195 [2022-03-15 21:28:24,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-03-15 21:28:24,925 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:24,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:28:24,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-03-15 21:28:24,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 144. [2022-03-15 21:28:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 2.2517482517482517) internal successors, (322), 143 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 322 transitions. [2022-03-15 21:28:24,948 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 322 transitions. Word has length 28 [2022-03-15 21:28:24,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:24,948 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 322 transitions. [2022-03-15 21:28:24,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 322 transitions. [2022-03-15 21:28:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:28:24,949 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:24,949 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:24,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 21:28:25,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:25,149 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:25,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash 17456600, now seen corresponding path program 29 times [2022-03-15 21:28:25,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:25,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108667325] [2022-03-15 21:28:25,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:25,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:25,322 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:25,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108667325] [2022-03-15 21:28:25,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108667325] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:25,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780480582] [2022-03-15 21:28:25,322 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:28:25,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:25,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:25,323 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 21:28:25,324 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 21:28:25,356 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 21:28:25,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:25,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:28:25,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:25,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:25,852 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:25,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780480582] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:25,852 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:25,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 57 [2022-03-15 21:28:25,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1839393788] [2022-03-15 21:28:25,853 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:25,855 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:25,862 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 97 transitions. [2022-03-15 21:28:25,862 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:26,469 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [12310#(or (<= (+ i2 10) N2) (< i1 N1)), 12304#(or (<= (+ i2 4) N2) (< i1 N1)), 12309#(or (<= (+ 9 i2) N2) (< i1 N1)), 12305#(or (< i1 N1) (<= (+ 5 i2) N2)), 12308#(or (< i1 N1) (<= (+ i2 8) N2)), 12307#(or (<= (+ 7 i2) N2) (< i1 N1)), 12300#(< i1 N1), 12312#(or (<= (+ i2 11) N2) (< (+ i1 1) N1) (<= N1 i1)), 12315#(or (<= (+ i2 11) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 12313#(or (<= (+ i2 11) N2) (<= N1 (+ i1 1)) (< (+ 2 i1) N1)), 12302#(or (< i1 N1) (<= (+ 2 i2) N2)), 12320#(or (< (+ 9 i1) N1) (<= (+ i2 11) N2) (<= N1 (+ i1 8))), 12301#(or (< i2 N2) (< i1 N1)), 12314#(or (<= (+ i2 11) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 12322#(or (<= (+ i2 11) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 12321#(or (<= (+ i2 11) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 12319#(or (<= N1 (+ 7 i1)) (<= (+ i2 11) N2) (< (+ i1 8) N1)), 12316#(or (<= N1 (+ i1 4)) (<= (+ i2 11) N2) (< (+ 5 i1) N1)), 12318#(or (<= (+ i2 11) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 12303#(or (< i1 N1) (<= (+ 3 i2) N2)), 12317#(or (<= (+ i2 11) N2) (<= N1 (+ 5 i1)) (< (+ 6 i1) N1)), 12311#(or (<= (+ i2 11) N2) (< i1 N1)), 12306#(or (< i1 N1) (<= (+ 6 i2) N2))] [2022-03-15 21:28:26,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-15 21:28:26,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:26,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-15 21:28:26,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1116, Invalid=5364, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 21:28:26,478 INFO L87 Difference]: Start difference. First operand 144 states and 322 transitions. Second operand has 48 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 47 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 21:28:27,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:27,353 INFO L93 Difference]: Finished difference Result 322 states and 592 transitions. [2022-03-15 21:28:27,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 21:28:27,354 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 47 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) Word has length 29 [2022-03-15 21:28:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:27,356 INFO L225 Difference]: With dead ends: 322 [2022-03-15 21:28:27,356 INFO L226 Difference]: Without dead ends: 250 [2022-03-15 21:28:27,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4904 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3260, Invalid=11502, Unknown=0, NotChecked=0, Total=14762 [2022-03-15 21:28:27,357 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 261 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:27,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 0 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:28:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-03-15 21:28:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 89. [2022-03-15 21:28:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 2.090909090909091) internal successors, (184), 88 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 184 transitions. [2022-03-15 21:28:27,377 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 184 transitions. Word has length 29 [2022-03-15 21:28:27,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:27,377 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 184 transitions. [2022-03-15 21:28:27,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 47 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 21:28:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 184 transitions. [2022-03-15 21:28:27,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:28:27,378 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:27,378 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:27,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-03-15 21:28:27,591 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,SelfDestructingSolverStorable31 [2022-03-15 21:28:27,591 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:27,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:27,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1458885620, now seen corresponding path program 30 times [2022-03-15 21:28:27,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:27,593 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025655919] [2022-03-15 21:28:27,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:27,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:27,753 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:27,753 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:27,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025655919] [2022-03-15 21:28:27,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025655919] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:27,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813258937] [2022-03-15 21:28:27,753 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:28:27,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:27,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:27,754 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 21:28:27,755 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 21:28:27,782 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-03-15 21:28:27,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:27,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:28:27,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:28,223 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:28,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:28,589 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:28,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813258937] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:28,589 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:28,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23, 23] total 56 [2022-03-15 21:28:28,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [759632283] [2022-03-15 21:28:28,589 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:28,591 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:28,600 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 55 transitions. [2022-03-15 21:28:28,600 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:28,866 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [13130#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ 9 i2) i1) (<= N1 i1))), 13139#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= N1 (+ i1 8)) (<= (+ i2 1) i1))), 13132#(and (or (<= (+ 7 i2) i1) (<= N1 (+ 2 i1))) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 13135#(< i2 N2), 13138#(and (or (<= N1 (+ 7 i1)) (<= (+ 2 i2) i1)) (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0))), 13131#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 1)) (<= (+ i2 8) i1))), 13134#(and (or (<= N1 (+ i1 4)) (<= (+ 5 i2) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 13140#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1))) (or (<= N1 (+ 9 i1)) (<= i2 i1))), 13137#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1))) (or (<= N1 (+ 6 i1)) (<= (+ 3 i2) i1))), 13133#(and (or (<= (+ 6 i2) i1) (<= N1 (+ 3 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 13136#(and (or (<= (+ i2 4) i1) (<= N1 (+ 5 i1))) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)))] [2022-03-15 21:28:28,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:28:28,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:28,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:28:28,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1019, Invalid=3537, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 21:28:28,878 INFO L87 Difference]: Start difference. First operand 89 states and 184 transitions. Second operand has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:29,254 INFO L93 Difference]: Finished difference Result 160 states and 310 transitions. [2022-03-15 21:28:29,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 21:28:29,254 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 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 29 [2022-03-15 21:28:29,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:29,255 INFO L225 Difference]: With dead ends: 160 [2022-03-15 21:28:29,255 INFO L226 Difference]: Without dead ends: 159 [2022-03-15 21:28:29,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3018 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2371, Invalid=7135, Unknown=0, NotChecked=0, Total=9506 [2022-03-15 21:28:29,255 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:29,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:28:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-03-15 21:28:29,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 79. [2022-03-15 21:28:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 2.1025641025641026) internal successors, (164), 78 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 21:28:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 164 transitions. [2022-03-15 21:28:29,277 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 164 transitions. Word has length 29 [2022-03-15 21:28:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:29,277 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 164 transitions. [2022-03-15 21:28:29,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 164 transitions. [2022-03-15 21:28:29,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 21:28:29,277 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:29,278 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:29,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-03-15 21:28:29,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:29,493 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:29,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash 541069857, now seen corresponding path program 31 times [2022-03-15 21:28:29,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:29,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786730750] [2022-03-15 21:28:29,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:29,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:29,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:29,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786730750] [2022-03-15 21:28:29,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786730750] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:29,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596490219] [2022-03-15 21:28:29,645 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:28:29,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:29,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:29,646 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 21:28:29,648 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 21:28:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:29,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 21:28:29,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:29,779 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:29,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:29,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596490219] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:29,888 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:29,888 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2022-03-15 21:28:29,888 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [661668541] [2022-03-15 21:28:29,888 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:29,891 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:29,899 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 102 transitions. [2022-03-15 21:28:29,899 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:30,283 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:28:30,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 21:28:30,284 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:30,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 21:28:30,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:28:30,284 INFO L87 Difference]: Start difference. First operand 79 states and 164 transitions. Second operand has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:30,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:30,565 INFO L93 Difference]: Finished difference Result 241 states and 463 transitions. [2022-03-15 21:28:30,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 21:28:30,566 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 21:28:30,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:30,566 INFO L225 Difference]: With dead ends: 241 [2022-03-15 21:28:30,566 INFO L226 Difference]: Without dead ends: 213 [2022-03-15 21:28:30,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 102 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:28:30,567 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:30,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:28:30,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-03-15 21:28:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 157. [2022-03-15 21:28:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.2564102564102564) internal successors, (352), 156 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 352 transitions. [2022-03-15 21:28:30,594 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 352 transitions. Word has length 30 [2022-03-15 21:28:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:30,594 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 352 transitions. [2022-03-15 21:28:30,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 352 transitions. [2022-03-15 21:28:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 21:28:30,595 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:30,595 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:30,623 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 21:28:30,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:30,810 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:30,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:30,810 INFO L85 PathProgramCache]: Analyzing trace with hash -188221920, now seen corresponding path program 32 times [2022-03-15 21:28:30,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:30,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777471221] [2022-03-15 21:28:30,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:30,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:31,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:31,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777471221] [2022-03-15 21:28:31,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777471221] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:31,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765577849] [2022-03-15 21:28:31,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:28:31,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:31,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:31,025 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 21:28:31,026 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 21:28:31,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:28:31,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:31,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:28:31,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:31,371 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:31,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:31,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765577849] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:31,564 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:31,564 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 62 [2022-03-15 21:28:31,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [802329441] [2022-03-15 21:28:31,567 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:31,569 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:31,578 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 105 transitions. [2022-03-15 21:28:31,578 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:32,243 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [14510#(or (< i1 N1) (<= (+ 5 i2) N2)), 14520#(or (<= N1 (+ 2 i1)) (<= (+ i2 12) N2) (< (+ 3 i1) N1)), 14507#(or (< i1 N1) (<= (+ 2 i2) N2)), 14521#(or (<= (+ i2 12) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 14529#(or (<= (+ i2 12) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 14523#(or (<= N1 (+ 5 i1)) (<= (+ i2 12) N2) (< (+ 6 i1) N1)), 14527#(or (<= (+ i2 12) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 14519#(or (<= N1 (+ i1 1)) (<= (+ i2 12) N2) (< (+ 2 i1) N1)), 14517#(or (<= (+ i2 12) N2) (< i1 N1)), 14506#(or (< i2 N2) (< i1 N1)), 14522#(or (<= N1 (+ i1 4)) (<= (+ i2 12) N2) (< (+ 5 i1) N1)), 14515#(or (<= (+ i2 10) N2) (< i1 N1)), 14524#(or (< (+ 7 i1) N1) (<= N1 (+ 6 i1)) (<= (+ i2 12) N2)), 14509#(or (<= (+ i2 4) N2) (< i1 N1)), 14525#(or (<= N1 (+ 7 i1)) (<= (+ i2 12) N2) (< (+ i1 8) N1)), 14526#(or (< (+ 9 i1) N1) (<= N1 (+ i1 8)) (<= (+ i2 12) N2)), 14505#(< i1 N1), 14508#(or (< i1 N1) (<= (+ 3 i2) N2)), 14513#(or (< i1 N1) (<= (+ i2 8) N2)), 14518#(or (< (+ i1 1) N1) (<= (+ i2 12) N2) (<= N1 i1)), 14528#(or (<= (+ i2 12) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 14512#(or (<= (+ 7 i2) N2) (< i1 N1)), 14514#(or (<= (+ 9 i2) N2) (< i1 N1)), 14511#(or (< i1 N1) (<= (+ 6 i2) N2)), 14516#(or (<= (+ i2 11) N2) (< i1 N1))] [2022-03-15 21:28:32,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 21:28:32,244 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:32,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 21:28:32,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1301, Invalid=6355, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 21:28:32,245 INFO L87 Difference]: Start difference. First operand 157 states and 352 transitions. Second operand has 52 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 51 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:33,285 INFO L93 Difference]: Finished difference Result 352 states and 648 transitions. [2022-03-15 21:28:33,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 21:28:33,285 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 51 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 21:28:33,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:33,287 INFO L225 Difference]: With dead ends: 352 [2022-03-15 21:28:33,287 INFO L226 Difference]: Without dead ends: 272 [2022-03-15 21:28:33,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5876 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3862, Invalid=13694, Unknown=0, NotChecked=0, Total=17556 [2022-03-15 21:28:33,288 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 352 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:33,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 0 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:28:33,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-03-15 21:28:33,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 96. [2022-03-15 21:28:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.094736842105263) internal successors, (199), 95 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 21:28:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 199 transitions. [2022-03-15 21:28:33,300 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 199 transitions. Word has length 31 [2022-03-15 21:28:33,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:33,300 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 199 transitions. [2022-03-15 21:28:33,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 51 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:33,300 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 199 transitions. [2022-03-15 21:28:33,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 21:28:33,300 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:33,301 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:33,316 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 21:28:33,515 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,SelfDestructingSolverStorable34 [2022-03-15 21:28:33,515 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:33,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:33,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1345627274, now seen corresponding path program 33 times [2022-03-15 21:28:33,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:33,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301976242] [2022-03-15 21:28:33,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:33,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 67 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:33,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:33,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301976242] [2022-03-15 21:28:33,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301976242] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:33,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466590737] [2022-03-15 21:28:33,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:28:33,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:33,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:33,706 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 21:28:33,707 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 21:28:33,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-03-15 21:28:33,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:33,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:28:33,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 67 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:34,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:34,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466590737] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:34,840 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:34,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25, 25] total 61 [2022-03-15 21:28:34,841 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [175021567] [2022-03-15 21:28:34,841 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:34,843 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:34,849 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 59 transitions. [2022-03-15 21:28:34,850 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:35,309 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [15417#(< i2 N2), 15415#(and (or (<= N1 (+ 9 i1)) (<= (+ i2 1) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 15413#(and (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 7 i1)) (<= (+ 3 i2) i1))), 15407#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 9 i2) i1) (<= N1 (+ i1 1)))), 15406#(and (or (<= N1 i1) (<= (+ i2 10) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1))), 15409#(and (or (<= (+ 7 i2) i1) (<= N1 (+ 3 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 15408#(and (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 8) i1) (<= N1 (+ 2 i1)))), 15412#(and (or (<= (+ i2 4) i1) (<= N1 (+ 6 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 15410#(and (or (<= N1 (+ i1 4)) (<= (+ 6 i2) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 15414#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= N1 (+ i1 8)) (<= (+ 2 i2) i1))), 15411#(and (or (<= N1 (+ 5 i1)) (<= (+ 5 i2) i1)) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 15416#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= N1 (+ i1 10)) (<= i2 i1)))] [2022-03-15 21:28:35,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:28:35,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:35,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:28:35,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1196, Invalid=4206, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 21:28:35,310 INFO L87 Difference]: Start difference. First operand 96 states and 199 transitions. Second operand has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:35,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:35,874 INFO L93 Difference]: Finished difference Result 174 states and 338 transitions. [2022-03-15 21:28:35,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 21:28:35,875 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 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 31 [2022-03-15 21:28:35,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:35,875 INFO L225 Difference]: With dead ends: 174 [2022-03-15 21:28:35,875 INFO L226 Difference]: Without dead ends: 173 [2022-03-15 21:28:35,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3643 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2810, Invalid=8532, Unknown=0, NotChecked=0, Total=11342 [2022-03-15 21:28:35,878 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:35,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:28:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-03-15 21:28:35,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 85. [2022-03-15 21:28:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 2.107142857142857) internal successors, (177), 84 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:35,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 177 transitions. [2022-03-15 21:28:35,880 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 177 transitions. Word has length 31 [2022-03-15 21:28:35,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:35,880 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 177 transitions. [2022-03-15 21:28:35,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 177 transitions. [2022-03-15 21:28:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 21:28:35,880 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:35,880 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:35,896 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 21:28:36,084 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,SelfDestructingSolverStorable35 [2022-03-15 21:28:36,085 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:36,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:36,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1539996967, now seen corresponding path program 34 times [2022-03-15 21:28:36,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:36,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338614356] [2022-03-15 21:28:36,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:36,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:36,265 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:36,265 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:36,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338614356] [2022-03-15 21:28:36,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338614356] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:36,266 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919263985] [2022-03-15 21:28:36,266 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:28:36,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:36,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:36,267 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 21:28:36,268 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 21:28:36,298 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:28:36,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:36,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 21:28:36,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:36,411 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:36,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:36,526 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:36,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919263985] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:36,526 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:36,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 13 [2022-03-15 21:28:36,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [22339081] [2022-03-15 21:28:36,526 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:36,529 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:36,538 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 110 transitions. [2022-03-15 21:28:36,538 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:37,069 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:28:37,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 21:28:37,070 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:37,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 21:28:37,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:28:37,071 INFO L87 Difference]: Start difference. First operand 85 states and 177 transitions. Second operand has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 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 21:28:37,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:37,426 INFO L93 Difference]: Finished difference Result 261 states and 502 transitions. [2022-03-15 21:28:37,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:28:37,426 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 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 32 [2022-03-15 21:28:37,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:37,427 INFO L225 Difference]: With dead ends: 261 [2022-03-15 21:28:37,427 INFO L226 Difference]: Without dead ends: 231 [2022-03-15 21:28:37,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:28:37,427 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:37,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:28:37,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-03-15 21:28:37,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 170. [2022-03-15 21:28:37,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 2.260355029585799) internal successors, (382), 169 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 382 transitions. [2022-03-15 21:28:37,431 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 382 transitions. Word has length 32 [2022-03-15 21:28:37,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:37,431 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 382 transitions. [2022-03-15 21:28:37,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 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 21:28:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 382 transitions. [2022-03-15 21:28:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 21:28:37,431 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:37,432 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:37,447 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 21:28:37,647 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,SelfDestructingSolverStorable36 [2022-03-15 21:28:37,647 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:37,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:37,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1985241880, now seen corresponding path program 35 times [2022-03-15 21:28:37,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:37,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107851335] [2022-03-15 21:28:37,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:37,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:37,961 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 78 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:37,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:37,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107851335] [2022-03-15 21:28:37,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107851335] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:37,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126511045] [2022-03-15 21:28:37,961 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:28:37,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:37,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:37,963 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 21:28:37,964 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 21:28:37,992 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-03-15 21:28:37,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:37,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 21:28:37,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 78 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:38,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:38,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126511045] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:38,858 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:38,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 67 [2022-03-15 21:28:38,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [312085584] [2022-03-15 21:28:38,858 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:38,862 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:38,872 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 113 transitions. [2022-03-15 21:28:38,872 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:39,614 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [16898#(or (< i1 N1) (<= (+ i2 8) N2)), 16902#(or (<= (+ i2 12) N2) (< i1 N1)), 16904#(or (< (+ i1 1) N1) (<= N1 i1) (<= (+ i2 13) N2)), 16892#(or (< i1 N1) (<= (+ 2 i2) N2)), 16908#(or (<= N1 (+ i1 4)) (< (+ 5 i1) N1) (<= (+ i2 13) N2)), 16894#(or (<= (+ i2 4) N2) (< i1 N1)), 16893#(or (< i1 N1) (<= (+ 3 i2) N2)), 16915#(or (< (+ i1 12) N1) (<= N1 (+ i1 11)) (<= (+ i2 13) N2)), 16901#(or (<= (+ i2 11) N2) (< i1 N1)), 16916#(or (<= N1 (+ i1 12)) (< (+ i1 13) N1) (<= (+ i2 13) N2)), 16913#(or (<= N1 (+ 9 i1)) (< (+ i1 10) N1) (<= (+ i2 13) N2)), 16907#(or (<= N1 (+ 3 i1)) (< (+ i1 4) N1) (<= (+ i2 13) N2)), 16906#(or (<= N1 (+ 2 i1)) (< (+ 3 i1) N1) (<= (+ i2 13) N2)), 16914#(or (< (+ i1 11) N1) (<= N1 (+ i1 10)) (<= (+ i2 13) N2)), 16912#(or (< (+ 9 i1) N1) (<= N1 (+ i1 8)) (<= (+ i2 13) N2)), 16903#(or (< i1 N1) (<= (+ i2 13) N2)), 16897#(or (<= (+ 7 i2) N2) (< i1 N1)), 16911#(or (<= N1 (+ 7 i1)) (< (+ i1 8) N1) (<= (+ i2 13) N2)), 16909#(or (<= N1 (+ 5 i1)) (<= (+ i2 13) N2) (< (+ 6 i1) N1)), 16891#(or (< i2 N2) (< i1 N1)), 16899#(or (<= (+ 9 i2) N2) (< i1 N1)), 16910#(or (< (+ 7 i1) N1) (<= N1 (+ 6 i1)) (<= (+ i2 13) N2)), 16890#(< i1 N1), 16896#(or (< i1 N1) (<= (+ 6 i2) N2)), 16905#(or (<= N1 (+ i1 1)) (<= (+ i2 13) N2) (< (+ 2 i1) N1)), 16900#(or (<= (+ i2 10) N2) (< i1 N1)), 16895#(or (< i1 N1) (<= (+ 5 i2) N2))] [2022-03-15 21:28:39,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-15 21:28:39,614 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:39,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-15 21:28:39,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1500, Invalid=7430, Unknown=0, NotChecked=0, Total=8930 [2022-03-15 21:28:39,616 INFO L87 Difference]: Start difference. First operand 170 states and 382 transitions. Second operand has 56 states, 56 states have (on average 1.7857142857142858) internal successors, (100), 55 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:40,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:40,902 INFO L93 Difference]: Finished difference Result 382 states and 704 transitions. [2022-03-15 21:28:40,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 21:28:40,902 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.7857142857142858) internal successors, (100), 55 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 21:28:40,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:40,903 INFO L225 Difference]: With dead ends: 382 [2022-03-15 21:28:40,903 INFO L226 Difference]: Without dead ends: 294 [2022-03-15 21:28:40,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6936 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4515, Invalid=16077, Unknown=0, NotChecked=0, Total=20592 [2022-03-15 21:28:40,905 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 377 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:40,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 0 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:28:40,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-03-15 21:28:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 103. [2022-03-15 21:28:40,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 2.0980392156862746) internal successors, (214), 102 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 214 transitions. [2022-03-15 21:28:40,907 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 214 transitions. Word has length 33 [2022-03-15 21:28:40,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:40,908 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 214 transitions. [2022-03-15 21:28:40,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.7857142857142858) internal successors, (100), 55 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 214 transitions. [2022-03-15 21:28:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 21:28:40,908 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:40,908 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:40,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 21:28:41,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:41,123 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:41,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:41,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2124944780, now seen corresponding path program 36 times [2022-03-15 21:28:41,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:41,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073390503] [2022-03-15 21:28:41,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:41,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:41,314 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 79 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:41,314 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:41,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073390503] [2022-03-15 21:28:41,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073390503] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:41,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255939104] [2022-03-15 21:28:41,314 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:28:41,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:41,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:41,322 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 21:28:41,323 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 21:28:41,360 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-03-15 21:28:41,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:41,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 21:28:41,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 79 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:41,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:42,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255939104] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:42,291 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:42,291 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 27, 27] total 66 [2022-03-15 21:28:42,292 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [839302799] [2022-03-15 21:28:42,292 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:42,295 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:42,302 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 63 transitions. [2022-03-15 21:28:42,302 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:42,639 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [17863#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 1)) (<= (+ i2 10) i1))), 17869#(and (or (<= N1 (+ 7 i1)) (<= (+ i2 4) i1)) (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0))), 17871#(and (or (<= N1 (+ 9 i1)) (<= (+ 2 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 17864#(and (or (<= (+ 9 i2) i1) (<= N1 (+ 2 i1))) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 17865#(and (or (<= (+ i2 8) i1) (<= N1 (+ 3 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 17868#(and (or (<= N1 (+ 6 i1)) (<= (+ 5 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 17872#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= N1 (+ i1 10)) (<= (+ i2 1) i1))), 17867#(and (or (<= N1 (+ 5 i1)) (<= (+ 6 i2) i1)) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 17866#(and (or (<= (+ 7 i2) i1) (<= N1 (+ i1 4))) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 17873#(and (or (<= N1 (+ i1 11)) (<= i2 i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11)))), 17862#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ i2 11) i1) (<= N1 i1))), 17874#(< i2 N2), 17870#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= N1 (+ i1 8)) (<= (+ 3 i2) i1)))] [2022-03-15 21:28:42,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 21:28:42,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:42,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 21:28:42,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=4933, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 21:28:42,640 INFO L87 Difference]: Start difference. First operand 103 states and 214 transitions. Second operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 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 21:28:43,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:43,118 INFO L93 Difference]: Finished difference Result 188 states and 366 transitions. [2022-03-15 21:28:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 21:28:43,119 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 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) Word has length 33 [2022-03-15 21:28:43,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:43,119 INFO L225 Difference]: With dead ends: 188 [2022-03-15 21:28:43,119 INFO L226 Difference]: Without dead ends: 187 [2022-03-15 21:28:43,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4321 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3286, Invalid=10054, Unknown=0, NotChecked=0, Total=13340 [2022-03-15 21:28:43,121 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:43,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:28:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-03-15 21:28:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 91. [2022-03-15 21:28:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 2.111111111111111) internal successors, (190), 90 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 190 transitions. [2022-03-15 21:28:43,124 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 190 transitions. Word has length 33 [2022-03-15 21:28:43,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:43,124 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 190 transitions. [2022-03-15 21:28:43,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 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 21:28:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 190 transitions. [2022-03-15 21:28:43,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 21:28:43,125 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:43,125 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:43,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 21:28:43,340 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,SelfDestructingSolverStorable38 [2022-03-15 21:28:43,341 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:43,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:43,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1412871393, now seen corresponding path program 37 times [2022-03-15 21:28:43,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:43,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694302443] [2022-03-15 21:28:43,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:43,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:43,482 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:43,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694302443] [2022-03-15 21:28:43,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694302443] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:43,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937822457] [2022-03-15 21:28:43,482 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:28:43,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:43,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:43,484 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 21:28:43,496 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 21:28:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:43,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 21:28:43,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:43,611 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:43,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:43,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937822457] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:43,675 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:43,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2022-03-15 21:28:43,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [693059314] [2022-03-15 21:28:43,675 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:43,678 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:43,707 INFO L252 McrAutomatonBuilder]: Finished intersection with 77 states and 118 transitions. [2022-03-15 21:28:43,707 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:44,048 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:28:44,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 21:28:44,048 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:44,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 21:28:44,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:28:44,049 INFO L87 Difference]: Start difference. First operand 91 states and 190 transitions. Second operand has 16 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:44,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:44,475 INFO L93 Difference]: Finished difference Result 281 states and 541 transitions. [2022-03-15 21:28:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 21:28:44,476 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 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 34 [2022-03-15 21:28:44,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:44,477 INFO L225 Difference]: With dead ends: 281 [2022-03-15 21:28:44,477 INFO L226 Difference]: Without dead ends: 249 [2022-03-15 21:28:44,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:28:44,477 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:44,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:28:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-03-15 21:28:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 183. [2022-03-15 21:28:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 2.2637362637362637) internal successors, (412), 182 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 412 transitions. [2022-03-15 21:28:44,480 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 412 transitions. Word has length 34 [2022-03-15 21:28:44,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:44,480 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 412 transitions. [2022-03-15 21:28:44,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 412 transitions. [2022-03-15 21:28:44,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 21:28:44,480 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:44,480 INFO L514 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:44,498 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 21:28:44,681 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,SelfDestructingSolverStorable39 [2022-03-15 21:28:44,681 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:44,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:44,681 INFO L85 PathProgramCache]: Analyzing trace with hash 438206816, now seen corresponding path program 38 times [2022-03-15 21:28:44,682 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:44,682 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126355509] [2022-03-15 21:28:44,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:44,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:45,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:45,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126355509] [2022-03-15 21:28:45,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126355509] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:45,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841227705] [2022-03-15 21:28:45,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:28:45,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:45,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:45,037 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 21:28:45,038 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 21:28:45,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:28:45,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:45,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 21:28:45,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:45,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:45,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841227705] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:45,776 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:45,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 72 [2022-03-15 21:28:45,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [998961180] [2022-03-15 21:28:45,776 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:45,790 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:45,802 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 121 transitions. [2022-03-15 21:28:45,802 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:46,623 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [19468#(or (< i1 N1) (<= (+ i2 13) N2)), 19483#(or (<= N1 (+ i1 13)) (<= (+ 14 i2) N2) (< (+ 14 i1) N1)), 19463#(or (< i1 N1) (<= (+ i2 8) N2)), 19472#(or (<= (+ 14 i2) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 19470#(or (< (+ i1 1) N1) (<= (+ 14 i2) N2) (<= N1 i1)), 19460#(or (< i1 N1) (<= (+ 5 i2) N2)), 19467#(or (<= (+ i2 12) N2) (< i1 N1)), 19465#(or (<= (+ i2 10) N2) (< i1 N1)), 19455#(< i1 N1), 19464#(or (<= (+ 9 i2) N2) (< i1 N1)), 19477#(or (<= N1 (+ 7 i1)) (<= (+ 14 i2) N2) (< (+ i1 8) N1)), 19456#(or (< i2 N2) (< i1 N1)), 19473#(or (<= (+ 14 i2) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 19482#(or (<= (+ 14 i2) N2) (<= N1 (+ i1 12)) (< (+ i1 13) N1)), 19476#(or (<= (+ 14 i2) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 19462#(or (<= (+ 7 i2) N2) (< i1 N1)), 19475#(or (<= N1 (+ 5 i1)) (<= (+ 14 i2) N2) (< (+ 6 i1) N1)), 19459#(or (<= (+ i2 4) N2) (< i1 N1)), 19458#(or (< i1 N1) (<= (+ 3 i2) N2)), 19474#(or (<= N1 (+ i1 4)) (<= (+ 14 i2) N2) (< (+ 5 i1) N1)), 19480#(or (<= (+ 14 i2) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 19471#(or (<= N1 (+ i1 1)) (<= (+ 14 i2) N2) (< (+ 2 i1) N1)), 19469#(or (<= (+ 14 i2) N2) (< i1 N1)), 19461#(or (< i1 N1) (<= (+ 6 i2) N2)), 19478#(or (< (+ 9 i1) N1) (<= (+ 14 i2) N2) (<= N1 (+ i1 8))), 19479#(or (<= (+ 14 i2) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 19466#(or (<= (+ i2 11) N2) (< i1 N1)), 19457#(or (< i1 N1) (<= (+ 2 i2) N2)), 19481#(or (<= (+ 14 i2) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11)))] [2022-03-15 21:28:46,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 21:28:46,623 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:46,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 21:28:46,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=8589, Unknown=0, NotChecked=0, Total=10302 [2022-03-15 21:28:46,626 INFO L87 Difference]: Start difference. First operand 183 states and 412 transitions. Second operand has 60 states, 60 states have (on average 1.7833333333333334) internal successors, (107), 59 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:47,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:47,953 INFO L93 Difference]: Finished difference Result 412 states and 760 transitions. [2022-03-15 21:28:47,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 21:28:47,954 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.7833333333333334) internal successors, (107), 59 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-03-15 21:28:47,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:47,955 INFO L225 Difference]: With dead ends: 412 [2022-03-15 21:28:47,955 INFO L226 Difference]: Without dead ends: 316 [2022-03-15 21:28:47,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8084 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=5219, Invalid=18651, Unknown=0, NotChecked=0, Total=23870 [2022-03-15 21:28:47,956 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 380 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:47,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 0 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:28:47,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-03-15 21:28:47,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 110. [2022-03-15 21:28:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 2.1009174311926606) internal successors, (229), 109 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 229 transitions. [2022-03-15 21:28:47,959 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 229 transitions. Word has length 35 [2022-03-15 21:28:47,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:47,959 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 229 transitions. [2022-03-15 21:28:47,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.7833333333333334) internal successors, (107), 59 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 229 transitions. [2022-03-15 21:28:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 21:28:47,959 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:47,959 INFO L514 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:47,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-03-15 21:28:48,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:48,175 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:48,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:48,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2133559926, now seen corresponding path program 39 times [2022-03-15 21:28:48,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:48,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980279623] [2022-03-15 21:28:48,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:48,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:48,346 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 92 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:48,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:48,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980279623] [2022-03-15 21:28:48,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980279623] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:48,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671438084] [2022-03-15 21:28:48,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:28:48,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:48,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:48,348 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 21:28:48,348 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 21:28:48,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-03-15 21:28:48,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:48,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 21:28:48,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 92 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:48,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:49,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671438084] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:49,299 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:49,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 29, 29] total 71 [2022-03-15 21:28:49,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1653642902] [2022-03-15 21:28:49,300 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:49,308 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:49,316 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 67 transitions. [2022-03-15 21:28:49,316 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:49,713 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [20503#(and (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 7 i2) i1) (<= N1 (+ 5 i1)))), 20502#(and (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 4)) (<= (+ i2 8) i1))), 20498#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ i2 12) i1) (<= N1 i1))), 20499#(and (or (<= N1 (+ i1 1)) (<= (+ i2 11) i1)) (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0))), 20506#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= (+ i2 4) i1) (<= N1 (+ i1 8)))), 20510#(and (or (<= N1 (+ i1 12)) (<= i2 i1)) (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0))), 20508#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= (+ 2 i2) i1) (<= N1 (+ i1 10)))), 20507#(and (or (<= N1 (+ 9 i1)) (<= (+ 3 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 20505#(and (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 7 i1)) (<= (+ 5 i2) i1))), 20501#(and (or (<= (+ 9 i2) i1) (<= N1 (+ 3 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 20500#(and (or (<= N1 (+ 2 i1)) (<= (+ i2 10) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 20511#(< i2 N2), 20504#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1))) (or (<= (+ 6 i2) i1) (<= N1 (+ 6 i1)))), 20509#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= N1 (+ i1 11)) (<= (+ i2 1) i1)))] [2022-03-15 21:28:49,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:28:49,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:49,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:28:49,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1592, Invalid=5718, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 21:28:49,715 INFO L87 Difference]: Start difference. First operand 110 states and 229 transitions. Second operand has 31 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:50,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:50,279 INFO L93 Difference]: Finished difference Result 202 states and 394 transitions. [2022-03-15 21:28:50,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 21:28:50,280 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 0 states have call successors, (0), 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 35 [2022-03-15 21:28:50,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:50,280 INFO L225 Difference]: With dead ends: 202 [2022-03-15 21:28:50,280 INFO L226 Difference]: Without dead ends: 201 [2022-03-15 21:28:50,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5057 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3799, Invalid=11701, Unknown=0, NotChecked=0, Total=15500 [2022-03-15 21:28:50,285 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 182 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:50,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 0 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:28:50,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-03-15 21:28:50,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 97. [2022-03-15 21:28:50,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 2.1145833333333335) internal successors, (203), 96 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 203 transitions. [2022-03-15 21:28:50,302 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 203 transitions. Word has length 35 [2022-03-15 21:28:50,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:50,303 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 203 transitions. [2022-03-15 21:28:50,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:50,303 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 203 transitions. [2022-03-15 21:28:50,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 21:28:50,303 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:50,303 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:50,321 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 21:28:50,518 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,SelfDestructingSolverStorable41 [2022-03-15 21:28:50,518 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:50,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:50,519 INFO L85 PathProgramCache]: Analyzing trace with hash 699424665, now seen corresponding path program 40 times [2022-03-15 21:28:50,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:50,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2721097] [2022-03-15 21:28:50,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:50,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:50,696 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:50,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2721097] [2022-03-15 21:28:50,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2721097] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:50,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818420476] [2022-03-15 21:28:50,696 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:28:50,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:50,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:50,697 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 21:28:50,699 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 21:28:50,736 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:28:50,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:50,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 21:28:50,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:50,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:50,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818420476] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:50,929 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:50,929 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2022-03-15 21:28:50,930 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [617809499] [2022-03-15 21:28:50,930 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:50,932 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:50,945 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 126 transitions. [2022-03-15 21:28:50,945 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:51,534 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:28:51,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 21:28:51,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:51,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 21:28:51,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:28:51,535 INFO L87 Difference]: Start difference. First operand 97 states and 203 transitions. Second operand has 17 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:52,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:52,081 INFO L93 Difference]: Finished difference Result 301 states and 580 transitions. [2022-03-15 21:28:52,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 21:28:52,082 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 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 36 [2022-03-15 21:28:52,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:52,082 INFO L225 Difference]: With dead ends: 301 [2022-03-15 21:28:52,082 INFO L226 Difference]: Without dead ends: 267 [2022-03-15 21:28:52,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:28:52,087 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:52,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:28:52,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-03-15 21:28:52,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 196. [2022-03-15 21:28:52,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 2.2666666666666666) internal successors, (442), 195 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 442 transitions. [2022-03-15 21:28:52,108 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 442 transitions. Word has length 36 [2022-03-15 21:28:52,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:52,108 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 442 transitions. [2022-03-15 21:28:52,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:52,108 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 442 transitions. [2022-03-15 21:28:52,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 21:28:52,108 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:52,108 INFO L514 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:52,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-03-15 21:28:52,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:52,309 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:52,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:52,309 INFO L85 PathProgramCache]: Analyzing trace with hash 349636696, now seen corresponding path program 41 times [2022-03-15 21:28:52,310 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:52,310 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546147641] [2022-03-15 21:28:52,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:52,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 105 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:52,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:52,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546147641] [2022-03-15 21:28:52,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546147641] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:52,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225062944] [2022-03-15 21:28:52,743 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:28:52,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:52,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:52,745 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 21:28:52,746 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 21:28:52,777 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-03-15 21:28:52,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:52,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 21:28:52,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 105 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:53,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:53,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225062944] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:53,772 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:53,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 77 [2022-03-15 21:28:53,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1751102173] [2022-03-15 21:28:53,773 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:53,776 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:53,790 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 129 transitions. [2022-03-15 21:28:53,790 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:54,809 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [22201#(or (< i2 N2) (< i1 N1)), 22230#(or (<= N1 (+ 14 i1)) (<= (+ i2 15) N2) (< (+ i1 15) N1)), 22214#(or (<= (+ 14 i2) N2) (< i1 N1)), 22224#(or (< (+ 9 i1) N1) (<= (+ i2 15) N2) (<= N1 (+ i1 8))), 22203#(or (< i1 N1) (<= (+ 3 i2) N2)), 22205#(or (< i1 N1) (<= (+ 5 i2) N2)), 22217#(or (<= N1 (+ i1 1)) (<= (+ i2 15) N2) (< (+ 2 i1) N1)), 22222#(or (<= (+ i2 15) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 22213#(or (< i1 N1) (<= (+ i2 13) N2)), 22220#(or (<= N1 (+ i1 4)) (<= (+ i2 15) N2) (< (+ 5 i1) N1)), 22221#(or (<= N1 (+ 5 i1)) (<= (+ i2 15) N2) (< (+ 6 i1) N1)), 22229#(or (<= N1 (+ i1 13)) (<= (+ i2 15) N2) (< (+ 14 i1) N1)), 22204#(or (<= (+ i2 4) N2) (< i1 N1)), 22216#(or (< (+ i1 1) N1) (<= (+ i2 15) N2) (<= N1 i1)), 22223#(or (<= N1 (+ 7 i1)) (<= (+ i2 15) N2) (< (+ i1 8) N1)), 22212#(or (<= (+ i2 12) N2) (< i1 N1)), 22227#(or (<= (+ i2 15) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 22226#(or (<= (+ i2 15) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 22228#(or (<= (+ i2 15) N2) (<= N1 (+ i1 12)) (< (+ i1 13) N1)), 22210#(or (<= (+ i2 10) N2) (< i1 N1)), 22225#(or (<= (+ i2 15) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 22209#(or (<= (+ 9 i2) N2) (< i1 N1)), 22208#(or (< i1 N1) (<= (+ i2 8) N2)), 22200#(< i1 N1), 22211#(or (<= (+ i2 11) N2) (< i1 N1)), 22207#(or (<= (+ 7 i2) N2) (< i1 N1)), 22202#(or (< i1 N1) (<= (+ 2 i2) N2)), 22219#(or (<= (+ i2 15) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 22218#(or (<= N1 (+ 2 i1)) (<= (+ i2 15) N2) (< (+ 3 i1) N1)), 22215#(or (<= (+ i2 15) N2) (< i1 N1)), 22206#(or (< i1 N1) (<= (+ 6 i2) N2))] [2022-03-15 21:28:54,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-15 21:28:54,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:54,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-15 21:28:54,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1940, Invalid=9832, Unknown=0, NotChecked=0, Total=11772 [2022-03-15 21:28:54,811 INFO L87 Difference]: Start difference. First operand 196 states and 442 transitions. Second operand has 64 states, 64 states have (on average 1.78125) internal successors, (114), 63 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 21:28:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:28:56,997 INFO L93 Difference]: Finished difference Result 442 states and 816 transitions. [2022-03-15 21:28:56,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-15 21:28:56,997 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.78125) internal successors, (114), 63 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) Word has length 37 [2022-03-15 21:28:56,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:28:56,998 INFO L225 Difference]: With dead ends: 442 [2022-03-15 21:28:56,998 INFO L226 Difference]: Without dead ends: 338 [2022-03-15 21:28:57,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9320 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5974, Invalid=21416, Unknown=0, NotChecked=0, Total=27390 [2022-03-15 21:28:57,000 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 462 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:28:57,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [462 Valid, 0 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:28:57,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-03-15 21:28:57,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 117. [2022-03-15 21:28:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.103448275862069) internal successors, (244), 116 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:28:57,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 244 transitions. [2022-03-15 21:28:57,002 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 244 transitions. Word has length 37 [2022-03-15 21:28:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:28:57,002 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 244 transitions. [2022-03-15 21:28:57,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.78125) internal successors, (114), 63 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 21:28:57,002 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 244 transitions. [2022-03-15 21:28:57,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 21:28:57,003 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:28:57,003 INFO L514 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:28:57,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-03-15 21:28:57,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:57,211 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:28:57,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:28:57,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1269461236, now seen corresponding path program 42 times [2022-03-15 21:28:57,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:28:57,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049334800] [2022-03-15 21:28:57,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:28:57,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:28:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:28:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 106 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:57,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:28:57,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049334800] [2022-03-15 21:28:57,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049334800] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:28:57,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885436534] [2022-03-15 21:28:57,436 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:28:57,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:28:57,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:28:57,437 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 21:28:57,438 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 21:28:57,478 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-03-15 21:28:57,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:28:57,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 21:28:57,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:28:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 106 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:58,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:28:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:28:58,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885436534] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:28:58,771 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:28:58,771 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 31, 31] total 76 [2022-03-15 21:28:58,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1174394282] [2022-03-15 21:28:58,771 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:28:58,774 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:28:58,784 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 71 transitions. [2022-03-15 21:28:58,784 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:28:59,415 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [23328#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 13)) (<= i2 i1))), 23326#(and (or (<= N1 (+ i1 12)) (<= (+ i2 1) i1)) (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0))), 23316#(and (or (<= N1 (+ 2 i1)) (<= (+ i2 11) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 23321#(and (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 7 i1)) (<= (+ 6 i2) i1))), 23315#(and (or (<= N1 (+ i1 1)) (<= (+ i2 12) i1)) (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0))), 23324#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= N1 (+ i1 10)) (<= (+ 3 i2) i1))), 23320#(and (or (<= (+ 7 i2) i1) (<= N1 (+ 6 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 23314#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ i2 13) i1) (<= N1 i1))), 23323#(and (or (<= (+ i2 4) i1) (<= N1 (+ 9 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 23319#(and (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 5 i1)) (<= (+ i2 8) i1))), 23325#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ 2 i2) i1) (<= N1 (+ i1 11)))), 23327#(< i2 N2), 23317#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1))) (or (<= N1 (+ 3 i1)) (<= (+ i2 10) i1))), 23318#(and (or (<= N1 (+ i1 4)) (<= (+ 9 i2) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 23322#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= N1 (+ i1 8)) (<= (+ 5 i2) i1)))] [2022-03-15 21:28:59,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:28:59,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:28:59,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:28:59,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1811, Invalid=6561, Unknown=0, NotChecked=0, Total=8372 [2022-03-15 21:28:59,417 INFO L87 Difference]: Start difference. First operand 117 states and 244 transitions. Second operand has 33 states, 33 states have (on average 2.090909090909091) internal successors, (69), 32 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 21:29:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:29:00,354 INFO L93 Difference]: Finished difference Result 216 states and 422 transitions. [2022-03-15 21:29:00,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 21:29:00,354 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.090909090909091) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-03-15 21:29:00,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:29:00,355 INFO L225 Difference]: With dead ends: 216 [2022-03-15 21:29:00,355 INFO L226 Difference]: Without dead ends: 215 [2022-03-15 21:29:00,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5850 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4349, Invalid=13473, Unknown=0, NotChecked=0, Total=17822 [2022-03-15 21:29:00,356 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 225 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:29:00,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 0 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:29:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-03-15 21:29:00,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 103. [2022-03-15 21:29:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 2.1176470588235294) internal successors, (216), 102 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 216 transitions. [2022-03-15 21:29:00,358 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 216 transitions. Word has length 37 [2022-03-15 21:29:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:29:00,358 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 216 transitions. [2022-03-15 21:29:00,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.090909090909091) internal successors, (69), 32 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 21:29:00,358 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 216 transitions. [2022-03-15 21:29:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 21:29:00,358 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:29:00,359 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:29:00,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-03-15 21:29:00,559 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,SelfDestructingSolverStorable44 [2022-03-15 21:29:00,559 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:29:00,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:29:00,559 INFO L85 PathProgramCache]: Analyzing trace with hash -2046249055, now seen corresponding path program 43 times [2022-03-15 21:29:00,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:29:00,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118809292] [2022-03-15 21:29:00,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:29:00,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:29:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:00,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:29:00,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118809292] [2022-03-15 21:29:00,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118809292] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:29:00,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440398961] [2022-03-15 21:29:00,795 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:29:00,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:00,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:29:00,796 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 21:29:00,796 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 21:29:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:00,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-15 21:29:00,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:29:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:00,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:29:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:01,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440398961] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:29:01,012 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:29:01,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2022-03-15 21:29:01,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2123882347] [2022-03-15 21:29:01,013 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:29:01,016 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:29:01,030 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 134 transitions. [2022-03-15 21:29:01,030 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:29:01,521 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:29:01,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 21:29:01,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:29:01,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 21:29:01,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:29:01,522 INFO L87 Difference]: Start difference. First operand 103 states and 216 transitions. Second operand has 18 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:29:02,134 INFO L93 Difference]: Finished difference Result 321 states and 619 transitions. [2022-03-15 21:29:02,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 21:29:02,135 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-03-15 21:29:02,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:29:02,135 INFO L225 Difference]: With dead ends: 321 [2022-03-15 21:29:02,136 INFO L226 Difference]: Without dead ends: 285 [2022-03-15 21:29:02,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:29:02,136 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:29:02,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:29:02,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-03-15 21:29:02,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 209. [2022-03-15 21:29:02,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 2.269230769230769) internal successors, (472), 208 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 472 transitions. [2022-03-15 21:29:02,139 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 472 transitions. Word has length 38 [2022-03-15 21:29:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:29:02,139 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 472 transitions. [2022-03-15 21:29:02,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 472 transitions. [2022-03-15 21:29:02,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-15 21:29:02,140 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:29:02,140 INFO L514 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:29:02,162 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 21:29:02,340 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,SelfDestructingSolverStorable45 [2022-03-15 21:29:02,340 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:29:02,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:29:02,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1109929120, now seen corresponding path program 44 times [2022-03-15 21:29:02,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:29:02,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913727869] [2022-03-15 21:29:02,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:29:02,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:29:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:02,635 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:29:02,635 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913727869] [2022-03-15 21:29:02,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913727869] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:29:02,635 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175144188] [2022-03-15 21:29:02,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:29:02,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:02,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:29:02,636 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 21:29:02,638 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 21:29:02,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:29:02,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:29:02,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 21:29:02,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:29:03,190 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:03,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:29:03,494 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:03,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175144188] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:29:03,494 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:29:03,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 82 [2022-03-15 21:29:03,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [673040295] [2022-03-15 21:29:03,494 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:29:03,498 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:29:03,542 INFO L252 McrAutomatonBuilder]: Finished intersection with 89 states and 137 transitions. [2022-03-15 21:29:03,542 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:29:04,612 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 33 new interpolants: [25149#(or (<= N1 (+ 7 i1)) (<= (+ 16 i2) N2) (< (+ i1 8) N1)), 25128#(or (< i1 N1) (<= (+ 3 i2) N2)), 25154#(or (<= N1 (+ i1 12)) (< (+ i1 13) N1) (<= (+ 16 i2) N2)), 25140#(or (<= (+ i2 15) N2) (< i1 N1)), 25152#(or (<= (+ 16 i2) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 25145#(or (<= (+ 16 i2) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 25136#(or (<= (+ i2 11) N2) (< i1 N1)), 25138#(or (< i1 N1) (<= (+ i2 13) N2)), 25133#(or (< i1 N1) (<= (+ i2 8) N2)), 25137#(or (<= (+ i2 12) N2) (< i1 N1)), 25150#(or (< (+ 9 i1) N1) (<= (+ 16 i2) N2) (<= N1 (+ i1 8))), 25157#(or (< (+ 16 i1) N1) (<= (+ 16 i2) N2) (<= N1 (+ i1 15))), 25144#(or (<= N1 (+ 2 i1)) (<= (+ 16 i2) N2) (< (+ 3 i1) N1)), 25151#(or (<= (+ 16 i2) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 25155#(or (<= N1 (+ i1 13)) (<= (+ 16 i2) N2) (< (+ 14 i1) N1)), 25127#(or (< i1 N1) (<= (+ 2 i2) N2)), 25130#(or (< i1 N1) (<= (+ 5 i2) N2)), 25131#(or (< i1 N1) (<= (+ 6 i2) N2)), 25139#(or (<= (+ 14 i2) N2) (< i1 N1)), 25141#(or (<= (+ 16 i2) N2) (< i1 N1)), 25126#(or (< i2 N2) (< i1 N1)), 25129#(or (<= (+ i2 4) N2) (< i1 N1)), 25148#(or (< (+ 7 i1) N1) (<= (+ 16 i2) N2) (<= N1 (+ 6 i1))), 25142#(or (< (+ i1 1) N1) (<= (+ 16 i2) N2) (<= N1 i1)), 25146#(or (<= N1 (+ i1 4)) (<= (+ 16 i2) N2) (< (+ 5 i1) N1)), 25153#(or (<= (+ 16 i2) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 25135#(or (<= (+ i2 10) N2) (< i1 N1)), 25132#(or (<= (+ 7 i2) N2) (< i1 N1)), 25125#(< i1 N1), 25156#(or (<= N1 (+ 14 i1)) (< (+ i1 15) N1) (<= (+ 16 i2) N2)), 25147#(or (<= N1 (+ 5 i1)) (<= (+ 16 i2) N2) (< (+ 6 i1) N1)), 25143#(or (<= N1 (+ i1 1)) (<= (+ 16 i2) N2) (< (+ 2 i1) N1)), 25134#(or (<= (+ 9 i2) N2) (< i1 N1))] [2022-03-15 21:29:04,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-03-15 21:29:04,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:29:04,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-03-15 21:29:04,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2181, Invalid=11159, Unknown=0, NotChecked=0, Total=13340 [2022-03-15 21:29:04,615 INFO L87 Difference]: Start difference. First operand 209 states and 472 transitions. Second operand has 68 states, 68 states have (on average 1.7794117647058822) internal successors, (121), 67 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:29:06,352 INFO L93 Difference]: Finished difference Result 472 states and 872 transitions. [2022-03-15 21:29:06,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-15 21:29:06,352 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.7794117647058822) internal successors, (121), 67 states have internal predecessors, (121), 0 states have call successors, (0), 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 39 [2022-03-15 21:29:06,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:29:06,353 INFO L225 Difference]: With dead ends: 472 [2022-03-15 21:29:06,353 INFO L226 Difference]: Without dead ends: 360 [2022-03-15 21:29:06,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10644 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=6780, Invalid=24372, Unknown=0, NotChecked=0, Total=31152 [2022-03-15 21:29:06,356 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 407 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:29:06,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 0 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:29:06,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-03-15 21:29:06,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 124. [2022-03-15 21:29:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 2.105691056910569) internal successors, (259), 123 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 259 transitions. [2022-03-15 21:29:06,363 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 259 transitions. Word has length 39 [2022-03-15 21:29:06,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:29:06,363 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 259 transitions. [2022-03-15 21:29:06,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.7794117647058822) internal successors, (121), 67 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:06,363 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 259 transitions. [2022-03-15 21:29:06,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-15 21:29:06,363 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:29:06,363 INFO L514 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:29:06,379 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 21:29:06,579 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,SelfDestructingSolverStorable46 [2022-03-15 21:29:06,579 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:29:06,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:29:06,579 INFO L85 PathProgramCache]: Analyzing trace with hash -177936010, now seen corresponding path program 45 times [2022-03-15 21:29:06,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:29:06,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265302189] [2022-03-15 21:29:06,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:29:06,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:29:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:06,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:29:06,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265302189] [2022-03-15 21:29:06,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265302189] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:29:06,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030901058] [2022-03-15 21:29:06,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:29:06,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:06,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:29:06,807 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 21:29:06,851 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 21:29:06,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-03-15 21:29:06,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:29:06,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 21:29:06,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:29:07,574 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:07,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:29:08,333 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:08,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030901058] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:29:08,334 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:29:08,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 33, 33] total 81 [2022-03-15 21:29:08,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1289478466] [2022-03-15 21:29:08,334 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:29:08,337 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:29:08,348 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 75 transitions. [2022-03-15 21:29:08,348 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:29:08,839 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [26319#(and (or (<= N1 (+ 9 i1)) (<= (+ 5 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 26324#(and (or (<= N1 (+ 14 i1)) (<= i2 i1)) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0))), 26315#(and (or (<= (+ 9 i2) i1) (<= N1 (+ 5 i1))) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 26322#(and (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 12)) (<= (+ 2 i2) i1))), 26323#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 13)) (<= (+ i2 1) i1))), 26312#(and (or (<= N1 (+ 2 i1)) (<= (+ i2 12) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 26325#(< i2 N2), 26321#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= N1 (+ i1 11)) (<= (+ 3 i2) i1))), 26314#(and (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 4)) (<= (+ i2 10) i1))), 26318#(and (or (<= (+ 6 i2) i1) (<= N1 (+ i1 8))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8)))), 26310#(and (or (<= (+ 14 i2) i1) (<= N1 i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1))), 26311#(and (or (<= N1 (+ i1 1)) (<= (+ i2 13) i1)) (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0))), 26317#(and (or (<= N1 (+ 7 i1)) (<= (+ 7 i2) i1)) (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0))), 26316#(and (or (<= (+ i2 8) i1) (<= N1 (+ 6 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 26313#(and (or (<= N1 (+ 3 i1)) (<= (+ i2 11) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 26320#(and (or (<= (+ i2 4) i1) (<= N1 (+ i1 10))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))))] [2022-03-15 21:29:08,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:29:08,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:29:08,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:29:08,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2044, Invalid=7462, Unknown=0, NotChecked=0, Total=9506 [2022-03-15 21:29:08,840 INFO L87 Difference]: Start difference. First operand 124 states and 259 transitions. Second operand has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:09,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:29:09,568 INFO L93 Difference]: Finished difference Result 230 states and 450 transitions. [2022-03-15 21:29:09,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-15 21:29:09,568 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 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 39 [2022-03-15 21:29:09,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:29:09,569 INFO L225 Difference]: With dead ends: 230 [2022-03-15 21:29:09,569 INFO L226 Difference]: Without dead ends: 229 [2022-03-15 21:29:09,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6703 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4936, Invalid=15370, Unknown=0, NotChecked=0, Total=20306 [2022-03-15 21:29:09,571 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 238 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:29:09,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 0 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:29:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-03-15 21:29:09,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 109. [2022-03-15 21:29:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.1203703703703702) internal successors, (229), 108 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:09,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 229 transitions. [2022-03-15 21:29:09,573 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 229 transitions. Word has length 39 [2022-03-15 21:29:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:29:09,573 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 229 transitions. [2022-03-15 21:29:09,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 229 transitions. [2022-03-15 21:29:09,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-15 21:29:09,573 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:29:09,573 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:29:09,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-03-15 21:29:09,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:09,789 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:29:09,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:29:09,789 INFO L85 PathProgramCache]: Analyzing trace with hash 47979609, now seen corresponding path program 46 times [2022-03-15 21:29:09,791 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:29:09,791 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344288720] [2022-03-15 21:29:09,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:29:09,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:29:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:10,013 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:29:10,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344288720] [2022-03-15 21:29:10,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344288720] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:29:10,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192708528] [2022-03-15 21:29:10,013 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:29:10,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:10,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:29:10,015 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 21:29:10,015 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 21:29:10,048 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:29:10,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:29:10,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-15 21:29:10,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:29:10,175 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:10,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:29:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:10,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192708528] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:29:10,296 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:29:10,296 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 17 [2022-03-15 21:29:10,296 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [658004591] [2022-03-15 21:29:10,297 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:29:10,300 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:29:10,326 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 142 transitions. [2022-03-15 21:29:10,326 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:29:10,932 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:29:10,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:29:10,932 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:29:10,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:29:10,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-03-15 21:29:10,932 INFO L87 Difference]: Start difference. First operand 109 states and 229 transitions. Second operand has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:29:11,645 INFO L93 Difference]: Finished difference Result 341 states and 658 transitions. [2022-03-15 21:29:11,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 21:29:11,645 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 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 40 [2022-03-15 21:29:11,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:29:11,646 INFO L225 Difference]: With dead ends: 341 [2022-03-15 21:29:11,646 INFO L226 Difference]: Without dead ends: 303 [2022-03-15 21:29:11,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-03-15 21:29:11,647 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:29:11,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 2336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:29:11,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-03-15 21:29:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 222. [2022-03-15 21:29:11,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 2.271493212669683) internal successors, (502), 221 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:11,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 502 transitions. [2022-03-15 21:29:11,650 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 502 transitions. Word has length 40 [2022-03-15 21:29:11,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:29:11,650 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 502 transitions. [2022-03-15 21:29:11,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:11,650 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 502 transitions. [2022-03-15 21:29:11,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-15 21:29:11,650 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:29:11,650 INFO L514 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:29:11,667 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 21:29:11,859 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,SelfDestructingSolverStorable48 [2022-03-15 21:29:11,859 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:29:11,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:29:11,859 INFO L85 PathProgramCache]: Analyzing trace with hash 888294808, now seen corresponding path program 47 times [2022-03-15 21:29:11,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:29:11,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990355637] [2022-03-15 21:29:11,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:29:11,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:29:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:12,340 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 136 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:12,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:29:12,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990355637] [2022-03-15 21:29:12,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990355637] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:29:12,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596906240] [2022-03-15 21:29:12,340 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:29:12,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:12,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:29:12,343 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:29:12,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 21:29:12,405 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-03-15 21:29:12,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:29:12,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 21:29:12,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:29:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 136 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:12,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:29:13,320 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:13,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596906240] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:29:13,320 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:29:13,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 87 [2022-03-15 21:29:13,320 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1208398243] [2022-03-15 21:29:13,320 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:29:13,324 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:29:13,341 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 145 transitions. [2022-03-15 21:29:13,341 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:29:14,584 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [28236#(or (< i1 N1) (<= (+ 6 i2) N2)), 28262#(or (<= N1 (+ 14 i1)) (< (+ i1 15) N1) (<= (+ i2 17) N2)), 28235#(or (< i1 N1) (<= (+ 5 i2) N2)), 28240#(or (<= (+ i2 10) N2) (< i1 N1)), 28261#(or (<= N1 (+ i1 13)) (<= (+ i2 17) N2) (< (+ 14 i1) N1)), 28264#(or (< (+ i1 17) N1) (<= N1 (+ 16 i1)) (<= (+ i2 17) N2)), 28258#(or (< (+ i1 11) N1) (<= (+ i2 17) N2) (<= N1 (+ i1 10))), 28259#(or (< (+ i1 12) N1) (<= (+ i2 17) N2) (<= N1 (+ i1 11))), 28242#(or (<= (+ i2 12) N2) (< i1 N1)), 28245#(or (<= (+ i2 15) N2) (< i1 N1)), 28234#(or (<= (+ i2 4) N2) (< i1 N1)), 28256#(or (< (+ 9 i1) N1) (<= N1 (+ i1 8)) (<= (+ i2 17) N2)), 28233#(or (< i1 N1) (<= (+ 3 i2) N2)), 28253#(or (<= N1 (+ 5 i1)) (<= (+ i2 17) N2) (< (+ 6 i1) N1)), 28237#(or (<= (+ 7 i2) N2) (< i1 N1)), 28243#(or (< i1 N1) (<= (+ i2 13) N2)), 28231#(or (< i2 N2) (< i1 N1)), 28250#(or (<= N1 (+ 2 i1)) (< (+ 3 i1) N1) (<= (+ i2 17) N2)), 28255#(or (<= N1 (+ 7 i1)) (< (+ i1 8) N1) (<= (+ i2 17) N2)), 28260#(or (<= N1 (+ i1 12)) (< (+ i1 13) N1) (<= (+ i2 17) N2)), 28263#(or (< (+ 16 i1) N1) (<= N1 (+ i1 15)) (<= (+ i2 17) N2)), 28239#(or (<= (+ 9 i2) N2) (< i1 N1)), 28238#(or (< i1 N1) (<= (+ i2 8) N2)), 28254#(or (< (+ 7 i1) N1) (<= N1 (+ 6 i1)) (<= (+ i2 17) N2)), 28246#(or (<= (+ 16 i2) N2) (< i1 N1)), 28252#(or (<= N1 (+ i1 4)) (<= (+ i2 17) N2) (< (+ 5 i1) N1)), 28257#(or (<= N1 (+ 9 i1)) (< (+ i1 10) N1) (<= (+ i2 17) N2)), 28241#(or (<= (+ i2 11) N2) (< i1 N1)), 28230#(< i1 N1), 28247#(or (< i1 N1) (<= (+ i2 17) N2)), 28244#(or (<= (+ 14 i2) N2) (< i1 N1)), 28251#(or (<= N1 (+ 3 i1)) (<= (+ i2 17) N2) (< (+ i1 4) N1)), 28249#(or (<= N1 (+ i1 1)) (<= (+ i2 17) N2) (< (+ 2 i1) N1)), 28248#(or (< (+ i1 1) N1) (<= (+ i2 17) N2) (<= N1 i1)), 28232#(or (< i1 N1) (<= (+ 2 i2) N2))] [2022-03-15 21:29:14,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-03-15 21:29:14,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:29:14,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-03-15 21:29:14,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2436, Invalid=12570, Unknown=0, NotChecked=0, Total=15006 [2022-03-15 21:29:14,586 INFO L87 Difference]: Start difference. First operand 222 states and 502 transitions. Second operand has 72 states, 72 states have (on average 1.7777777777777777) internal successors, (128), 71 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:29:16,594 INFO L93 Difference]: Finished difference Result 502 states and 928 transitions. [2022-03-15 21:29:16,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 21:29:16,594 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.7777777777777777) internal successors, (128), 71 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-03-15 21:29:16,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:29:16,595 INFO L225 Difference]: With dead ends: 502 [2022-03-15 21:29:16,595 INFO L226 Difference]: Without dead ends: 382 [2022-03-15 21:29:16,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12056 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=7637, Invalid=27519, Unknown=0, NotChecked=0, Total=35156 [2022-03-15 21:29:16,597 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 511 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:29:16,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [511 Valid, 0 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:29:16,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-03-15 21:29:16,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 131. [2022-03-15 21:29:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 2.1076923076923078) internal successors, (274), 130 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 274 transitions. [2022-03-15 21:29:16,600 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 274 transitions. Word has length 41 [2022-03-15 21:29:16,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:29:16,600 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 274 transitions. [2022-03-15 21:29:16,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.7777777777777777) internal successors, (128), 71 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 274 transitions. [2022-03-15 21:29:16,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-15 21:29:16,601 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:29:16,601 INFO L514 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:29:16,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-15 21:29:16,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-03-15 21:29:16,816 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:29:16,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:29:16,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1278711948, now seen corresponding path program 48 times [2022-03-15 21:29:16,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:29:16,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495419087] [2022-03-15 21:29:16,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:29:16,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:29:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:17,100 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 137 proven. 152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:17,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:29:17,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495419087] [2022-03-15 21:29:17,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495419087] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:29:17,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175773875] [2022-03-15 21:29:17,101 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:29:17,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:17,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:29:17,116 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:29:17,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-15 21:29:17,151 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-03-15 21:29:17,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:29:17,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 21:29:17,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:29:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 137 proven. 152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:18,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:29:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:18,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175773875] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:29:18,918 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:29:18,918 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 35, 35] total 86 [2022-03-15 21:29:18,918 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [378053872] [2022-03-15 21:29:18,918 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:29:18,922 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:29:18,934 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 79 transitions. [2022-03-15 21:29:18,934 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:29:19,746 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [29494#(and (or (<= (+ 7 i2) i1) (<= N1 (+ i1 8))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8)))), 29491#(and (or (<= N1 (+ 5 i1)) (<= (+ i2 10) i1)) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 29496#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= (+ 5 i2) i1) (<= N1 (+ i1 10)))), 29490#(and (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 4)) (<= (+ i2 11) i1))), 29486#(and (or (<= (+ i2 15) i1) (<= N1 i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1))), 29498#(and (or (<= N1 (+ i1 12)) (<= (+ 3 i2) i1)) (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0))), 29487#(and (or (<= N1 (+ i1 1)) (<= (+ 14 i2) i1)) (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0))), 29488#(and (or (<= N1 (+ 2 i1)) (<= (+ i2 13) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 29499#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 13)) (<= (+ 2 i2) i1))), 29501#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= N1 (+ i1 15)) (<= i2 i1))), 29489#(and (or (<= N1 (+ 3 i1)) (<= (+ i2 12) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 29497#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ i2 4) i1) (<= N1 (+ i1 11)))), 29493#(and (or (<= N1 (+ 7 i1)) (<= (+ i2 8) i1)) (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0))), 29502#(< i2 N2), 29495#(and (or (<= (+ 6 i2) i1) (<= N1 (+ 9 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 29492#(and (or (<= (+ 9 i2) i1) (<= N1 (+ 6 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 29500#(and (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 14 i1)) (<= (+ i2 1) i1)))] [2022-03-15 21:29:19,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 21:29:19,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:29:19,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 21:29:19,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2291, Invalid=8421, Unknown=0, NotChecked=0, Total=10712 [2022-03-15 21:29:19,747 INFO L87 Difference]: Start difference. First operand 131 states and 274 transitions. Second operand has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:20,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:29:20,891 INFO L93 Difference]: Finished difference Result 244 states and 478 transitions. [2022-03-15 21:29:20,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-15 21:29:20,891 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 0 states have call successors, (0), 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 41 [2022-03-15 21:29:20,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:29:20,892 INFO L225 Difference]: With dead ends: 244 [2022-03-15 21:29:20,892 INFO L226 Difference]: Without dead ends: 243 [2022-03-15 21:29:20,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7613 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5560, Invalid=17392, Unknown=0, NotChecked=0, Total=22952 [2022-03-15 21:29:20,894 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 253 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:29:20,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 0 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:29:20,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-03-15 21:29:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 115. [2022-03-15 21:29:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 2.1228070175438596) internal successors, (242), 114 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 242 transitions. [2022-03-15 21:29:20,896 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 242 transitions. Word has length 41 [2022-03-15 21:29:20,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:29:20,896 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 242 transitions. [2022-03-15 21:29:20,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 242 transitions. [2022-03-15 21:29:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 21:29:20,897 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:29:20,897 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:29:20,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-15 21:29:21,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:21,097 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:29:21,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:29:21,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1767250529, now seen corresponding path program 49 times [2022-03-15 21:29:21,099 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:29:21,099 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337075422] [2022-03-15 21:29:21,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:29:21,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:29:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:21,335 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:29:21,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337075422] [2022-03-15 21:29:21,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337075422] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:29:21,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665642393] [2022-03-15 21:29:21,335 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:29:21,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:21,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:29:21,337 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:29:21,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-15 21:29:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:21,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 21:29:21,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:29:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:21,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:29:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:21,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665642393] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:29:21,680 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:29:21,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2022-03-15 21:29:21,680 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1007583638] [2022-03-15 21:29:21,680 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:29:21,686 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:29:21,706 INFO L252 McrAutomatonBuilder]: Finished intersection with 97 states and 150 transitions. [2022-03-15 21:29:21,707 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:29:22,420 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:29:22,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 21:29:22,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:29:22,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 21:29:22,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:29:22,421 INFO L87 Difference]: Start difference. First operand 115 states and 242 transitions. Second operand has 20 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:29:23,209 INFO L93 Difference]: Finished difference Result 361 states and 697 transitions. [2022-03-15 21:29:23,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 21:29:23,210 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 21:29:23,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:29:23,211 INFO L225 Difference]: With dead ends: 361 [2022-03-15 21:29:23,211 INFO L226 Difference]: Without dead ends: 321 [2022-03-15 21:29:23,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 150 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:29:23,211 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 2616 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:29:23,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 2617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2616 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:29:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-03-15 21:29:23,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 235. [2022-03-15 21:29:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 2.2735042735042734) internal successors, (532), 234 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:23,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 532 transitions. [2022-03-15 21:29:23,215 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 532 transitions. Word has length 42 [2022-03-15 21:29:23,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:29:23,215 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 532 transitions. [2022-03-15 21:29:23,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:23,215 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 532 transitions. [2022-03-15 21:29:23,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-15 21:29:23,215 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:29:23,215 INFO L514 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:29:23,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-03-15 21:29:23,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-03-15 21:29:23,424 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:29:23,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:29:23,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1856305120, now seen corresponding path program 50 times [2022-03-15 21:29:23,425 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:29:23,425 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415805175] [2022-03-15 21:29:23,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:29:23,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:29:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:23,967 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:23,967 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:29:23,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415805175] [2022-03-15 21:29:23,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415805175] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:29:23,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442641738] [2022-03-15 21:29:23,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:29:23,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:23,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:29:23,988 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:29:24,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-15 21:29:24,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:29:24,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:29:24,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 21:29:24,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:29:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:25,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:29:25,459 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:25,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442641738] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:29:25,460 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:29:25,460 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 92 [2022-03-15 21:29:25,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1117648035] [2022-03-15 21:29:25,460 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:29:25,464 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:29:25,483 INFO L252 McrAutomatonBuilder]: Finished intersection with 99 states and 153 transitions. [2022-03-15 21:29:25,483 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:29:26,732 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [31538#(or (<= N1 (+ i1 4)) (< (+ 5 i1) N1) (<= (+ i2 18) N2)), 31525#(or (<= (+ i2 10) N2) (< i1 N1)), 31545#(or (< (+ i1 12) N1) (<= N1 (+ i1 11)) (<= (+ i2 18) N2)), 31546#(or (<= N1 (+ i1 12)) (< (+ i1 13) N1) (<= (+ i2 18) N2)), 31547#(or (<= N1 (+ i1 13)) (< (+ 14 i1) N1) (<= (+ i2 18) N2)), 31536#(or (<= N1 (+ 2 i1)) (< (+ 3 i1) N1) (<= (+ i2 18) N2)), 31549#(or (< (+ 16 i1) N1) (<= N1 (+ i1 15)) (<= (+ i2 18) N2)), 31544#(or (< (+ i1 11) N1) (<= N1 (+ i1 10)) (<= (+ i2 18) N2)), 31527#(or (<= (+ i2 12) N2) (< i1 N1)), 31535#(or (<= N1 (+ i1 1)) (< (+ 2 i1) N1) (<= (+ i2 18) N2)), 31532#(or (< i1 N1) (<= (+ i2 17) N2)), 31533#(or (< i1 N1) (<= (+ i2 18) N2)), 31529#(or (<= (+ 14 i2) N2) (< i1 N1)), 31543#(or (<= N1 (+ 9 i1)) (< (+ i1 10) N1) (<= (+ i2 18) N2)), 31520#(or (< i1 N1) (<= (+ 5 i2) N2)), 31519#(or (<= (+ i2 4) N2) (< i1 N1)), 31534#(or (< (+ i1 1) N1) (<= N1 i1) (<= (+ i2 18) N2)), 31523#(or (< i1 N1) (<= (+ i2 8) N2)), 31530#(or (<= (+ i2 15) N2) (< i1 N1)), 31524#(or (<= (+ 9 i2) N2) (< i1 N1)), 31516#(or (< i2 N2) (< i1 N1)), 31528#(or (< i1 N1) (<= (+ i2 13) N2)), 31522#(or (<= (+ 7 i2) N2) (< i1 N1)), 31515#(< i1 N1), 31518#(or (< i1 N1) (<= (+ 3 i2) N2)), 31550#(or (< (+ i1 17) N1) (<= N1 (+ 16 i1)) (<= (+ i2 18) N2)), 31540#(or (< (+ 7 i1) N1) (<= N1 (+ 6 i1)) (<= (+ i2 18) N2)), 31539#(or (<= N1 (+ 5 i1)) (< (+ 6 i1) N1) (<= (+ i2 18) N2)), 31541#(or (<= N1 (+ 7 i1)) (< (+ i1 8) N1) (<= (+ i2 18) N2)), 31517#(or (< i1 N1) (<= (+ 2 i2) N2)), 31551#(or (< (+ i1 18) N1) (<= N1 (+ i1 17)) (<= (+ i2 18) N2)), 31537#(or (<= N1 (+ 3 i1)) (< (+ i1 4) N1) (<= (+ i2 18) N2)), 31521#(or (< i1 N1) (<= (+ 6 i2) N2)), 31526#(or (<= (+ i2 11) N2) (< i1 N1)), 31542#(or (< (+ 9 i1) N1) (<= N1 (+ i1 8)) (<= (+ i2 18) N2)), 31531#(or (<= (+ 16 i2) N2) (< i1 N1)), 31548#(or (<= N1 (+ 14 i1)) (< (+ i1 15) N1) (<= (+ i2 18) N2))] [2022-03-15 21:29:26,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-03-15 21:29:26,732 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:29:26,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-03-15 21:29:26,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2705, Invalid=14065, Unknown=0, NotChecked=0, Total=16770 [2022-03-15 21:29:26,733 INFO L87 Difference]: Start difference. First operand 235 states and 532 transitions. Second operand has 76 states, 76 states have (on average 1.7763157894736843) internal successors, (135), 75 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 21:29:28,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:29:28,793 INFO L93 Difference]: Finished difference Result 532 states and 984 transitions. [2022-03-15 21:29:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 21:29:28,793 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.7763157894736843) internal successors, (135), 75 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) Word has length 43 [2022-03-15 21:29:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:29:28,794 INFO L225 Difference]: With dead ends: 532 [2022-03-15 21:29:28,794 INFO L226 Difference]: Without dead ends: 404 [2022-03-15 21:29:28,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13556 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=8545, Invalid=30857, Unknown=0, NotChecked=0, Total=39402 [2022-03-15 21:29:28,796 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 629 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:29:28,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 0 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:29:28,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-03-15 21:29:28,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 138. [2022-03-15 21:29:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.1094890510948905) internal successors, (289), 137 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 289 transitions. [2022-03-15 21:29:28,799 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 289 transitions. Word has length 43 [2022-03-15 21:29:28,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:29:28,799 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 289 transitions. [2022-03-15 21:29:28,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.7763157894736843) internal successors, (135), 75 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 21:29:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 289 transitions. [2022-03-15 21:29:28,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-15 21:29:28,800 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:29:28,800 INFO L514 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:29:28,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-03-15 21:29:29,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:29,015 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:29:29,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:29:29,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1561102218, now seen corresponding path program 51 times [2022-03-15 21:29:29,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:29:29,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933724357] [2022-03-15 21:29:29,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:29:29,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:29:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:29,246 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 154 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:29,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:29:29,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933724357] [2022-03-15 21:29:29,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933724357] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:29:29,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270140246] [2022-03-15 21:29:29,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:29:29,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:29,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:29:29,248 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:29:29,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-15 21:29:29,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-03-15 21:29:29,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:29:29,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 21:29:29,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:29:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 154 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:30,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:29:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:30,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270140246] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:29:30,865 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:29:30,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 37, 37] total 91 [2022-03-15 21:29:30,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1345929565] [2022-03-15 21:29:30,865 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:29:30,868 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:29:30,881 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 83 transitions. [2022-03-15 21:29:30,881 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:29:31,457 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [32851#(and (or (<= (+ 7 i2) i1) (<= N1 (+ 9 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 32858#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= N1 (+ i1 15)) (<= (+ i2 1) i1))), 32844#(and (or (<= N1 (+ 2 i1)) (<= (+ 14 i2) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 32856#(and (or (<= N1 (+ 14 i1)) (<= (+ 2 i2) i1)) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0))), 32843#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 15) i1) (<= N1 (+ i1 1)))), 32854#(and (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 4) i1) (<= N1 (+ i1 12)))), 32847#(and (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 5 i1)) (<= (+ i2 11) i1))), 32852#(and (or (<= (+ 6 i2) i1) (<= N1 (+ i1 10))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10)))), 32848#(and (or (<= N1 (+ 6 i1)) (<= (+ i2 10) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 32859#(and (or (<= N1 (+ 16 i1)) (<= i2 i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1)))), 32849#(and (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 7 i1)) (<= (+ 9 i2) i1))), 32853#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ 5 i2) i1) (<= N1 (+ i1 11)))), 32845#(and (or (<= (+ i2 13) i1) (<= N1 (+ 3 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 32855#(and (or (<= N1 (+ i1 13)) (<= (+ 3 i2) i1)) (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0))), 32850#(and (or (<= (+ i2 8) i1) (<= N1 (+ i1 8))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8)))), 32846#(and (or (<= N1 (+ i1 4)) (<= (+ i2 12) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 32857#(< i2 N2), 32842#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ 16 i2) i1) (<= N1 i1)))] [2022-03-15 21:29:31,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 21:29:31,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:29:31,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 21:29:31,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2552, Invalid=9438, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 21:29:31,459 INFO L87 Difference]: Start difference. First operand 138 states and 289 transitions. Second operand has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:32,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:29:32,343 INFO L93 Difference]: Finished difference Result 258 states and 506 transitions. [2022-03-15 21:29:32,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-15 21:29:32,344 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 0 states have call successors, (0), 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 43 [2022-03-15 21:29:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:29:32,344 INFO L225 Difference]: With dead ends: 258 [2022-03-15 21:29:32,344 INFO L226 Difference]: Without dead ends: 257 [2022-03-15 21:29:32,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8579 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=6221, Invalid=19539, Unknown=0, NotChecked=0, Total=25760 [2022-03-15 21:29:32,347 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 269 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:29:32,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 0 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:29:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-03-15 21:29:32,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 121. [2022-03-15 21:29:32,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 2.125) internal successors, (255), 120 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 255 transitions. [2022-03-15 21:29:32,349 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 255 transitions. Word has length 43 [2022-03-15 21:29:32,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:29:32,350 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 255 transitions. [2022-03-15 21:29:32,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:32,350 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 255 transitions. [2022-03-15 21:29:32,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 21:29:32,350 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:29:32,350 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:29:32,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-03-15 21:29:32,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-03-15 21:29:32,566 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:29:32,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:29:32,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1710799129, now seen corresponding path program 52 times [2022-03-15 21:29:32,567 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:29:32,567 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761058683] [2022-03-15 21:29:32,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:29:32,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:29:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:32,832 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:29:32,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761058683] [2022-03-15 21:29:32,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761058683] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:29:32,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484573289] [2022-03-15 21:29:32,832 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:29:32,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:32,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:29:32,834 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:29:32,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-03-15 21:29:32,869 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:29:32,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:29:32,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 75 conjunts are in the unsatisfiable core [2022-03-15 21:29:32,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:29:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:33,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:29:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:33,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484573289] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:29:33,187 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:29:33,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 19 [2022-03-15 21:29:33,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [835304750] [2022-03-15 21:29:33,187 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:29:33,191 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:29:33,213 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 158 transitions. [2022-03-15 21:29:33,213 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:29:33,988 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:29:33,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 21:29:33,989 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:29:33,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 21:29:33,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:29:33,989 INFO L87 Difference]: Start difference. First operand 121 states and 255 transitions. Second operand has 21 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:29:34,642 INFO L93 Difference]: Finished difference Result 381 states and 736 transitions. [2022-03-15 21:29:34,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 21:29:34,642 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-03-15 21:29:34,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:29:34,643 INFO L225 Difference]: With dead ends: 381 [2022-03-15 21:29:34,643 INFO L226 Difference]: Without dead ends: 339 [2022-03-15 21:29:34,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 158 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:29:34,644 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 2913 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:29:34,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2913 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:29:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-03-15 21:29:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 248. [2022-03-15 21:29:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 2.2753036437246963) internal successors, (562), 247 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 562 transitions. [2022-03-15 21:29:34,647 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 562 transitions. Word has length 44 [2022-03-15 21:29:34,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:29:34,647 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 562 transitions. [2022-03-15 21:29:34,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:34,647 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 562 transitions. [2022-03-15 21:29:34,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 21:29:34,648 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:29:34,648 INFO L514 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:29:34,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-03-15 21:29:34,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-03-15 21:29:34,864 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:29:34,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:29:34,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1392915160, now seen corresponding path program 53 times [2022-03-15 21:29:34,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:29:34,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100244773] [2022-03-15 21:29:34,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:29:34,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:29:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 171 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:35,410 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:29:35,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100244773] [2022-03-15 21:29:35,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100244773] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:29:35,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13865237] [2022-03-15 21:29:35,410 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:29:35,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:35,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:29:35,412 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:29:35,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-03-15 21:29:35,449 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-15 21:29:35,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:29:35,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 21:29:35,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:29:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 171 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:36,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:29:36,870 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:36,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13865237] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:29:36,870 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:29:36,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 97 [2022-03-15 21:29:36,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1120332778] [2022-03-15 21:29:36,871 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:29:36,874 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:29:36,897 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 161 transitions. [2022-03-15 21:29:36,898 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:29:39,078 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 39 new interpolants: [35015#(or (< (+ 16 i1) N1) (<= (+ 19 i2) N2) (<= N1 (+ i1 15))), 34995#(or (<= (+ i2 15) N2) (< i1 N1)), 34998#(or (< i1 N1) (<= (+ i2 18) N2)), 34991#(or (<= (+ i2 11) N2) (< i1 N1)), 34999#(or (<= (+ 19 i2) N2) (< i1 N1)), 35017#(or (< (+ i1 18) N1) (<= (+ 19 i2) N2) (<= N1 (+ i1 17))), 35018#(or (<= N1 (+ i1 18)) (<= (+ 19 i2) N2) (< (+ 19 i1) N1)), 34994#(or (<= (+ 14 i2) N2) (< i1 N1)), 34992#(or (<= (+ i2 12) N2) (< i1 N1)), 34990#(or (<= (+ i2 10) N2) (< i1 N1)), 35007#(or (<= N1 (+ 7 i1)) (<= (+ 19 i2) N2) (< (+ i1 8) N1)), 35011#(or (<= (+ 19 i2) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 34984#(or (<= (+ i2 4) N2) (< i1 N1)), 35006#(or (< (+ 7 i1) N1) (<= (+ 19 i2) N2) (<= N1 (+ 6 i1))), 34980#(< i1 N1), 35001#(or (<= N1 (+ i1 1)) (<= (+ 19 i2) N2) (< (+ 2 i1) N1)), 35003#(or (<= (+ 19 i2) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 35010#(or (<= (+ 19 i2) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 35008#(or (< (+ 9 i1) N1) (<= (+ 19 i2) N2) (<= N1 (+ i1 8))), 35016#(or (< (+ i1 17) N1) (<= (+ 19 i2) N2) (<= N1 (+ 16 i1))), 34988#(or (< i1 N1) (<= (+ i2 8) N2)), 35002#(or (<= N1 (+ 2 i1)) (<= (+ 19 i2) N2) (< (+ 3 i1) N1)), 34982#(or (< i1 N1) (<= (+ 2 i2) N2)), 34997#(or (< i1 N1) (<= (+ i2 17) N2)), 34985#(or (< i1 N1) (<= (+ 5 i2) N2)), 34983#(or (< i1 N1) (<= (+ 3 i2) N2)), 35005#(or (<= N1 (+ 5 i1)) (<= (+ 19 i2) N2) (< (+ 6 i1) N1)), 35012#(or (<= N1 (+ i1 12)) (< (+ i1 13) N1) (<= (+ 19 i2) N2)), 34993#(or (< i1 N1) (<= (+ i2 13) N2)), 35004#(or (<= N1 (+ i1 4)) (<= (+ 19 i2) N2) (< (+ 5 i1) N1)), 35013#(or (<= N1 (+ i1 13)) (<= (+ 19 i2) N2) (< (+ 14 i1) N1)), 34987#(or (<= (+ 7 i2) N2) (< i1 N1)), 34996#(or (<= (+ 16 i2) N2) (< i1 N1)), 34989#(or (<= (+ 9 i2) N2) (< i1 N1)), 35009#(or (<= (+ 19 i2) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 34986#(or (< i1 N1) (<= (+ 6 i2) N2)), 35014#(or (<= N1 (+ 14 i1)) (< (+ i1 15) N1) (<= (+ 19 i2) N2)), 35000#(or (< (+ i1 1) N1) (<= (+ 19 i2) N2) (<= N1 i1)), 34981#(or (< i2 N2) (< i1 N1))] [2022-03-15 21:29:39,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-03-15 21:29:39,078 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:29:39,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-03-15 21:29:39,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2988, Invalid=15644, Unknown=0, NotChecked=0, Total=18632 [2022-03-15 21:29:39,080 INFO L87 Difference]: Start difference. First operand 248 states and 562 transitions. Second operand has 80 states, 80 states have (on average 1.775) internal successors, (142), 79 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:41,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:29:41,557 INFO L93 Difference]: Finished difference Result 562 states and 1040 transitions. [2022-03-15 21:29:41,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-03-15 21:29:41,557 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.775) internal successors, (142), 79 states have internal predecessors, (142), 0 states have call successors, (0), 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 45 [2022-03-15 21:29:41,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:29:41,558 INFO L225 Difference]: With dead ends: 562 [2022-03-15 21:29:41,558 INFO L226 Difference]: Without dead ends: 426 [2022-03-15 21:29:41,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15144 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=9504, Invalid=34386, Unknown=0, NotChecked=0, Total=43890 [2022-03-15 21:29:41,560 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 583 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:29:41,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [583 Valid, 0 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:29:41,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-03-15 21:29:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 145. [2022-03-15 21:29:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.111111111111111) internal successors, (304), 144 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 304 transitions. [2022-03-15 21:29:41,563 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 304 transitions. Word has length 45 [2022-03-15 21:29:41,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:29:41,563 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 304 transitions. [2022-03-15 21:29:41,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 1.775) internal successors, (142), 79 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 304 transitions. [2022-03-15 21:29:41,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 21:29:41,564 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:29:41,564 INFO L514 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:29:41,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-03-15 21:29:41,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:41,779 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:29:41,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:29:41,780 INFO L85 PathProgramCache]: Analyzing trace with hash 192033292, now seen corresponding path program 54 times [2022-03-15 21:29:41,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:29:41,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345203833] [2022-03-15 21:29:41,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:29:41,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:29:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 172 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:42,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:29:42,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345203833] [2022-03-15 21:29:42,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345203833] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:29:42,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978412252] [2022-03-15 21:29:42,098 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:29:42,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:42,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:29:42,108 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:29:42,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-03-15 21:29:42,146 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-03-15 21:29:42,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:29:42,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 21:29:42,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:29:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 172 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:43,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:29:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:43,903 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978412252] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:29:43,903 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:29:43,903 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 39, 39] total 96 [2022-03-15 21:29:43,903 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1054059067] [2022-03-15 21:29:43,903 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:29:43,906 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:29:43,921 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 87 transitions. [2022-03-15 21:29:43,921 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:29:44,565 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [36395#(and (or (<= N1 (+ i1 17)) (<= i2 i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 36391#(and (or (<= (+ i2 4) i1) (<= N1 (+ i1 13))) (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0))), 36378#(and (or (<= (+ i2 17) i1) (<= N1 i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1))), 36388#(and (or (<= (+ 7 i2) i1) (<= N1 (+ i1 10))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10)))), 36394#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= N1 (+ 16 i1)) (<= (+ i2 1) i1))), 36382#(and (or (<= N1 (+ i1 4)) (<= (+ i2 13) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 36383#(and (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 5 i1)) (<= (+ i2 12) i1))), 36390#(and (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 12)) (<= (+ 5 i2) i1))), 36385#(and (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 7 i1)) (<= (+ i2 10) i1))), 36379#(and (or (<= N1 (+ i1 1)) (<= (+ 16 i2) i1)) (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0))), 36386#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= (+ 9 i2) i1) (<= N1 (+ i1 8)))), 36380#(and (or (<= (+ i2 15) i1) (<= N1 (+ 2 i1))) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 36387#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1))) (or (<= (+ i2 8) i1) (<= N1 (+ 9 i1)))), 36389#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ 6 i2) i1) (<= N1 (+ i1 11)))), 36396#(< i2 N2), 36384#(and (or (<= N1 (+ 6 i1)) (<= (+ i2 11) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 36381#(and (or (<= (+ 14 i2) i1) (<= N1 (+ 3 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 36392#(and (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 14 i1)) (<= (+ 3 i2) i1))), 36393#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= N1 (+ i1 15)) (<= (+ 2 i2) i1)))] [2022-03-15 21:29:44,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 21:29:44,566 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:29:44,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 21:29:44,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2827, Invalid=10513, Unknown=0, NotChecked=0, Total=13340 [2022-03-15 21:29:44,567 INFO L87 Difference]: Start difference. First operand 145 states and 304 transitions. Second operand has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:45,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:29:45,656 INFO L93 Difference]: Finished difference Result 272 states and 534 transitions. [2022-03-15 21:29:45,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-03-15 21:29:45,657 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 0 states have call successors, (0), 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 45 [2022-03-15 21:29:45,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:29:45,657 INFO L225 Difference]: With dead ends: 272 [2022-03-15 21:29:45,657 INFO L226 Difference]: Without dead ends: 271 [2022-03-15 21:29:45,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9607 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=6919, Invalid=21811, Unknown=0, NotChecked=0, Total=28730 [2022-03-15 21:29:45,660 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 205 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:29:45,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 0 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:29:45,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-03-15 21:29:45,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 127. [2022-03-15 21:29:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.126984126984127) internal successors, (268), 126 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 268 transitions. [2022-03-15 21:29:45,662 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 268 transitions. Word has length 45 [2022-03-15 21:29:45,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:29:45,662 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 268 transitions. [2022-03-15 21:29:45,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 268 transitions. [2022-03-15 21:29:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-15 21:29:45,662 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:29:45,662 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:29:45,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-03-15 21:29:45,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:45,878 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:29:45,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:29:45,879 INFO L85 PathProgramCache]: Analyzing trace with hash 230612257, now seen corresponding path program 55 times [2022-03-15 21:29:45,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:29:45,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911516163] [2022-03-15 21:29:45,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:29:45,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:29:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:46,154 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:46,154 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:29:46,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911516163] [2022-03-15 21:29:46,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911516163] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:29:46,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494568342] [2022-03-15 21:29:46,154 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:29:46,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:46,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:29:46,155 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:29:46,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-03-15 21:29:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:46,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 79 conjunts are in the unsatisfiable core [2022-03-15 21:29:46,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:29:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:46,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:29:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:46,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494568342] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:29:46,481 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:29:46,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2022-03-15 21:29:46,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [555543194] [2022-03-15 21:29:46,482 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:29:46,489 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:29:46,511 INFO L252 McrAutomatonBuilder]: Finished intersection with 107 states and 166 transitions. [2022-03-15 21:29:46,512 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:29:47,176 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:29:47,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 21:29:47,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:29:47,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 21:29:47,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2022-03-15 21:29:47,177 INFO L87 Difference]: Start difference. First operand 127 states and 268 transitions. Second operand has 22 states, 21 states have (on average 4.904761904761905) internal successors, (103), 21 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:29:47,873 INFO L93 Difference]: Finished difference Result 401 states and 775 transitions. [2022-03-15 21:29:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 21:29:47,873 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.904761904761905) internal successors, (103), 21 states have internal predecessors, (103), 0 states have call successors, (0), 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 46 [2022-03-15 21:29:47,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:29:47,874 INFO L225 Difference]: With dead ends: 401 [2022-03-15 21:29:47,874 INFO L226 Difference]: Without dead ends: 357 [2022-03-15 21:29:47,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 166 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2022-03-15 21:29:47,874 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 3226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:29:47,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3226 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:29:47,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-03-15 21:29:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 261. [2022-03-15 21:29:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 2.276923076923077) internal successors, (592), 260 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 592 transitions. [2022-03-15 21:29:47,878 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 592 transitions. Word has length 46 [2022-03-15 21:29:47,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:29:47,878 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 592 transitions. [2022-03-15 21:29:47,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.904761904761905) internal successors, (103), 21 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:47,878 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 592 transitions. [2022-03-15 21:29:47,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-15 21:29:47,878 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:29:47,878 INFO L514 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:29:47,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-03-15 21:29:48,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:48,091 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:29:48,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:29:48,091 INFO L85 PathProgramCache]: Analyzing trace with hash -313203936, now seen corresponding path program 56 times [2022-03-15 21:29:48,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:29:48,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070116106] [2022-03-15 21:29:48,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:29:48,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:29:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:48,643 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:29:48,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070116106] [2022-03-15 21:29:48,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070116106] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:29:48,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285360437] [2022-03-15 21:29:48,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:29:48,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:48,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:29:48,644 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:29:48,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-03-15 21:29:48,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:29:48,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:29:48,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 21:29:48,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:29:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:49,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:29:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:50,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285360437] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:29:50,233 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:29:50,233 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 102 [2022-03-15 21:29:50,233 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [680586634] [2022-03-15 21:29:50,233 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:29:50,236 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:29:50,261 INFO L252 McrAutomatonBuilder]: Finished intersection with 109 states and 169 transitions. [2022-03-15 21:29:50,261 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:29:52,022 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [38646#(or (<= (+ i2 20) N2) (< (+ i1 1) N1) (<= N1 i1)), 38650#(or (<= N1 (+ i1 4)) (<= (+ i2 20) N2) (< (+ 5 i1) N1)), 38625#(< i1 N1), 38629#(or (<= (+ i2 4) N2) (< i1 N1)), 38642#(or (< i1 N1) (<= (+ i2 17) N2)), 38630#(or (< i1 N1) (<= (+ 5 i2) N2)), 38647#(or (<= (+ i2 20) N2) (<= N1 (+ i1 1)) (< (+ 2 i1) N1)), 38654#(or (<= (+ i2 20) N2) (< (+ 9 i1) N1) (<= N1 (+ i1 8))), 38660#(or (<= N1 (+ 14 i1)) (<= (+ i2 20) N2) (< (+ i1 15) N1)), 38645#(or (<= (+ i2 20) N2) (< i1 N1)), 38633#(or (< i1 N1) (<= (+ i2 8) N2)), 38631#(or (< i1 N1) (<= (+ 6 i2) N2)), 38643#(or (< i1 N1) (<= (+ i2 18) N2)), 38656#(or (<= (+ i2 20) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 38664#(or (<= (+ i2 20) N2) (<= N1 (+ i1 18)) (< (+ 19 i1) N1)), 38653#(or (<= N1 (+ 7 i1)) (<= (+ i2 20) N2) (< (+ i1 8) N1)), 38662#(or (< (+ i1 17) N1) (<= (+ i2 20) N2) (<= N1 (+ 16 i1))), 38657#(or (<= (+ i2 20) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 38655#(or (<= (+ i2 20) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 38665#(or (<= (+ i2 20) N2) (<= N1 (+ 19 i1)) (< (+ i1 20) N1)), 38637#(or (<= (+ i2 12) N2) (< i1 N1)), 38628#(or (< i1 N1) (<= (+ 3 i2) N2)), 38636#(or (<= (+ i2 11) N2) (< i1 N1)), 38651#(or (<= (+ i2 20) N2) (<= N1 (+ 5 i1)) (< (+ 6 i1) N1)), 38627#(or (< i1 N1) (<= (+ 2 i2) N2)), 38626#(or (< i2 N2) (< i1 N1)), 38640#(or (<= (+ i2 15) N2) (< i1 N1)), 38649#(or (<= (+ i2 20) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 38652#(or (<= (+ i2 20) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 38641#(or (<= (+ 16 i2) N2) (< i1 N1)), 38658#(or (<= (+ i2 20) N2) (<= N1 (+ i1 12)) (< (+ i1 13) N1)), 38661#(or (< (+ 16 i1) N1) (<= (+ i2 20) N2) (<= N1 (+ i1 15))), 38634#(or (<= (+ 9 i2) N2) (< i1 N1)), 38632#(or (<= (+ 7 i2) N2) (< i1 N1)), 38648#(or (<= (+ i2 20) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 38639#(or (<= (+ 14 i2) N2) (< i1 N1)), 38659#(or (<= (+ i2 20) N2) (<= N1 (+ i1 13)) (< (+ 14 i1) N1)), 38663#(or (<= (+ i2 20) N2) (< (+ i1 18) N1) (<= N1 (+ i1 17))), 38644#(or (<= (+ 19 i2) N2) (< i1 N1)), 38635#(or (<= (+ i2 10) N2) (< i1 N1)), 38638#(or (< i1 N1) (<= (+ i2 13) N2))] [2022-03-15 21:29:52,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-03-15 21:29:52,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:29:52,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-03-15 21:29:52,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3285, Invalid=17307, Unknown=0, NotChecked=0, Total=20592 [2022-03-15 21:29:52,024 INFO L87 Difference]: Start difference. First operand 261 states and 592 transitions. Second operand has 84 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 83 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 21:29:54,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:29:54,750 INFO L93 Difference]: Finished difference Result 592 states and 1096 transitions. [2022-03-15 21:29:54,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-03-15 21:29:54,750 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 83 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) Word has length 47 [2022-03-15 21:29:54,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:29:54,751 INFO L225 Difference]: With dead ends: 592 [2022-03-15 21:29:54,751 INFO L226 Difference]: Without dead ends: 448 [2022-03-15 21:29:54,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16820 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=10514, Invalid=38106, Unknown=0, NotChecked=0, Total=48620 [2022-03-15 21:29:54,754 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 647 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:29:54,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [647 Valid, 0 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:29:54,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-03-15 21:29:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 152. [2022-03-15 21:29:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 2.1125827814569536) internal successors, (319), 151 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 319 transitions. [2022-03-15 21:29:54,757 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 319 transitions. Word has length 47 [2022-03-15 21:29:54,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:29:54,758 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 319 transitions. [2022-03-15 21:29:54,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 83 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 21:29:54,758 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 319 transitions. [2022-03-15 21:29:54,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-15 21:29:54,768 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:29:54,768 INFO L514 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:29:54,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-03-15 21:29:54,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-03-15 21:29:54,971 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:29:54,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:29:54,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1521272970, now seen corresponding path program 57 times [2022-03-15 21:29:54,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:29:54,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232896684] [2022-03-15 21:29:54,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:29:54,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:29:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:55,335 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 191 proven. 209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:55,335 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:29:55,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232896684] [2022-03-15 21:29:55,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232896684] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:29:55,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421384384] [2022-03-15 21:29:55,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:29:55,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:55,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:29:55,336 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:29:55,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-03-15 21:29:55,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2022-03-15 21:29:55,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:29:55,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 21:29:55,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:29:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 191 proven. 209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:56,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:29:57,784 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:57,784 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421384384] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:29:57,784 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:29:57,784 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 41, 41] total 101 [2022-03-15 21:29:57,784 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1215624230] [2022-03-15 21:29:57,784 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:29:57,788 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:29:57,804 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 91 transitions. [2022-03-15 21:29:57,804 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:29:58,585 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [40106#(and (or (<= N1 (+ i1 12)) (<= (+ 6 i2) i1)) (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0))), 40096#(and (or (<= N1 (+ 2 i1)) (<= (+ 16 i2) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 40097#(and (or (<= (+ i2 15) i1) (<= N1 (+ 3 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 40105#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ 7 i2) i1) (<= N1 (+ i1 11)))), 40104#(and (or (<= (+ i2 8) i1) (<= N1 (+ i1 10))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10)))), 40108#(and (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 14 i1)) (<= (+ i2 4) i1))), 40109#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= N1 (+ i1 15)) (<= (+ 3 i2) i1))), 40101#(and (or (<= N1 (+ 7 i1)) (<= (+ i2 11) i1)) (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0))), 40098#(and (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 4)) (<= (+ 14 i2) i1))), 40112#(and (or (<= N1 (+ i1 17)) (<= (+ i2 1) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 40094#(and (or (<= N1 i1) (<= (+ i2 18) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1))), 40103#(and (or (<= (+ 9 i2) i1) (<= N1 (+ 9 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 40107#(and (or (<= N1 (+ i1 13)) (<= (+ 5 i2) i1)) (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0))), 40110#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= N1 (+ 16 i1)) (<= (+ 2 i2) i1))), 40095#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 1)) (<= (+ i2 17) i1))), 40113#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= i2 i1))), 40111#(< i2 N2), 40100#(and (or (<= N1 (+ 6 i1)) (<= (+ i2 12) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 40102#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= N1 (+ i1 8)) (<= (+ i2 10) i1))), 40099#(and (or (<= N1 (+ 5 i1)) (<= (+ i2 13) i1)) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)))] [2022-03-15 21:29:58,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 21:29:58,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:29:58,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 21:29:58,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3116, Invalid=11646, Unknown=0, NotChecked=0, Total=14762 [2022-03-15 21:29:58,587 INFO L87 Difference]: Start difference. First operand 152 states and 319 transitions. Second operand has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 42 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:29:59,584 INFO L93 Difference]: Finished difference Result 286 states and 562 transitions. [2022-03-15 21:29:59,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-03-15 21:29:59,584 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 42 states have internal predecessors, (89), 0 states have call successors, (0), 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 47 [2022-03-15 21:29:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:29:59,585 INFO L225 Difference]: With dead ends: 286 [2022-03-15 21:29:59,585 INFO L226 Difference]: Without dead ends: 285 [2022-03-15 21:29:59,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10689 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=7654, Invalid=24208, Unknown=0, NotChecked=0, Total=31862 [2022-03-15 21:29:59,588 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 279 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:29:59,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 0 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:29:59,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-03-15 21:29:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 133. [2022-03-15 21:29:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.128787878787879) internal successors, (281), 132 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 281 transitions. [2022-03-15 21:29:59,590 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 281 transitions. Word has length 47 [2022-03-15 21:29:59,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:29:59,590 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 281 transitions. [2022-03-15 21:29:59,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 42 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:59,591 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 281 transitions. [2022-03-15 21:29:59,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-15 21:29:59,591 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:29:59,591 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:29:59,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-03-15 21:29:59,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-03-15 21:29:59,807 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:29:59,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:29:59,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1119472167, now seen corresponding path program 58 times [2022-03-15 21:29:59,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:29:59,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414243310] [2022-03-15 21:29:59,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:29:59,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:29:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:30:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:00,061 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:30:00,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414243310] [2022-03-15 21:30:00,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414243310] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:30:00,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659993911] [2022-03-15 21:30:00,062 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:30:00,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:00,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:30:00,063 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:30:00,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-03-15 21:30:00,101 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:30:00,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:30:00,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 83 conjunts are in the unsatisfiable core [2022-03-15 21:30:00,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:30:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:00,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:30:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:00,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659993911] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:30:00,321 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:30:00,321 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 21 [2022-03-15 21:30:00,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [718620535] [2022-03-15 21:30:00,322 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:30:00,325 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:30:00,406 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 174 transitions. [2022-03-15 21:30:00,406 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:30:01,017 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:30:01,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:30:01,018 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:30:01,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:30:01,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:30:01,018 INFO L87 Difference]: Start difference. First operand 133 states and 281 transitions. Second operand has 23 states, 22 states have (on average 4.909090909090909) internal successors, (108), 22 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 21:30:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:30:01,710 INFO L93 Difference]: Finished difference Result 421 states and 814 transitions. [2022-03-15 21:30:01,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 21:30:01,710 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.909090909090909) internal successors, (108), 22 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-03-15 21:30:01,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:30:01,712 INFO L225 Difference]: With dead ends: 421 [2022-03-15 21:30:01,712 INFO L226 Difference]: Without dead ends: 375 [2022-03-15 21:30:01,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 174 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:30:01,712 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 3555 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:30:01,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 3556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3555 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:30:01,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-03-15 21:30:01,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 274. [2022-03-15 21:30:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 2.2783882783882783) internal successors, (622), 273 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 622 transitions. [2022-03-15 21:30:01,715 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 622 transitions. Word has length 48 [2022-03-15 21:30:01,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:30:01,716 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 622 transitions. [2022-03-15 21:30:01,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.909090909090909) internal successors, (108), 22 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 21:30:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 622 transitions. [2022-03-15 21:30:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 21:30:01,716 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:30:01,716 INFO L514 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:30:01,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-03-15 21:30:01,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:01,933 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:30:01,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:30:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash 259176472, now seen corresponding path program 59 times [2022-03-15 21:30:01,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:30:01,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401901093] [2022-03-15 21:30:01,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:30:01,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:30:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:30:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 210 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:02,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:30:02,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401901093] [2022-03-15 21:30:02,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401901093] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:30:02,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808104748] [2022-03-15 21:30:02,462 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:30:02,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:02,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:30:02,464 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:30:02,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-03-15 21:30:02,505 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-03-15 21:30:02,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:30:02,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 21:30:02,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:30:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 210 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:03,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:30:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:04,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808104748] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:30:04,062 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:30:04,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 107 [2022-03-15 21:30:04,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1533755599] [2022-03-15 21:30:04,062 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:30:04,066 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:30:04,094 INFO L252 McrAutomatonBuilder]: Finished intersection with 114 states and 177 transitions. [2022-03-15 21:30:04,095 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:30:06,294 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [42458#(or (< i1 N1) (<= (+ i2 8) N2)), 42456#(or (< i1 N1) (<= (+ 6 i2) N2)), 42460#(or (<= (+ i2 10) N2) (< i1 N1)), 42462#(or (<= (+ i2 12) N2) (< i1 N1)), 42477#(or (<= N1 (+ 5 i1)) (<= (+ 21 i2) N2) (< (+ 6 i1) N1)), 42482#(or (< (+ i1 11) N1) (<= (+ 21 i2) N2) (<= N1 (+ i1 10))), 42457#(or (<= (+ 7 i2) N2) (< i1 N1)), 42476#(or (<= N1 (+ i1 4)) (<= (+ 21 i2) N2) (< (+ 5 i1) N1)), 42467#(or (< i1 N1) (<= (+ i2 17) N2)), 42490#(or (<= N1 (+ i1 18)) (< (+ 19 i1) N1) (<= (+ 21 i2) N2)), 42471#(or (<= (+ 21 i2) N2) (< i1 N1)), 42453#(or (< i1 N1) (<= (+ 3 i2) N2)), 42475#(or (<= N1 (+ 3 i1)) (<= (+ 21 i2) N2) (< (+ i1 4) N1)), 42451#(or (< i2 N2) (< i1 N1)), 42452#(or (< i1 N1) (<= (+ 2 i2) N2)), 42465#(or (<= (+ i2 15) N2) (< i1 N1)), 42487#(or (< (+ 16 i1) N1) (<= (+ 21 i2) N2) (<= N1 (+ i1 15))), 42485#(or (<= N1 (+ i1 13)) (<= (+ 21 i2) N2) (< (+ 14 i1) N1)), 42461#(or (<= (+ i2 11) N2) (< i1 N1)), 42468#(or (< i1 N1) (<= (+ i2 18) N2)), 42491#(or (<= N1 (+ 19 i1)) (< (+ i1 20) N1) (<= (+ 21 i2) N2)), 42483#(or (<= (+ 21 i2) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 42466#(or (<= (+ 16 i2) N2) (< i1 N1)), 42454#(or (<= (+ i2 4) N2) (< i1 N1)), 42480#(or (< (+ 9 i1) N1) (<= N1 (+ i1 8)) (<= (+ 21 i2) N2)), 42478#(or (< (+ 7 i1) N1) (<= N1 (+ 6 i1)) (<= (+ 21 i2) N2)), 42455#(or (< i1 N1) (<= (+ 5 i2) N2)), 42481#(or (<= (+ 21 i2) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 42470#(or (<= (+ i2 20) N2) (< i1 N1)), 42474#(or (<= N1 (+ 2 i1)) (<= (+ 21 i2) N2) (< (+ 3 i1) N1)), 42464#(or (<= (+ 14 i2) N2) (< i1 N1)), 42486#(or (<= N1 (+ 14 i1)) (< (+ i1 15) N1) (<= (+ 21 i2) N2)), 42473#(or (<= N1 (+ i1 1)) (<= (+ 21 i2) N2) (< (+ 2 i1) N1)), 42489#(or (< (+ i1 18) N1) (<= N1 (+ i1 17)) (<= (+ 21 i2) N2)), 42459#(or (<= (+ 9 i2) N2) (< i1 N1)), 42450#(< i1 N1), 42488#(or (< (+ i1 17) N1) (<= (+ 21 i2) N2) (<= N1 (+ 16 i1))), 42479#(or (<= N1 (+ 7 i1)) (< (+ i1 8) N1) (<= (+ 21 i2) N2)), 42472#(or (< (+ i1 1) N1) (<= (+ 21 i2) N2) (<= N1 i1)), 42469#(or (<= (+ 19 i2) N2) (< i1 N1)), 42484#(or (<= N1 (+ i1 12)) (< (+ i1 13) N1) (<= (+ 21 i2) N2)), 42492#(or (< (+ 21 i1) N1) (<= N1 (+ i1 20)) (<= (+ 21 i2) N2)), 42463#(or (< i1 N1) (<= (+ i2 13) N2))] [2022-03-15 21:30:06,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-03-15 21:30:06,295 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:30:06,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-03-15 21:30:06,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=19054, Unknown=0, NotChecked=0, Total=22650 [2022-03-15 21:30:06,296 INFO L87 Difference]: Start difference. First operand 274 states and 622 transitions. Second operand has 88 states, 88 states have (on average 1.7727272727272727) internal successors, (156), 87 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:30:09,400 INFO L93 Difference]: Finished difference Result 622 states and 1152 transitions. [2022-03-15 21:30:09,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-15 21:30:09,401 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 1.7727272727272727) internal successors, (156), 87 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 21:30:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:30:09,402 INFO L225 Difference]: With dead ends: 622 [2022-03-15 21:30:09,402 INFO L226 Difference]: Without dead ends: 470 [2022-03-15 21:30:09,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18584 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=11575, Invalid=42017, Unknown=0, NotChecked=0, Total=53592 [2022-03-15 21:30:09,405 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 712 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:30:09,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [712 Valid, 0 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:30:09,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-03-15 21:30:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 159. [2022-03-15 21:30:09,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 2.1139240506329116) internal successors, (334), 158 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:09,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 334 transitions. [2022-03-15 21:30:09,409 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 334 transitions. Word has length 49 [2022-03-15 21:30:09,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:30:09,409 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 334 transitions. [2022-03-15 21:30:09,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 1.7727272727272727) internal successors, (156), 87 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 334 transitions. [2022-03-15 21:30:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 21:30:09,410 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:30:09,410 INFO L514 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:30:09,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-03-15 21:30:09,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:09,626 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:30:09,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:30:09,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1171694708, now seen corresponding path program 60 times [2022-03-15 21:30:09,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:30:09,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714593260] [2022-03-15 21:30:09,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:30:09,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:30:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:30:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 211 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:10,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:30:10,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714593260] [2022-03-15 21:30:10,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714593260] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:30:10,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54182861] [2022-03-15 21:30:10,026 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:30:10,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:10,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:30:10,027 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:30:10,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-03-15 21:30:10,069 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-03-15 21:30:10,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:30:10,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 21:30:10,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:30:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 211 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:11,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:30:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:12,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54182861] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:30:12,305 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:30:12,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 43, 43] total 106 [2022-03-15 21:30:12,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1978514425] [2022-03-15 21:30:12,305 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:30:12,309 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:30:12,327 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 95 transitions. [2022-03-15 21:30:12,327 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:30:13,181 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [44006#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= (+ i2 4) i1) (<= N1 (+ i1 15)))), 43995#(and (or (<= N1 (+ 5 i1)) (<= (+ 14 i2) i1)) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 43997#(and (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 7 i1)) (<= (+ i2 12) i1))), 43994#(and (or (<= (+ i2 15) i1) (<= N1 (+ i1 4))) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 43998#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= N1 (+ i1 8)) (<= (+ i2 11) i1))), 44000#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= (+ 9 i2) i1) (<= N1 (+ i1 10)))), 43990#(and (or (<= (+ 19 i2) i1) (<= N1 i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1))), 44002#(and (or (<= (+ 7 i2) i1) (<= N1 (+ i1 12))) (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0))), 44005#(and (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 14 i1)) (<= (+ 5 i2) i1))), 44008#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17))) (or (<= N1 (+ i1 17)) (<= (+ 2 i2) i1))), 44009#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= (+ i2 1) i1))), 44001#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ i2 8) i1) (<= N1 (+ i1 11)))), 43991#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 1)) (<= (+ i2 18) i1))), 43996#(and (or (<= (+ i2 13) i1) (<= N1 (+ 6 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 44004#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 13)) (<= (+ 6 i2) i1))), 43999#(and (or (<= N1 (+ 9 i1)) (<= (+ i2 10) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 44007#(and (or (<= N1 (+ 16 i1)) (<= (+ 3 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1)))), 43992#(and (or (<= N1 (+ 2 i1)) (<= (+ i2 17) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 44010#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= i2 i1))), 44003#(< i2 N2), 43993#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1))) (or (<= (+ 16 i2) i1) (<= N1 (+ 3 i1))))] [2022-03-15 21:30:13,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 21:30:13,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:30:13,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 21:30:13,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3419, Invalid=12837, Unknown=0, NotChecked=0, Total=16256 [2022-03-15 21:30:13,183 INFO L87 Difference]: Start difference. First operand 159 states and 334 transitions. Second operand has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 44 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:14,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:30:14,647 INFO L93 Difference]: Finished difference Result 300 states and 590 transitions. [2022-03-15 21:30:14,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-03-15 21:30:14,647 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 44 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 21:30:14,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:30:14,648 INFO L225 Difference]: With dead ends: 300 [2022-03-15 21:30:14,648 INFO L226 Difference]: Without dead ends: 299 [2022-03-15 21:30:14,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11826 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=8426, Invalid=26730, Unknown=0, NotChecked=0, Total=35156 [2022-03-15 21:30:14,651 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 220 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:30:14,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 0 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:30:14,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-03-15 21:30:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 139. [2022-03-15 21:30:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 2.130434782608696) internal successors, (294), 138 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 294 transitions. [2022-03-15 21:30:14,659 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 294 transitions. Word has length 49 [2022-03-15 21:30:14,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:30:14,659 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 294 transitions. [2022-03-15 21:30:14,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 44 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 294 transitions. [2022-03-15 21:30:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-15 21:30:14,659 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:30:14,659 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:30:14,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-03-15 21:30:14,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:14,891 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:30:14,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:30:14,892 INFO L85 PathProgramCache]: Analyzing trace with hash -555548703, now seen corresponding path program 61 times [2022-03-15 21:30:14,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:30:14,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385313906] [2022-03-15 21:30:14,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:30:14,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:30:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:30:15,236 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:15,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:30:15,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385313906] [2022-03-15 21:30:15,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385313906] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:30:15,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516865907] [2022-03-15 21:30:15,236 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:30:15,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:15,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:30:15,238 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:30:15,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-03-15 21:30:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:30:15,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 87 conjunts are in the unsatisfiable core [2022-03-15 21:30:15,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:30:15,454 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:15,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:30:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:15,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516865907] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:30:15,635 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:30:15,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2022-03-15 21:30:15,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1447951176] [2022-03-15 21:30:15,635 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:30:15,681 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:30:15,709 INFO L252 McrAutomatonBuilder]: Finished intersection with 117 states and 182 transitions. [2022-03-15 21:30:15,709 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:30:16,479 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:30:16,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:30:16,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:30:16,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:30:16,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2022-03-15 21:30:16,482 INFO L87 Difference]: Start difference. First operand 139 states and 294 transitions. Second operand has 24 states, 23 states have (on average 4.913043478260869) internal successors, (113), 23 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:17,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:30:17,370 INFO L93 Difference]: Finished difference Result 441 states and 853 transitions. [2022-03-15 21:30:17,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 21:30:17,370 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.913043478260869) internal successors, (113), 23 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-03-15 21:30:17,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:30:17,372 INFO L225 Difference]: With dead ends: 441 [2022-03-15 21:30:17,372 INFO L226 Difference]: Without dead ends: 393 [2022-03-15 21:30:17,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 182 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2022-03-15 21:30:17,377 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 2335 mSDsCounter, 0 mSdLazyCounter, 3900 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:30:17,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 3901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3900 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:30:17,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-03-15 21:30:17,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 287. [2022-03-15 21:30:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 2.2797202797202796) internal successors, (652), 286 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 652 transitions. [2022-03-15 21:30:17,406 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 652 transitions. Word has length 50 [2022-03-15 21:30:17,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:30:17,406 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 652 transitions. [2022-03-15 21:30:17,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.913043478260869) internal successors, (113), 23 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 652 transitions. [2022-03-15 21:30:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-15 21:30:17,407 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:30:17,407 INFO L514 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:30:17,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-03-15 21:30:17,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:17,607 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:30:17,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:30:17,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1475866208, now seen corresponding path program 62 times [2022-03-15 21:30:17,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:30:17,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673397683] [2022-03-15 21:30:17,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:30:17,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:30:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:30:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:18,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:30:18,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673397683] [2022-03-15 21:30:18,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673397683] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:30:18,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418787215] [2022-03-15 21:30:18,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:30:18,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:18,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:30:18,209 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:30:18,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-03-15 21:30:18,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:30:18,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:30:18,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 21:30:18,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:30:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:19,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:30:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:20,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418787215] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:30:20,286 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:30:20,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 112 [2022-03-15 21:30:20,286 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [474466587] [2022-03-15 21:30:20,286 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:30:20,290 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:30:20,320 INFO L252 McrAutomatonBuilder]: Finished intersection with 119 states and 185 transitions. [2022-03-15 21:30:20,321 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:30:22,766 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 45 new interpolants: [46467#(or (<= (+ i2 12) N2) (< i1 N1)), 46480#(or (<= (+ 22 i2) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 46481#(or (<= (+ 22 i2) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 46468#(or (< i1 N1) (<= (+ i2 13) N2)), 46491#(or (<= (+ 22 i2) N2) (<= N1 (+ i1 13)) (< (+ 14 i1) N1)), 46493#(or (< (+ 16 i1) N1) (<= (+ 22 i2) N2) (<= N1 (+ i1 15))), 46492#(or (<= N1 (+ 14 i1)) (<= (+ 22 i2) N2) (< (+ i1 15) N1)), 46475#(or (<= (+ i2 20) N2) (< i1 N1)), 46494#(or (< (+ i1 17) N1) (<= (+ 22 i2) N2) (<= N1 (+ 16 i1))), 46459#(or (<= (+ i2 4) N2) (< i1 N1)), 46457#(or (< i1 N1) (<= (+ 2 i2) N2)), 46455#(< i1 N1), 46473#(or (< i1 N1) (<= (+ i2 18) N2)), 46498#(or (< (+ 21 i1) N1) (<= (+ 22 i2) N2) (<= N1 (+ i1 20))), 46499#(or (<= N1 (+ 21 i1)) (<= (+ 22 i2) N2) (< (+ 22 i1) N1)), 46477#(or (<= (+ 22 i2) N2) (< i1 N1)), 46486#(or (<= (+ 22 i2) N2) (< (+ 9 i1) N1) (<= N1 (+ i1 8))), 46458#(or (< i1 N1) (<= (+ 3 i2) N2)), 46497#(or (<= (+ 22 i2) N2) (<= N1 (+ 19 i1)) (< (+ i1 20) N1)), 46482#(or (<= N1 (+ i1 4)) (<= (+ 22 i2) N2) (< (+ 5 i1) N1)), 46487#(or (<= (+ 22 i2) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 46470#(or (<= (+ i2 15) N2) (< i1 N1)), 46472#(or (< i1 N1) (<= (+ i2 17) N2)), 46461#(or (< i1 N1) (<= (+ 6 i2) N2)), 46488#(or (<= (+ 22 i2) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 46474#(or (<= (+ 19 i2) N2) (< i1 N1)), 46456#(or (< i2 N2) (< i1 N1)), 46489#(or (<= (+ 22 i2) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 46496#(or (<= (+ 22 i2) N2) (<= N1 (+ i1 18)) (< (+ 19 i1) N1)), 46495#(or (<= (+ 22 i2) N2) (< (+ i1 18) N1) (<= N1 (+ i1 17))), 46476#(or (<= (+ 21 i2) N2) (< i1 N1)), 46462#(or (<= (+ 7 i2) N2) (< i1 N1)), 46466#(or (<= (+ i2 11) N2) (< i1 N1)), 46479#(or (<= (+ 22 i2) N2) (<= N1 (+ i1 1)) (< (+ 2 i1) N1)), 46490#(or (<= (+ 22 i2) N2) (<= N1 (+ i1 12)) (< (+ i1 13) N1)), 46478#(or (<= (+ 22 i2) N2) (< (+ i1 1) N1) (<= N1 i1)), 46483#(or (<= (+ 22 i2) N2) (<= N1 (+ 5 i1)) (< (+ 6 i1) N1)), 46484#(or (<= (+ 22 i2) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 46460#(or (< i1 N1) (<= (+ 5 i2) N2)), 46485#(or (<= N1 (+ 7 i1)) (<= (+ 22 i2) N2) (< (+ i1 8) N1)), 46471#(or (<= (+ 16 i2) N2) (< i1 N1)), 46463#(or (< i1 N1) (<= (+ i2 8) N2)), 46465#(or (<= (+ i2 10) N2) (< i1 N1)), 46464#(or (<= (+ 9 i2) N2) (< i1 N1)), 46469#(or (<= (+ 14 i2) N2) (< i1 N1))] [2022-03-15 21:30:22,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-03-15 21:30:22,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:30:22,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-03-15 21:30:22,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3921, Invalid=20885, Unknown=0, NotChecked=0, Total=24806 [2022-03-15 21:30:22,769 INFO L87 Difference]: Start difference. First operand 287 states and 652 transitions. Second operand has 92 states, 92 states have (on average 1.7717391304347827) internal successors, (163), 91 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:30:25,805 INFO L93 Difference]: Finished difference Result 652 states and 1208 transitions. [2022-03-15 21:30:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-15 21:30:25,805 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 1.7717391304347827) internal successors, (163), 91 states have internal predecessors, (163), 0 states have call successors, (0), 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 51 [2022-03-15 21:30:25,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:30:25,807 INFO L225 Difference]: With dead ends: 652 [2022-03-15 21:30:25,807 INFO L226 Difference]: Without dead ends: 492 [2022-03-15 21:30:25,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20436 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=12687, Invalid=46119, Unknown=0, NotChecked=0, Total=58806 [2022-03-15 21:30:25,810 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 717 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:30:25,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [717 Valid, 0 Invalid, 2115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:30:25,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-03-15 21:30:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 166. [2022-03-15 21:30:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.1151515151515152) internal successors, (349), 165 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 349 transitions. [2022-03-15 21:30:25,816 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 349 transitions. Word has length 51 [2022-03-15 21:30:25,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:30:25,816 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 349 transitions. [2022-03-15 21:30:25,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 1.7717391304347827) internal successors, (163), 91 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 349 transitions. [2022-03-15 21:30:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-15 21:30:25,831 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:30:25,831 INFO L514 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:30:25,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2022-03-15 21:30:26,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-03-15 21:30:26,047 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:30:26,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:30:26,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1728063094, now seen corresponding path program 63 times [2022-03-15 21:30:26,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:30:26,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491500269] [2022-03-15 21:30:26,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:30:26,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:30:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:30:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 232 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:26,321 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:30:26,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491500269] [2022-03-15 21:30:26,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491500269] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:30:26,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182360294] [2022-03-15 21:30:26,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:30:26,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:26,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:30:26,322 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:30:26,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-03-15 21:30:26,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2022-03-15 21:30:26,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:30:26,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 21:30:26,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:30:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 232 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:27,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:30:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:28,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182360294] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:30:28,343 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:30:28,343 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 45, 45] total 111 [2022-03-15 21:30:28,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1443724229] [2022-03-15 21:30:28,343 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:30:28,347 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:30:28,367 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 99 transitions. [2022-03-15 21:30:28,367 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:30:29,191 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [48067#(and (or (<= N1 (+ i1 1)) (<= (+ 19 i2) i1)) (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0))), 48078#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ 9 i2) i1) (<= N1 (+ i1 11)))), 48079#(and (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 8) i1) (<= N1 (+ i1 12)))), 48086#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ i2 1) i1))), 48081#(and (or (<= N1 (+ 14 i1)) (<= (+ 6 i2) i1)) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0))), 48080#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 7 i2) i1) (<= N1 (+ i1 13)))), 48066#(and (or (<= N1 i1) (<= (+ i2 20) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1))), 48084#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17))) (or (<= N1 (+ i1 17)) (<= (+ 3 i2) i1))), 48085#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= (+ 2 i2) i1))), 48083#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= (+ i2 4) i1) (<= N1 (+ 16 i1)))), 48075#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= N1 (+ i1 8)) (<= (+ i2 12) i1))), 48077#(and (or (<= N1 (+ i1 10)) (<= (+ i2 10) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10)))), 48070#(and (or (<= N1 (+ i1 4)) (<= (+ 16 i2) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 48082#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= (+ 5 i2) i1) (<= N1 (+ i1 15)))), 48069#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1))) (or (<= N1 (+ 3 i1)) (<= (+ i2 17) i1))), 48073#(and (or (<= N1 (+ 7 i1)) (<= (+ i2 13) i1)) (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0))), 48071#(and (or (<= (+ i2 15) i1) (<= N1 (+ 5 i1))) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 48068#(and (or (<= N1 (+ 2 i1)) (<= (+ i2 18) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 48072#(and (or (<= N1 (+ 6 i1)) (<= (+ 14 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 48076#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1))) (or (<= N1 (+ 9 i1)) (<= (+ i2 11) i1))), 48074#(< i2 N2), 48087#(and (or (<= N1 (+ i1 20)) (<= i2 i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20))))] [2022-03-15 21:30:29,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 21:30:29,191 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:30:29,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 21:30:29,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3736, Invalid=14086, Unknown=0, NotChecked=0, Total=17822 [2022-03-15 21:30:29,193 INFO L87 Difference]: Start difference. First operand 166 states and 349 transitions. Second operand has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 46 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:30,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:30:30,415 INFO L93 Difference]: Finished difference Result 314 states and 618 transitions. [2022-03-15 21:30:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-03-15 21:30:30,415 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 46 states have internal predecessors, (97), 0 states have call successors, (0), 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 51 [2022-03-15 21:30:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:30:30,416 INFO L225 Difference]: With dead ends: 314 [2022-03-15 21:30:30,416 INFO L226 Difference]: Without dead ends: 313 [2022-03-15 21:30:30,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13020 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=9235, Invalid=29377, Unknown=0, NotChecked=0, Total=38612 [2022-03-15 21:30:30,419 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 227 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:30:30,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 0 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:30:30,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-03-15 21:30:30,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 145. [2022-03-15 21:30:30,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.1319444444444446) internal successors, (307), 144 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 307 transitions. [2022-03-15 21:30:30,421 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 307 transitions. Word has length 51 [2022-03-15 21:30:30,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:30:30,421 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 307 transitions. [2022-03-15 21:30:30,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 46 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 307 transitions. [2022-03-15 21:30:30,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-15 21:30:30,422 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:30:30,422 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:30:30,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-03-15 21:30:30,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:30,630 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:30:30,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:30:30,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1492872551, now seen corresponding path program 64 times [2022-03-15 21:30:30,631 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:30:30,631 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298973531] [2022-03-15 21:30:30,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:30:30,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:30:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:30:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:30,845 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:30:30,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298973531] [2022-03-15 21:30:30,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298973531] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:30:30,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094876515] [2022-03-15 21:30:30,846 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:30:30,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:30,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:30:30,847 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:30:30,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-03-15 21:30:30,886 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:30:30,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:30:30,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 91 conjunts are in the unsatisfiable core [2022-03-15 21:30:30,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:30:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:30,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:30:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:31,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094876515] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:30:31,077 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:30:31,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 23 [2022-03-15 21:30:31,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1072138687] [2022-03-15 21:30:31,077 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:30:31,081 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:30:31,113 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 190 transitions. [2022-03-15 21:30:31,114 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:30:31,864 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:30:31,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:30:31,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:30:31,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:30:31,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2022-03-15 21:30:31,865 INFO L87 Difference]: Start difference. First operand 145 states and 307 transitions. Second operand has 25 states, 24 states have (on average 4.916666666666667) internal successors, (118), 24 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:32,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:30:32,761 INFO L93 Difference]: Finished difference Result 461 states and 892 transitions. [2022-03-15 21:30:32,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 21:30:32,761 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.916666666666667) internal successors, (118), 24 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-03-15 21:30:32,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:30:32,762 INFO L225 Difference]: With dead ends: 461 [2022-03-15 21:30:32,763 INFO L226 Difference]: Without dead ends: 411 [2022-03-15 21:30:32,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 190 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2022-03-15 21:30:32,763 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 2556 mSDsCounter, 0 mSdLazyCounter, 4261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:30:32,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 4262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4261 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:30:32,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-03-15 21:30:32,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 300. [2022-03-15 21:30:32,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 2.280936454849498) internal successors, (682), 299 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 682 transitions. [2022-03-15 21:30:32,766 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 682 transitions. Word has length 52 [2022-03-15 21:30:32,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:30:32,767 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 682 transitions. [2022-03-15 21:30:32,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.916666666666667) internal successors, (118), 24 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:32,767 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 682 transitions. [2022-03-15 21:30:32,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-03-15 21:30:32,767 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:30:32,767 INFO L514 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:30:32,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-03-15 21:30:32,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-03-15 21:30:32,983 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:30:32,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:30:32,983 INFO L85 PathProgramCache]: Analyzing trace with hash 781704536, now seen corresponding path program 65 times [2022-03-15 21:30:32,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:30:32,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567404530] [2022-03-15 21:30:32,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:30:32,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:30:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:30:33,583 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 253 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:33,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:30:33,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567404530] [2022-03-15 21:30:33,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567404530] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:30:33,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388586954] [2022-03-15 21:30:33,583 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:30:33,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:33,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:30:33,584 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:30:33,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-03-15 21:30:33,628 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2022-03-15 21:30:33,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:30:33,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 21:30:33,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:30:34,742 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 253 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:34,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:30:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:35,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388586954] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:30:35,357 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:30:35,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 117 [2022-03-15 21:30:35,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1765156346] [2022-03-15 21:30:35,358 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:30:35,362 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:30:35,395 INFO L252 McrAutomatonBuilder]: Finished intersection with 124 states and 193 transitions. [2022-03-15 21:30:35,396 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:30:37,333 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 47 new interpolants: [50645#(or (< i1 N1) (<= (+ 5 i2) N2)), 50663#(or (<= (+ 23 i2) N2) (< i1 N1)), 50681#(or (<= (+ 23 i2) N2) (< (+ i1 18) N1) (<= N1 (+ i1 17))), 50640#(< i1 N1), 50675#(or (<= (+ 23 i2) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 50654#(or (<= (+ 14 i2) N2) (< i1 N1)), 50662#(or (<= (+ 22 i2) N2) (< i1 N1)), 50666#(or (<= (+ 23 i2) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 50684#(or (< (+ 21 i1) N1) (<= (+ 23 i2) N2) (<= N1 (+ i1 20))), 50642#(or (< i1 N1) (<= (+ 2 i2) N2)), 50685#(or (<= N1 (+ 21 i1)) (<= (+ 23 i2) N2) (< (+ 22 i1) N1)), 50670#(or (<= (+ 23 i2) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 50653#(or (< i1 N1) (<= (+ i2 13) N2)), 50647#(or (<= (+ 7 i2) N2) (< i1 N1)), 50673#(or (<= (+ 23 i2) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 50665#(or (<= (+ 23 i2) N2) (<= N1 (+ i1 1)) (< (+ 2 i1) N1)), 50655#(or (<= (+ i2 15) N2) (< i1 N1)), 50641#(or (< i2 N2) (< i1 N1)), 50671#(or (<= N1 (+ 7 i1)) (<= (+ 23 i2) N2) (< (+ i1 8) N1)), 50643#(or (< i1 N1) (<= (+ 3 i2) N2)), 50650#(or (<= (+ i2 10) N2) (< i1 N1)), 50678#(or (<= N1 (+ 14 i1)) (<= (+ 23 i2) N2) (< (+ i1 15) N1)), 50674#(or (<= (+ 23 i2) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 50644#(or (<= (+ i2 4) N2) (< i1 N1)), 50660#(or (<= (+ i2 20) N2) (< i1 N1)), 50646#(or (< i1 N1) (<= (+ 6 i2) N2)), 50648#(or (< i1 N1) (<= (+ i2 8) N2)), 50677#(or (<= (+ 23 i2) N2) (<= N1 (+ i1 13)) (< (+ 14 i1) N1)), 50668#(or (<= N1 (+ i1 4)) (<= (+ 23 i2) N2) (< (+ 5 i1) N1)), 50656#(or (<= (+ 16 i2) N2) (< i1 N1)), 50667#(or (<= (+ 23 i2) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 50680#(or (< (+ i1 17) N1) (<= (+ 23 i2) N2) (<= N1 (+ 16 i1))), 50686#(or (<= (+ 23 i2) N2) (< (+ 23 i1) N1) (<= N1 (+ 22 i1))), 50682#(or (<= (+ 23 i2) N2) (<= N1 (+ i1 18)) (< (+ 19 i1) N1)), 50679#(or (< (+ 16 i1) N1) (<= (+ 23 i2) N2) (<= N1 (+ i1 15))), 50651#(or (<= (+ i2 11) N2) (< i1 N1)), 50672#(or (<= (+ 23 i2) N2) (< (+ 9 i1) N1) (<= N1 (+ i1 8))), 50661#(or (<= (+ 21 i2) N2) (< i1 N1)), 50657#(or (< i1 N1) (<= (+ i2 17) N2)), 50683#(or (<= (+ 23 i2) N2) (<= N1 (+ 19 i1)) (< (+ i1 20) N1)), 50676#(or (<= (+ 23 i2) N2) (<= N1 (+ i1 12)) (< (+ i1 13) N1)), 50649#(or (<= (+ 9 i2) N2) (< i1 N1)), 50658#(or (< i1 N1) (<= (+ i2 18) N2)), 50669#(or (<= (+ 23 i2) N2) (<= N1 (+ 5 i1)) (< (+ 6 i1) N1)), 50659#(or (<= (+ 19 i2) N2) (< i1 N1)), 50664#(or (<= (+ 23 i2) N2) (< (+ i1 1) N1) (<= N1 i1)), 50652#(or (<= (+ i2 12) N2) (< i1 N1))] [2022-03-15 21:30:37,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-03-15 21:30:37,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:30:37,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-03-15 21:30:37,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4260, Invalid=22800, Unknown=0, NotChecked=0, Total=27060 [2022-03-15 21:30:37,336 INFO L87 Difference]: Start difference. First operand 300 states and 682 transitions. Second operand has 96 states, 96 states have (on average 1.7708333333333333) internal successors, (170), 95 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 21:30:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:30:41,276 INFO L93 Difference]: Finished difference Result 682 states and 1264 transitions. [2022-03-15 21:30:41,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-03-15 21:30:41,276 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.7708333333333333) internal successors, (170), 95 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) Word has length 53 [2022-03-15 21:30:41,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:30:41,277 INFO L225 Difference]: With dead ends: 682 [2022-03-15 21:30:41,277 INFO L226 Difference]: Without dead ends: 514 [2022-03-15 21:30:41,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22376 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=13850, Invalid=50412, Unknown=0, NotChecked=0, Total=64262 [2022-03-15 21:30:41,280 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 698 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:30:41,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [698 Valid, 0 Invalid, 2439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 2060 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:30:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-03-15 21:30:41,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 173. [2022-03-15 21:30:41,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 2.116279069767442) internal successors, (364), 172 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:41,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 364 transitions. [2022-03-15 21:30:41,283 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 364 transitions. Word has length 53 [2022-03-15 21:30:41,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:30:41,283 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 364 transitions. [2022-03-15 21:30:41,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.7708333333333333) internal successors, (170), 95 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 21:30:41,283 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 364 transitions. [2022-03-15 21:30:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-03-15 21:30:41,284 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:30:41,284 INFO L514 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:30:41,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2022-03-15 21:30:41,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-03-15 21:30:41,495 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:30:41,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:30:41,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1669403916, now seen corresponding path program 66 times [2022-03-15 21:30:41,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:30:41,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104642844] [2022-03-15 21:30:41,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:30:41,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:30:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:30:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 254 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:41,893 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:30:41,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104642844] [2022-03-15 21:30:41,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104642844] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:30:41,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417164948] [2022-03-15 21:30:41,893 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:30:41,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:41,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:30:41,895 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:30:41,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-03-15 21:30:41,937 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-03-15 21:30:41,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:30:41,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 21:30:41,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:30:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 254 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:42,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:30:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:43,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417164948] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:30:43,930 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:30:43,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 47, 47] total 116 [2022-03-15 21:30:43,930 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2082743953] [2022-03-15 21:30:43,931 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:30:43,935 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:30:43,957 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 103 transitions. [2022-03-15 21:30:43,957 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:30:44,889 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [52337#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= (+ 6 i2) i1) (<= N1 (+ i1 15)))), 52323#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 1)) (<= (+ i2 20) i1))), 52333#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= N1 (+ i1 11)) (<= (+ i2 10) i1))), 52329#(and (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 7 i1)) (<= (+ 14 i2) i1))), 52344#(and (or (<= N1 (+ 21 i1)) (<= i2 i1)) (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0))), 52326#(and (or (<= N1 (+ i1 4)) (<= (+ i2 17) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 52322#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ 21 i2) i1) (<= N1 i1))), 52342#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ 2 i2) i1))), 52340#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17))) (or (<= (+ i2 4) i1) (<= N1 (+ i1 17)))), 52332#(and (or (<= N1 (+ i1 10)) (<= (+ i2 11) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10)))), 52336#(and (or (<= (+ 7 i2) i1) (<= N1 (+ 14 i1))) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0))), 52327#(and (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 5 i1)) (<= (+ 16 i2) i1))), 52325#(and (or (<= N1 (+ 3 i1)) (<= (+ i2 18) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 52335#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 13)) (<= (+ i2 8) i1))), 52331#(and (or (<= N1 (+ 9 i1)) (<= (+ i2 12) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 52341#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= (+ 3 i2) i1))), 52343#(and (or (<= N1 (+ i1 20)) (<= (+ i2 1) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20)))), 52338#(< i2 N2), 52328#(and (or (<= (+ i2 15) i1) (<= N1 (+ 6 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 52334#(and (or (<= (+ 9 i2) i1) (<= N1 (+ i1 12))) (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0))), 52339#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= (+ 5 i2) i1) (<= N1 (+ 16 i1)))), 52324#(and (or (<= N1 (+ 2 i1)) (<= (+ 19 i2) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 52330#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= (+ i2 13) i1) (<= N1 (+ i1 8))))] [2022-03-15 21:30:44,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-15 21:30:44,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:30:44,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-15 21:30:44,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4067, Invalid=15393, Unknown=0, NotChecked=0, Total=19460 [2022-03-15 21:30:44,891 INFO L87 Difference]: Start difference. First operand 173 states and 364 transitions. Second operand has 49 states, 49 states have (on average 2.061224489795918) internal successors, (101), 48 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 21:30:46,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:30:46,448 INFO L93 Difference]: Finished difference Result 328 states and 646 transitions. [2022-03-15 21:30:46,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-03-15 21:30:46,448 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.061224489795918) internal successors, (101), 48 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) Word has length 53 [2022-03-15 21:30:46,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:30:46,449 INFO L225 Difference]: With dead ends: 328 [2022-03-15 21:30:46,449 INFO L226 Difference]: Without dead ends: 327 [2022-03-15 21:30:46,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14285 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=10081, Invalid=32149, Unknown=0, NotChecked=0, Total=42230 [2022-03-15 21:30:46,451 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 434 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:30:46,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 0 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:30:46,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-03-15 21:30:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 151. [2022-03-15 21:30:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.1333333333333333) internal successors, (320), 150 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 320 transitions. [2022-03-15 21:30:46,453 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 320 transitions. Word has length 53 [2022-03-15 21:30:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:30:46,454 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 320 transitions. [2022-03-15 21:30:46,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.061224489795918) internal successors, (101), 48 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 21:30:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 320 transitions. [2022-03-15 21:30:46,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-03-15 21:30:46,454 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:30:46,454 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:30:46,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-03-15 21:30:46,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-03-15 21:30:46,667 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:30:46,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:30:46,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1537047903, now seen corresponding path program 67 times [2022-03-15 21:30:46,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:30:46,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952851206] [2022-03-15 21:30:46,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:30:46,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:30:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:30:47,043 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:47,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:30:47,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952851206] [2022-03-15 21:30:47,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952851206] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:30:47,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517720752] [2022-03-15 21:30:47,043 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:30:47,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:47,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:30:47,044 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:30:47,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-03-15 21:30:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:30:47,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 95 conjunts are in the unsatisfiable core [2022-03-15 21:30:47,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:30:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:47,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:30:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:47,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517720752] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:30:47,292 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:30:47,292 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2022-03-15 21:30:47,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1431421259] [2022-03-15 21:30:47,293 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:30:47,297 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:30:47,332 INFO L252 McrAutomatonBuilder]: Finished intersection with 127 states and 198 transitions. [2022-03-15 21:30:47,332 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:30:47,989 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:30:47,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 21:30:47,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:30:47,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 21:30:47,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:30:47,990 INFO L87 Difference]: Start difference. First operand 151 states and 320 transitions. Second operand has 26 states, 25 states have (on average 4.92) internal successors, (123), 25 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 21:30:49,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:30:49,007 INFO L93 Difference]: Finished difference Result 481 states and 931 transitions. [2022-03-15 21:30:49,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 21:30:49,007 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.92) internal successors, (123), 25 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-03-15 21:30:49,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:30:49,008 INFO L225 Difference]: With dead ends: 481 [2022-03-15 21:30:49,008 INFO L226 Difference]: Without dead ends: 429 [2022-03-15 21:30:49,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:30:49,009 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 2787 mSDsCounter, 0 mSdLazyCounter, 4638 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:30:49,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 4639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4638 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 21:30:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-03-15 21:30:49,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 313. [2022-03-15 21:30:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 2.282051282051282) internal successors, (712), 312 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 712 transitions. [2022-03-15 21:30:49,012 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 712 transitions. Word has length 54 [2022-03-15 21:30:49,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:30:49,012 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 712 transitions. [2022-03-15 21:30:49,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.92) internal successors, (123), 25 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 21:30:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 712 transitions. [2022-03-15 21:30:49,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-03-15 21:30:49,014 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:30:49,014 INFO L514 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:30:49,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-03-15 21:30:49,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-03-15 21:30:49,227 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:30:49,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:30:49,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1806820960, now seen corresponding path program 68 times [2022-03-15 21:30:49,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:30:49,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295181789] [2022-03-15 21:30:49,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:30:49,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:30:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:30:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:49,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:30:49,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295181789] [2022-03-15 21:30:49,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295181789] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:30:49,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106695219] [2022-03-15 21:30:49,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:30:49,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:49,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:30:49,776 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:30:49,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-03-15 21:30:49,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:30:49,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:30:49,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 21:30:49,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:30:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:50,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:30:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:51,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106695219] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:30:51,848 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:30:51,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 122 [2022-03-15 21:30:51,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1528760573] [2022-03-15 21:30:51,848 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:30:51,853 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:30:51,889 INFO L252 McrAutomatonBuilder]: Finished intersection with 129 states and 201 transitions. [2022-03-15 21:30:51,889 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:30:54,408 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 49 new interpolants: [55047#(or (< (+ i1 18) N1) (<= N1 (+ i1 17)) (<= (+ i2 24) N2)), 55036#(or (< (+ 7 i1) N1) (<= N1 (+ 6 i1)) (<= (+ i2 24) N2)), 55027#(or (<= (+ 22 i2) N2) (< i1 N1)), 55008#(or (< i1 N1) (<= (+ 3 i2) N2)), 55021#(or (<= (+ 16 i2) N2) (< i1 N1)), 55044#(or (<= N1 (+ 14 i1)) (< (+ i1 15) N1) (<= (+ i2 24) N2)), 55051#(or (<= N1 (+ 21 i1)) (<= (+ i2 24) N2) (< (+ 22 i1) N1)), 55038#(or (< (+ 9 i1) N1) (<= N1 (+ i1 8)) (<= (+ i2 24) N2)), 55015#(or (<= (+ i2 10) N2) (< i1 N1)), 55012#(or (<= (+ 7 i2) N2) (< i1 N1)), 55045#(or (< (+ 16 i1) N1) (<= (+ i2 24) N2) (<= N1 (+ i1 15))), 55046#(or (< (+ i1 17) N1) (<= (+ i2 24) N2) (<= N1 (+ 16 i1))), 55053#(or (< (+ i1 24) N1) (<= N1 (+ 23 i1)) (<= (+ i2 24) N2)), 55033#(or (<= N1 (+ 3 i1)) (<= (+ i2 24) N2) (< (+ i1 4) N1)), 55042#(or (<= N1 (+ i1 12)) (< (+ i1 13) N1) (<= (+ i2 24) N2)), 55030#(or (< (+ i1 1) N1) (<= (+ i2 24) N2) (<= N1 i1)), 55037#(or (<= N1 (+ 7 i1)) (< (+ i1 8) N1) (<= (+ i2 24) N2)), 55014#(or (<= (+ 9 i2) N2) (< i1 N1)), 55024#(or (<= (+ 19 i2) N2) (< i1 N1)), 55050#(or (< (+ 21 i1) N1) (<= N1 (+ i1 20)) (<= (+ i2 24) N2)), 55039#(or (<= N1 (+ 9 i1)) (<= (+ i2 24) N2) (< (+ i1 10) N1)), 55011#(or (< i1 N1) (<= (+ 6 i2) N2)), 55007#(or (< i1 N1) (<= (+ 2 i2) N2)), 55034#(or (<= N1 (+ i1 4)) (<= (+ i2 24) N2) (< (+ 5 i1) N1)), 55052#(or (< (+ 23 i1) N1) (<= (+ i2 24) N2) (<= N1 (+ 22 i1))), 55022#(or (< i1 N1) (<= (+ i2 17) N2)), 55016#(or (<= (+ i2 11) N2) (< i1 N1)), 55041#(or (<= (+ i2 24) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 55005#(< i1 N1), 55048#(or (<= N1 (+ i1 18)) (< (+ 19 i1) N1) (<= (+ i2 24) N2)), 55010#(or (< i1 N1) (<= (+ 5 i2) N2)), 55013#(or (< i1 N1) (<= (+ i2 8) N2)), 55020#(or (<= (+ i2 15) N2) (< i1 N1)), 55018#(or (< i1 N1) (<= (+ i2 13) N2)), 55049#(or (<= N1 (+ 19 i1)) (< (+ i1 20) N1) (<= (+ i2 24) N2)), 55043#(or (<= N1 (+ i1 13)) (<= (+ i2 24) N2) (< (+ 14 i1) N1)), 55032#(or (<= N1 (+ 2 i1)) (<= (+ i2 24) N2) (< (+ 3 i1) N1)), 55028#(or (<= (+ 23 i2) N2) (< i1 N1)), 55019#(or (<= (+ 14 i2) N2) (< i1 N1)), 55023#(or (< i1 N1) (<= (+ i2 18) N2)), 55040#(or (< (+ i1 11) N1) (<= (+ i2 24) N2) (<= N1 (+ i1 10))), 55029#(or (< i1 N1) (<= (+ i2 24) N2)), 55009#(or (<= (+ i2 4) N2) (< i1 N1)), 55025#(or (<= (+ i2 20) N2) (< i1 N1)), 55006#(or (< i2 N2) (< i1 N1)), 55026#(or (<= (+ 21 i2) N2) (< i1 N1)), 55035#(or (<= N1 (+ 5 i1)) (<= (+ i2 24) N2) (< (+ 6 i1) N1)), 55017#(or (<= (+ i2 12) N2) (< i1 N1)), 55031#(or (<= N1 (+ i1 1)) (<= (+ i2 24) N2) (< (+ 2 i1) N1))] [2022-03-15 21:30:54,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2022-03-15 21:30:54,408 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:30:54,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2022-03-15 21:30:54,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4613, Invalid=24799, Unknown=0, NotChecked=0, Total=29412 [2022-03-15 21:30:54,410 INFO L87 Difference]: Start difference. First operand 313 states and 712 transitions. Second operand has 100 states, 100 states have (on average 1.77) internal successors, (177), 99 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:58,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:30:58,889 INFO L93 Difference]: Finished difference Result 712 states and 1320 transitions. [2022-03-15 21:30:58,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 21:30:58,890 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 100 states have (on average 1.77) internal successors, (177), 99 states have internal predecessors, (177), 0 states have call successors, (0), 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 55 [2022-03-15 21:30:58,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:30:58,891 INFO L225 Difference]: With dead ends: 712 [2022-03-15 21:30:58,891 INFO L226 Difference]: Without dead ends: 536 [2022-03-15 21:30:58,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24404 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=15064, Invalid=54896, Unknown=0, NotChecked=0, Total=69960 [2022-03-15 21:30:58,894 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1056 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 1907 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 1907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:30:58,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1056 Valid, 0 Invalid, 2333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 1907 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:30:58,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-03-15 21:30:58,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 180. [2022-03-15 21:30:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.11731843575419) internal successors, (379), 179 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 379 transitions. [2022-03-15 21:30:58,897 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 379 transitions. Word has length 55 [2022-03-15 21:30:58,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:30:58,897 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 379 transitions. [2022-03-15 21:30:58,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 1.77) internal successors, (177), 99 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:58,898 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 379 transitions. [2022-03-15 21:30:58,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-03-15 21:30:58,911 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:30:58,911 INFO L514 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:30:58,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-03-15 21:30:59,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:59,123 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:30:59,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:30:59,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1601586550, now seen corresponding path program 69 times [2022-03-15 21:30:59,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:30:59,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164756827] [2022-03-15 21:30:59,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:30:59,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:30:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:30:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 277 proven. 299 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:59,562 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:30:59,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164756827] [2022-03-15 21:30:59,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164756827] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:30:59,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655820214] [2022-03-15 21:30:59,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:30:59,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:59,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:30:59,584 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:30:59,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-03-15 21:30:59,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-03-15 21:30:59,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:30:59,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 21:30:59,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 277 proven. 299 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:01,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:02,437 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:02,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655820214] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:02,437 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:02,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 49, 49] total 121 [2022-03-15 21:31:02,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1063663347] [2022-03-15 21:31:02,438 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:02,442 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:02,467 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 107 transitions. [2022-03-15 21:31:02,467 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:03,403 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [56762#(and (or (<= N1 (+ i1 4)) (<= (+ i2 18) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 56778#(and (or (<= N1 (+ i1 20)) (<= (+ 2 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20)))), 56760#(and (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 2 i1)) (<= (+ i2 20) i1))), 56766#(and (or (<= N1 (+ i1 8)) (<= (+ 14 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8)))), 56758#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= N1 i1) (<= (+ 22 i2) i1))), 56768#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= (+ i2 12) i1) (<= N1 (+ i1 10)))), 56767#(and (or (<= (+ i2 13) i1) (<= N1 (+ 9 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 56777#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ 3 i2) i1))), 56779#(and (or (<= N1 (+ 21 i1)) (<= (+ i2 1) i1)) (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0))), 56763#(and (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 5 i1)) (<= (+ i2 17) i1))), 56773#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= (+ 7 i2) i1) (<= N1 (+ i1 15)))), 56764#(and (or (<= N1 (+ 6 i1)) (<= (+ 16 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 56761#(and (or (<= N1 (+ 3 i1)) (<= (+ 19 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 56769#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ i2 11) i1) (<= N1 (+ i1 11)))), 56772#(and (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 14 i1)) (<= (+ i2 8) i1))), 56765#(and (or (<= N1 (+ 7 i1)) (<= (+ i2 15) i1)) (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0))), 56771#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 9 i2) i1) (<= N1 (+ i1 13)))), 56781#(< i2 N2), 56776#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 4) i1) (<= N1 (+ i1 18)))), 56774#(and (or (<= (+ 6 i2) i1) (<= N1 (+ 16 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1)))), 56770#(and (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 12)) (<= (+ i2 10) i1))), 56775#(and (or (<= N1 (+ i1 17)) (<= (+ 5 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 56780#(and (or (<= N1 (+ 22 i1)) (<= i2 i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 56759#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 1)) (<= (+ 21 i2) i1)))] [2022-03-15 21:31:03,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 21:31:03,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:03,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 21:31:03,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4412, Invalid=16758, Unknown=0, NotChecked=0, Total=21170 [2022-03-15 21:31:03,405 INFO L87 Difference]: Start difference. First operand 180 states and 379 transitions. Second operand has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:04,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:04,881 INFO L93 Difference]: Finished difference Result 342 states and 674 transitions. [2022-03-15 21:31:04,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-03-15 21:31:04,881 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-03-15 21:31:04,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:04,882 INFO L225 Difference]: With dead ends: 342 [2022-03-15 21:31:04,882 INFO L226 Difference]: Without dead ends: 341 [2022-03-15 21:31:04,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15607 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=10964, Invalid=35046, Unknown=0, NotChecked=0, Total=46010 [2022-03-15 21:31:04,886 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 267 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:04,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 0 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:31:04,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-03-15 21:31:04,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 157. [2022-03-15 21:31:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.1346153846153846) internal successors, (333), 156 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:04,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 333 transitions. [2022-03-15 21:31:04,888 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 333 transitions. Word has length 55 [2022-03-15 21:31:04,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:04,888 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 333 transitions. [2022-03-15 21:31:04,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:04,889 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 333 transitions. [2022-03-15 21:31:04,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-03-15 21:31:04,902 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:04,902 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:04,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-03-15 21:31:05,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:05,130 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:31:05,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:05,130 INFO L85 PathProgramCache]: Analyzing trace with hash -176959655, now seen corresponding path program 70 times [2022-03-15 21:31:05,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:05,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473283452] [2022-03-15 21:31:05,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:05,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:05,399 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:05,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473283452] [2022-03-15 21:31:05,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473283452] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:05,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653106876] [2022-03-15 21:31:05,399 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:31:05,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:05,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:05,400 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:05,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-03-15 21:31:05,444 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:31:05,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:31:05,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 99 conjunts are in the unsatisfiable core [2022-03-15 21:31:05,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:05,551 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:05,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:05,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653106876] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:05,658 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:05,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 25 [2022-03-15 21:31:05,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1286239599] [2022-03-15 21:31:05,659 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:05,663 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:05,748 INFO L252 McrAutomatonBuilder]: Finished intersection with 132 states and 206 transitions. [2022-03-15 21:31:05,748 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:06,349 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:31:06,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:31:06,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:06,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:31:06,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-03-15 21:31:06,350 INFO L87 Difference]: Start difference. First operand 157 states and 333 transitions. Second operand has 27 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:07,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:07,267 INFO L93 Difference]: Finished difference Result 501 states and 970 transitions. [2022-03-15 21:31:07,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 21:31:07,267 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-03-15 21:31:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:07,268 INFO L225 Difference]: With dead ends: 501 [2022-03-15 21:31:07,268 INFO L226 Difference]: Without dead ends: 447 [2022-03-15 21:31:07,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-03-15 21:31:07,269 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 3028 mSDsCounter, 0 mSdLazyCounter, 5031 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:07,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 5032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5031 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:31:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-03-15 21:31:07,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 326. [2022-03-15 21:31:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 2.2830769230769232) internal successors, (742), 325 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 742 transitions. [2022-03-15 21:31:07,285 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 742 transitions. Word has length 56 [2022-03-15 21:31:07,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:07,286 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 742 transitions. [2022-03-15 21:31:07,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 742 transitions. [2022-03-15 21:31:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-15 21:31:07,286 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:07,286 INFO L514 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:07,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-03-15 21:31:07,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:07,502 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:31:07,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:07,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1730829672, now seen corresponding path program 71 times [2022-03-15 21:31:07,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:07,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110415730] [2022-03-15 21:31:07,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:07,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:08,207 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 300 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:08,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:08,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110415730] [2022-03-15 21:31:08,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110415730] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:08,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100372655] [2022-03-15 21:31:08,207 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:31:08,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:08,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:08,208 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:08,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-03-15 21:31:08,254 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2022-03-15 21:31:08,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:31:08,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-15 21:31:08,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 300 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:09,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:10,300 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:10,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100372655] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:10,301 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:10,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 127 [2022-03-15 21:31:10,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1045163052] [2022-03-15 21:31:10,301 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:10,306 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:10,344 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 209 transitions. [2022-03-15 21:31:10,344 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:12,518 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 51 new interpolants: [59564#(or (<= (+ 14 i2) N2) (< i1 N1)), 59550#(< i1 N1), 59570#(or (<= (+ i2 20) N2) (< i1 N1)), 59588#(or (<= N1 (+ i1 12)) (< (+ i1 13) N1) (<= (+ i2 25) N2)), 59560#(or (<= (+ i2 10) N2) (< i1 N1)), 59556#(or (< i1 N1) (<= (+ 6 i2) N2)), 59589#(or (<= N1 (+ i1 13)) (<= (+ i2 25) N2) (< (+ 14 i1) N1)), 59578#(or (<= N1 (+ 2 i1)) (<= (+ i2 25) N2) (< (+ 3 i1) N1)), 59579#(or (<= (+ i2 25) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 59562#(or (<= (+ i2 12) N2) (< i1 N1)), 59565#(or (<= (+ i2 15) N2) (< i1 N1)), 59598#(or (< (+ 23 i1) N1) (<= (+ i2 25) N2) (<= N1 (+ 22 i1))), 59574#(or (< i1 N1) (<= (+ i2 24) N2)), 59567#(or (< i1 N1) (<= (+ i2 17) N2)), 59555#(or (< i1 N1) (<= (+ 5 i2) N2)), 59552#(or (< i1 N1) (<= (+ 2 i2) N2)), 59559#(or (<= (+ 9 i2) N2) (< i1 N1)), 59583#(or (<= N1 (+ 7 i1)) (< (+ i1 8) N1) (<= (+ i2 25) N2)), 59580#(or (<= N1 (+ i1 4)) (<= (+ i2 25) N2) (< (+ 5 i1) N1)), 59581#(or (<= N1 (+ 5 i1)) (<= (+ i2 25) N2) (< (+ 6 i1) N1)), 59584#(or (< (+ 9 i1) N1) (<= N1 (+ i1 8)) (<= (+ i2 25) N2)), 59594#(or (<= N1 (+ i1 18)) (<= (+ i2 25) N2) (< (+ 19 i1) N1)), 59553#(or (< i1 N1) (<= (+ 3 i2) N2)), 59595#(or (<= N1 (+ 19 i1)) (< (+ i1 20) N1) (<= (+ i2 25) N2)), 59566#(or (<= (+ 16 i2) N2) (< i1 N1)), 59597#(or (<= N1 (+ 21 i1)) (<= (+ i2 25) N2) (< (+ 22 i1) N1)), 59587#(or (<= (+ i2 25) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 59571#(or (<= (+ 21 i2) N2) (< i1 N1)), 59573#(or (<= (+ 23 i2) N2) (< i1 N1)), 59590#(or (<= N1 (+ 14 i1)) (< (+ i1 15) N1) (<= (+ i2 25) N2)), 59576#(or (< (+ i1 1) N1) (<= (+ i2 25) N2) (<= N1 i1)), 59585#(or (<= (+ i2 25) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 59596#(or (< (+ 21 i1) N1) (<= (+ i2 25) N2) (<= N1 (+ i1 20))), 59577#(or (<= N1 (+ i1 1)) (<= (+ i2 25) N2) (< (+ 2 i1) N1)), 59551#(or (< i2 N2) (< i1 N1)), 59563#(or (< i1 N1) (<= (+ i2 13) N2)), 59586#(or (< (+ i1 11) N1) (<= (+ i2 25) N2) (<= N1 (+ i1 10))), 59575#(or (<= (+ i2 25) N2) (< i1 N1)), 59591#(or (< (+ 16 i1) N1) (<= (+ i2 25) N2) (<= N1 (+ i1 15))), 59568#(or (< i1 N1) (<= (+ i2 18) N2)), 59569#(or (<= (+ 19 i2) N2) (< i1 N1)), 59599#(or (< (+ i1 24) N1) (<= (+ i2 25) N2) (<= N1 (+ 23 i1))), 59561#(or (<= (+ i2 11) N2) (< i1 N1)), 59600#(or (<= N1 (+ i1 24)) (<= (+ i2 25) N2) (< (+ i1 25) N1)), 59592#(or (< (+ i1 17) N1) (<= (+ i2 25) N2) (<= N1 (+ 16 i1))), 59558#(or (< i1 N1) (<= (+ i2 8) N2)), 59554#(or (<= (+ i2 4) N2) (< i1 N1)), 59557#(or (<= (+ 7 i2) N2) (< i1 N1)), 59582#(or (< (+ 7 i1) N1) (<= N1 (+ 6 i1)) (<= (+ i2 25) N2)), 59572#(or (<= (+ 22 i2) N2) (< i1 N1)), 59593#(or (< (+ i1 18) N1) (<= N1 (+ i1 17)) (<= (+ i2 25) N2))] [2022-03-15 21:31:12,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-03-15 21:31:12,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:12,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-03-15 21:31:12,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4980, Invalid=26882, Unknown=0, NotChecked=0, Total=31862 [2022-03-15 21:31:12,535 INFO L87 Difference]: Start difference. First operand 326 states and 742 transitions. Second operand has 104 states, 104 states have (on average 1.7692307692307692) internal successors, (184), 103 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:16,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:16,721 INFO L93 Difference]: Finished difference Result 742 states and 1376 transitions. [2022-03-15 21:31:16,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-03-15 21:31:16,721 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 1.7692307692307692) internal successors, (184), 103 states have internal predecessors, (184), 0 states have call successors, (0), 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 57 [2022-03-15 21:31:16,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:16,723 INFO L225 Difference]: With dead ends: 742 [2022-03-15 21:31:16,723 INFO L226 Difference]: Without dead ends: 558 [2022-03-15 21:31:16,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26520 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=16329, Invalid=59571, Unknown=0, NotChecked=0, Total=75900 [2022-03-15 21:31:16,726 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 911 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 2084 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:16,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [911 Valid, 0 Invalid, 2527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2084 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:31:16,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-03-15 21:31:16,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 187. [2022-03-15 21:31:16,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 2.118279569892473) internal successors, (394), 186 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 394 transitions. [2022-03-15 21:31:16,730 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 394 transitions. Word has length 57 [2022-03-15 21:31:16,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:16,730 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 394 transitions. [2022-03-15 21:31:16,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 1.7692307692307692) internal successors, (184), 103 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:16,730 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 394 transitions. [2022-03-15 21:31:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-15 21:31:16,730 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:16,730 INFO L514 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:16,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-03-15 21:31:16,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2022-03-15 21:31:16,947 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:31:16,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:16,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1784848756, now seen corresponding path program 72 times [2022-03-15 21:31:16,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:16,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862767441] [2022-03-15 21:31:16,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:16,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 301 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:17,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:17,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862767441] [2022-03-15 21:31:17,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862767441] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:17,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187980770] [2022-03-15 21:31:17,405 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:31:17,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:17,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:17,406 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:17,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-03-15 21:31:17,451 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-03-15 21:31:17,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:31:17,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-15 21:31:17,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 301 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:18,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:19,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187980770] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:19,806 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:19,806 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 51, 51] total 126 [2022-03-15 21:31:19,807 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2037841678] [2022-03-15 21:31:19,807 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:19,812 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:19,839 INFO L252 McrAutomatonBuilder]: Finished intersection with 85 states and 111 transitions. [2022-03-15 21:31:19,839 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:20,794 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [61376#(and (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 2 i1)) (<= (+ 21 i2) i1))), 61382#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= (+ i2 15) i1) (<= N1 (+ i1 8)))), 61387#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 13)) (<= (+ i2 10) i1))), 61386#(and (or (<= N1 (+ i1 12)) (<= (+ i2 11) i1)) (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0))), 61393#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 4) i1) (<= N1 (+ 19 i1)))), 61390#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= (+ 7 i2) i1) (<= N1 (+ 16 i1)))), 61378#(and (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 4)) (<= (+ 19 i2) i1))), 61397#(and (or (<= (+ i2 1) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 61375#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 1)) (<= (+ 22 i2) i1))), 61396#(and (or (<= N1 (+ 21 i1)) (<= (+ 2 i2) i1)) (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0))), 61383#(and (or (<= (+ 14 i2) i1) (<= N1 (+ 9 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 61379#(and (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 5 i1)) (<= (+ i2 18) i1))), 61385#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ i2 12) i1) (<= N1 (+ i1 11)))), 61380#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1))) (or (<= N1 (+ 6 i1)) (<= (+ i2 17) i1))), 61388#(and (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 14 i1)) (<= (+ 9 i2) i1))), 61398#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1))) (or (<= N1 (+ 23 i1)) (<= i2 i1))), 61377#(and (or (<= N1 (+ 3 i1)) (<= (+ i2 20) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 61392#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= (+ 5 i2) i1))), 61391#(and (or (<= (+ 6 i2) i1) (<= N1 (+ i1 17))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 61381#(and (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 7 i1)) (<= (+ 16 i2) i1))), 61389#(and (or (<= (+ i2 8) i1) (<= N1 (+ i1 15))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15)))), 61395#(< i2 N2), 61384#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= (+ i2 13) i1) (<= N1 (+ i1 10)))), 61374#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ 23 i2) i1) (<= N1 i1))), 61394#(and (or (<= N1 (+ i1 20)) (<= (+ 3 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20))))] [2022-03-15 21:31:20,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-15 21:31:20,794 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:20,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-15 21:31:20,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4771, Invalid=18181, Unknown=0, NotChecked=0, Total=22952 [2022-03-15 21:31:20,796 INFO L87 Difference]: Start difference. First operand 187 states and 394 transitions. Second operand has 53 states, 53 states have (on average 2.056603773584906) internal successors, (109), 52 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 21:31:22,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:22,569 INFO L93 Difference]: Finished difference Result 356 states and 702 transitions. [2022-03-15 21:31:22,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-03-15 21:31:22,570 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.056603773584906) internal successors, (109), 52 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-03-15 21:31:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:22,571 INFO L225 Difference]: With dead ends: 356 [2022-03-15 21:31:22,571 INFO L226 Difference]: Without dead ends: 355 [2022-03-15 21:31:22,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16978 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=11884, Invalid=38068, Unknown=0, NotChecked=0, Total=49952 [2022-03-15 21:31:22,575 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 255 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:22,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 0 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:31:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-03-15 21:31:22,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 163. [2022-03-15 21:31:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 2.1358024691358026) internal successors, (346), 162 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 346 transitions. [2022-03-15 21:31:22,579 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 346 transitions. Word has length 57 [2022-03-15 21:31:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:22,579 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 346 transitions. [2022-03-15 21:31:22,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.056603773584906) internal successors, (109), 52 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 21:31:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 346 transitions. [2022-03-15 21:31:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-15 21:31:22,579 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:22,579 INFO L514 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:22,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-03-15 21:31:22,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:22,787 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:31:22,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:22,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2116197023, now seen corresponding path program 73 times [2022-03-15 21:31:22,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:22,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933798893] [2022-03-15 21:31:22,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:22,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:23,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:23,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933798893] [2022-03-15 21:31:23,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933798893] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:23,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844896159] [2022-03-15 21:31:23,194 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:31:23,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:23,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:23,195 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:23,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-03-15 21:31:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:23,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 103 conjunts are in the unsatisfiable core [2022-03-15 21:31:23,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:23,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:23,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844896159] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:23,638 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:23,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2022-03-15 21:31:23,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [884838340] [2022-03-15 21:31:23,638 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:23,643 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:23,685 INFO L252 McrAutomatonBuilder]: Finished intersection with 137 states and 214 transitions. [2022-03-15 21:31:23,685 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:24,600 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:31:24,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:31:24,602 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:24,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:31:24,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:31:24,602 INFO L87 Difference]: Start difference. First operand 163 states and 346 transitions. Second operand has 28 states, 27 states have (on average 4.925925925925926) internal successors, (133), 27 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:25,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:25,864 INFO L93 Difference]: Finished difference Result 521 states and 1009 transitions. [2022-03-15 21:31:25,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 21:31:25,865 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.925925925925926) internal successors, (133), 27 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-03-15 21:31:25,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:25,866 INFO L225 Difference]: With dead ends: 521 [2022-03-15 21:31:25,866 INFO L226 Difference]: Without dead ends: 465 [2022-03-15 21:31:25,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 214 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:31:25,866 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 3279 mSDsCounter, 0 mSdLazyCounter, 5440 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:25,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 5441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5440 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 21:31:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-03-15 21:31:25,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 339. [2022-03-15 21:31:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 2.2840236686390534) internal successors, (772), 338 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 772 transitions. [2022-03-15 21:31:25,871 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 772 transitions. Word has length 58 [2022-03-15 21:31:25,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:25,871 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 772 transitions. [2022-03-15 21:31:25,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.925925925925926) internal successors, (133), 27 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 772 transitions. [2022-03-15 21:31:25,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-15 21:31:25,871 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:25,871 INFO L514 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:25,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-03-15 21:31:26,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:26,079 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:31:26,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:26,079 INFO L85 PathProgramCache]: Analyzing trace with hash -736664352, now seen corresponding path program 74 times [2022-03-15 21:31:26,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:26,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100678024] [2022-03-15 21:31:26,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:26,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:26,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:26,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100678024] [2022-03-15 21:31:26,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100678024] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:26,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043453062] [2022-03-15 21:31:26,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:31:26,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:26,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:26,728 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:26,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-03-15 21:31:26,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:31:26,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:31:26,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 21:31:26,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:28,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:29,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043453062] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:29,005 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:29,005 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 132 [2022-03-15 21:31:29,005 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1615350761] [2022-03-15 21:31:29,005 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:29,010 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:29,053 INFO L252 McrAutomatonBuilder]: Finished intersection with 139 states and 217 transitions. [2022-03-15 21:31:29,053 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:31,348 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 53 new interpolants: [64326#(or (<= (+ i2 26) N2) (<= N1 (+ i1 24)) (< (+ i1 25) N1)), 64303#(or (<= (+ i2 26) N2) (<= N1 (+ i1 1)) (< (+ 2 i1) N1)), 64293#(or (< i1 N1) (<= (+ i2 18) N2)), 64311#(or (<= (+ i2 26) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 64284#(or (<= (+ 9 i2) N2) (< i1 N1)), 64304#(or (<= (+ i2 26) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 64301#(or (<= (+ i2 26) N2) (< i1 N1)), 64309#(or (<= N1 (+ 7 i1)) (<= (+ i2 26) N2) (< (+ i1 8) N1)), 64295#(or (<= (+ i2 20) N2) (< i1 N1)), 64319#(or (<= (+ i2 26) N2) (< (+ i1 18) N1) (<= N1 (+ i1 17))), 64316#(or (<= (+ i2 26) N2) (<= N1 (+ 14 i1)) (< (+ i1 15) N1)), 64313#(or (<= (+ i2 26) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 64277#(or (< i1 N1) (<= (+ 2 i2) N2)), 64310#(or (<= (+ i2 26) N2) (< (+ 9 i1) N1) (<= N1 (+ i1 8))), 64300#(or (<= (+ i2 25) N2) (< i1 N1)), 64314#(or (<= (+ i2 26) N2) (<= N1 (+ i1 12)) (< (+ i1 13) N1)), 64286#(or (<= (+ i2 11) N2) (< i1 N1)), 64279#(or (<= (+ i2 4) N2) (< i1 N1)), 64288#(or (< i1 N1) (<= (+ i2 13) N2)), 64324#(or (<= (+ i2 26) N2) (< (+ 23 i1) N1) (<= N1 (+ 22 i1))), 64275#(< i1 N1), 64278#(or (< i1 N1) (<= (+ 3 i2) N2)), 64322#(or (<= (+ i2 26) N2) (< (+ 21 i1) N1) (<= N1 (+ i1 20))), 64281#(or (< i1 N1) (<= (+ 6 i2) N2)), 64327#(or (< (+ i1 26) N1) (<= (+ i2 26) N2) (<= N1 (+ i1 25))), 64290#(or (<= (+ i2 15) N2) (< i1 N1)), 64299#(or (< i1 N1) (<= (+ i2 24) N2)), 64308#(or (<= (+ i2 26) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 64276#(or (< i2 N2) (< i1 N1)), 64317#(or (<= (+ i2 26) N2) (< (+ 16 i1) N1) (<= N1 (+ i1 15))), 64306#(or (<= (+ i2 26) N2) (<= N1 (+ i1 4)) (< (+ 5 i1) N1)), 64312#(or (<= (+ i2 26) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 64320#(or (<= (+ i2 26) N2) (<= N1 (+ i1 18)) (< (+ 19 i1) N1)), 64305#(or (<= (+ i2 26) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 64325#(or (<= (+ i2 26) N2) (< (+ i1 24) N1) (<= N1 (+ 23 i1))), 64291#(or (<= (+ 16 i2) N2) (< i1 N1)), 64315#(or (<= (+ i2 26) N2) (<= N1 (+ i1 13)) (< (+ 14 i1) N1)), 64297#(or (<= (+ 22 i2) N2) (< i1 N1)), 64294#(or (<= (+ 19 i2) N2) (< i1 N1)), 64289#(or (<= (+ 14 i2) N2) (< i1 N1)), 64282#(or (<= (+ 7 i2) N2) (< i1 N1)), 64298#(or (<= (+ 23 i2) N2) (< i1 N1)), 64321#(or (<= (+ i2 26) N2) (<= N1 (+ 19 i1)) (< (+ i1 20) N1)), 64307#(or (<= (+ i2 26) N2) (<= N1 (+ 5 i1)) (< (+ 6 i1) N1)), 64287#(or (<= (+ i2 12) N2) (< i1 N1)), 64296#(or (<= (+ 21 i2) N2) (< i1 N1)), 64285#(or (<= (+ i2 10) N2) (< i1 N1)), 64302#(or (<= (+ i2 26) N2) (< (+ i1 1) N1) (<= N1 i1)), 64318#(or (<= (+ i2 26) N2) (< (+ i1 17) N1) (<= N1 (+ 16 i1))), 64283#(or (< i1 N1) (<= (+ i2 8) N2)), 64323#(or (<= (+ i2 26) N2) (<= N1 (+ 21 i1)) (< (+ 22 i1) N1)), 64292#(or (< i1 N1) (<= (+ i2 17) N2)), 64280#(or (< i1 N1) (<= (+ 5 i2) N2))] [2022-03-15 21:31:31,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-03-15 21:31:31,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:31,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-03-15 21:31:31,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5361, Invalid=29049, Unknown=0, NotChecked=0, Total=34410 [2022-03-15 21:31:31,351 INFO L87 Difference]: Start difference. First operand 339 states and 772 transitions. Second operand has 108 states, 108 states have (on average 1.7685185185185186) internal successors, (191), 107 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 21:31:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:35,754 INFO L93 Difference]: Finished difference Result 772 states and 1432 transitions. [2022-03-15 21:31:35,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-03-15 21:31:35,754 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 1.7685185185185186) internal successors, (191), 107 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-03-15 21:31:35,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:35,756 INFO L225 Difference]: With dead ends: 772 [2022-03-15 21:31:35,756 INFO L226 Difference]: Without dead ends: 580 [2022-03-15 21:31:35,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28724 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=17645, Invalid=64437, Unknown=0, NotChecked=0, Total=82082 [2022-03-15 21:31:35,760 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 985 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 2329 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 2329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:35,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [985 Valid, 0 Invalid, 2805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 2329 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:31:35,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2022-03-15 21:31:35,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 194. [2022-03-15 21:31:35,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 2.1191709844559585) internal successors, (409), 193 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:35,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 409 transitions. [2022-03-15 21:31:35,764 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 409 transitions. Word has length 59 [2022-03-15 21:31:35,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:35,764 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 409 transitions. [2022-03-15 21:31:35,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 1.7685185185185186) internal successors, (191), 107 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 21:31:35,764 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 409 transitions. [2022-03-15 21:31:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-15 21:31:35,764 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:35,764 INFO L514 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:35,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-03-15 21:31:35,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-03-15 21:31:35,980 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:31:35,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:35,981 INFO L85 PathProgramCache]: Analyzing trace with hash -751725450, now seen corresponding path program 75 times [2022-03-15 21:31:35,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:35,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376716039] [2022-03-15 21:31:35,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:35,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 326 proven. 350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:36,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:36,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376716039] [2022-03-15 21:31:36,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376716039] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:36,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962754201] [2022-03-15 21:31:36,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:31:36,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:36,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:36,391 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:36,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-03-15 21:31:36,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-03-15 21:31:36,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:31:36,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 21:31:36,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:37,984 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 326 proven. 350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:37,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:39,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962754201] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:39,558 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:39,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 53, 53] total 131 [2022-03-15 21:31:39,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1898291652] [2022-03-15 21:31:39,558 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:39,563 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:39,593 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 115 transitions. [2022-03-15 21:31:39,593 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:40,693 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [66178#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= N1 (+ i1 8)) (<= (+ 16 i2) i1))), 66194#(and (or (<= N1 (+ 23 i1)) (<= (+ i2 1) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1)))), 66171#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 1)) (<= (+ 23 i2) i1))), 66187#(and (or (<= (+ 7 i2) i1) (<= N1 (+ i1 17))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 66179#(and (or (<= (+ i2 15) i1) (<= N1 (+ 9 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 66188#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= (+ 6 i2) i1))), 66184#(and (or (<= N1 (+ 14 i1)) (<= (+ i2 10) i1)) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0))), 66186#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= (+ i2 8) i1) (<= N1 (+ 16 i1)))), 66182#(and (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 12)) (<= (+ i2 12) i1))), 66183#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 13)) (<= (+ i2 11) i1))), 66173#(and (or (<= (+ 21 i2) i1) (<= N1 (+ 3 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 66176#(and (or (<= N1 (+ 6 i1)) (<= (+ i2 18) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 66181#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ i2 13) i1) (<= N1 (+ i1 11)))), 66195#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 24)) (<= i2 i1))), 66193#(< i2 N2), 66180#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= (+ 14 i2) i1) (<= N1 (+ i1 10)))), 66191#(and (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 21 i1)) (<= (+ 3 i2) i1))), 66170#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ i2 24) i1) (<= N1 i1))), 66189#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ 5 i2) i1))), 66175#(and (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 5 i1)) (<= (+ 19 i2) i1))), 66185#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= (+ 9 i2) i1) (<= N1 (+ i1 15)))), 66192#(and (or (<= (+ 2 i2) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 66190#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20))) (or (<= (+ i2 4) i1) (<= N1 (+ i1 20)))), 66172#(and (or (<= N1 (+ 2 i1)) (<= (+ 22 i2) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 66177#(and (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 7 i1)) (<= (+ i2 17) i1))), 66174#(and (or (<= N1 (+ i1 4)) (<= (+ i2 20) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0)))] [2022-03-15 21:31:40,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-15 21:31:40,693 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:40,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-15 21:31:40,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5144, Invalid=19662, Unknown=0, NotChecked=0, Total=24806 [2022-03-15 21:31:40,694 INFO L87 Difference]: Start difference. First operand 194 states and 409 transitions. Second operand has 55 states, 55 states have (on average 2.0545454545454547) internal successors, (113), 54 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:42,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:42,680 INFO L93 Difference]: Finished difference Result 370 states and 730 transitions. [2022-03-15 21:31:42,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-03-15 21:31:42,681 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.0545454545454547) internal successors, (113), 54 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-03-15 21:31:42,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:42,682 INFO L225 Difference]: With dead ends: 370 [2022-03-15 21:31:42,682 INFO L226 Difference]: Without dead ends: 369 [2022-03-15 21:31:42,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18411 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=12841, Invalid=41215, Unknown=0, NotChecked=0, Total=54056 [2022-03-15 21:31:42,686 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 372 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:42,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 0 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:31:42,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-03-15 21:31:42,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 169. [2022-03-15 21:31:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 2.136904761904762) internal successors, (359), 168 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:42,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 359 transitions. [2022-03-15 21:31:42,689 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 359 transitions. Word has length 59 [2022-03-15 21:31:42,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:42,689 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 359 transitions. [2022-03-15 21:31:42,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.0545454545454547) internal successors, (113), 54 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:42,689 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 359 transitions. [2022-03-15 21:31:42,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-03-15 21:31:42,689 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:42,689 INFO L514 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:42,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-03-15 21:31:42,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-03-15 21:31:42,905 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:31:42,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:42,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1361843175, now seen corresponding path program 76 times [2022-03-15 21:31:42,906 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:42,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18634644] [2022-03-15 21:31:42,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:42,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:43,205 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:43,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18634644] [2022-03-15 21:31:43,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18634644] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:43,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780224593] [2022-03-15 21:31:43,205 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:31:43,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:43,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:43,206 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:43,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-03-15 21:31:43,257 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:31:43,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:31:43,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 107 conjunts are in the unsatisfiable core [2022-03-15 21:31:43,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:43,367 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:43,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:43,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780224593] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:43,478 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:43,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 27 [2022-03-15 21:31:43,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [923162750] [2022-03-15 21:31:43,478 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:43,483 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:43,530 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 222 transitions. [2022-03-15 21:31:43,530 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:44,212 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:31:44,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 21:31:44,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:44,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 21:31:44,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:31:44,213 INFO L87 Difference]: Start difference. First operand 169 states and 359 transitions. Second operand has 29 states, 28 states have (on average 4.928571428571429) internal successors, (138), 28 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:45,326 INFO L93 Difference]: Finished difference Result 541 states and 1048 transitions. [2022-03-15 21:31:45,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 21:31:45,326 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.928571428571429) internal successors, (138), 28 states have internal predecessors, (138), 0 states have call successors, (0), 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 60 [2022-03-15 21:31:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:45,328 INFO L225 Difference]: With dead ends: 541 [2022-03-15 21:31:45,328 INFO L226 Difference]: Without dead ends: 483 [2022-03-15 21:31:45,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 222 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:31:45,328 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 3540 mSDsCounter, 0 mSdLazyCounter, 5865 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:45,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 5866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5865 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 21:31:45,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-03-15 21:31:45,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 352. [2022-03-15 21:31:45,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 2.284900284900285) internal successors, (802), 351 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 802 transitions. [2022-03-15 21:31:45,332 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 802 transitions. Word has length 60 [2022-03-15 21:31:45,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:45,332 INFO L470 AbstractCegarLoop]: Abstraction has 352 states and 802 transitions. [2022-03-15 21:31:45,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.928571428571429) internal successors, (138), 28 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:45,332 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 802 transitions. [2022-03-15 21:31:45,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-15 21:31:45,333 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:45,333 INFO L514 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:45,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-03-15 21:31:45,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:45,548 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:31:45,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:45,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1519126488, now seen corresponding path program 77 times [2022-03-15 21:31:45,549 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:45,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115471617] [2022-03-15 21:31:45,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:45,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:46,224 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 351 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:46,224 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:46,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115471617] [2022-03-15 21:31:46,224 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115471617] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:46,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579711387] [2022-03-15 21:31:46,224 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:31:46,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:46,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:46,225 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:46,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-03-15 21:31:46,276 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2022-03-15 21:31:46,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:31:46,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 21:31:46,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 351 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:48,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:31:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:49,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579711387] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:31:49,145 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:31:49,145 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 137 [2022-03-15 21:31:49,145 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1469350089] [2022-03-15 21:31:49,145 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:31:49,151 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:31:49,197 INFO L252 McrAutomatonBuilder]: Finished intersection with 144 states and 225 transitions. [2022-03-15 21:31:49,198 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:51,704 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 55 new interpolants: [69220#(or (<= (+ i2 27) N2) (<= N1 (+ i1 12)) (< (+ i1 13) N1)), 69187#(or (<= (+ 7 i2) N2) (< i1 N1)), 69194#(or (<= (+ 14 i2) N2) (< i1 N1)), 69217#(or (<= (+ i2 27) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 69227#(or (<= N1 (+ 19 i1)) (<= (+ i2 27) N2) (< (+ i1 20) N1)), 69206#(or (<= (+ i2 26) N2) (< i1 N1)), 69223#(or (< (+ 16 i1) N1) (<= (+ i2 27) N2) (<= N1 (+ i1 15))), 69211#(or (<= (+ i2 27) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 69229#(or (<= N1 (+ 21 i1)) (<= (+ i2 27) N2) (< (+ 22 i1) N1)), 69210#(or (<= (+ i2 27) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 69226#(or (<= (+ i2 27) N2) (<= N1 (+ i1 18)) (< (+ 19 i1) N1)), 69215#(or (<= N1 (+ 7 i1)) (<= (+ i2 27) N2) (< (+ i1 8) N1)), 69205#(or (<= (+ i2 25) N2) (< i1 N1)), 69183#(or (< i1 N1) (<= (+ 3 i2) N2)), 69201#(or (<= (+ 21 i2) N2) (< i1 N1)), 69209#(or (<= (+ i2 27) N2) (<= N1 (+ i1 1)) (< (+ 2 i1) N1)), 69233#(or (< (+ i1 26) N1) (<= N1 (+ i1 25)) (<= (+ i2 27) N2)), 69234#(or (<= (+ i2 27) N2) (<= N1 (+ i1 26)) (< (+ i1 27) N1)), 69190#(or (<= (+ i2 10) N2) (< i1 N1)), 69196#(or (<= (+ 16 i2) N2) (< i1 N1)), 69195#(or (<= (+ i2 15) N2) (< i1 N1)), 69202#(or (<= (+ 22 i2) N2) (< i1 N1)), 69203#(or (<= (+ 23 i2) N2) (< i1 N1)), 69188#(or (< i1 N1) (<= (+ i2 8) N2)), 69222#(or (<= N1 (+ 14 i1)) (<= (+ i2 27) N2) (< (+ i1 15) N1)), 69204#(or (< i1 N1) (<= (+ i2 24) N2)), 69221#(or (<= N1 (+ i1 13)) (<= (+ i2 27) N2) (< (+ 14 i1) N1)), 69228#(or (< (+ 21 i1) N1) (<= (+ i2 27) N2) (<= N1 (+ i1 20))), 69213#(or (<= (+ i2 27) N2) (<= N1 (+ 5 i1)) (< (+ 6 i1) N1)), 69192#(or (<= (+ i2 12) N2) (< i1 N1)), 69182#(or (< i1 N1) (<= (+ 2 i2) N2)), 69231#(or (<= (+ i2 27) N2) (< (+ i1 24) N1) (<= N1 (+ 23 i1))), 69181#(or (< i2 N2) (< i1 N1)), 69180#(< i1 N1), 69214#(or (<= (+ i2 27) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 69216#(or (< (+ 9 i1) N1) (<= (+ i2 27) N2) (<= N1 (+ i1 8))), 69197#(or (< i1 N1) (<= (+ i2 17) N2)), 69185#(or (< i1 N1) (<= (+ 5 i2) N2)), 69219#(or (<= (+ i2 27) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 69230#(or (<= (+ i2 27) N2) (< (+ 23 i1) N1) (<= N1 (+ 22 i1))), 69184#(or (<= (+ i2 4) N2) (< i1 N1)), 69212#(or (<= N1 (+ i1 4)) (<= (+ i2 27) N2) (< (+ 5 i1) N1)), 69207#(or (<= (+ i2 27) N2) (< i1 N1)), 69218#(or (<= (+ i2 27) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 69200#(or (<= (+ i2 20) N2) (< i1 N1)), 69198#(or (< i1 N1) (<= (+ i2 18) N2)), 69208#(or (<= (+ i2 27) N2) (< (+ i1 1) N1) (<= N1 i1)), 69224#(or (< (+ i1 17) N1) (<= (+ i2 27) N2) (<= N1 (+ 16 i1))), 69225#(or (< (+ i1 18) N1) (<= (+ i2 27) N2) (<= N1 (+ i1 17))), 69199#(or (<= (+ 19 i2) N2) (< i1 N1)), 69186#(or (< i1 N1) (<= (+ 6 i2) N2)), 69193#(or (< i1 N1) (<= (+ i2 13) N2)), 69232#(or (<= (+ i2 27) N2) (<= N1 (+ i1 24)) (< (+ i1 25) N1)), 69189#(or (<= (+ 9 i2) N2) (< i1 N1)), 69191#(or (<= (+ i2 11) N2) (< i1 N1))] [2022-03-15 21:31:51,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-03-15 21:31:51,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:51,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-03-15 21:31:51,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5756, Invalid=31300, Unknown=0, NotChecked=0, Total=37056 [2022-03-15 21:31:51,706 INFO L87 Difference]: Start difference. First operand 352 states and 802 transitions. Second operand has 112 states, 112 states have (on average 1.7678571428571428) internal successors, (198), 111 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 21:31:56,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:31:56,615 INFO L93 Difference]: Finished difference Result 802 states and 1488 transitions. [2022-03-15 21:31:56,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-03-15 21:31:56,616 INFO L78 Accepts]: Start accepts. Automaton has has 112 states, 112 states have (on average 1.7678571428571428) internal successors, (198), 111 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) Word has length 61 [2022-03-15 21:31:56,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:31:56,617 INFO L225 Difference]: With dead ends: 802 [2022-03-15 21:31:56,617 INFO L226 Difference]: Without dead ends: 602 [2022-03-15 21:31:56,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31016 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=19012, Invalid=69494, Unknown=0, NotChecked=0, Total=88506 [2022-03-15 21:31:56,621 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 985 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:31:56,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [985 Valid, 0 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:31:56,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-03-15 21:31:56,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 201. [2022-03-15 21:31:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 2.12) internal successors, (424), 200 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:31:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 424 transitions. [2022-03-15 21:31:56,642 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 424 transitions. Word has length 61 [2022-03-15 21:31:56,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:31:56,642 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 424 transitions. [2022-03-15 21:31:56,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 1.7678571428571428) internal successors, (198), 111 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 21:31:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 424 transitions. [2022-03-15 21:31:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-15 21:31:56,643 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:31:56,643 INFO L514 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:31:56,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-03-15 21:31:56,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:56,858 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:31:56,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:31:56,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1583204340, now seen corresponding path program 78 times [2022-03-15 21:31:56,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:31:56,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577971984] [2022-03-15 21:31:56,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:31:56,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:31:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:31:57,334 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 352 proven. 377 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:57,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:31:57,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577971984] [2022-03-15 21:31:57,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577971984] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:31:57,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44945346] [2022-03-15 21:31:57,335 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:31:57,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:31:57,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:31:57,336 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:31:57,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-03-15 21:31:57,400 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-03-15 21:31:57,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:31:57,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 21:31:57,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:31:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 352 proven. 377 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:31:59,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:01,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44945346] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:01,195 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:01,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 55, 55] total 136 [2022-03-15 21:32:01,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1884531619] [2022-03-15 21:32:01,195 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:01,201 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:01,236 INFO L252 McrAutomatonBuilder]: Finished intersection with 91 states and 119 transitions. [2022-03-15 21:32:01,236 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:02,335 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [71172#(and (or (<= N1 (+ i1 25)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 25)) (<= i2 i1))), 71160#(and (or (<= N1 (+ 14 i1)) (<= (+ i2 11) i1)) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0))), 71154#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= N1 (+ i1 8)) (<= (+ i2 17) i1))), 71148#(and (or (<= N1 (+ 2 i1)) (<= (+ 23 i2) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 71166#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ 6 i2) i1))), 71146#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ i2 25) i1) (<= N1 i1))), 71150#(and (or (<= N1 (+ i1 4)) (<= (+ 21 i2) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 71168#(and (or (<= N1 (+ 21 i1)) (<= (+ i2 4) i1)) (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0))), 71164#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17))) (or (<= (+ i2 8) i1) (<= N1 (+ i1 17)))), 71156#(and (or (<= (+ i2 15) i1) (<= N1 (+ i1 10))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10)))), 71153#(and (or (<= N1 (+ 7 i1)) (<= (+ i2 18) i1)) (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0))), 71162#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= N1 (+ i1 15)) (<= (+ i2 10) i1))), 71171#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 24)) (<= (+ i2 1) i1))), 71151#(and (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 5 i1)) (<= (+ i2 20) i1))), 71158#(and (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 12)) (<= (+ i2 13) i1))), 71149#(and (or (<= N1 (+ 3 i1)) (<= (+ 22 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 71169#(and (or (<= (+ 3 i2) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 71167#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20))) (or (<= N1 (+ i1 20)) (<= (+ 5 i2) i1))), 71152#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1))) (or (<= N1 (+ 6 i1)) (<= (+ 19 i2) i1))), 71165#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 7 i2) i1) (<= N1 (+ i1 18)))), 71157#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ 14 i2) i1) (<= N1 (+ i1 11)))), 71161#(< i2 N2), 71170#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1))) (or (<= N1 (+ 23 i1)) (<= (+ 2 i2) i1))), 71147#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 1)) (<= (+ i2 24) i1))), 71163#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= (+ 9 i2) i1) (<= N1 (+ 16 i1)))), 71155#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1))) (or (<= (+ 16 i2) i1) (<= N1 (+ 9 i1)))), 71159#(and (or (<= N1 (+ i1 13)) (<= (+ i2 12) i1)) (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)))] [2022-03-15 21:32:02,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-15 21:32:02,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:02,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-15 21:32:02,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5531, Invalid=21201, Unknown=0, NotChecked=0, Total=26732 [2022-03-15 21:32:02,338 INFO L87 Difference]: Start difference. First operand 201 states and 424 transitions. Second operand has 57 states, 57 states have (on average 2.0526315789473686) internal successors, (117), 56 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:04,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:04,110 INFO L93 Difference]: Finished difference Result 384 states and 758 transitions. [2022-03-15 21:32:04,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-03-15 21:32:04,111 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.0526315789473686) internal successors, (117), 56 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-03-15 21:32:04,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:04,149 INFO L225 Difference]: With dead ends: 384 [2022-03-15 21:32:04,149 INFO L226 Difference]: Without dead ends: 383 [2022-03-15 21:32:04,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19892 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=13835, Invalid=44487, Unknown=0, NotChecked=0, Total=58322 [2022-03-15 21:32:04,153 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 528 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:04,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [528 Valid, 0 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:32:04,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-03-15 21:32:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 175. [2022-03-15 21:32:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 2.1379310344827585) internal successors, (372), 174 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 372 transitions. [2022-03-15 21:32:04,156 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 372 transitions. Word has length 61 [2022-03-15 21:32:04,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:04,156 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 372 transitions. [2022-03-15 21:32:04,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.0526315789473686) internal successors, (117), 56 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:04,156 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 372 transitions. [2022-03-15 21:32:04,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-03-15 21:32:04,156 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:04,156 INFO L514 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:04,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2022-03-15 21:32:04,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:04,372 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:32:04,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:04,373 INFO L85 PathProgramCache]: Analyzing trace with hash -151803871, now seen corresponding path program 79 times [2022-03-15 21:32:04,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:04,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419196927] [2022-03-15 21:32:04,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:04,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:04,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:04,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419196927] [2022-03-15 21:32:04,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419196927] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:04,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349719372] [2022-03-15 21:32:04,655 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:32:04,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:04,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:04,656 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:04,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-03-15 21:32:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:04,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 111 conjunts are in the unsatisfiable core [2022-03-15 21:32:04,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:04,814 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:04,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:04,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349719372] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:04,993 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:04,994 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2022-03-15 21:32:04,994 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [285200177] [2022-03-15 21:32:04,994 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:04,999 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:05,049 INFO L252 McrAutomatonBuilder]: Finished intersection with 147 states and 230 transitions. [2022-03-15 21:32:05,049 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:05,927 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:32:05,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 21:32:05,927 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:05,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 21:32:05,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2022-03-15 21:32:05,928 INFO L87 Difference]: Start difference. First operand 175 states and 372 transitions. Second operand has 30 states, 29 states have (on average 4.931034482758621) internal successors, (143), 29 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:07,173 INFO L93 Difference]: Finished difference Result 561 states and 1087 transitions. [2022-03-15 21:32:07,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 21:32:07,173 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.931034482758621) internal successors, (143), 29 states have internal predecessors, (143), 0 states have call successors, (0), 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 62 [2022-03-15 21:32:07,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:07,174 INFO L225 Difference]: With dead ends: 561 [2022-03-15 21:32:07,174 INFO L226 Difference]: Without dead ends: 501 [2022-03-15 21:32:07,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2022-03-15 21:32:07,175 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 3811 mSDsCounter, 0 mSdLazyCounter, 6306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:07,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 6307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6306 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 21:32:07,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-03-15 21:32:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 365. [2022-03-15 21:32:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 2.2857142857142856) internal successors, (832), 364 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 832 transitions. [2022-03-15 21:32:07,179 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 832 transitions. Word has length 62 [2022-03-15 21:32:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:07,179 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 832 transitions. [2022-03-15 21:32:07,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.931034482758621) internal successors, (143), 29 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 832 transitions. [2022-03-15 21:32:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-15 21:32:07,180 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:07,180 INFO L514 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:07,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2022-03-15 21:32:07,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:07,396 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:32:07,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:07,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1793863648, now seen corresponding path program 80 times [2022-03-15 21:32:07,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:07,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516979579] [2022-03-15 21:32:07,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:07,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:08,100 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:08,100 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:08,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516979579] [2022-03-15 21:32:08,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516979579] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:08,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252743737] [2022-03-15 21:32:08,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:32:08,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:08,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:08,102 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:08,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-03-15 21:32:08,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:32:08,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:32:08,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 21:32:08,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:09,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:10,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252743737] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:10,831 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:10,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 57] total 142 [2022-03-15 21:32:10,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1816671203] [2022-03-15 21:32:10,831 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:10,837 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:10,887 INFO L252 McrAutomatonBuilder]: Finished intersection with 149 states and 233 transitions. [2022-03-15 21:32:10,887 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:13,600 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 57 new interpolants: [74280#(or (<= (+ i2 15) N2) (< i1 N1)), 74316#(or (< (+ 23 i1) N1) (<= (+ i2 28) N2) (<= N1 (+ 22 i1))), 74281#(or (<= (+ 16 i2) N2) (< i1 N1)), 74315#(or (<= N1 (+ 21 i1)) (<= (+ i2 28) N2) (< (+ 22 i1) N1)), 74288#(or (<= (+ 23 i2) N2) (< i1 N1)), 74321#(or (<= N1 (+ i1 27)) (< (+ i1 28) N1) (<= (+ i2 28) N2)), 74300#(or (< (+ 7 i1) N1) (<= N1 (+ 6 i1)) (<= (+ i2 28) N2)), 74276#(or (<= (+ i2 11) N2) (< i1 N1)), 74287#(or (<= (+ 22 i2) N2) (< i1 N1)), 74269#(or (<= (+ i2 4) N2) (< i1 N1)), 74271#(or (< i1 N1) (<= (+ 6 i2) N2)), 74292#(or (<= (+ i2 27) N2) (< i1 N1)), 74295#(or (<= N1 (+ i1 1)) (<= (+ i2 28) N2) (< (+ 2 i1) N1)), 74311#(or (< (+ i1 18) N1) (<= N1 (+ i1 17)) (<= (+ i2 28) N2)), 74299#(or (<= N1 (+ 5 i1)) (<= (+ i2 28) N2) (< (+ 6 i1) N1)), 74279#(or (<= (+ 14 i2) N2) (< i1 N1)), 74318#(or (<= N1 (+ i1 24)) (<= (+ i2 28) N2) (< (+ i1 25) N1)), 74265#(< i1 N1), 74310#(or (< (+ i1 17) N1) (<= (+ i2 28) N2) (<= N1 (+ 16 i1))), 74266#(or (< i2 N2) (< i1 N1)), 74283#(or (< i1 N1) (<= (+ i2 18) N2)), 74296#(or (<= N1 (+ 2 i1)) (<= (+ i2 28) N2) (< (+ 3 i1) N1)), 74278#(or (< i1 N1) (<= (+ i2 13) N2)), 74298#(or (<= N1 (+ i1 4)) (<= (+ i2 28) N2) (< (+ 5 i1) N1)), 74294#(or (< (+ i1 1) N1) (<= (+ i2 28) N2) (<= N1 i1)), 74284#(or (<= (+ 19 i2) N2) (< i1 N1)), 74313#(or (<= N1 (+ 19 i1)) (< (+ i1 20) N1) (<= (+ i2 28) N2)), 74282#(or (< i1 N1) (<= (+ i2 17) N2)), 74270#(or (< i1 N1) (<= (+ 5 i2) N2)), 74277#(or (<= (+ i2 12) N2) (< i1 N1)), 74307#(or (<= N1 (+ i1 13)) (<= (+ i2 28) N2) (< (+ 14 i1) N1)), 74303#(or (<= (+ i2 28) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 74297#(or (<= N1 (+ 3 i1)) (<= (+ i2 28) N2) (< (+ i1 4) N1)), 74302#(or (< (+ 9 i1) N1) (<= N1 (+ i1 8)) (<= (+ i2 28) N2)), 74312#(or (<= N1 (+ i1 18)) (< (+ 19 i1) N1) (<= (+ i2 28) N2)), 74286#(or (<= (+ 21 i2) N2) (< i1 N1)), 74301#(or (<= N1 (+ 7 i1)) (< (+ i1 8) N1) (<= (+ i2 28) N2)), 74314#(or (< (+ 21 i1) N1) (<= N1 (+ i1 20)) (<= (+ i2 28) N2)), 74272#(or (<= (+ 7 i2) N2) (< i1 N1)), 74308#(or (<= N1 (+ 14 i1)) (< (+ i1 15) N1) (<= (+ i2 28) N2)), 74317#(or (< (+ i1 24) N1) (<= N1 (+ 23 i1)) (<= (+ i2 28) N2)), 74293#(or (< i1 N1) (<= (+ i2 28) N2)), 74291#(or (<= (+ i2 26) N2) (< i1 N1)), 74268#(or (< i1 N1) (<= (+ 3 i2) N2)), 74275#(or (<= (+ i2 10) N2) (< i1 N1)), 74304#(or (< (+ i1 11) N1) (<= (+ i2 28) N2) (<= N1 (+ i1 10))), 74273#(or (< i1 N1) (<= (+ i2 8) N2)), 74285#(or (<= (+ i2 20) N2) (< i1 N1)), 74319#(or (< (+ i1 26) N1) (<= N1 (+ i1 25)) (<= (+ i2 28) N2)), 74306#(or (<= N1 (+ i1 12)) (< (+ i1 13) N1) (<= (+ i2 28) N2)), 74320#(or (<= N1 (+ i1 26)) (< (+ i1 27) N1) (<= (+ i2 28) N2)), 74289#(or (< i1 N1) (<= (+ i2 24) N2)), 74309#(or (< (+ 16 i1) N1) (<= (+ i2 28) N2) (<= N1 (+ i1 15))), 74267#(or (< i1 N1) (<= (+ 2 i2) N2)), 74290#(or (<= (+ i2 25) N2) (< i1 N1)), 74274#(or (<= (+ 9 i2) N2) (< i1 N1)), 74305#(or (<= (+ i2 28) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11)))] [2022-03-15 21:32:13,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2022-03-15 21:32:13,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:13,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2022-03-15 21:32:13,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6165, Invalid=33635, Unknown=0, NotChecked=0, Total=39800 [2022-03-15 21:32:13,602 INFO L87 Difference]: Start difference. First operand 365 states and 832 transitions. Second operand has 116 states, 116 states have (on average 1.7672413793103448) internal successors, (205), 115 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:19,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:19,380 INFO L93 Difference]: Finished difference Result 832 states and 1544 transitions. [2022-03-15 21:32:19,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-03-15 21:32:19,380 INFO L78 Accepts]: Start accepts. Automaton has has 116 states, 116 states have (on average 1.7672413793103448) internal successors, (205), 115 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-03-15 21:32:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:19,381 INFO L225 Difference]: With dead ends: 832 [2022-03-15 21:32:19,381 INFO L226 Difference]: Without dead ends: 624 [2022-03-15 21:32:19,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33396 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=20430, Invalid=74742, Unknown=0, NotChecked=0, Total=95172 [2022-03-15 21:32:19,385 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 986 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 2565 mSolverCounterSat, 536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 2565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:19,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [986 Valid, 0 Invalid, 3101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 2565 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:32:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-03-15 21:32:19,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 208. [2022-03-15 21:32:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.1207729468599035) internal successors, (439), 207 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 439 transitions. [2022-03-15 21:32:19,388 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 439 transitions. Word has length 63 [2022-03-15 21:32:19,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:19,389 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 439 transitions. [2022-03-15 21:32:19,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 116 states, 116 states have (on average 1.7672413793103448) internal successors, (205), 115 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 439 transitions. [2022-03-15 21:32:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-15 21:32:19,389 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:19,389 INFO L514 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:19,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-03-15 21:32:19,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:19,605 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:32:19,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:19,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1817308298, now seen corresponding path program 81 times [2022-03-15 21:32:19,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:19,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824385552] [2022-03-15 21:32:19,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:19,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 379 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:20,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:20,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824385552] [2022-03-15 21:32:20,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824385552] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:20,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272808221] [2022-03-15 21:32:20,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:32:20,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:20,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:20,078 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:20,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-03-15 21:32:20,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2022-03-15 21:32:20,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:32:20,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 21:32:20,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 379 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:21,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:23,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272808221] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:23,671 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:23,671 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 57, 57] total 141 [2022-03-15 21:32:23,671 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1376033448] [2022-03-15 21:32:23,671 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:23,677 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:23,712 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 123 transitions. [2022-03-15 21:32:23,712 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:25,308 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [76314#(and (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 12)) (<= (+ 14 i2) i1))), 76317#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= N1 (+ i1 15)) (<= (+ i2 11) i1))), 76304#(and (or (<= N1 (+ 2 i1)) (<= (+ i2 24) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 76316#(and (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 14 i1)) (<= (+ i2 12) i1))), 76329#(and (or (<= N1 (+ i1 26)) (<= i2 i1)) (or (<= N1 (+ i1 26)) (= (+ N1 (* (- 1) N2)) 0))), 76315#(and (or (<= N1 (+ i1 13)) (<= (+ i2 13) i1)) (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0))), 76308#(and (or (<= N1 (+ 6 i1)) (<= (+ i2 20) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 76319#(and (or (<= N1 (+ 16 i1)) (<= (+ i2 10) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1)))), 76318#(< i2 N2), 76305#(and (or (<= N1 (+ 3 i1)) (<= (+ 23 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 76325#(and (or (<= (+ i2 4) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 76322#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 7 i2) i1) (<= N1 (+ 19 i1)))), 76306#(and (or (<= N1 (+ i1 4)) (<= (+ 22 i2) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 76321#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 8) i1) (<= N1 (+ i1 18)))), 76310#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= N1 (+ i1 8)) (<= (+ i2 18) i1))), 76311#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1))) (or (<= N1 (+ 9 i1)) (<= (+ i2 17) i1))), 76320#(and (or (<= (+ 9 i2) i1) (<= N1 (+ i1 17))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 76324#(and (or (<= N1 (+ 21 i1)) (<= (+ 5 i2) i1)) (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0))), 76327#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 24)) (<= (+ 2 i2) i1))), 76326#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1))) (or (<= N1 (+ 23 i1)) (<= (+ 3 i2) i1))), 76328#(and (or (<= N1 (+ i1 25)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 25)) (<= (+ i2 1) i1))), 76309#(and (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 7 i1)) (<= (+ 19 i2) i1))), 76312#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= (+ 16 i2) i1) (<= N1 (+ i1 10)))), 76303#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 25) i1) (<= N1 (+ i1 1)))), 76302#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ i2 26) i1) (<= N1 i1))), 76313#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ i2 15) i1) (<= N1 (+ i1 11)))), 76323#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20))) (or (<= (+ 6 i2) i1) (<= N1 (+ i1 20)))), 76307#(and (or (<= N1 (+ 5 i1)) (<= (+ 21 i2) i1)) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)))] [2022-03-15 21:32:25,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-03-15 21:32:25,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:25,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-03-15 21:32:25,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5932, Invalid=22798, Unknown=0, NotChecked=0, Total=28730 [2022-03-15 21:32:25,310 INFO L87 Difference]: Start difference. First operand 208 states and 439 transitions. Second operand has 59 states, 59 states have (on average 2.0508474576271185) internal successors, (121), 58 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:27,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:27,757 INFO L93 Difference]: Finished difference Result 398 states and 786 transitions. [2022-03-15 21:32:27,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-03-15 21:32:27,757 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0508474576271185) internal successors, (121), 58 states have internal predecessors, (121), 0 states have call successors, (0), 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 63 [2022-03-15 21:32:27,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:27,758 INFO L225 Difference]: With dead ends: 398 [2022-03-15 21:32:27,758 INFO L226 Difference]: Without dead ends: 397 [2022-03-15 21:32:27,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21440 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=14866, Invalid=47884, Unknown=0, NotChecked=0, Total=62750 [2022-03-15 21:32:27,761 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 253 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:27,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 0 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:32:27,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-03-15 21:32:27,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 181. [2022-03-15 21:32:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 2.138888888888889) internal successors, (385), 180 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 385 transitions. [2022-03-15 21:32:27,764 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 385 transitions. Word has length 63 [2022-03-15 21:32:27,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:27,765 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 385 transitions. [2022-03-15 21:32:27,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.0508474576271185) internal successors, (121), 58 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:27,765 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 385 transitions. [2022-03-15 21:32:27,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-15 21:32:27,765 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:27,765 INFO L514 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:27,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-03-15 21:32:27,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable83 [2022-03-15 21:32:27,966 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:32:27,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:27,967 INFO L85 PathProgramCache]: Analyzing trace with hash 224717017, now seen corresponding path program 82 times [2022-03-15 21:32:27,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:27,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653557669] [2022-03-15 21:32:27,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:27,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:28,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:28,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653557669] [2022-03-15 21:32:28,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653557669] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:28,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637591691] [2022-03-15 21:32:28,427 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:32:28,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:28,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:28,428 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:28,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-03-15 21:32:28,475 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:32:28,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:32:28,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 115 conjunts are in the unsatisfiable core [2022-03-15 21:32:28,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:28,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:28,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637591691] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:28,823 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:28,823 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 29 [2022-03-15 21:32:28,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1611709095] [2022-03-15 21:32:28,823 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:28,829 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:28,884 INFO L252 McrAutomatonBuilder]: Finished intersection with 152 states and 238 transitions. [2022-03-15 21:32:28,885 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:29,796 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:32:29,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:32:29,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:29,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:32:29,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2022-03-15 21:32:29,797 INFO L87 Difference]: Start difference. First operand 181 states and 385 transitions. Second operand has 31 states, 30 states have (on average 4.933333333333334) internal successors, (148), 30 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:31,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:31,199 INFO L93 Difference]: Finished difference Result 581 states and 1126 transitions. [2022-03-15 21:32:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 21:32:31,200 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.933333333333334) internal successors, (148), 30 states have internal predecessors, (148), 0 states have call successors, (0), 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 64 [2022-03-15 21:32:31,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:31,201 INFO L225 Difference]: With dead ends: 581 [2022-03-15 21:32:31,201 INFO L226 Difference]: Without dead ends: 519 [2022-03-15 21:32:31,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 238 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2022-03-15 21:32:31,201 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 4092 mSDsCounter, 0 mSdLazyCounter, 6763 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:31,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 6764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6763 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 21:32:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-03-15 21:32:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 378. [2022-03-15 21:32:31,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 2.286472148541114) internal successors, (862), 377 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 862 transitions. [2022-03-15 21:32:31,205 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 862 transitions. Word has length 64 [2022-03-15 21:32:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:31,205 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 862 transitions. [2022-03-15 21:32:31,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.933333333333334) internal successors, (148), 30 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 862 transitions. [2022-03-15 21:32:31,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-03-15 21:32:31,206 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:31,206 INFO L514 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:31,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2022-03-15 21:32:31,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:31,422 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:32:31,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:31,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1541731048, now seen corresponding path program 83 times [2022-03-15 21:32:31,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:31,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509472430] [2022-03-15 21:32:31,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:31,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 406 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:32,477 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:32,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509472430] [2022-03-15 21:32:32,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509472430] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:32,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954546163] [2022-03-15 21:32:32,479 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:32:32,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:32,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:32,481 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:32,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-03-15 21:32:32,530 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2022-03-15 21:32:32,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:32:32,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-15 21:32:32,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:34,168 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 406 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:34,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:35,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954546163] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:35,260 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:35,260 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59, 59] total 147 [2022-03-15 21:32:35,260 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1621892876] [2022-03-15 21:32:35,260 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:35,267 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:35,359 INFO L252 McrAutomatonBuilder]: Finished intersection with 154 states and 241 transitions. [2022-03-15 21:32:35,359 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:38,522 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 59 new interpolants: [79570#(or (<= (+ 29 i2) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 79533#(or (< i1 N1) (<= (+ 3 i2) N2)), 79580#(or (< (+ 21 i1) N1) (<= (+ 29 i2) N2) (<= N1 (+ i1 20))), 79581#(or (<= N1 (+ 21 i1)) (<= (+ 29 i2) N2) (< (+ 22 i1) N1)), 79538#(or (< i1 N1) (<= (+ i2 8) N2)), 79588#(or (<= (+ 29 i2) N2) (<= N1 (+ i1 28)) (< (+ 29 i1) N1)), 79585#(or (< (+ i1 26) N1) (<= N1 (+ i1 25)) (<= (+ 29 i2) N2)), 79534#(or (<= (+ i2 4) N2) (< i1 N1)), 79551#(or (<= (+ 21 i2) N2) (< i1 N1)), 79535#(or (< i1 N1) (<= (+ 5 i2) N2)), 79554#(or (< i1 N1) (<= (+ i2 24) N2)), 79540#(or (<= (+ i2 10) N2) (< i1 N1)), 79575#(or (< (+ 16 i1) N1) (<= (+ 29 i2) N2) (<= N1 (+ i1 15))), 79537#(or (<= (+ 7 i2) N2) (< i1 N1)), 79562#(or (<= (+ 29 i2) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 79536#(or (< i1 N1) (<= (+ 6 i2) N2)), 79550#(or (<= (+ i2 20) N2) (< i1 N1)), 79530#(< i1 N1), 79586#(or (<= (+ 29 i2) N2) (<= N1 (+ i1 26)) (< (+ i1 27) N1)), 79576#(or (< (+ i1 17) N1) (<= (+ 29 i2) N2) (<= N1 (+ 16 i1))), 79558#(or (< i1 N1) (<= (+ i2 28) N2)), 79571#(or (<= (+ 29 i2) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 79573#(or (<= N1 (+ i1 13)) (<= (+ 29 i2) N2) (< (+ 14 i1) N1)), 79531#(or (< i2 N2) (< i1 N1)), 79583#(or (<= (+ 29 i2) N2) (< (+ i1 24) N1) (<= N1 (+ 23 i1))), 79574#(or (<= N1 (+ 14 i1)) (<= (+ 29 i2) N2) (< (+ i1 15) N1)), 79584#(or (<= (+ 29 i2) N2) (<= N1 (+ i1 24)) (< (+ i1 25) N1)), 79560#(or (<= (+ 29 i2) N2) (< (+ i1 1) N1) (<= N1 i1)), 79563#(or (<= (+ 29 i2) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 79557#(or (<= (+ i2 27) N2) (< i1 N1)), 79555#(or (<= (+ i2 25) N2) (< i1 N1)), 79552#(or (<= (+ 22 i2) N2) (< i1 N1)), 79579#(or (<= N1 (+ 19 i1)) (<= (+ 29 i2) N2) (< (+ i1 20) N1)), 79569#(or (<= (+ 29 i2) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 79566#(or (<= (+ 29 i2) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 79539#(or (<= (+ 9 i2) N2) (< i1 N1)), 79548#(or (< i1 N1) (<= (+ i2 18) N2)), 79553#(or (<= (+ 23 i2) N2) (< i1 N1)), 79544#(or (<= (+ 14 i2) N2) (< i1 N1)), 79561#(or (<= (+ 29 i2) N2) (<= N1 (+ i1 1)) (< (+ 2 i1) N1)), 79565#(or (<= (+ 29 i2) N2) (<= N1 (+ 5 i1)) (< (+ 6 i1) N1)), 79582#(or (<= (+ 29 i2) N2) (< (+ 23 i1) N1) (<= N1 (+ 22 i1))), 79545#(or (<= (+ i2 15) N2) (< i1 N1)), 79549#(or (<= (+ 19 i2) N2) (< i1 N1)), 79541#(or (<= (+ i2 11) N2) (< i1 N1)), 79556#(or (<= (+ i2 26) N2) (< i1 N1)), 79559#(or (<= (+ 29 i2) N2) (< i1 N1)), 79547#(or (< i1 N1) (<= (+ i2 17) N2)), 79578#(or (<= (+ 29 i2) N2) (<= N1 (+ i1 18)) (< (+ 19 i1) N1)), 79567#(or (<= N1 (+ 7 i1)) (<= (+ 29 i2) N2) (< (+ i1 8) N1)), 79564#(or (<= N1 (+ i1 4)) (<= (+ 29 i2) N2) (< (+ 5 i1) N1)), 79532#(or (< i1 N1) (<= (+ 2 i2) N2)), 79587#(or (<= N1 (+ i1 27)) (<= (+ 29 i2) N2) (< (+ i1 28) N1)), 79568#(or (< (+ 9 i1) N1) (<= (+ 29 i2) N2) (<= N1 (+ i1 8))), 79542#(or (<= (+ i2 12) N2) (< i1 N1)), 79543#(or (< i1 N1) (<= (+ i2 13) N2)), 79546#(or (<= (+ 16 i2) N2) (< i1 N1)), 79577#(or (< (+ i1 18) N1) (<= (+ 29 i2) N2) (<= N1 (+ i1 17))), 79572#(or (<= (+ 29 i2) N2) (<= N1 (+ i1 12)) (< (+ i1 13) N1))] [2022-03-15 21:32:38,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 120 states [2022-03-15 21:32:38,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:38,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2022-03-15 21:32:38,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6588, Invalid=36054, Unknown=0, NotChecked=0, Total=42642 [2022-03-15 21:32:38,524 INFO L87 Difference]: Start difference. First operand 378 states and 862 transitions. Second operand has 120 states, 120 states have (on average 1.7666666666666666) internal successors, (212), 119 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:44,273 INFO L93 Difference]: Finished difference Result 862 states and 1600 transitions. [2022-03-15 21:32:44,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-03-15 21:32:44,273 INFO L78 Accepts]: Start accepts. Automaton has has 120 states, 120 states have (on average 1.7666666666666666) internal successors, (212), 119 states have internal predecessors, (212), 0 states have call successors, (0), 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 65 [2022-03-15 21:32:44,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:44,274 INFO L225 Difference]: With dead ends: 862 [2022-03-15 21:32:44,274 INFO L226 Difference]: Without dead ends: 646 [2022-03-15 21:32:44,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35864 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=21899, Invalid=80181, Unknown=0, NotChecked=0, Total=102080 [2022-03-15 21:32:44,279 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1174 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 2698 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 2698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:44,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1174 Valid, 0 Invalid, 3261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 2698 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:32:44,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-03-15 21:32:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 215. [2022-03-15 21:32:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 2.121495327102804) internal successors, (454), 214 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 454 transitions. [2022-03-15 21:32:44,283 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 454 transitions. Word has length 65 [2022-03-15 21:32:44,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:44,284 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 454 transitions. [2022-03-15 21:32:44,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 120 states, 120 states have (on average 1.7666666666666666) internal successors, (212), 119 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 454 transitions. [2022-03-15 21:32:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-03-15 21:32:44,284 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:44,284 INFO L514 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:44,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2022-03-15 21:32:44,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:44,491 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:32:44,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:44,492 INFO L85 PathProgramCache]: Analyzing trace with hash -608984692, now seen corresponding path program 84 times [2022-03-15 21:32:44,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:44,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290726389] [2022-03-15 21:32:44,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:44,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 407 proven. 434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:45,002 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:45,002 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290726389] [2022-03-15 21:32:45,002 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290726389] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:45,002 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978120509] [2022-03-15 21:32:45,002 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:32:45,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:45,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:45,003 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:45,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-03-15 21:32:45,058 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2022-03-15 21:32:45,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:32:45,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-15 21:32:45,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 407 proven. 434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:46,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:48,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978120509] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:48,693 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:48,693 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 59, 59] total 146 [2022-03-15 21:32:48,693 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1243628125] [2022-03-15 21:32:48,693 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:48,699 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:48,740 INFO L252 McrAutomatonBuilder]: Finished intersection with 97 states and 127 transitions. [2022-03-15 21:32:48,740 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:49,984 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [81654#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= N1 (+ i1 15)) (<= (+ i2 12) i1))), 81662#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1))) (or (<= (+ i2 4) i1) (<= N1 (+ 23 i1)))), 81644#(< i2 N2), 81655#(and (or (<= N1 (+ 16 i1)) (<= (+ i2 11) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1)))), 81640#(and (or (<= (+ i2 25) i1) (<= N1 (+ 2 i1))) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 81646#(and (or (<= N1 (+ 7 i1)) (<= (+ i2 20) i1)) (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0))), 81648#(and (or (<= N1 (+ 9 i1)) (<= (+ i2 18) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 81666#(and (or (<= N1 (+ i1 27)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 27)) (<= i2 i1))), 81638#(and (or (<= (+ i2 27) i1) (<= N1 i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1))), 81652#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 13)) (<= (+ 14 i2) i1))), 81649#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= (+ i2 17) i1) (<= N1 (+ i1 10)))), 81665#(and (or (<= N1 (+ i1 26)) (<= (+ i2 1) i1)) (or (<= N1 (+ i1 26)) (= (+ N1 (* (- 1) N2)) 0))), 81657#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 9 i2) i1) (<= N1 (+ i1 18)))), 81659#(and (or (<= (+ 7 i2) i1) (<= N1 (+ i1 20))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20)))), 81658#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ i2 8) i1))), 81656#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17))) (or (<= N1 (+ i1 17)) (<= (+ i2 10) i1))), 81647#(and (or (<= N1 (+ i1 8)) (<= (+ 19 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8)))), 81660#(and (or (<= N1 (+ 21 i1)) (<= (+ 6 i2) i1)) (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0))), 81653#(and (or (<= N1 (+ 14 i1)) (<= (+ i2 13) i1)) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0))), 81643#(and (or (<= N1 (+ 5 i1)) (<= (+ 22 i2) i1)) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 81642#(and (or (<= N1 (+ i1 4)) (<= (+ 23 i2) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 81641#(and (or (<= (+ i2 24) i1) (<= N1 (+ 3 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 81645#(and (or (<= (+ 21 i2) i1) (<= N1 (+ 6 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 81650#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ 16 i2) i1) (<= N1 (+ i1 11)))), 81651#(and (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 15) i1) (<= N1 (+ i1 12)))), 81639#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 1)) (<= (+ i2 26) i1))), 81664#(and (or (<= N1 (+ i1 25)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 25)) (<= (+ 2 i2) i1))), 81663#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 24)) (<= (+ 3 i2) i1))), 81661#(and (or (<= (+ 5 i2) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1))))] [2022-03-15 21:32:49,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 21:32:49,984 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:49,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 21:32:49,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6347, Invalid=24453, Unknown=0, NotChecked=0, Total=30800 [2022-03-15 21:32:49,990 INFO L87 Difference]: Start difference. First operand 215 states and 454 transitions. Second operand has 61 states, 61 states have (on average 2.0491803278688523) internal successors, (125), 60 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:52,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:52,380 INFO L93 Difference]: Finished difference Result 412 states and 814 transitions. [2022-03-15 21:32:52,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-03-15 21:32:52,380 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.0491803278688523) internal successors, (125), 60 states have internal predecessors, (125), 0 states have call successors, (0), 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 65 [2022-03-15 21:32:52,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:52,381 INFO L225 Difference]: With dead ends: 412 [2022-03-15 21:32:52,381 INFO L226 Difference]: Without dead ends: 411 [2022-03-15 21:32:52,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23035 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=15934, Invalid=51406, Unknown=0, NotChecked=0, Total=67340 [2022-03-15 21:32:52,386 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 369 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:52,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 0 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:32:52,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-03-15 21:32:52,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 187. [2022-03-15 21:32:52,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 2.139784946236559) internal successors, (398), 186 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 398 transitions. [2022-03-15 21:32:52,389 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 398 transitions. Word has length 65 [2022-03-15 21:32:52,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:52,389 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 398 transitions. [2022-03-15 21:32:52,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.0491803278688523) internal successors, (125), 60 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:52,389 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 398 transitions. [2022-03-15 21:32:52,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-03-15 21:32:52,390 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:52,390 INFO L514 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:52,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2022-03-15 21:32:52,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:52,606 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:32:52,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:52,606 INFO L85 PathProgramCache]: Analyzing trace with hash -549106975, now seen corresponding path program 85 times [2022-03-15 21:32:52,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:52,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491312946] [2022-03-15 21:32:52,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:52,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:52,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:52,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491312946] [2022-03-15 21:32:52,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491312946] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:52,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728296908] [2022-03-15 21:32:52,963 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:32:52,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:52,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:52,964 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:52,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-03-15 21:32:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:53,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 119 conjunts are in the unsatisfiable core [2022-03-15 21:32:53,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:53,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:53,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728296908] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:53,280 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:53,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2022-03-15 21:32:53,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [972674310] [2022-03-15 21:32:53,280 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:53,287 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:53,344 INFO L252 McrAutomatonBuilder]: Finished intersection with 157 states and 246 transitions. [2022-03-15 21:32:53,344 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:32:54,049 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:32:54,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:32:54,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:32:54,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:32:54,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2022-03-15 21:32:54,049 INFO L87 Difference]: Start difference. First operand 187 states and 398 transitions. Second operand has 32 states, 31 states have (on average 4.935483870967742) internal successors, (153), 31 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 21:32:55,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:32:55,408 INFO L93 Difference]: Finished difference Result 601 states and 1165 transitions. [2022-03-15 21:32:55,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 21:32:55,412 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.935483870967742) internal successors, (153), 31 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) Word has length 66 [2022-03-15 21:32:55,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:32:55,413 INFO L225 Difference]: With dead ends: 601 [2022-03-15 21:32:55,413 INFO L226 Difference]: Without dead ends: 537 [2022-03-15 21:32:55,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 246 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2022-03-15 21:32:55,413 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 87 mSDsluCounter, 4383 mSDsCounter, 0 mSdLazyCounter, 7236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:32:55,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 0 Invalid, 7237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7236 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 21:32:55,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-03-15 21:32:55,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 391. [2022-03-15 21:32:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 390 states have (on average 2.287179487179487) internal successors, (892), 390 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:32:55,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 892 transitions. [2022-03-15 21:32:55,418 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 892 transitions. Word has length 66 [2022-03-15 21:32:55,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:32:55,418 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 892 transitions. [2022-03-15 21:32:55,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.935483870967742) internal successors, (153), 31 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 21:32:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 892 transitions. [2022-03-15 21:32:55,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-03-15 21:32:55,418 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:32:55,419 INFO L514 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:32:55,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2022-03-15 21:32:55,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:55,634 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:32:55,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:32:55,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1593615520, now seen corresponding path program 86 times [2022-03-15 21:32:55,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:32:55,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678279677] [2022-03-15 21:32:55,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:32:55,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:32:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:32:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:56,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:32:56,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678279677] [2022-03-15 21:32:56,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678279677] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:32:56,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984136053] [2022-03-15 21:32:56,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:32:56,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:32:56,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:32:56,639 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:32:56,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-03-15 21:32:56,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:32:56,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:32:56,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-15 21:32:56,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:32:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:58,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:32:59,224 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:32:59,224 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984136053] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:32:59,224 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:32:59,224 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 61] total 152 [2022-03-15 21:32:59,224 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [154375507] [2022-03-15 21:32:59,224 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:32:59,231 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:32:59,291 INFO L252 McrAutomatonBuilder]: Finished intersection with 159 states and 249 transitions. [2022-03-15 21:32:59,291 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:33:02,560 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 61 new interpolants: [84993#(or (< i1 N1) (<= (+ i2 18) N2)), 85009#(or (<= (+ 30 i2) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 85016#(or (<= (+ 30 i2) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 85004#(or (<= (+ 29 i2) N2) (< i1 N1)), 84986#(or (<= (+ i2 11) N2) (< i1 N1)), 85030#(or (<= N1 (+ i1 24)) (<= (+ 30 i2) N2) (< (+ i1 25) N1)), 84990#(or (<= (+ i2 15) N2) (< i1 N1)), 85027#(or (<= N1 (+ 21 i1)) (<= (+ 30 i2) N2) (< (+ 22 i1) N1)), 84976#(or (< i2 N2) (< i1 N1)), 84988#(or (< i1 N1) (<= (+ i2 13) N2)), 84985#(or (<= (+ i2 10) N2) (< i1 N1)), 85028#(or (< (+ 23 i1) N1) (<= (+ 30 i2) N2) (<= N1 (+ 22 i1))), 84992#(or (< i1 N1) (<= (+ i2 17) N2)), 85033#(or (<= N1 (+ i1 27)) (< (+ i1 28) N1) (<= (+ 30 i2) N2)), 84981#(or (< i1 N1) (<= (+ 6 i2) N2)), 84977#(or (< i1 N1) (<= (+ 2 i2) N2)), 84997#(or (<= (+ 22 i2) N2) (< i1 N1)), 84996#(or (<= (+ 21 i2) N2) (< i1 N1)), 84991#(or (<= (+ 16 i2) N2) (< i1 N1)), 84999#(or (< i1 N1) (<= (+ i2 24) N2)), 85006#(or (< (+ i1 1) N1) (<= (+ 30 i2) N2) (<= N1 i1)), 84994#(or (<= (+ 19 i2) N2) (< i1 N1)), 85014#(or (< (+ 9 i1) N1) (<= (+ 30 i2) N2) (<= N1 (+ i1 8))), 85025#(or (<= N1 (+ 19 i1)) (< (+ i1 20) N1) (<= (+ 30 i2) N2)), 84987#(or (<= (+ i2 12) N2) (< i1 N1)), 85019#(or (<= N1 (+ i1 13)) (<= (+ 30 i2) N2) (< (+ 14 i1) N1)), 84998#(or (<= (+ 23 i2) N2) (< i1 N1)), 84978#(or (< i1 N1) (<= (+ 3 i2) N2)), 85003#(or (< i1 N1) (<= (+ i2 28) N2)), 85005#(or (<= (+ 30 i2) N2) (< i1 N1)), 84979#(or (<= (+ i2 4) N2) (< i1 N1)), 84980#(or (< i1 N1) (<= (+ 5 i2) N2)), 84975#(< i1 N1), 85012#(or (<= (+ 30 i2) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 84989#(or (<= (+ 14 i2) N2) (< i1 N1)), 85031#(or (< (+ i1 26) N1) (<= N1 (+ i1 25)) (<= (+ 30 i2) N2)), 85024#(or (<= N1 (+ i1 18)) (<= (+ 30 i2) N2) (< (+ 19 i1) N1)), 85010#(or (<= N1 (+ i1 4)) (<= (+ 30 i2) N2) (< (+ 5 i1) N1)), 85018#(or (<= N1 (+ i1 12)) (<= (+ 30 i2) N2) (< (+ i1 13) N1)), 85015#(or (<= (+ 30 i2) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 85008#(or (<= N1 (+ 2 i1)) (<= (+ 30 i2) N2) (< (+ 3 i1) N1)), 84984#(or (<= (+ 9 i2) N2) (< i1 N1)), 85020#(or (<= N1 (+ 14 i1)) (<= (+ 30 i2) N2) (< (+ i1 15) N1)), 84995#(or (<= (+ i2 20) N2) (< i1 N1)), 85021#(or (< (+ 16 i1) N1) (<= (+ 30 i2) N2) (<= N1 (+ i1 15))), 85001#(or (<= (+ i2 26) N2) (< i1 N1)), 85032#(or (<= N1 (+ i1 26)) (<= (+ 30 i2) N2) (< (+ i1 27) N1)), 84983#(or (< i1 N1) (<= (+ i2 8) N2)), 85000#(or (<= (+ i2 25) N2) (< i1 N1)), 85026#(or (< (+ 21 i1) N1) (<= (+ 30 i2) N2) (<= N1 (+ i1 20))), 84982#(or (<= (+ 7 i2) N2) (< i1 N1)), 85013#(or (<= N1 (+ 7 i1)) (<= (+ 30 i2) N2) (< (+ i1 8) N1)), 85011#(or (<= N1 (+ 5 i1)) (<= (+ 30 i2) N2) (< (+ 6 i1) N1)), 85023#(or (< (+ i1 18) N1) (<= (+ 30 i2) N2) (<= N1 (+ i1 17))), 85029#(or (< (+ i1 24) N1) (<= (+ 30 i2) N2) (<= N1 (+ 23 i1))), 85007#(or (<= N1 (+ i1 1)) (<= (+ 30 i2) N2) (< (+ 2 i1) N1)), 85035#(or (<= N1 (+ 29 i1)) (<= (+ 30 i2) N2) (< (+ 30 i1) N1)), 85002#(or (<= (+ i2 27) N2) (< i1 N1)), 85017#(or (<= (+ 30 i2) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 85022#(or (< (+ i1 17) N1) (<= (+ 30 i2) N2) (<= N1 (+ 16 i1))), 85034#(or (<= N1 (+ i1 28)) (<= (+ 30 i2) N2) (< (+ 29 i1) N1))] [2022-03-15 21:33:02,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 124 states [2022-03-15 21:33:02,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:33:02,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2022-03-15 21:33:02,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7025, Invalid=38557, Unknown=0, NotChecked=0, Total=45582 [2022-03-15 21:33:02,563 INFO L87 Difference]: Start difference. First operand 391 states and 892 transitions. Second operand has 124 states, 124 states have (on average 1.7661290322580645) internal successors, (219), 123 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:33:08,791 INFO L93 Difference]: Finished difference Result 892 states and 1656 transitions. [2022-03-15 21:33:08,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-03-15 21:33:08,792 INFO L78 Accepts]: Start accepts. Automaton has has 124 states, 124 states have (on average 1.7661290322580645) internal successors, (219), 123 states have internal predecessors, (219), 0 states have call successors, (0), 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 67 [2022-03-15 21:33:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:33:08,793 INFO L225 Difference]: With dead ends: 892 [2022-03-15 21:33:08,793 INFO L226 Difference]: Without dead ends: 668 [2022-03-15 21:33:08,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38420 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=23419, Invalid=85811, Unknown=0, NotChecked=0, Total=109230 [2022-03-15 21:33:08,796 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1189 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 2846 mSolverCounterSat, 614 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 614 IncrementalHoareTripleChecker+Valid, 2846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:33:08,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1189 Valid, 0 Invalid, 3460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [614 Valid, 2846 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 21:33:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-03-15 21:33:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 222. [2022-03-15 21:33:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 2.1221719457013575) internal successors, (469), 221 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 469 transitions. [2022-03-15 21:33:08,800 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 469 transitions. Word has length 67 [2022-03-15 21:33:08,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:33:08,800 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 469 transitions. [2022-03-15 21:33:08,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 124 states, 124 states have (on average 1.7661290322580645) internal successors, (219), 123 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 469 transitions. [2022-03-15 21:33:08,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-03-15 21:33:08,800 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:33:08,800 INFO L514 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:33:08,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2022-03-15 21:33:09,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:09,015 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:33:09,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:33:09,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1083719050, now seen corresponding path program 87 times [2022-03-15 21:33:09,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:33:09,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385137404] [2022-03-15 21:33:09,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:33:09,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:33:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:33:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 436 proven. 464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:09,590 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:33:09,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385137404] [2022-03-15 21:33:09,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385137404] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:33:09,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041591253] [2022-03-15 21:33:09,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:33:09,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:09,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:33:09,592 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:33:09,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-03-15 21:33:09,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2022-03-15 21:33:09,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:33:09,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-15 21:33:09,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:33:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 436 proven. 464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:11,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:33:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:13,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041591253] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:33:13,008 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:33:13,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 61, 61] total 151 [2022-03-15 21:33:13,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1550869700] [2022-03-15 21:33:13,009 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:33:13,015 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:33:13,055 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 131 transitions. [2022-03-15 21:33:13,055 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:33:14,780 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [87179#(and (or (<= N1 (+ i1 25)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 25)) (<= (+ 3 i2) i1))), 87155#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 1)) (<= (+ i2 27) i1))), 87158#(and (or (<= N1 (+ i1 4)) (<= (+ i2 24) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 87164#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= N1 (+ i1 10)) (<= (+ i2 18) i1))), 87174#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20))) (or (<= (+ i2 8) i1) (<= N1 (+ i1 20)))), 87169#(and (or (<= (+ i2 13) i1) (<= N1 (+ i1 15))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15)))), 87162#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= N1 (+ i1 8)) (<= (+ i2 20) i1))), 87165#(and (or (<= (+ i2 17) i1) (<= N1 (+ i1 11))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11)))), 87172#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= (+ i2 10) i1))), 87161#(and (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 7 i1)) (<= (+ 21 i2) i1))), 87156#(and (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 2 i1)) (<= (+ i2 26) i1))), 87182#(and (or (<= N1 (+ i1 28)) (<= i2 i1)) (or (<= N1 (+ i1 28)) (= (+ N1 (* (- 1) N2)) 0))), 87160#(and (or (<= N1 (+ 6 i1)) (<= (+ 22 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 87167#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 15) i1) (<= N1 (+ i1 13)))), 87166#(and (or (<= N1 (+ i1 12)) (<= (+ 16 i2) i1)) (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0))), 87173#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 9 i2) i1) (<= N1 (+ 19 i1)))), 87170#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= N1 (+ 16 i1)) (<= (+ i2 12) i1))), 87171#(and (or (<= N1 (+ i1 17)) (<= (+ i2 11) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 87177#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1))) (or (<= N1 (+ 23 i1)) (<= (+ 5 i2) i1))), 87159#(and (or (<= N1 (+ 5 i1)) (<= (+ 23 i2) i1)) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 87181#(and (or (<= N1 (+ i1 27)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 27)) (<= (+ i2 1) i1))), 87175#(and (or (<= (+ 7 i2) i1) (<= N1 (+ 21 i1))) (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0))), 87157#(and (or (<= (+ i2 25) i1) (<= N1 (+ 3 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 87180#(and (or (<= N1 (+ i1 26)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 26)) (<= (+ 2 i2) i1))), 87183#(< i2 N2), 87154#(and (or (<= (+ i2 28) i1) (<= N1 i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1))), 87178#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 4) i1) (<= N1 (+ i1 24)))), 87176#(and (or (<= (+ 6 i2) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 87163#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1))) (or (<= (+ 19 i2) i1) (<= N1 (+ 9 i1)))), 87168#(and (or (<= N1 (+ 14 i1)) (<= (+ 14 i2) i1)) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0)))] [2022-03-15 21:33:14,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 21:33:14,781 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:33:14,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 21:33:14,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6776, Invalid=26166, Unknown=0, NotChecked=0, Total=32942 [2022-03-15 21:33:14,783 INFO L87 Difference]: Start difference. First operand 222 states and 469 transitions. Second operand has 63 states, 63 states have (on average 2.0476190476190474) internal successors, (129), 62 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:33:17,105 INFO L93 Difference]: Finished difference Result 426 states and 842 transitions. [2022-03-15 21:33:17,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-03-15 21:33:17,106 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0476190476190474) internal successors, (129), 62 states have internal predecessors, (129), 0 states have call successors, (0), 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 67 [2022-03-15 21:33:17,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:33:17,106 INFO L225 Difference]: With dead ends: 426 [2022-03-15 21:33:17,106 INFO L226 Difference]: Without dead ends: 425 [2022-03-15 21:33:17,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24721 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=17039, Invalid=55053, Unknown=0, NotChecked=0, Total=72092 [2022-03-15 21:33:17,109 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 341 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:33:17,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 0 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:33:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-03-15 21:33:17,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 193. [2022-03-15 21:33:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 2.140625) internal successors, (411), 192 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 411 transitions. [2022-03-15 21:33:17,112 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 411 transitions. Word has length 67 [2022-03-15 21:33:17,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:33:17,112 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 411 transitions. [2022-03-15 21:33:17,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.0476190476190474) internal successors, (129), 62 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:17,112 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 411 transitions. [2022-03-15 21:33:17,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-03-15 21:33:17,112 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:33:17,112 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:33:17,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2022-03-15 21:33:17,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2022-03-15 21:33:17,327 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:33:17,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:33:17,328 INFO L85 PathProgramCache]: Analyzing trace with hash 2137441689, now seen corresponding path program 88 times [2022-03-15 21:33:17,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:33:17,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923718991] [2022-03-15 21:33:17,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:33:17,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:33:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:33:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:17,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:33:17,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923718991] [2022-03-15 21:33:17,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923718991] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:33:17,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445312492] [2022-03-15 21:33:17,727 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:33:17,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:17,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:33:17,728 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:33:17,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-03-15 21:33:17,777 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:33:17,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:33:17,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 123 conjunts are in the unsatisfiable core [2022-03-15 21:33:17,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:33:17,908 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:17,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:33:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:18,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445312492] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:33:18,047 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:33:18,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 31 [2022-03-15 21:33:18,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1250197571] [2022-03-15 21:33:18,047 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:33:18,055 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:33:18,147 INFO L252 McrAutomatonBuilder]: Finished intersection with 162 states and 254 transitions. [2022-03-15 21:33:18,147 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:33:18,916 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:33:18,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:33:18,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:33:18,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:33:18,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:33:18,917 INFO L87 Difference]: Start difference. First operand 193 states and 411 transitions. Second operand has 33 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:20,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:33:20,363 INFO L93 Difference]: Finished difference Result 621 states and 1204 transitions. [2022-03-15 21:33:20,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 21:33:20,363 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 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 68 [2022-03-15 21:33:20,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:33:20,364 INFO L225 Difference]: With dead ends: 621 [2022-03-15 21:33:20,364 INFO L226 Difference]: Without dead ends: 555 [2022-03-15 21:33:20,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 254 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:33:20,364 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 4684 mSDsCounter, 0 mSdLazyCounter, 7725 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:33:20,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 7726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7725 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 21:33:20,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-03-15 21:33:20,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 404. [2022-03-15 21:33:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 2.2878411910669976) internal successors, (922), 403 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 922 transitions. [2022-03-15 21:33:20,370 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 922 transitions. Word has length 68 [2022-03-15 21:33:20,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:33:20,370 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 922 transitions. [2022-03-15 21:33:20,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:20,370 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 922 transitions. [2022-03-15 21:33:20,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-03-15 21:33:20,370 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:33:20,370 INFO L514 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:33:20,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2022-03-15 21:33:20,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:20,592 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:33:20,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:33:20,592 INFO L85 PathProgramCache]: Analyzing trace with hash -907890088, now seen corresponding path program 89 times [2022-03-15 21:33:20,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:33:20,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521947449] [2022-03-15 21:33:20,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:33:20,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:33:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:33:21,530 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 465 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:21,531 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:33:21,531 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521947449] [2022-03-15 21:33:21,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521947449] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:33:21,531 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043166782] [2022-03-15 21:33:21,531 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:33:21,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:21,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:33:21,532 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:33:21,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-03-15 21:33:21,600 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2022-03-15 21:33:21,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:33:21,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 21:33:21,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:33:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 465 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:23,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:33:24,699 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:24,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043166782] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:33:24,700 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:33:24,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63, 63] total 157 [2022-03-15 21:33:24,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [519648744] [2022-03-15 21:33:24,700 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:33:24,707 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:33:24,770 INFO L252 McrAutomatonBuilder]: Finished intersection with 164 states and 257 transitions. [2022-03-15 21:33:24,770 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:33:28,053 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 63 new interpolants: [90633#(or (<= N1 (+ i1 1)) (<= (+ i2 31) N2) (< (+ 2 i1) N1)), 90620#(or (<= (+ i2 20) N2) (< i1 N1)), 90629#(or (<= (+ 29 i2) N2) (< i1 N1)), 90640#(or (< (+ 9 i1) N1) (<= (+ i2 31) N2) (<= N1 (+ i1 8))), 90618#(or (< i1 N1) (<= (+ i2 18) N2)), 90645#(or (<= N1 (+ i1 13)) (<= (+ i2 31) N2) (< (+ 14 i1) N1)), 90603#(or (< i1 N1) (<= (+ 3 i2) N2)), 90616#(or (<= (+ 16 i2) N2) (< i1 N1)), 90611#(or (<= (+ i2 11) N2) (< i1 N1)), 90638#(or (<= (+ i2 31) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 90621#(or (<= (+ 21 i2) N2) (< i1 N1)), 90630#(or (<= (+ 30 i2) N2) (< i1 N1)), 90631#(or (<= (+ i2 31) N2) (< i1 N1)), 90625#(or (<= (+ i2 25) N2) (< i1 N1)), 90655#(or (<= (+ i2 31) N2) (< (+ i1 24) N1) (<= N1 (+ 23 i1))), 90651#(or (<= N1 (+ 19 i1)) (<= (+ i2 31) N2) (< (+ i1 20) N1)), 90601#(or (< i2 N2) (< i1 N1)), 90656#(or (<= (+ i2 31) N2) (<= N1 (+ i1 24)) (< (+ i1 25) N1)), 90648#(or (< (+ i1 17) N1) (<= (+ i2 31) N2) (<= N1 (+ 16 i1))), 90649#(or (< (+ i1 18) N1) (<= (+ i2 31) N2) (<= N1 (+ i1 17))), 90647#(or (< (+ 16 i1) N1) (<= (+ i2 31) N2) (<= N1 (+ i1 15))), 90644#(or (<= (+ i2 31) N2) (<= N1 (+ i1 12)) (< (+ i1 13) N1)), 90613#(or (< i1 N1) (<= (+ i2 13) N2)), 90605#(or (< i1 N1) (<= (+ 5 i2) N2)), 90643#(or (<= (+ i2 31) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 90600#(< i1 N1), 90652#(or (< (+ 21 i1) N1) (<= (+ i2 31) N2) (<= N1 (+ i1 20))), 90607#(or (<= (+ 7 i2) N2) (< i1 N1)), 90615#(or (<= (+ i2 15) N2) (< i1 N1)), 90658#(or (<= (+ i2 31) N2) (<= N1 (+ i1 26)) (< (+ i1 27) N1)), 90639#(or (<= N1 (+ 7 i1)) (<= (+ i2 31) N2) (< (+ i1 8) N1)), 90661#(or (<= N1 (+ 29 i1)) (<= (+ i2 31) N2) (< (+ 30 i1) N1)), 90624#(or (< i1 N1) (<= (+ i2 24) N2)), 90654#(or (< (+ 23 i1) N1) (<= (+ i2 31) N2) (<= N1 (+ 22 i1))), 90610#(or (<= (+ i2 10) N2) (< i1 N1)), 90604#(or (<= (+ i2 4) N2) (< i1 N1)), 90627#(or (<= (+ i2 27) N2) (< i1 N1)), 90641#(or (<= (+ i2 31) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 90646#(or (<= N1 (+ 14 i1)) (<= (+ i2 31) N2) (< (+ i1 15) N1)), 90614#(or (<= (+ 14 i2) N2) (< i1 N1)), 90612#(or (<= (+ i2 12) N2) (< i1 N1)), 90637#(or (<= N1 (+ 5 i1)) (<= (+ i2 31) N2) (< (+ 6 i1) N1)), 90602#(or (< i1 N1) (<= (+ 2 i2) N2)), 90632#(or (< (+ i1 1) N1) (<= (+ i2 31) N2) (<= N1 i1)), 90619#(or (<= (+ 19 i2) N2) (< i1 N1)), 90628#(or (< i1 N1) (<= (+ i2 28) N2)), 90642#(or (<= (+ i2 31) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 90662#(or (<= N1 (+ 30 i1)) (<= (+ i2 31) N2) (< (+ i1 31) N1)), 90606#(or (< i1 N1) (<= (+ 6 i2) N2)), 90653#(or (<= N1 (+ 21 i1)) (<= (+ i2 31) N2) (< (+ 22 i1) N1)), 90660#(or (<= N1 (+ i1 28)) (<= (+ i2 31) N2) (< (+ 29 i1) N1)), 90608#(or (< i1 N1) (<= (+ i2 8) N2)), 90659#(or (<= N1 (+ i1 27)) (<= (+ i2 31) N2) (< (+ i1 28) N1)), 90622#(or (<= (+ 22 i2) N2) (< i1 N1)), 90609#(or (<= (+ 9 i2) N2) (< i1 N1)), 90636#(or (<= N1 (+ i1 4)) (<= (+ i2 31) N2) (< (+ 5 i1) N1)), 90635#(or (<= (+ i2 31) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 90634#(or (<= (+ i2 31) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 90626#(or (<= (+ i2 26) N2) (< i1 N1)), 90617#(or (< i1 N1) (<= (+ i2 17) N2)), 90657#(or (< (+ i1 26) N1) (<= N1 (+ i1 25)) (<= (+ i2 31) N2)), 90650#(or (<= N1 (+ i1 18)) (<= (+ i2 31) N2) (< (+ 19 i1) N1)), 90623#(or (<= (+ 23 i2) N2) (< i1 N1))] [2022-03-15 21:33:28,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2022-03-15 21:33:28,053 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:33:28,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2022-03-15 21:33:28,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7476, Invalid=41144, Unknown=0, NotChecked=0, Total=48620 [2022-03-15 21:33:28,056 INFO L87 Difference]: Start difference. First operand 404 states and 922 transitions. Second operand has 128 states, 128 states have (on average 1.765625) internal successors, (226), 127 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:34,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:33:34,754 INFO L93 Difference]: Finished difference Result 922 states and 1712 transitions. [2022-03-15 21:33:34,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-03-15 21:33:34,755 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 128 states have (on average 1.765625) internal successors, (226), 127 states have internal predecessors, (226), 0 states have call successors, (0), 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 69 [2022-03-15 21:33:34,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:33:34,756 INFO L225 Difference]: With dead ends: 922 [2022-03-15 21:33:34,756 INFO L226 Difference]: Without dead ends: 690 [2022-03-15 21:33:34,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41064 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=24990, Invalid=91632, Unknown=0, NotChecked=0, Total=116622 [2022-03-15 21:33:34,760 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1226 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 2795 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:33:34,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1226 Valid, 0 Invalid, 3446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2795 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:33:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-03-15 21:33:34,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 229. [2022-03-15 21:33:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 2.1228070175438596) internal successors, (484), 228 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:34,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 484 transitions. [2022-03-15 21:33:34,764 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 484 transitions. Word has length 69 [2022-03-15 21:33:34,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:33:34,764 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 484 transitions. [2022-03-15 21:33:34,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 128 states have (on average 1.765625) internal successors, (226), 127 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:34,764 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 484 transitions. [2022-03-15 21:33:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-03-15 21:33:34,764 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:33:34,764 INFO L514 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:33:34,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Forceful destruction successful, exit code 0 [2022-03-15 21:33:34,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:34,981 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:33:34,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:33:34,981 INFO L85 PathProgramCache]: Analyzing trace with hash -621438196, now seen corresponding path program 90 times [2022-03-15 21:33:34,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:33:34,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118463288] [2022-03-15 21:33:34,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:33:34,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:33:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:33:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 466 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:35,545 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:33:35,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118463288] [2022-03-15 21:33:35,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118463288] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:33:35,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038916710] [2022-03-15 21:33:35,545 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:33:35,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:35,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:33:35,546 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:33:35,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-03-15 21:33:35,604 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-03-15 21:33:35,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:33:35,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 21:33:35,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:33:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 466 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:37,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:33:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:39,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038916710] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:33:39,929 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:33:39,929 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 63, 63] total 156 [2022-03-15 21:33:39,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2102774019] [2022-03-15 21:33:39,929 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:33:39,936 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:33:40,028 INFO L252 McrAutomatonBuilder]: Finished intersection with 103 states and 135 transitions. [2022-03-15 21:33:40,028 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:33:42,055 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [92877#(and (or (<= N1 (+ i1 27)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 27)) (<= (+ 2 i2) i1))), 92864#(and (or (<= (+ i2 15) i1) (<= N1 (+ 14 i1))) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0))), 92861#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= N1 (+ i1 11)) (<= (+ i2 18) i1))), 92863#(and (or (<= N1 (+ i1 13)) (<= (+ 16 i2) i1)) (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0))), 92867#(and (or (<= N1 (+ i1 17)) (<= (+ i2 12) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 92852#(and (or (<= N1 (+ 2 i1)) (<= (+ i2 27) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 92856#(and (or (<= N1 (+ 6 i1)) (<= (+ 23 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 92866#(and (or (<= (+ i2 13) i1) (<= N1 (+ 16 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1)))), 92874#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 24)) (<= (+ 5 i2) i1))), 92869#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ i2 10) i1))), 92851#(and (or (<= (+ i2 28) i1) (<= N1 (+ i1 1))) (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0))), 92860#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= (+ 19 i2) i1) (<= N1 (+ i1 10)))), 92862#(and (or (<= N1 (+ i1 12)) (<= (+ i2 17) i1)) (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0))), 92850#(and (or (<= (+ 29 i2) i1) (<= N1 i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1))), 92855#(and (or (<= N1 (+ 5 i1)) (<= (+ i2 24) i1)) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 92879#(and (or (<= N1 (+ i1 28)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 28)) (<= (+ i2 1) i1))), 92854#(and (or (<= N1 (+ i1 4)) (<= (+ i2 25) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 92871#(and (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 21 i1)) (<= (+ i2 8) i1))), 92865#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= (+ 14 i2) i1) (<= N1 (+ i1 15)))), 92875#(and (or (<= N1 (+ i1 25)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 25)) (<= (+ i2 4) i1))), 92857#(and (or (<= N1 (+ 7 i1)) (<= (+ 22 i2) i1)) (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0))), 92873#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1))) (or (<= (+ 6 i2) i1) (<= N1 (+ 23 i1)))), 92880#(and (or (<= N1 (+ 29 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 29 i1)) (<= i2 i1))), 92859#(and (or (<= N1 (+ 9 i1)) (<= (+ i2 20) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 92858#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= (+ 21 i2) i1) (<= N1 (+ i1 8)))), 92853#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1))) (or (<= (+ i2 26) i1) (<= N1 (+ 3 i1)))), 92872#(and (or (<= (+ 7 i2) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 92870#(and (or (<= (+ 9 i2) i1) (<= N1 (+ i1 20))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20)))), 92878#(< i2 N2), 92876#(and (or (<= N1 (+ i1 26)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 26)) (<= (+ 3 i2) i1))), 92868#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= (+ i2 11) i1)))] [2022-03-15 21:33:42,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-15 21:33:42,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:33:42,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-15 21:33:42,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7219, Invalid=27937, Unknown=0, NotChecked=0, Total=35156 [2022-03-15 21:33:42,058 INFO L87 Difference]: Start difference. First operand 229 states and 484 transitions. Second operand has 65 states, 65 states have (on average 2.046153846153846) internal successors, (133), 64 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:33:44,679 INFO L93 Difference]: Finished difference Result 440 states and 870 transitions. [2022-03-15 21:33:44,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-03-15 21:33:44,679 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.046153846153846) internal successors, (133), 64 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-03-15 21:33:44,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:33:44,680 INFO L225 Difference]: With dead ends: 440 [2022-03-15 21:33:44,680 INFO L226 Difference]: Without dead ends: 439 [2022-03-15 21:33:44,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26441 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=18181, Invalid=58825, Unknown=0, NotChecked=0, Total=77006 [2022-03-15 21:33:44,683 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 513 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:33:44,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 0 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:33:44,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-03-15 21:33:44,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 199. [2022-03-15 21:33:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 2.1414141414141414) internal successors, (424), 198 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:44,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 424 transitions. [2022-03-15 21:33:44,686 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 424 transitions. Word has length 69 [2022-03-15 21:33:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:33:44,686 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 424 transitions. [2022-03-15 21:33:44,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.046153846153846) internal successors, (133), 64 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:44,686 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 424 transitions. [2022-03-15 21:33:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-15 21:33:44,686 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:33:44,686 INFO L514 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:33:44,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2022-03-15 21:33:44,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:44,899 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:33:44,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:33:44,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1920093601, now seen corresponding path program 91 times [2022-03-15 21:33:44,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:33:44,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600916707] [2022-03-15 21:33:44,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:33:44,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:33:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:33:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:45,291 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:33:45,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600916707] [2022-03-15 21:33:45,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600916707] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:33:45,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563015340] [2022-03-15 21:33:45,292 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:33:45,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:45,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:33:45,293 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:33:45,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-03-15 21:33:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:33:45,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 127 conjunts are in the unsatisfiable core [2022-03-15 21:33:45,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:33:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:45,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:33:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:45,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563015340] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:33:45,615 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:33:45,615 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2022-03-15 21:33:45,615 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [435966131] [2022-03-15 21:33:45,615 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:33:45,622 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:33:45,690 INFO L252 McrAutomatonBuilder]: Finished intersection with 167 states and 262 transitions. [2022-03-15 21:33:45,690 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:33:46,463 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:33:46,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 21:33:46,463 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:33:46,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 21:33:46,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:33:46,464 INFO L87 Difference]: Start difference. First operand 199 states and 424 transitions. Second operand has 34 states, 33 states have (on average 4.9393939393939394) internal successors, (163), 33 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:47,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:33:47,999 INFO L93 Difference]: Finished difference Result 641 states and 1243 transitions. [2022-03-15 21:33:47,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 21:33:47,999 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.9393939393939394) internal successors, (163), 33 states have internal predecessors, (163), 0 states have call successors, (0), 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 70 [2022-03-15 21:33:47,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:33:48,000 INFO L225 Difference]: With dead ends: 641 [2022-03-15 21:33:48,000 INFO L226 Difference]: Without dead ends: 573 [2022-03-15 21:33:48,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 262 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:33:48,001 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 4995 mSDsCounter, 0 mSdLazyCounter, 8230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:33:48,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 8231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8230 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 21:33:48,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-03-15 21:33:48,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 417. [2022-03-15 21:33:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 2.2884615384615383) internal successors, (952), 416 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 952 transitions. [2022-03-15 21:33:48,025 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 952 transitions. Word has length 70 [2022-03-15 21:33:48,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:33:48,025 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 952 transitions. [2022-03-15 21:33:48,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.9393939393939394) internal successors, (163), 33 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:33:48,025 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 952 transitions. [2022-03-15 21:33:48,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-03-15 21:33:48,026 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:33:48,026 INFO L514 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:33:48,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Ended with exit code 0 [2022-03-15 21:33:48,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:48,243 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:33:48,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:33:48,244 INFO L85 PathProgramCache]: Analyzing trace with hash 228984480, now seen corresponding path program 92 times [2022-03-15 21:33:48,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:33:48,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023727601] [2022-03-15 21:33:48,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:33:48,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:33:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:33:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:49,237 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:33:49,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023727601] [2022-03-15 21:33:49,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023727601] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:33:49,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036841753] [2022-03-15 21:33:49,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:33:49,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:33:49,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:33:49,238 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:33:49,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-03-15 21:33:49,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:33:49,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:33:49,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-15 21:33:49,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:33:51,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:51,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:33:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:33:52,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036841753] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:33:52,195 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:33:52,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65, 65] total 162 [2022-03-15 21:33:52,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1140140623] [2022-03-15 21:33:52,195 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:33:52,203 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:33:52,276 INFO L252 McrAutomatonBuilder]: Finished intersection with 169 states and 265 transitions. [2022-03-15 21:33:52,277 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:33:55,640 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 65 new interpolants: [96424#(or (<= (+ 19 i2) N2) (< i1 N1)), 96413#(or (< i1 N1) (<= (+ i2 8) N2)), 96420#(or (<= (+ i2 15) N2) (< i1 N1)), 96460#(or (<= (+ 32 i2) N2) (< (+ 23 i1) N1) (<= N1 (+ 22 i1))), 96410#(or (< i1 N1) (<= (+ 5 i2) N2)), 96409#(or (<= (+ i2 4) N2) (< i1 N1)), 96437#(or (<= (+ 32 i2) N2) (< i1 N1)), 96421#(or (<= (+ 16 i2) N2) (< i1 N1)), 96447#(or (<= (+ 32 i2) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 96467#(or (<= (+ 32 i2) N2) (<= N1 (+ 29 i1)) (< (+ 30 i1) N1)), 96456#(or (<= (+ 32 i2) N2) (<= N1 (+ i1 18)) (< (+ 19 i1) N1)), 96407#(or (< i1 N1) (<= (+ 2 i2) N2)), 96466#(or (<= (+ 32 i2) N2) (<= N1 (+ i1 28)) (< (+ 29 i1) N1)), 96411#(or (< i1 N1) (<= (+ 6 i2) N2)), 96455#(or (<= (+ 32 i2) N2) (< (+ i1 18) N1) (<= N1 (+ i1 17))), 96469#(or (<= (+ 32 i2) N2) (< (+ 32 i1) N1) (<= N1 (+ i1 31))), 96438#(or (<= (+ 32 i2) N2) (< (+ i1 1) N1) (<= N1 i1)), 96408#(or (< i1 N1) (<= (+ 3 i2) N2)), 96448#(or (<= (+ 32 i2) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 96427#(or (<= (+ 22 i2) N2) (< i1 N1)), 96436#(or (<= (+ i2 31) N2) (< i1 N1)), 96414#(or (<= (+ 9 i2) N2) (< i1 N1)), 96431#(or (<= (+ i2 26) N2) (< i1 N1)), 96449#(or (<= (+ 32 i2) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 96422#(or (< i1 N1) (<= (+ i2 17) N2)), 96446#(or (<= (+ 32 i2) N2) (< (+ 9 i1) N1) (<= N1 (+ i1 8))), 96425#(or (<= (+ i2 20) N2) (< i1 N1)), 96428#(or (<= (+ 23 i2) N2) (< i1 N1)), 96458#(or (<= (+ 32 i2) N2) (< (+ 21 i1) N1) (<= N1 (+ i1 20))), 96441#(or (<= (+ 32 i2) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 96405#(< i1 N1), 96423#(or (< i1 N1) (<= (+ i2 18) N2)), 96452#(or (<= N1 (+ 14 i1)) (<= (+ 32 i2) N2) (< (+ i1 15) N1)), 96457#(or (<= (+ 32 i2) N2) (<= N1 (+ 19 i1)) (< (+ i1 20) N1)), 96459#(or (<= N1 (+ 21 i1)) (<= (+ 32 i2) N2) (< (+ 22 i1) N1)), 96418#(or (< i1 N1) (<= (+ i2 13) N2)), 96465#(or (<= (+ 32 i2) N2) (<= N1 (+ i1 27)) (< (+ i1 28) N1)), 96442#(or (<= N1 (+ i1 4)) (<= (+ 32 i2) N2) (< (+ 5 i1) N1)), 96462#(or (<= (+ 32 i2) N2) (<= N1 (+ i1 24)) (< (+ i1 25) N1)), 96429#(or (< i1 N1) (<= (+ i2 24) N2)), 96416#(or (<= (+ i2 11) N2) (< i1 N1)), 96419#(or (<= (+ 14 i2) N2) (< i1 N1)), 96426#(or (<= (+ 21 i2) N2) (< i1 N1)), 96444#(or (<= (+ 32 i2) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 96440#(or (<= (+ 32 i2) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 96415#(or (<= (+ i2 10) N2) (< i1 N1)), 96435#(or (<= (+ 30 i2) N2) (< i1 N1)), 96468#(or (<= N1 (+ 30 i1)) (<= (+ 32 i2) N2) (< (+ i1 31) N1)), 96464#(or (<= (+ 32 i2) N2) (<= N1 (+ i1 26)) (< (+ i1 27) N1)), 96430#(or (<= (+ i2 25) N2) (< i1 N1)), 96433#(or (< i1 N1) (<= (+ i2 28) N2)), 96445#(or (<= N1 (+ 7 i1)) (<= (+ 32 i2) N2) (< (+ i1 8) N1)), 96417#(or (<= (+ i2 12) N2) (< i1 N1)), 96406#(or (< i2 N2) (< i1 N1)), 96463#(or (< (+ i1 26) N1) (<= N1 (+ i1 25)) (<= (+ 32 i2) N2)), 96434#(or (<= (+ 29 i2) N2) (< i1 N1)), 96439#(or (<= (+ 32 i2) N2) (<= N1 (+ i1 1)) (< (+ 2 i1) N1)), 96450#(or (<= (+ 32 i2) N2) (<= N1 (+ i1 12)) (< (+ i1 13) N1)), 96453#(or (< (+ 16 i1) N1) (<= (+ 32 i2) N2) (<= N1 (+ i1 15))), 96432#(or (<= (+ i2 27) N2) (< i1 N1)), 96454#(or (< (+ i1 17) N1) (<= (+ 32 i2) N2) (<= N1 (+ 16 i1))), 96443#(or (<= (+ 32 i2) N2) (<= N1 (+ 5 i1)) (< (+ 6 i1) N1)), 96461#(or (<= (+ 32 i2) N2) (< (+ i1 24) N1) (<= N1 (+ 23 i1))), 96412#(or (<= (+ 7 i2) N2) (< i1 N1)), 96451#(or (<= (+ 32 i2) N2) (<= N1 (+ i1 13)) (< (+ 14 i1) N1))] [2022-03-15 21:33:55,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-03-15 21:33:55,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:33:55,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-03-15 21:33:55,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7941, Invalid=43815, Unknown=0, NotChecked=0, Total=51756 [2022-03-15 21:33:55,643 INFO L87 Difference]: Start difference. First operand 417 states and 952 transitions. Second operand has 132 states, 132 states have (on average 1.7651515151515151) internal successors, (233), 131 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:02,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:34:02,389 INFO L93 Difference]: Finished difference Result 952 states and 1768 transitions. [2022-03-15 21:34:02,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-03-15 21:34:02,389 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 1.7651515151515151) internal successors, (233), 131 states have internal predecessors, (233), 0 states have call successors, (0), 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 71 [2022-03-15 21:34:02,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:34:02,390 INFO L225 Difference]: With dead ends: 952 [2022-03-15 21:34:02,390 INFO L226 Difference]: Without dead ends: 712 [2022-03-15 21:34:02,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 351 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43796 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=26612, Invalid=97644, Unknown=0, NotChecked=0, Total=124256 [2022-03-15 21:34:02,396 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1272 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 3121 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 675 IncrementalHoareTripleChecker+Valid, 3121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:34:02,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1272 Valid, 0 Invalid, 3796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [675 Valid, 3121 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 21:34:02,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-03-15 21:34:02,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 236. [2022-03-15 21:34:02,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 2.123404255319149) internal successors, (499), 235 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:02,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 499 transitions. [2022-03-15 21:34:02,400 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 499 transitions. Word has length 71 [2022-03-15 21:34:02,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:34:02,400 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 499 transitions. [2022-03-15 21:34:02,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 1.7651515151515151) internal successors, (233), 131 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 499 transitions. [2022-03-15 21:34:02,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-03-15 21:34:02,401 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:34:02,401 INFO L514 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:34:02,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2022-03-15 21:34:02,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:02,617 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:34:02,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:34:02,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2116378250, now seen corresponding path program 93 times [2022-03-15 21:34:02,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:34:02,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531353229] [2022-03-15 21:34:02,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:34:02,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:34:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:34:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 497 proven. 527 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:03,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:34:03,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531353229] [2022-03-15 21:34:03,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531353229] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:34:03,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475758978] [2022-03-15 21:34:03,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:34:03,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:03,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:34:03,066 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:34:03,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-03-15 21:34:03,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2022-03-15 21:34:03,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:34:03,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-15 21:34:03,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:34:04,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 497 proven. 527 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:04,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:34:07,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:07,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475758978] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:34:07,116 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:34:07,116 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 65, 65] total 161 [2022-03-15 21:34:07,116 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2119416352] [2022-03-15 21:34:07,116 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:34:07,123 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:34:07,174 INFO L252 McrAutomatonBuilder]: Finished intersection with 106 states and 139 transitions. [2022-03-15 21:34:07,175 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:34:08,713 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [98732#(and (or (<= N1 (+ 6 i1)) (<= (+ i2 24) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 98735#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1))) (or (<= (+ 21 i2) i1) (<= N1 (+ 9 i1)))), 98736#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= N1 (+ i1 10)) (<= (+ i2 20) i1))), 98731#(and (or (<= (+ i2 25) i1) (<= N1 (+ 5 i1))) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 98750#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 24)) (<= (+ 6 i2) i1))), 98748#(and (or (<= (+ i2 8) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 98754#(and (or (<= N1 (+ i1 27)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 27)) (<= (+ 3 i2) i1))), 98730#(and (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 4)) (<= (+ i2 26) i1))), 98747#(and (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 21 i1)) (<= (+ 9 i2) i1))), 98755#(and (or (<= N1 (+ i1 28)) (<= (+ 2 i2) i1)) (or (<= N1 (+ i1 28)) (= (+ N1 (* (- 1) N2)) 0))), 98752#(< i2 N2), 98726#(and (or (<= (+ 30 i2) i1) (<= N1 i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1))), 98738#(and (or (<= N1 (+ i1 12)) (<= (+ i2 18) i1)) (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0))), 98740#(and (or (<= N1 (+ 14 i1)) (<= (+ 16 i2) i1)) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0))), 98749#(and (or (<= (+ 7 i2) i1) (<= N1 (+ 23 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1)))), 98753#(and (or (<= (+ i2 4) i1) (<= N1 (+ i1 26))) (or (<= N1 (+ i1 26)) (= (+ N1 (* (- 1) N2)) 0))), 98756#(and (or (<= N1 (+ 29 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 29 i1)) (<= (+ i2 1) i1))), 98741#(and (or (<= (+ i2 15) i1) (<= N1 (+ i1 15))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15)))), 98729#(and (or (<= (+ i2 27) i1) (<= N1 (+ 3 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 98757#(and (or (<= N1 (+ 30 i1)) (<= i2 i1)) (or (<= N1 (+ 30 i1)) (= (+ N1 (* (- 1) N2)) 0))), 98745#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ i2 11) i1))), 98742#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= (+ 14 i2) i1) (<= N1 (+ 16 i1)))), 98734#(and (or (<= N1 (+ i1 8)) (<= (+ 22 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8)))), 98727#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 1)) (<= (+ 29 i2) i1))), 98743#(and (or (<= (+ i2 13) i1) (<= N1 (+ i1 17))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 98744#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= (+ i2 12) i1))), 98728#(and (or (<= (+ i2 28) i1) (<= N1 (+ 2 i1))) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 98746#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20))) (or (<= N1 (+ i1 20)) (<= (+ i2 10) i1))), 98751#(and (or (<= N1 (+ i1 25)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 25)) (<= (+ 5 i2) i1))), 98739#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 13)) (<= (+ i2 17) i1))), 98733#(and (or (<= N1 (+ 7 i1)) (<= (+ 23 i2) i1)) (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0))), 98737#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ 19 i2) i1) (<= N1 (+ i1 11))))] [2022-03-15 21:34:08,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-03-15 21:34:08,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:34:08,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-03-15 21:34:08,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7676, Invalid=29766, Unknown=0, NotChecked=0, Total=37442 [2022-03-15 21:34:08,716 INFO L87 Difference]: Start difference. First operand 236 states and 499 transitions. Second operand has 67 states, 67 states have (on average 2.044776119402985) internal successors, (137), 66 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:11,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:34:11,417 INFO L93 Difference]: Finished difference Result 454 states and 898 transitions. [2022-03-15 21:34:11,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-03-15 21:34:11,418 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.044776119402985) internal successors, (137), 66 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-03-15 21:34:11,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:34:11,418 INFO L225 Difference]: With dead ends: 454 [2022-03-15 21:34:11,418 INFO L226 Difference]: Without dead ends: 453 [2022-03-15 21:34:11,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28218 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=19360, Invalid=62722, Unknown=0, NotChecked=0, Total=82082 [2022-03-15 21:34:11,422 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 473 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:34:11,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [473 Valid, 0 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:34:11,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-03-15 21:34:11,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 205. [2022-03-15 21:34:11,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 2.142156862745098) internal successors, (437), 204 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 437 transitions. [2022-03-15 21:34:11,425 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 437 transitions. Word has length 71 [2022-03-15 21:34:11,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:34:11,425 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 437 transitions. [2022-03-15 21:34:11,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.044776119402985) internal successors, (137), 66 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 437 transitions. [2022-03-15 21:34:11,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-03-15 21:34:11,426 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:34:11,426 INFO L514 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:34:11,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2022-03-15 21:34:11,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable95 [2022-03-15 21:34:11,642 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:34:11,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:34:11,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1491500455, now seen corresponding path program 94 times [2022-03-15 21:34:11,643 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:34:11,643 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564585413] [2022-03-15 21:34:11,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:34:11,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:34:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:34:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:12,063 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:34:12,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564585413] [2022-03-15 21:34:12,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564585413] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:34:12,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862353624] [2022-03-15 21:34:12,063 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:34:12,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:12,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:34:12,064 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:34:12,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-03-15 21:34:12,119 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:34:12,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:34:12,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 131 conjunts are in the unsatisfiable core [2022-03-15 21:34:12,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:34:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:12,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:34:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:12,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862353624] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:34:12,391 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:34:12,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 33 [2022-03-15 21:34:12,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1556068583] [2022-03-15 21:34:12,391 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:34:12,399 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:34:12,472 INFO L252 McrAutomatonBuilder]: Finished intersection with 172 states and 270 transitions. [2022-03-15 21:34:12,472 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:34:13,280 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:34:13,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:34:13,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:34:13,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:34:13,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:34:13,281 INFO L87 Difference]: Start difference. First operand 205 states and 437 transitions. Second operand has 35 states, 34 states have (on average 4.9411764705882355) internal successors, (168), 34 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:34:15,162 INFO L93 Difference]: Finished difference Result 661 states and 1282 transitions. [2022-03-15 21:34:15,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:34:15,163 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.9411764705882355) internal successors, (168), 34 states have internal predecessors, (168), 0 states have call successors, (0), 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 72 [2022-03-15 21:34:15,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:34:15,164 INFO L225 Difference]: With dead ends: 661 [2022-03-15 21:34:15,164 INFO L226 Difference]: Without dead ends: 591 [2022-03-15 21:34:15,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 270 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:34:15,164 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 5316 mSDsCounter, 0 mSdLazyCounter, 8751 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:34:15,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 8752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8751 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 21:34:15,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-03-15 21:34:15,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 430. [2022-03-15 21:34:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 2.289044289044289) internal successors, (982), 429 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 982 transitions. [2022-03-15 21:34:15,169 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 982 transitions. Word has length 72 [2022-03-15 21:34:15,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:34:15,169 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 982 transitions. [2022-03-15 21:34:15,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.9411764705882355) internal successors, (168), 34 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 982 transitions. [2022-03-15 21:34:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-03-15 21:34:15,170 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:34:15,170 INFO L514 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:34:15,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2022-03-15 21:34:15,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable96 [2022-03-15 21:34:15,374 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:34:15,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:34:15,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1145239448, now seen corresponding path program 95 times [2022-03-15 21:34:15,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:34:15,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636203527] [2022-03-15 21:34:15,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:34:15,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:34:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:34:16,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 528 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:16,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:34:16,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636203527] [2022-03-15 21:34:16,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636203527] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:34:16,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017160429] [2022-03-15 21:34:16,379 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:34:16,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:16,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:34:16,380 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:34:16,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-03-15 21:34:16,441 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-03-15 21:34:16,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:34:16,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 21:34:16,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:34:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 528 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:18,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:34:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:19,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017160429] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:34:19,879 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:34:19,879 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67, 67] total 167 [2022-03-15 21:34:19,879 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [389521094] [2022-03-15 21:34:19,879 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:34:19,887 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:34:19,961 INFO L252 McrAutomatonBuilder]: Finished intersection with 174 states and 273 transitions. [2022-03-15 21:34:19,961 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:34:23,588 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 67 new interpolants: [102440#(or (< (+ i1 17) N1) (<= (+ i2 33) N2) (<= N1 (+ 16 i1))), 102432#(or (< (+ 9 i1) N1) (<= (+ i2 33) N2) (<= N1 (+ i1 8))), 102435#(or (<= (+ i2 33) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 102418#(or (< i1 N1) (<= (+ i2 28) N2)), 102419#(or (<= (+ 29 i2) N2) (< i1 N1)), 102404#(or (<= (+ 14 i2) N2) (< i1 N1)), 102455#(or (< (+ 32 i1) N1) (<= (+ i2 33) N2) (<= N1 (+ i1 31))), 102441#(or (< (+ i1 18) N1) (<= (+ i2 33) N2) (<= N1 (+ i1 17))), 102448#(or (<= N1 (+ i1 24)) (<= (+ i2 33) N2) (< (+ i1 25) N1)), 102442#(or (<= N1 (+ i1 18)) (<= (+ i2 33) N2) (< (+ 19 i1) N1)), 102451#(or (<= N1 (+ i1 27)) (< (+ i1 28) N1) (<= (+ i2 33) N2)), 102413#(or (<= (+ 23 i2) N2) (< i1 N1)), 102417#(or (<= (+ i2 27) N2) (< i1 N1)), 102439#(or (< (+ 16 i1) N1) (<= (+ i2 33) N2) (<= N1 (+ i1 15))), 102408#(or (< i1 N1) (<= (+ i2 18) N2)), 102390#(< i1 N1), 102391#(or (< i2 N2) (< i1 N1)), 102409#(or (<= (+ 19 i2) N2) (< i1 N1)), 102424#(or (< (+ i1 1) N1) (<= (+ i2 33) N2) (<= N1 i1)), 102447#(or (< (+ i1 24) N1) (<= (+ i2 33) N2) (<= N1 (+ 23 i1))), 102407#(or (< i1 N1) (<= (+ i2 17) N2)), 102415#(or (<= (+ i2 25) N2) (< i1 N1)), 102405#(or (<= (+ i2 15) N2) (< i1 N1)), 102416#(or (<= (+ i2 26) N2) (< i1 N1)), 102428#(or (<= N1 (+ i1 4)) (<= (+ i2 33) N2) (< (+ 5 i1) N1)), 102421#(or (<= (+ i2 31) N2) (< i1 N1)), 102427#(or (<= (+ i2 33) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 102429#(or (<= N1 (+ 5 i1)) (<= (+ i2 33) N2) (< (+ 6 i1) N1)), 102430#(or (< (+ 7 i1) N1) (<= (+ i2 33) N2) (<= N1 (+ 6 i1))), 102452#(or (<= N1 (+ i1 28)) (<= (+ i2 33) N2) (< (+ 29 i1) N1)), 102422#(or (<= (+ 32 i2) N2) (< i1 N1)), 102437#(or (<= N1 (+ i1 13)) (<= (+ i2 33) N2) (< (+ 14 i1) N1)), 102423#(or (<= (+ i2 33) N2) (< i1 N1)), 102438#(or (<= N1 (+ 14 i1)) (< (+ i1 15) N1) (<= (+ i2 33) N2)), 102449#(or (< (+ i1 26) N1) (<= N1 (+ i1 25)) (<= (+ i2 33) N2)), 102420#(or (<= (+ 30 i2) N2) (< i1 N1)), 102396#(or (< i1 N1) (<= (+ 6 i2) N2)), 102456#(or (<= N1 (+ 32 i1)) (<= (+ i2 33) N2) (< (+ i1 33) N1)), 102402#(or (<= (+ i2 12) N2) (< i1 N1)), 102425#(or (<= N1 (+ i1 1)) (<= (+ i2 33) N2) (< (+ 2 i1) N1)), 102436#(or (<= N1 (+ i1 12)) (< (+ i1 13) N1) (<= (+ i2 33) N2)), 102412#(or (<= (+ 22 i2) N2) (< i1 N1)), 102392#(or (< i1 N1) (<= (+ 2 i2) N2)), 102411#(or (<= (+ 21 i2) N2) (< i1 N1)), 102433#(or (<= (+ i2 33) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 102401#(or (<= (+ i2 11) N2) (< i1 N1)), 102453#(or (<= N1 (+ 29 i1)) (<= (+ i2 33) N2) (< (+ 30 i1) N1)), 102393#(or (< i1 N1) (<= (+ 3 i2) N2)), 102446#(or (< (+ 23 i1) N1) (<= (+ i2 33) N2) (<= N1 (+ 22 i1))), 102406#(or (<= (+ 16 i2) N2) (< i1 N1)), 102445#(or (<= N1 (+ 21 i1)) (<= (+ i2 33) N2) (< (+ 22 i1) N1)), 102443#(or (<= N1 (+ 19 i1)) (< (+ i1 20) N1) (<= (+ i2 33) N2)), 102410#(or (<= (+ i2 20) N2) (< i1 N1)), 102444#(or (< (+ 21 i1) N1) (<= (+ i2 33) N2) (<= N1 (+ i1 20))), 102426#(or (<= N1 (+ 2 i1)) (<= (+ i2 33) N2) (< (+ 3 i1) N1)), 102431#(or (<= N1 (+ 7 i1)) (<= (+ i2 33) N2) (< (+ i1 8) N1)), 102395#(or (< i1 N1) (<= (+ 5 i2) N2)), 102394#(or (<= (+ i2 4) N2) (< i1 N1)), 102400#(or (<= (+ i2 10) N2) (< i1 N1)), 102454#(or (<= N1 (+ 30 i1)) (<= (+ i2 33) N2) (< (+ i1 31) N1)), 102434#(or (<= (+ i2 33) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 102398#(or (< i1 N1) (<= (+ i2 8) N2)), 102403#(or (< i1 N1) (<= (+ i2 13) N2)), 102414#(or (< i1 N1) (<= (+ i2 24) N2)), 102399#(or (<= (+ 9 i2) N2) (< i1 N1)), 102450#(or (<= N1 (+ i1 26)) (<= (+ i2 33) N2) (< (+ i1 27) N1)), 102397#(or (<= (+ 7 i2) N2) (< i1 N1))] [2022-03-15 21:34:23,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2022-03-15 21:34:23,588 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:34:23,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2022-03-15 21:34:23,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8420, Invalid=46570, Unknown=0, NotChecked=0, Total=54990 [2022-03-15 21:34:23,593 INFO L87 Difference]: Start difference. First operand 430 states and 982 transitions. Second operand has 136 states, 136 states have (on average 1.7647058823529411) internal successors, (240), 135 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:31,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:34:31,365 INFO L93 Difference]: Finished difference Result 982 states and 1824 transitions. [2022-03-15 21:34:31,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-03-15 21:34:31,365 INFO L78 Accepts]: Start accepts. Automaton has has 136 states, 136 states have (on average 1.7647058823529411) internal successors, (240), 135 states have internal predecessors, (240), 0 states have call successors, (0), 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 73 [2022-03-15 21:34:31,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:34:31,366 INFO L225 Difference]: With dead ends: 982 [2022-03-15 21:34:31,366 INFO L226 Difference]: Without dead ends: 734 [2022-03-15 21:34:31,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46616 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=28285, Invalid=103847, Unknown=0, NotChecked=0, Total=132132 [2022-03-15 21:34:31,371 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1377 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 3205 mSolverCounterSat, 725 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 725 IncrementalHoareTripleChecker+Valid, 3205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:34:31,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1377 Valid, 0 Invalid, 3930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [725 Valid, 3205 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 21:34:31,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2022-03-15 21:34:31,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 243. [2022-03-15 21:34:31,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 2.12396694214876) internal successors, (514), 242 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:31,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 514 transitions. [2022-03-15 21:34:31,375 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 514 transitions. Word has length 73 [2022-03-15 21:34:31,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:34:31,375 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 514 transitions. [2022-03-15 21:34:31,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 136 states, 136 states have (on average 1.7647058823529411) internal successors, (240), 135 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:31,375 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 514 transitions. [2022-03-15 21:34:31,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-03-15 21:34:31,376 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:34:31,376 INFO L514 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:34:31,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2022-03-15 21:34:31,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:31,592 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:34:31,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:34:31,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1181997940, now seen corresponding path program 96 times [2022-03-15 21:34:31,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:34:31,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703030650] [2022-03-15 21:34:31,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:34:31,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:34:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:34:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 529 proven. 560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:32,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:34:32,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703030650] [2022-03-15 21:34:32,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703030650] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:34:32,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978695024] [2022-03-15 21:34:32,239 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:34:32,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:32,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:34:32,240 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:34:32,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-03-15 21:34:32,301 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-03-15 21:34:32,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:34:32,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 21:34:32,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:34:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 529 proven. 560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:34,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:34:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:37,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978695024] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:34:37,013 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:34:37,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 67, 67] total 166 [2022-03-15 21:34:37,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1028978102] [2022-03-15 21:34:37,013 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:34:37,021 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:34:37,074 INFO L252 McrAutomatonBuilder]: Finished intersection with 109 states and 143 transitions. [2022-03-15 21:34:37,074 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:34:38,838 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 33 new interpolants: [104793#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= N1 (+ i1 11)) (<= (+ i2 20) i1))), 104795#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 13)) (<= (+ i2 18) i1))), 104798#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= (+ i2 15) i1) (<= N1 (+ 16 i1)))), 104791#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1))) (or (<= N1 (+ 9 i1)) (<= (+ 22 i2) i1))), 104796#(and (or (<= N1 (+ 14 i1)) (<= (+ i2 17) i1)) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0))), 104784#(and (or (<= N1 (+ 2 i1)) (<= (+ 29 i2) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 104800#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= (+ i2 13) i1))), 104782#(and (or (<= (+ i2 31) i1) (<= N1 i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1))), 104806#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 7 i2) i1) (<= N1 (+ i1 24)))), 104814#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 31))) (or (<= N1 (+ i1 31)) (<= i2 i1))), 104812#(and (or (<= N1 (+ 30 i1)) (<= (+ i2 1) i1)) (or (<= N1 (+ 30 i1)) (= (+ N1 (* (- 1) N2)) 0))), 104803#(and (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 21 i1)) (<= (+ i2 10) i1))), 104805#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1))) (or (<= (+ i2 8) i1) (<= N1 (+ 23 i1)))), 104788#(and (or (<= (+ i2 25) i1) (<= N1 (+ 6 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 104787#(and (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 5 i1)) (<= (+ i2 26) i1))), 104783#(and (or (<= N1 (+ i1 1)) (<= (+ 30 i2) i1)) (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0))), 104797#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= (+ 16 i2) i1) (<= N1 (+ i1 15)))), 104807#(and (or (<= N1 (+ i1 25)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 25)) (<= (+ 6 i2) i1))), 104789#(and (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 7 i1)) (<= (+ i2 24) i1))), 104785#(and (or (<= (+ i2 28) i1) (<= N1 (+ 3 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 104790#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= N1 (+ i1 8)) (<= (+ 23 i2) i1))), 104808#(and (or (<= N1 (+ i1 26)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 26)) (<= (+ 5 i2) i1))), 104801#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ i2 12) i1))), 104799#(and (or (<= (+ 14 i2) i1) (<= N1 (+ i1 17))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 104804#(and (or (<= (+ 9 i2) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 104802#(and (or (<= N1 (+ i1 20)) (<= (+ i2 11) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20)))), 104809#(and (or (<= N1 (+ i1 27)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 4) i1) (<= N1 (+ i1 27)))), 104810#(and (or (<= N1 (+ i1 28)) (<= (+ 3 i2) i1)) (or (<= N1 (+ i1 28)) (= (+ N1 (* (- 1) N2)) 0))), 104811#(and (or (<= N1 (+ 29 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 29 i1)) (<= (+ 2 i2) i1))), 104792#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= (+ 21 i2) i1) (<= N1 (+ i1 10)))), 104794#(and (or (<= N1 (+ i1 12)) (<= (+ 19 i2) i1)) (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0))), 104813#(< i2 N2), 104786#(and (or (<= N1 (+ i1 4)) (<= (+ i2 27) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0)))] [2022-03-15 21:34:38,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-03-15 21:34:38,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:34:38,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-03-15 21:34:38,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8147, Invalid=31653, Unknown=0, NotChecked=0, Total=39800 [2022-03-15 21:34:38,841 INFO L87 Difference]: Start difference. First operand 243 states and 514 transitions. Second operand has 69 states, 69 states have (on average 2.0434782608695654) internal successors, (141), 68 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:34:41,569 INFO L93 Difference]: Finished difference Result 468 states and 926 transitions. [2022-03-15 21:34:41,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-03-15 21:34:41,570 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.0434782608695654) internal successors, (141), 68 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-03-15 21:34:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:34:41,570 INFO L225 Difference]: With dead ends: 468 [2022-03-15 21:34:41,571 INFO L226 Difference]: Without dead ends: 467 [2022-03-15 21:34:41,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30060 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=20576, Invalid=66744, Unknown=0, NotChecked=0, Total=87320 [2022-03-15 21:34:41,573 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 494 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:34:41,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 0 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:34:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-03-15 21:34:41,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 211. [2022-03-15 21:34:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 2.142857142857143) internal successors, (450), 210 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 450 transitions. [2022-03-15 21:34:41,576 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 450 transitions. Word has length 73 [2022-03-15 21:34:41,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:34:41,576 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 450 transitions. [2022-03-15 21:34:41,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.0434782608695654) internal successors, (141), 68 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:41,576 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 450 transitions. [2022-03-15 21:34:41,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-03-15 21:34:41,578 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:34:41,579 INFO L514 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:34:41,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2022-03-15 21:34:41,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:41,793 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:34:41,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:34:41,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1142599777, now seen corresponding path program 97 times [2022-03-15 21:34:41,794 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:34:41,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048515773] [2022-03-15 21:34:41,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:34:41,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:34:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:34:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:42,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:34:42,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048515773] [2022-03-15 21:34:42,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048515773] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:34:42,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185451034] [2022-03-15 21:34:42,254 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:34:42,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:42,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:34:42,255 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:34:42,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-03-15 21:34:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:34:42,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 135 conjunts are in the unsatisfiable core [2022-03-15 21:34:42,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:34:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:42,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:34:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:42,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185451034] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:34:42,585 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:34:42,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2022-03-15 21:34:42,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1528405101] [2022-03-15 21:34:42,586 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:34:42,594 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:34:42,673 INFO L252 McrAutomatonBuilder]: Finished intersection with 177 states and 278 transitions. [2022-03-15 21:34:42,673 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:34:43,702 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:34:43,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:34:43,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:34:43,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:34:43,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:34:43,703 INFO L87 Difference]: Start difference. First operand 211 states and 450 transitions. Second operand has 36 states, 35 states have (on average 4.942857142857143) internal successors, (173), 35 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:45,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:34:45,875 INFO L93 Difference]: Finished difference Result 681 states and 1321 transitions. [2022-03-15 21:34:45,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 21:34:45,875 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.942857142857143) internal successors, (173), 35 states have internal predecessors, (173), 0 states have call successors, (0), 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 74 [2022-03-15 21:34:45,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:34:45,876 INFO L225 Difference]: With dead ends: 681 [2022-03-15 21:34:45,876 INFO L226 Difference]: Without dead ends: 609 [2022-03-15 21:34:45,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 278 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:34:45,877 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 5647 mSDsCounter, 0 mSdLazyCounter, 9288 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:34:45,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 9289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9288 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 21:34:45,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2022-03-15 21:34:45,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 443. [2022-03-15 21:34:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 2.2895927601809953) internal successors, (1012), 442 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:45,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1012 transitions. [2022-03-15 21:34:45,884 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1012 transitions. Word has length 74 [2022-03-15 21:34:45,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:34:45,885 INFO L470 AbstractCegarLoop]: Abstraction has 443 states and 1012 transitions. [2022-03-15 21:34:45,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.942857142857143) internal successors, (173), 35 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:34:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1012 transitions. [2022-03-15 21:34:45,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-03-15 21:34:45,885 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:34:45,885 INFO L514 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:34:45,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Forceful destruction successful, exit code 0 [2022-03-15 21:34:46,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2022-03-15 21:34:46,097 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:34:46,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:34:46,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1018941920, now seen corresponding path program 98 times [2022-03-15 21:34:46,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:34:46,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560338961] [2022-03-15 21:34:46,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:34:46,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:34:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:34:47,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:47,136 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:34:47,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560338961] [2022-03-15 21:34:47,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560338961] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:34:47,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616770276] [2022-03-15 21:34:47,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:34:47,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:34:47,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:34:47,144 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:34:47,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-03-15 21:34:47,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:34:47,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:34:47,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 21:34:47,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:34:49,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:49,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:34:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:34:50,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616770276] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:34:50,477 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:34:50,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 69, 69] total 172 [2022-03-15 21:34:50,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1760073843] [2022-03-15 21:34:50,477 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:34:50,495 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:34:50,578 INFO L252 McrAutomatonBuilder]: Finished intersection with 179 states and 281 transitions. [2022-03-15 21:34:50,579 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:34:54,271 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 69 new interpolants: [108575#(or (<= (+ i2 20) N2) (< i1 N1)), 108588#(or (<= (+ i2 33) N2) (< i1 N1)), 108607#(or (< (+ i1 18) N1) (<= (+ i2 34) N2) (<= N1 (+ i1 17))), 108584#(or (<= (+ 29 i2) N2) (< i1 N1)), 108562#(or (<= (+ 7 i2) N2) (< i1 N1)), 108605#(or (< (+ 16 i1) N1) (<= (+ i2 34) N2) (<= N1 (+ i1 15))), 108617#(or (<= N1 (+ i1 27)) (<= (+ i2 34) N2) (< (+ i1 28) N1)), 108580#(or (<= (+ i2 25) N2) (< i1 N1)), 108600#(or (<= (+ i2 34) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 108598#(or (< (+ 9 i1) N1) (<= (+ i2 34) N2) (<= N1 (+ i1 8))), 108569#(or (<= (+ 14 i2) N2) (< i1 N1)), 108612#(or (< (+ 23 i1) N1) (<= (+ i2 34) N2) (<= N1 (+ 22 i1))), 108616#(or (<= (+ i2 34) N2) (<= N1 (+ i1 26)) (< (+ i1 27) N1)), 108621#(or (< (+ 32 i1) N1) (<= (+ i2 34) N2) (<= N1 (+ i1 31))), 108555#(< i1 N1), 108563#(or (< i1 N1) (<= (+ i2 8) N2)), 108606#(or (< (+ i1 17) N1) (<= (+ i2 34) N2) (<= N1 (+ 16 i1))), 108623#(or (<= (+ i2 34) N2) (<= N1 (+ i1 33)) (< (+ i1 34) N1)), 108595#(or (<= N1 (+ 5 i1)) (<= (+ i2 34) N2) (< (+ 6 i1) N1)), 108614#(or (<= (+ i2 34) N2) (<= N1 (+ i1 24)) (< (+ i1 25) N1)), 108583#(or (< i1 N1) (<= (+ i2 28) N2)), 108620#(or (<= N1 (+ 30 i1)) (<= (+ i2 34) N2) (< (+ i1 31) N1)), 108601#(or (<= (+ i2 34) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 108599#(or (<= (+ i2 34) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 108559#(or (<= (+ i2 4) N2) (< i1 N1)), 108567#(or (<= (+ i2 12) N2) (< i1 N1)), 108573#(or (< i1 N1) (<= (+ i2 18) N2)), 108594#(or (<= N1 (+ i1 4)) (<= (+ i2 34) N2) (< (+ 5 i1) N1)), 108565#(or (<= (+ i2 10) N2) (< i1 N1)), 108571#(or (<= (+ 16 i2) N2) (< i1 N1)), 108582#(or (<= (+ i2 27) N2) (< i1 N1)), 108610#(or (< (+ 21 i1) N1) (<= (+ i2 34) N2) (<= N1 (+ i1 20))), 108622#(or (<= N1 (+ 32 i1)) (<= (+ i2 34) N2) (< (+ i1 33) N1)), 108608#(or (<= (+ i2 34) N2) (<= N1 (+ i1 18)) (< (+ 19 i1) N1)), 108613#(or (<= (+ i2 34) N2) (< (+ i1 24) N1) (<= N1 (+ 23 i1))), 108609#(or (<= N1 (+ 19 i1)) (<= (+ i2 34) N2) (< (+ i1 20) N1)), 108579#(or (< i1 N1) (<= (+ i2 24) N2)), 108615#(or (< (+ i1 26) N1) (<= N1 (+ i1 25)) (<= (+ i2 34) N2)), 108587#(or (<= (+ 32 i2) N2) (< i1 N1)), 108602#(or (<= (+ i2 34) N2) (<= N1 (+ i1 12)) (< (+ i1 13) N1)), 108619#(or (<= N1 (+ 29 i1)) (<= (+ i2 34) N2) (< (+ 30 i1) N1)), 108576#(or (<= (+ 21 i2) N2) (< i1 N1)), 108593#(or (<= (+ i2 34) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 108596#(or (<= (+ i2 34) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 108568#(or (< i1 N1) (<= (+ i2 13) N2)), 108589#(or (<= (+ i2 34) N2) (< i1 N1)), 108558#(or (< i1 N1) (<= (+ 3 i2) N2)), 108604#(or (<= N1 (+ 14 i1)) (<= (+ i2 34) N2) (< (+ i1 15) N1)), 108603#(or (<= N1 (+ i1 13)) (<= (+ i2 34) N2) (< (+ 14 i1) N1)), 108566#(or (<= (+ i2 11) N2) (< i1 N1)), 108574#(or (<= (+ 19 i2) N2) (< i1 N1)), 108591#(or (<= N1 (+ i1 1)) (<= (+ i2 34) N2) (< (+ 2 i1) N1)), 108618#(or (<= N1 (+ i1 28)) (<= (+ i2 34) N2) (< (+ 29 i1) N1)), 108557#(or (< i1 N1) (<= (+ 2 i2) N2)), 108585#(or (<= (+ 30 i2) N2) (< i1 N1)), 108581#(or (<= (+ i2 26) N2) (< i1 N1)), 108586#(or (<= (+ i2 31) N2) (< i1 N1)), 108564#(or (<= (+ 9 i2) N2) (< i1 N1)), 108597#(or (<= N1 (+ 7 i1)) (<= (+ i2 34) N2) (< (+ i1 8) N1)), 108611#(or (<= N1 (+ 21 i1)) (<= (+ i2 34) N2) (< (+ 22 i1) N1)), 108577#(or (<= (+ 22 i2) N2) (< i1 N1)), 108590#(or (< (+ i1 1) N1) (<= (+ i2 34) N2) (<= N1 i1)), 108592#(or (<= (+ i2 34) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 108572#(or (< i1 N1) (<= (+ i2 17) N2)), 108570#(or (<= (+ i2 15) N2) (< i1 N1)), 108578#(or (<= (+ 23 i2) N2) (< i1 N1)), 108560#(or (< i1 N1) (<= (+ 5 i2) N2)), 108556#(or (< i2 N2) (< i1 N1)), 108561#(or (< i1 N1) (<= (+ 6 i2) N2))] [2022-03-15 21:34:54,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 140 states [2022-03-15 21:34:54,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:34:54,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2022-03-15 21:34:54,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8913, Invalid=49409, Unknown=0, NotChecked=0, Total=58322 [2022-03-15 21:34:54,274 INFO L87 Difference]: Start difference. First operand 443 states and 1012 transitions. Second operand has 140 states, 140 states have (on average 1.7642857142857142) internal successors, (247), 139 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:02,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:02,014 INFO L93 Difference]: Finished difference Result 1012 states and 1880 transitions. [2022-03-15 21:35:02,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2022-03-15 21:35:02,014 INFO L78 Accepts]: Start accepts. Automaton has has 140 states, 140 states have (on average 1.7642857142857142) internal successors, (247), 139 states have internal predecessors, (247), 0 states have call successors, (0), 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 75 [2022-03-15 21:35:02,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:02,015 INFO L225 Difference]: With dead ends: 1012 [2022-03-15 21:35:02,015 INFO L226 Difference]: Without dead ends: 756 [2022-03-15 21:35:02,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49524 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=30009, Invalid=110241, Unknown=0, NotChecked=0, Total=140250 [2022-03-15 21:35:02,022 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1373 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 3497 mSolverCounterSat, 761 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 761 IncrementalHoareTripleChecker+Valid, 3497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:02,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1373 Valid, 0 Invalid, 4258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [761 Valid, 3497 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 21:35:02,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-03-15 21:35:02,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 250. [2022-03-15 21:35:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 2.1244979919678717) internal successors, (529), 249 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 529 transitions. [2022-03-15 21:35:02,027 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 529 transitions. Word has length 75 [2022-03-15 21:35:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:02,028 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 529 transitions. [2022-03-15 21:35:02,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 140 states, 140 states have (on average 1.7642857142857142) internal successors, (247), 139 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:02,028 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 529 transitions. [2022-03-15 21:35:02,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-03-15 21:35:02,028 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:02,028 INFO L514 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:02,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0 [2022-03-15 21:35:02,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:02,237 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:35:02,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:02,237 INFO L85 PathProgramCache]: Analyzing trace with hash -746409866, now seen corresponding path program 99 times [2022-03-15 21:35:02,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:02,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113603504] [2022-03-15 21:35:02,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:02,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 562 proven. 594 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:02,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:02,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113603504] [2022-03-15 21:35:02,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113603504] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:02,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880121165] [2022-03-15 21:35:02,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:35:02,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:02,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:02,747 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:35:02,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-03-15 21:35:02,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2022-03-15 21:35:02,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:35:02,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 21:35:02,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 562 proven. 594 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:05,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:07,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880121165] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:07,510 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:07,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 69, 69] total 171 [2022-03-15 21:35:07,510 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1595681918] [2022-03-15 21:35:07,510 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:07,518 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:07,573 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 147 transitions. [2022-03-15 21:35:07,573 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:09,334 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [111032#(and (or (<= N1 (+ 14 i1)) (<= (+ i2 18) i1)) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0))), 111020#(and (or (<= N1 (+ 2 i1)) (<= (+ 30 i2) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 111040#(and (or (<= (+ i2 10) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 111026#(and (or (<= N1 (+ i1 8)) (<= (+ i2 24) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8)))), 111043#(and (or (<= N1 (+ i1 25)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 7 i2) i1) (<= N1 (+ i1 25)))), 111025#(and (or (<= N1 (+ 7 i1)) (<= (+ i2 25) i1)) (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0))), 111023#(and (or (<= N1 (+ 5 i1)) (<= (+ i2 27) i1)) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 111045#(and (or (<= N1 (+ i1 27)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 27)) (<= (+ 5 i2) i1))), 111030#(and (or (<= N1 (+ i1 12)) (<= (+ i2 20) i1)) (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0))), 111041#(and (or (<= (+ 9 i2) i1) (<= N1 (+ 23 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1)))), 111038#(and (or (<= N1 (+ i1 20)) (<= (+ i2 12) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20)))), 111050#(and (or (<= N1 (+ i1 31)) (<= (+ i2 1) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 31)))), 111031#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 13)) (<= (+ 19 i2) i1))), 111022#(and (or (<= (+ i2 28) i1) (<= N1 (+ i1 4))) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 111035#(and (or (<= (+ i2 15) i1) (<= N1 (+ i1 17))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 111039#(and (or (<= N1 (+ 21 i1)) (<= (+ i2 11) i1)) (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0))), 111042#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 8) i1) (<= N1 (+ i1 24)))), 111051#(and (or (<= N1 (+ 32 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 32 i1)) (<= i2 i1))), 111036#(and (or (<= N1 (+ i1 18)) (<= (+ 14 i2) i1)) (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0))), 111048#(and (or (<= N1 (+ 29 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 29 i1)) (<= (+ 3 i2) i1))), 111028#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= N1 (+ i1 10)) (<= (+ 22 i2) i1))), 111046#(< i2 N2), 111037#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ i2 13) i1))), 111034#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= (+ 16 i2) i1) (<= N1 (+ 16 i1)))), 111047#(and (or (<= (+ i2 4) i1) (<= N1 (+ i1 28))) (or (<= N1 (+ i1 28)) (= (+ N1 (* (- 1) N2)) 0))), 111049#(and (or (<= N1 (+ 30 i1)) (<= (+ 2 i2) i1)) (or (<= N1 (+ 30 i1)) (= (+ N1 (* (- 1) N2)) 0))), 111044#(and (or (<= N1 (+ i1 26)) (<= (+ 6 i2) i1)) (or (<= N1 (+ i1 26)) (= (+ N1 (* (- 1) N2)) 0))), 111019#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 31) i1) (<= N1 (+ i1 1)))), 111018#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ 32 i2) i1) (<= N1 i1))), 111024#(and (or (<= (+ i2 26) i1) (<= N1 (+ 6 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 111029#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ 21 i2) i1) (<= N1 (+ i1 11)))), 111021#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1))) (or (<= N1 (+ 3 i1)) (<= (+ 29 i2) i1))), 111027#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1))) (or (<= (+ 23 i2) i1) (<= N1 (+ 9 i1)))), 111033#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= N1 (+ i1 15)) (<= (+ i2 17) i1)))] [2022-03-15 21:35:09,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-03-15 21:35:09,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:09,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-03-15 21:35:09,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8632, Invalid=33598, Unknown=0, NotChecked=0, Total=42230 [2022-03-15 21:35:09,336 INFO L87 Difference]: Start difference. First operand 250 states and 529 transitions. Second operand has 71 states, 71 states have (on average 2.0422535211267605) internal successors, (145), 70 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:12,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:12,317 INFO L93 Difference]: Finished difference Result 482 states and 954 transitions. [2022-03-15 21:35:12,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2022-03-15 21:35:12,317 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.0422535211267605) internal successors, (145), 70 states have internal predecessors, (145), 0 states have call successors, (0), 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 75 [2022-03-15 21:35:12,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:12,318 INFO L225 Difference]: With dead ends: 482 [2022-03-15 21:35:12,318 INFO L226 Difference]: Without dead ends: 481 [2022-03-15 21:35:12,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31952 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=21829, Invalid=70891, Unknown=0, NotChecked=0, Total=92720 [2022-03-15 21:35:12,322 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 375 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:12,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 0 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:35:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-03-15 21:35:12,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 217. [2022-03-15 21:35:12,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 2.1435185185185186) internal successors, (463), 216 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:12,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 463 transitions. [2022-03-15 21:35:12,325 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 463 transitions. Word has length 75 [2022-03-15 21:35:12,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:12,325 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 463 transitions. [2022-03-15 21:35:12,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.0422535211267605) internal successors, (145), 70 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:12,326 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 463 transitions. [2022-03-15 21:35:12,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-15 21:35:12,326 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:12,326 INFO L514 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:12,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Forceful destruction successful, exit code 0 [2022-03-15 21:35:12,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:12,527 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:35:12,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:12,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1522343705, now seen corresponding path program 100 times [2022-03-15 21:35:12,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:12,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630652576] [2022-03-15 21:35:12,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:12,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:13,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:13,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630652576] [2022-03-15 21:35:13,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630652576] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:13,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442650523] [2022-03-15 21:35:13,135 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:35:13,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:13,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:13,137 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:35:13,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-03-15 21:35:13,221 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:35:13,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:35:13,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 139 conjunts are in the unsatisfiable core [2022-03-15 21:35:13,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:13,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:13,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442650523] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:13,812 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:13,812 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 35 [2022-03-15 21:35:13,812 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [734264291] [2022-03-15 21:35:13,812 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:13,820 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:13,907 INFO L252 McrAutomatonBuilder]: Finished intersection with 182 states and 286 transitions. [2022-03-15 21:35:13,907 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:15,129 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:35:15,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 21:35:15,129 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:15,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 21:35:15,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:35:15,130 INFO L87 Difference]: Start difference. First operand 217 states and 463 transitions. Second operand has 37 states, 36 states have (on average 4.944444444444445) internal successors, (178), 36 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:17,798 INFO L93 Difference]: Finished difference Result 701 states and 1360 transitions. [2022-03-15 21:35:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 21:35:17,799 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 4.944444444444445) internal successors, (178), 36 states have internal predecessors, (178), 0 states have call successors, (0), 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 76 [2022-03-15 21:35:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:17,800 INFO L225 Difference]: With dead ends: 701 [2022-03-15 21:35:17,800 INFO L226 Difference]: Without dead ends: 627 [2022-03-15 21:35:17,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 286 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 21:35:17,801 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 5988 mSDsCounter, 0 mSdLazyCounter, 9841 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:17,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 9842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9841 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 21:35:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2022-03-15 21:35:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 456. [2022-03-15 21:35:17,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 2.29010989010989) internal successors, (1042), 455 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1042 transitions. [2022-03-15 21:35:17,817 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1042 transitions. Word has length 76 [2022-03-15 21:35:17,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:17,817 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 1042 transitions. [2022-03-15 21:35:17,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 4.944444444444445) internal successors, (178), 36 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1042 transitions. [2022-03-15 21:35:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-03-15 21:35:17,817 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:17,817 INFO L514 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:17,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Ended with exit code 0 [2022-03-15 21:35:18,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-03-15 21:35:18,018 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:35:18,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:18,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1348739880, now seen corresponding path program 101 times [2022-03-15 21:35:18,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:18,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51374293] [2022-03-15 21:35:18,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:18,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 595 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:19,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:19,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51374293] [2022-03-15 21:35:19,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51374293] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:19,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683167004] [2022-03-15 21:35:19,209 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:35:19,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:19,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:19,210 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:35:19,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-03-15 21:35:19,277 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2022-03-15 21:35:19,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:35:19,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-15 21:35:19,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 595 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:22,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:24,142 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683167004] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:24,142 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:24,142 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 71, 71] total 177 [2022-03-15 21:35:24,142 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1768715926] [2022-03-15 21:35:24,142 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:24,151 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:24,243 INFO L252 McrAutomatonBuilder]: Finished intersection with 184 states and 289 transitions. [2022-03-15 21:35:24,243 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:29,422 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 71 new interpolants: [114904#(or (<= (+ i2 4) N2) (< i1 N1)), 114967#(or (<= (+ 35 i2) N2) (< (+ 32 i1) N1) (<= N1 (+ i1 31))), 114920#(or (<= (+ i2 20) N2) (< i1 N1)), 114969#(or (<= (+ 35 i2) N2) (<= N1 (+ i1 33)) (< (+ i1 34) N1)), 114902#(or (< i1 N1) (<= (+ 2 i2) N2)), 114916#(or (<= (+ 16 i2) N2) (< i1 N1)), 114948#(or (<= (+ 35 i2) N2) (<= N1 (+ i1 12)) (< (+ i1 13) N1)), 114950#(or (<= (+ 35 i2) N2) (<= N1 (+ 14 i1)) (< (+ i1 15) N1)), 114952#(or (<= (+ 35 i2) N2) (< (+ i1 17) N1) (<= N1 (+ 16 i1))), 114925#(or (<= (+ i2 25) N2) (< i1 N1)), 114937#(or (<= (+ 35 i2) N2) (<= N1 (+ i1 1)) (< (+ 2 i1) N1)), 114965#(or (<= (+ 35 i2) N2) (<= N1 (+ 29 i1)) (< (+ 30 i1) N1)), 114923#(or (<= (+ 23 i2) N2) (< i1 N1)), 114957#(or (<= (+ 35 i2) N2) (<= N1 (+ 21 i1)) (< (+ 22 i1) N1)), 114966#(or (<= (+ 35 i2) N2) (<= N1 (+ 30 i1)) (< (+ i1 31) N1)), 114908#(or (< i1 N1) (<= (+ i2 8) N2)), 114944#(or (<= (+ 35 i2) N2) (< (+ 9 i1) N1) (<= N1 (+ i1 8))), 114917#(or (< i1 N1) (<= (+ i2 17) N2)), 114903#(or (< i1 N1) (<= (+ 3 i2) N2)), 114930#(or (<= (+ 30 i2) N2) (< i1 N1)), 114943#(or (<= N1 (+ 7 i1)) (<= (+ 35 i2) N2) (< (+ i1 8) N1)), 114921#(or (<= (+ 21 i2) N2) (< i1 N1)), 114926#(or (<= (+ i2 26) N2) (< i1 N1)), 114963#(or (<= (+ 35 i2) N2) (<= N1 (+ i1 27)) (< (+ i1 28) N1)), 114962#(or (<= (+ 35 i2) N2) (<= N1 (+ i1 26)) (< (+ i1 27) N1)), 114914#(or (<= (+ 14 i2) N2) (< i1 N1)), 114946#(or (<= (+ 35 i2) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 114940#(or (<= (+ 35 i2) N2) (<= N1 (+ i1 4)) (< (+ 5 i1) N1)), 114939#(or (<= (+ 35 i2) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 114931#(or (<= (+ i2 31) N2) (< i1 N1)), 114968#(or (<= (+ 35 i2) N2) (<= N1 (+ 32 i1)) (< (+ i1 33) N1)), 114913#(or (< i1 N1) (<= (+ i2 13) N2)), 114949#(or (<= (+ 35 i2) N2) (<= N1 (+ i1 13)) (< (+ 14 i1) N1)), 114942#(or (<= (+ 35 i2) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 114960#(or (<= (+ 35 i2) N2) (<= N1 (+ i1 24)) (< (+ i1 25) N1)), 114900#(< i1 N1), 114945#(or (<= (+ 35 i2) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 114932#(or (<= (+ 32 i2) N2) (< i1 N1)), 114906#(or (< i1 N1) (<= (+ 6 i2) N2)), 114936#(or (<= (+ 35 i2) N2) (< (+ i1 1) N1) (<= N1 i1)), 114938#(or (<= (+ 35 i2) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 114941#(or (<= (+ 35 i2) N2) (<= N1 (+ 5 i1)) (< (+ 6 i1) N1)), 114956#(or (<= (+ 35 i2) N2) (< (+ 21 i1) N1) (<= N1 (+ i1 20))), 114933#(or (<= (+ i2 33) N2) (< i1 N1)), 114934#(or (<= (+ i2 34) N2) (< i1 N1)), 114928#(or (< i1 N1) (<= (+ i2 28) N2)), 114919#(or (<= (+ 19 i2) N2) (< i1 N1)), 114918#(or (< i1 N1) (<= (+ i2 18) N2)), 114953#(or (<= (+ 35 i2) N2) (< (+ i1 18) N1) (<= N1 (+ i1 17))), 114935#(or (<= (+ 35 i2) N2) (< i1 N1)), 114911#(or (<= (+ i2 11) N2) (< i1 N1)), 114964#(or (<= (+ 35 i2) N2) (<= N1 (+ i1 28)) (< (+ 29 i1) N1)), 114922#(or (<= (+ 22 i2) N2) (< i1 N1)), 114959#(or (<= (+ 35 i2) N2) (< (+ i1 24) N1) (<= N1 (+ 23 i1))), 114951#(or (<= (+ 35 i2) N2) (< (+ 16 i1) N1) (<= N1 (+ i1 15))), 114901#(or (< i2 N2) (< i1 N1)), 114970#(or (< (+ 35 i1) N1) (<= (+ 35 i2) N2) (<= N1 (+ i1 34))), 114955#(or (<= (+ 35 i2) N2) (<= N1 (+ 19 i1)) (< (+ i1 20) N1)), 114924#(or (< i1 N1) (<= (+ i2 24) N2)), 114907#(or (<= (+ 7 i2) N2) (< i1 N1)), 114912#(or (<= (+ i2 12) N2) (< i1 N1)), 114909#(or (<= (+ 9 i2) N2) (< i1 N1)), 114961#(or (<= (+ 35 i2) N2) (< (+ i1 26) N1) (<= N1 (+ i1 25))), 114927#(or (<= (+ i2 27) N2) (< i1 N1)), 114915#(or (<= (+ i2 15) N2) (< i1 N1)), 114958#(or (<= (+ 35 i2) N2) (< (+ 23 i1) N1) (<= N1 (+ 22 i1))), 114910#(or (<= (+ i2 10) N2) (< i1 N1)), 114905#(or (< i1 N1) (<= (+ 5 i2) N2)), 114947#(or (<= (+ 35 i2) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 114954#(or (<= (+ 35 i2) N2) (<= N1 (+ i1 18)) (< (+ 19 i1) N1)), 114929#(or (<= (+ 29 i2) N2) (< i1 N1))] [2022-03-15 21:35:29,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 144 states [2022-03-15 21:35:29,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:29,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2022-03-15 21:35:29,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9420, Invalid=52332, Unknown=0, NotChecked=0, Total=61752 [2022-03-15 21:35:29,427 INFO L87 Difference]: Start difference. First operand 456 states and 1042 transitions. Second operand has 144 states, 144 states have (on average 1.7638888888888888) internal successors, (254), 143 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:37,816 INFO L93 Difference]: Finished difference Result 1042 states and 1936 transitions. [2022-03-15 21:35:37,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-03-15 21:35:37,817 INFO L78 Accepts]: Start accepts. Automaton has has 144 states, 144 states have (on average 1.7638888888888888) internal successors, (254), 143 states have internal predecessors, (254), 0 states have call successors, (0), 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 77 [2022-03-15 21:35:37,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:37,818 INFO L225 Difference]: With dead ends: 1042 [2022-03-15 21:35:37,818 INFO L226 Difference]: Without dead ends: 778 [2022-03-15 21:35:37,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 384 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52520 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=31784, Invalid=116826, Unknown=0, NotChecked=0, Total=148610 [2022-03-15 21:35:37,825 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1534 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 3596 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 3596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:37,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1534 Valid, 0 Invalid, 4390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 3596 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 21:35:37,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-03-15 21:35:37,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 257. [2022-03-15 21:35:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 2.125) internal successors, (544), 256 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:37,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 544 transitions. [2022-03-15 21:35:37,829 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 544 transitions. Word has length 77 [2022-03-15 21:35:37,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:37,829 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 544 transitions. [2022-03-15 21:35:37,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 144 states, 144 states have (on average 1.7638888888888888) internal successors, (254), 143 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 544 transitions. [2022-03-15 21:35:37,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-03-15 21:35:37,832 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:37,832 INFO L514 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:37,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Forceful destruction successful, exit code 0 [2022-03-15 21:35:38,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-03-15 21:35:38,051 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:35:38,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:38,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1419460108, now seen corresponding path program 102 times [2022-03-15 21:35:38,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:38,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683899998] [2022-03-15 21:35:38,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:38,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 596 proven. 629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:38,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:38,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683899998] [2022-03-15 21:35:38,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683899998] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:38,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222866496] [2022-03-15 21:35:38,604 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:35:38,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:38,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:38,605 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:35:38,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-03-15 21:35:38,673 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2022-03-15 21:35:38,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:35:38,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-15 21:35:38,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 596 proven. 629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:41,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:44,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222866496] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:44,003 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:44,003 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 71, 71] total 176 [2022-03-15 21:35:44,003 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1455732841] [2022-03-15 21:35:44,003 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:44,012 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:44,072 INFO L252 McrAutomatonBuilder]: Finished intersection with 115 states and 151 transitions. [2022-03-15 21:35:44,072 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:46,583 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [117446#(and (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 12)) (<= (+ 21 i2) i1))), 117440#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1))) (or (<= (+ i2 27) i1) (<= N1 (+ 6 i1)))), 117444#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= (+ 23 i2) i1) (<= N1 (+ i1 10)))), 117450#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= N1 (+ 16 i1)) (<= (+ i2 17) i1))), 117452#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 15) i1) (<= N1 (+ i1 18)))), 117439#(and (or (<= (+ i2 28) i1) (<= N1 (+ 5 i1))) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 117438#(and (or (<= N1 (+ i1 4)) (<= (+ 29 i2) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 117457#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1))) (or (<= N1 (+ 23 i1)) (<= (+ i2 10) i1))), 117468#(and (or (<= N1 (+ i1 33)) (<= i2 i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 33)))), 117463#(and (or (<= N1 (+ 29 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 4) i1) (<= N1 (+ 29 i1)))), 117445#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= N1 (+ i1 11)) (<= (+ 22 i2) i1))), 117434#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ i2 33) i1) (<= N1 i1))), 117464#(and (or (<= N1 (+ 30 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 30 i1)) (<= (+ 3 i2) i1))), 117460#(and (or (<= (+ 7 i2) i1) (<= N1 (+ i1 26))) (or (<= N1 (+ i1 26)) (= (+ N1 (* (- 1) N2)) 0))), 117455#(and (or (<= N1 (+ 21 i1)) (<= (+ i2 12) i1)) (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0))), 117467#(and (or (<= N1 (+ 32 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 32 i1)) (<= (+ i2 1) i1))), 117466#(< i2 N2), 117448#(and (or (<= N1 (+ 14 i1)) (<= (+ 19 i2) i1)) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0))), 117437#(and (or (<= (+ 30 i2) i1) (<= N1 (+ 3 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 117456#(and (or (<= (+ i2 11) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 117459#(and (or (<= N1 (+ i1 25)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 25)) (<= (+ i2 8) i1))), 117454#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20))) (or (<= (+ i2 13) i1) (<= N1 (+ i1 20)))), 117462#(and (or (<= N1 (+ i1 28)) (<= (+ 5 i2) i1)) (or (<= N1 (+ i1 28)) (= (+ N1 (* (- 1) N2)) 0))), 117443#(and (or (<= (+ i2 24) i1) (<= N1 (+ 9 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 117458#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 9 i2) i1) (<= N1 (+ i1 24)))), 117461#(and (or (<= N1 (+ i1 27)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 27)) (<= (+ 6 i2) i1))), 117453#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ 14 i2) i1))), 117451#(and (or (<= N1 (+ i1 17)) (<= (+ 16 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 117465#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 31))) (or (<= N1 (+ i1 31)) (<= (+ 2 i2) i1))), 117447#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 13)) (<= (+ i2 20) i1))), 117442#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= (+ i2 25) i1) (<= N1 (+ i1 8)))), 117436#(and (or (<= (+ i2 31) i1) (<= N1 (+ 2 i1))) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 117449#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= N1 (+ i1 15)) (<= (+ i2 18) i1))), 117435#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 32 i2) i1) (<= N1 (+ i1 1)))), 117441#(and (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 7 i1)) (<= (+ i2 26) i1)))] [2022-03-15 21:35:46,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-03-15 21:35:46,583 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:46,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-03-15 21:35:46,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9131, Invalid=35601, Unknown=0, NotChecked=0, Total=44732 [2022-03-15 21:35:46,586 INFO L87 Difference]: Start difference. First operand 257 states and 544 transitions. Second operand has 73 states, 73 states have (on average 2.041095890410959) internal successors, (149), 72 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 21:35:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:50,140 INFO L93 Difference]: Finished difference Result 496 states and 982 transitions. [2022-03-15 21:35:50,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2022-03-15 21:35:50,141 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.041095890410959) internal successors, (149), 72 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) Word has length 77 [2022-03-15 21:35:50,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:50,141 INFO L225 Difference]: With dead ends: 496 [2022-03-15 21:35:50,141 INFO L226 Difference]: Without dead ends: 495 [2022-03-15 21:35:50,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33909 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=23119, Invalid=75163, Unknown=0, NotChecked=0, Total=98282 [2022-03-15 21:35:50,146 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 557 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:50,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [557 Valid, 0 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:35:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-03-15 21:35:50,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 223. [2022-03-15 21:35:50,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 2.144144144144144) internal successors, (476), 222 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 476 transitions. [2022-03-15 21:35:50,149 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 476 transitions. Word has length 77 [2022-03-15 21:35:50,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:50,149 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 476 transitions. [2022-03-15 21:35:50,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 2.041095890410959) internal successors, (149), 72 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 21:35:50,149 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 476 transitions. [2022-03-15 21:35:50,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-15 21:35:50,150 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:50,150 INFO L514 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:50,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2022-03-15 21:35:50,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:50,366 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:35:50,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:50,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1138651937, now seen corresponding path program 103 times [2022-03-15 21:35:50,367 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:50,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297559072] [2022-03-15 21:35:50,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:50,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:51,033 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:51,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297559072] [2022-03-15 21:35:51,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297559072] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:51,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12636805] [2022-03-15 21:35:51,033 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:35:51,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:51,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:51,035 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:35:51,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-03-15 21:35:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:51,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 143 conjunts are in the unsatisfiable core [2022-03-15 21:35:51,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:51,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:51,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:35:51,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:51,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12636805] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:35:51,570 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:35:51,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2022-03-15 21:35:51,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [632120837] [2022-03-15 21:35:51,570 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:35:51,603 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:35:51,692 INFO L252 McrAutomatonBuilder]: Finished intersection with 187 states and 294 transitions. [2022-03-15 21:35:51,692 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:35:53,139 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:35:53,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 21:35:53,139 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:35:53,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 21:35:53,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 21:35:53,140 INFO L87 Difference]: Start difference. First operand 223 states and 476 transitions. Second operand has 38 states, 37 states have (on average 4.945945945945946) internal successors, (183), 37 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 21:35:55,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:35:55,423 INFO L93 Difference]: Finished difference Result 721 states and 1399 transitions. [2022-03-15 21:35:55,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 21:35:55,423 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 4.945945945945946) internal successors, (183), 37 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-03-15 21:35:55,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:35:55,440 INFO L225 Difference]: With dead ends: 721 [2022-03-15 21:35:55,440 INFO L226 Difference]: Without dead ends: 645 [2022-03-15 21:35:55,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 294 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 21:35:55,441 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 105 mSDsluCounter, 6339 mSDsCounter, 0 mSdLazyCounter, 10410 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:35:55,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 0 Invalid, 10411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10410 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 21:35:55,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-03-15 21:35:55,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 469. [2022-03-15 21:35:55,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 2.2905982905982905) internal successors, (1072), 468 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:35:55,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1072 transitions. [2022-03-15 21:35:55,461 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1072 transitions. Word has length 78 [2022-03-15 21:35:55,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:35:55,461 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 1072 transitions. [2022-03-15 21:35:55,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.945945945945946) internal successors, (183), 37 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 21:35:55,461 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1072 transitions. [2022-03-15 21:35:55,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-03-15 21:35:55,462 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:35:55,462 INFO L514 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:35:55,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Forceful destruction successful, exit code 0 [2022-03-15 21:35:55,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:55,680 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:35:55,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:35:55,680 INFO L85 PathProgramCache]: Analyzing trace with hash -603669216, now seen corresponding path program 104 times [2022-03-15 21:35:55,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:35:55,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534137625] [2022-03-15 21:35:55,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:35:55,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:35:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:35:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:56,852 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:35:56,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534137625] [2022-03-15 21:35:56,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534137625] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:35:56,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267300535] [2022-03-15 21:35:56,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:35:56,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:35:56,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:35:56,853 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:35:56,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2022-03-15 21:35:56,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:35:56,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:35:56,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 75 conjunts are in the unsatisfiable core [2022-03-15 21:35:56,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:35:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:35:59,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:36:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:00,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267300535] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:36:00,775 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:36:00,775 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 73, 73] total 182 [2022-03-15 21:36:00,775 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [18322916] [2022-03-15 21:36:00,775 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:36:00,784 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:36:00,914 INFO L252 McrAutomatonBuilder]: Finished intersection with 189 states and 297 transitions. [2022-03-15 21:36:00,914 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:36:05,403 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 73 new interpolants: [121462#(or (< (+ i1 1) N1) (<= (+ i2 36) N2) (<= N1 i1)), 121487#(or (< (+ i1 26) N1) (<= N1 (+ i1 25)) (<= (+ i2 36) N2)), 121482#(or (< (+ 21 i1) N1) (<= N1 (+ i1 20)) (<= (+ i2 36) N2)), 121489#(or (<= N1 (+ i1 27)) (< (+ i1 28) N1) (<= (+ i2 36) N2)), 121444#(or (<= (+ 19 i2) N2) (< i1 N1)), 121431#(or (< i1 N1) (<= (+ 6 i2) N2)), 121493#(or (< (+ 32 i1) N1) (<= N1 (+ i1 31)) (<= (+ i2 36) N2)), 121495#(or (<= N1 (+ i1 33)) (< (+ i1 34) N1) (<= (+ i2 36) N2)), 121449#(or (< i1 N1) (<= (+ i2 24) N2)), 121440#(or (<= (+ i2 15) N2) (< i1 N1)), 121491#(or (<= N1 (+ 29 i1)) (< (+ 30 i1) N1) (<= (+ i2 36) N2)), 121426#(or (< i2 N2) (< i1 N1)), 121458#(or (<= (+ i2 33) N2) (< i1 N1)), 121476#(or (<= N1 (+ 14 i1)) (< (+ i1 15) N1) (<= (+ i2 36) N2)), 121455#(or (<= (+ 30 i2) N2) (< i1 N1)), 121447#(or (<= (+ 22 i2) N2) (< i1 N1)), 121456#(or (<= (+ i2 31) N2) (< i1 N1)), 121478#(or (< (+ i1 17) N1) (<= N1 (+ 16 i1)) (<= (+ i2 36) N2)), 121468#(or (< (+ 7 i1) N1) (<= N1 (+ 6 i1)) (<= (+ i2 36) N2)), 121481#(or (<= N1 (+ 19 i1)) (< (+ i1 20) N1) (<= (+ i2 36) N2)), 121451#(or (<= (+ i2 26) N2) (< i1 N1)), 121475#(or (<= N1 (+ i1 13)) (<= (+ i2 36) N2) (< (+ 14 i1) N1)), 121466#(or (<= N1 (+ i1 4)) (<= (+ i2 36) N2) (< (+ 5 i1) N1)), 121448#(or (<= (+ 23 i2) N2) (< i1 N1)), 121460#(or (<= (+ 35 i2) N2) (< i1 N1)), 121472#(or (< (+ i1 11) N1) (<= N1 (+ i1 10)) (<= (+ i2 36) N2)), 121443#(or (< i1 N1) (<= (+ i2 18) N2)), 121441#(or (<= (+ 16 i2) N2) (< i1 N1)), 121452#(or (<= (+ i2 27) N2) (< i1 N1)), 121429#(or (<= (+ i2 4) N2) (< i1 N1)), 121428#(or (< i1 N1) (<= (+ 3 i2) N2)), 121488#(or (<= N1 (+ i1 26)) (< (+ i1 27) N1) (<= (+ i2 36) N2)), 121490#(or (<= N1 (+ i1 28)) (< (+ 29 i1) N1) (<= (+ i2 36) N2)), 121469#(or (<= N1 (+ 7 i1)) (< (+ i1 8) N1) (<= (+ i2 36) N2)), 121425#(< i1 N1), 121454#(or (<= (+ 29 i2) N2) (< i1 N1)), 121497#(or (<= N1 (+ 35 i1)) (< (+ i1 36) N1) (<= (+ i2 36) N2)), 121496#(or (< (+ 35 i1) N1) (<= N1 (+ i1 34)) (<= (+ i2 36) N2)), 121435#(or (<= (+ i2 10) N2) (< i1 N1)), 121446#(or (<= (+ 21 i2) N2) (< i1 N1)), 121485#(or (< (+ i1 24) N1) (<= N1 (+ 23 i1)) (<= (+ i2 36) N2)), 121434#(or (<= (+ 9 i2) N2) (< i1 N1)), 121442#(or (< i1 N1) (<= (+ i2 17) N2)), 121457#(or (<= (+ 32 i2) N2) (< i1 N1)), 121477#(or (< (+ 16 i1) N1) (<= N1 (+ i1 15)) (<= (+ i2 36) N2)), 121436#(or (<= (+ i2 11) N2) (< i1 N1)), 121445#(or (<= (+ i2 20) N2) (< i1 N1)), 121467#(or (<= N1 (+ 5 i1)) (<= (+ i2 36) N2) (< (+ 6 i1) N1)), 121459#(or (<= (+ i2 34) N2) (< i1 N1)), 121464#(or (<= N1 (+ 2 i1)) (< (+ 3 i1) N1) (<= (+ i2 36) N2)), 121494#(or (<= N1 (+ 32 i1)) (<= (+ i2 36) N2) (< (+ i1 33) N1)), 121437#(or (<= (+ i2 12) N2) (< i1 N1)), 121439#(or (<= (+ 14 i2) N2) (< i1 N1)), 121427#(or (< i1 N1) (<= (+ 2 i2) N2)), 121432#(or (<= (+ 7 i2) N2) (< i1 N1)), 121483#(or (<= N1 (+ 21 i1)) (< (+ 22 i1) N1) (<= (+ i2 36) N2)), 121471#(or (<= N1 (+ 9 i1)) (< (+ i1 10) N1) (<= (+ i2 36) N2)), 121430#(or (< i1 N1) (<= (+ 5 i2) N2)), 121463#(or (<= N1 (+ i1 1)) (<= (+ i2 36) N2) (< (+ 2 i1) N1)), 121484#(or (< (+ 23 i1) N1) (<= (+ i2 36) N2) (<= N1 (+ 22 i1))), 121450#(or (<= (+ i2 25) N2) (< i1 N1)), 121479#(or (< (+ i1 18) N1) (<= N1 (+ i1 17)) (<= (+ i2 36) N2)), 121492#(or (<= N1 (+ 30 i1)) (<= (+ i2 36) N2) (< (+ i1 31) N1)), 121465#(or (<= N1 (+ 3 i1)) (< (+ i1 4) N1) (<= (+ i2 36) N2)), 121461#(or (< i1 N1) (<= (+ i2 36) N2)), 121433#(or (< i1 N1) (<= (+ i2 8) N2)), 121474#(or (<= N1 (+ i1 12)) (< (+ i1 13) N1) (<= (+ i2 36) N2)), 121480#(or (<= N1 (+ i1 18)) (< (+ 19 i1) N1) (<= (+ i2 36) N2)), 121473#(or (< (+ i1 12) N1) (<= N1 (+ i1 11)) (<= (+ i2 36) N2)), 121438#(or (< i1 N1) (<= (+ i2 13) N2)), 121453#(or (< i1 N1) (<= (+ i2 28) N2)), 121486#(or (<= N1 (+ i1 24)) (< (+ i1 25) N1) (<= (+ i2 36) N2)), 121470#(or (< (+ 9 i1) N1) (<= N1 (+ i1 8)) (<= (+ i2 36) N2))] [2022-03-15 21:36:05,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 148 states [2022-03-15 21:36:05,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:36:05,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2022-03-15 21:36:05,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9941, Invalid=55339, Unknown=0, NotChecked=0, Total=65280 [2022-03-15 21:36:05,407 INFO L87 Difference]: Start difference. First operand 469 states and 1072 transitions. Second operand has 148 states, 148 states have (on average 1.7635135135135136) internal successors, (261), 147 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:36:14,771 INFO L93 Difference]: Finished difference Result 1072 states and 1992 transitions. [2022-03-15 21:36:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-03-15 21:36:14,771 INFO L78 Accepts]: Start accepts. Automaton has has 148 states, 148 states have (on average 1.7635135135135136) internal successors, (261), 147 states have internal predecessors, (261), 0 states have call successors, (0), 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 79 [2022-03-15 21:36:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:36:14,773 INFO L225 Difference]: With dead ends: 1072 [2022-03-15 21:36:14,773 INFO L226 Difference]: Without dead ends: 800 [2022-03-15 21:36:14,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 395 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55604 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=33610, Invalid=123602, Unknown=0, NotChecked=0, Total=157212 [2022-03-15 21:36:14,779 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1489 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 3651 mSolverCounterSat, 840 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 840 IncrementalHoareTripleChecker+Valid, 3651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:36:14,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1489 Valid, 0 Invalid, 4491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [840 Valid, 3651 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 21:36:14,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-03-15 21:36:14,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 264. [2022-03-15 21:36:14,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 2.1254752851711025) internal successors, (559), 263 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 559 transitions. [2022-03-15 21:36:14,783 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 559 transitions. Word has length 79 [2022-03-15 21:36:14,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:36:14,783 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 559 transitions. [2022-03-15 21:36:14,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 148 states, 148 states have (on average 1.7635135135135136) internal successors, (261), 147 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:14,784 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 559 transitions. [2022-03-15 21:36:14,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-03-15 21:36:14,784 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:36:14,784 INFO L514 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:36:14,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Ended with exit code 0 [2022-03-15 21:36:15,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106 [2022-03-15 21:36:15,000 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:36:15,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:36:15,000 INFO L85 PathProgramCache]: Analyzing trace with hash 970714998, now seen corresponding path program 105 times [2022-03-15 21:36:15,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:36:15,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945729039] [2022-03-15 21:36:15,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:36:15,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:36:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:36:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 631 proven. 665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:15,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:36:15,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945729039] [2022-03-15 21:36:15,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945729039] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:36:15,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103829342] [2022-03-15 21:36:15,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:36:15,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:15,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:36:15,691 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:36:15,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2022-03-15 21:36:15,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2022-03-15 21:36:15,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:36:15,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 75 conjunts are in the unsatisfiable core [2022-03-15 21:36:15,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:36:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 631 proven. 665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:18,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:36:20,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:20,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103829342] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:36:20,710 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:36:20,710 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 73, 73] total 181 [2022-03-15 21:36:20,710 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1215730735] [2022-03-15 21:36:20,711 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:36:20,719 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:36:20,791 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 155 transitions. [2022-03-15 21:36:20,791 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:36:22,895 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [124048#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= (+ 16 i2) i1))), 124054#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 24)) (<= (+ i2 10) i1))), 124044#(and (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 14 i1)) (<= (+ i2 20) i1))), 124047#(and (or (<= N1 (+ i1 17)) (<= (+ i2 17) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 124064#(and (or (<= N1 (+ i1 34)) (<= i2 i1)) (or (<= N1 (+ i1 34)) (= (+ N1 (* (- 1) N2)) 0))), 124038#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= (+ i2 26) i1) (<= N1 (+ i1 8)))), 124040#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= (+ i2 24) i1) (<= N1 (+ i1 10)))), 124052#(and (or (<= (+ i2 12) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 124056#(and (or (<= (+ i2 8) i1) (<= N1 (+ i1 26))) (or (<= N1 (+ i1 26)) (= (+ N1 (* (- 1) N2)) 0))), 124042#(and (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 12)) (<= (+ 22 i2) i1))), 124036#(and (or (<= (+ i2 28) i1) (<= N1 (+ 6 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 124033#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1))) (or (<= (+ i2 31) i1) (<= N1 (+ 3 i1)))), 124058#(and (or (<= N1 (+ i1 28)) (<= (+ 6 i2) i1)) (or (<= N1 (+ i1 28)) (= (+ N1 (* (- 1) N2)) 0))), 124059#(and (or (<= N1 (+ 29 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 29 i1)) (<= (+ 5 i2) i1))), 124060#(and (or (<= N1 (+ 30 i1)) (<= (+ i2 4) i1)) (or (<= N1 (+ 30 i1)) (= (+ N1 (* (- 1) N2)) 0))), 124032#(and (or (<= (+ 32 i2) i1) (<= N1 (+ 2 i1))) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 124062#(and (or (<= N1 (+ 32 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 32 i1)) (<= (+ 2 i2) i1))), 124039#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1))) (or (<= (+ i2 25) i1) (<= N1 (+ 9 i1)))), 124055#(and (or (<= N1 (+ i1 25)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 9 i2) i1) (<= N1 (+ i1 25)))), 124030#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ i2 34) i1) (<= N1 i1))), 124065#(< i2 N2), 124061#(and (or (<= N1 (+ i1 31)) (<= (+ 3 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 31)))), 124051#(and (or (<= N1 (+ 21 i1)) (<= (+ i2 13) i1)) (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0))), 124063#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 33))) (or (<= N1 (+ i1 33)) (<= (+ i2 1) i1))), 124050#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20))) (or (<= (+ 14 i2) i1) (<= N1 (+ i1 20)))), 124043#(and (or (<= N1 (+ i1 13)) (<= (+ 21 i2) i1)) (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0))), 124057#(and (or (<= N1 (+ i1 27)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 7 i2) i1) (<= N1 (+ i1 27)))), 124037#(and (or (<= N1 (+ 7 i1)) (<= (+ i2 27) i1)) (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0))), 124034#(and (or (<= N1 (+ i1 4)) (<= (+ 30 i2) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 124046#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= N1 (+ 16 i1)) (<= (+ i2 18) i1))), 124049#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 15) i1) (<= N1 (+ 19 i1)))), 124053#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1))) (or (<= N1 (+ 23 i1)) (<= (+ i2 11) i1))), 124041#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ 23 i2) i1) (<= N1 (+ i1 11)))), 124045#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= (+ 19 i2) i1) (<= N1 (+ i1 15)))), 124031#(and (or (<= N1 (+ i1 1)) (<= (+ i2 33) i1)) (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0))), 124035#(and (or (<= N1 (+ 5 i1)) (<= (+ 29 i2) i1)) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)))] [2022-03-15 21:36:22,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-03-15 21:36:22,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:36:22,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-03-15 21:36:22,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9644, Invalid=37662, Unknown=0, NotChecked=0, Total=47306 [2022-03-15 21:36:22,897 INFO L87 Difference]: Start difference. First operand 264 states and 559 transitions. Second operand has 75 states, 75 states have (on average 2.04) internal successors, (153), 74 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 21:36:26,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:36:26,884 INFO L93 Difference]: Finished difference Result 510 states and 1010 transitions. [2022-03-15 21:36:26,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-03-15 21:36:26,884 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 2.04) internal successors, (153), 74 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) Word has length 79 [2022-03-15 21:36:26,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:36:26,885 INFO L225 Difference]: With dead ends: 510 [2022-03-15 21:36:26,885 INFO L226 Difference]: Without dead ends: 509 [2022-03-15 21:36:26,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35923 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=24446, Invalid=79560, Unknown=0, NotChecked=0, Total=104006 [2022-03-15 21:36:26,890 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 597 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:36:26,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [597 Valid, 0 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:36:26,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-03-15 21:36:26,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 229. [2022-03-15 21:36:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 2.1447368421052633) internal successors, (489), 228 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 489 transitions. [2022-03-15 21:36:26,906 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 489 transitions. Word has length 79 [2022-03-15 21:36:26,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:36:26,906 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 489 transitions. [2022-03-15 21:36:26,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 2.04) internal successors, (153), 74 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 21:36:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 489 transitions. [2022-03-15 21:36:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-03-15 21:36:26,907 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:36:26,907 INFO L514 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:36:26,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Forceful destruction successful, exit code 0 [2022-03-15 21:36:27,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2022-03-15 21:36:27,123 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:36:27,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:36:27,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1533961255, now seen corresponding path program 106 times [2022-03-15 21:36:27,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:36:27,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040735811] [2022-03-15 21:36:27,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:36:27,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:36:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:36:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:27,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:36:27,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040735811] [2022-03-15 21:36:27,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040735811] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:36:27,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715277410] [2022-03-15 21:36:27,741 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:36:27,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:27,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:36:27,742 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:36:27,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2022-03-15 21:36:27,811 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:36:27,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:36:27,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 147 conjunts are in the unsatisfiable core [2022-03-15 21:36:27,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:36:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:28,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:36:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:28,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715277410] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:36:28,212 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:36:28,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 37 [2022-03-15 21:36:28,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [951416922] [2022-03-15 21:36:28,212 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:36:28,221 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:36:28,391 INFO L252 McrAutomatonBuilder]: Finished intersection with 192 states and 302 transitions. [2022-03-15 21:36:28,391 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:36:29,489 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:36:29,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 21:36:29,490 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:36:29,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 21:36:29,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 21:36:29,490 INFO L87 Difference]: Start difference. First operand 229 states and 489 transitions. Second operand has 39 states, 38 states have (on average 4.947368421052632) internal successors, (188), 38 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:31,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:36:31,577 INFO L93 Difference]: Finished difference Result 741 states and 1438 transitions. [2022-03-15 21:36:31,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 21:36:31,577 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 4.947368421052632) internal successors, (188), 38 states have internal predecessors, (188), 0 states have call successors, (0), 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 80 [2022-03-15 21:36:31,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:36:31,578 INFO L225 Difference]: With dead ends: 741 [2022-03-15 21:36:31,578 INFO L226 Difference]: Without dead ends: 663 [2022-03-15 21:36:31,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 302 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 21:36:31,579 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 6700 mSDsCounter, 0 mSdLazyCounter, 10995 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:36:31,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 10996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10995 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 21:36:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-03-15 21:36:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 482. [2022-03-15 21:36:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 2.291060291060291) internal successors, (1102), 481 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1102 transitions. [2022-03-15 21:36:31,583 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1102 transitions. Word has length 80 [2022-03-15 21:36:31,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:36:31,584 INFO L470 AbstractCegarLoop]: Abstraction has 482 states and 1102 transitions. [2022-03-15 21:36:31,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.947368421052632) internal successors, (188), 38 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1102 transitions. [2022-03-15 21:36:31,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-03-15 21:36:31,584 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:36:31,584 INFO L514 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:36:31,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Forceful destruction successful, exit code 0 [2022-03-15 21:36:31,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:31,798 INFO L402 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:36:31,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:36:31,798 INFO L85 PathProgramCache]: Analyzing trace with hash -867343848, now seen corresponding path program 107 times [2022-03-15 21:36:31,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:36:31,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078815579] [2022-03-15 21:36:31,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:36:31,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:36:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:36:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 666 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:33,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:36:33,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078815579] [2022-03-15 21:36:33,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078815579] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:36:33,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731668252] [2022-03-15 21:36:33,150 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:36:33,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:33,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:36:33,151 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:36:33,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2022-03-15 21:36:33,213 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2022-03-15 21:36:33,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:36:33,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-15 21:36:33,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:36:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 666 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:35,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:36:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:37,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731668252] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:36:37,273 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:36:37,273 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 75, 75] total 187 [2022-03-15 21:36:37,273 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1780457906] [2022-03-15 21:36:37,273 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:36:37,282 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:36:37,388 INFO L252 McrAutomatonBuilder]: Finished intersection with 194 states and 305 transitions. [2022-03-15 21:36:37,389 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:36:41,832 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 75 new interpolants: [128132#(or (< i1 N1) (<= (+ 2 i2) N2)), 128170#(or (<= N1 (+ 2 i1)) (<= (+ i2 37) N2) (< (+ 3 i1) N1)), 128150#(or (<= (+ i2 20) N2) (< i1 N1)), 128159#(or (<= (+ 29 i2) N2) (< i1 N1)), 128153#(or (<= (+ 23 i2) N2) (< i1 N1)), 128141#(or (<= (+ i2 11) N2) (< i1 N1)), 128139#(or (<= (+ 9 i2) N2) (< i1 N1)), 128151#(or (<= (+ 21 i2) N2) (< i1 N1)), 128164#(or (<= (+ i2 34) N2) (< i1 N1)), 128200#(or (<= N1 (+ 32 i1)) (<= (+ i2 37) N2) (< (+ i1 33) N1)), 128175#(or (<= N1 (+ 7 i1)) (< (+ i1 8) N1) (<= (+ i2 37) N2)), 128138#(or (< i1 N1) (<= (+ i2 8) N2)), 128187#(or (<= N1 (+ 19 i1)) (< (+ i1 20) N1) (<= (+ i2 37) N2)), 128147#(or (< i1 N1) (<= (+ i2 17) N2)), 128198#(or (<= N1 (+ 30 i1)) (<= (+ i2 37) N2) (< (+ i1 31) N1)), 128191#(or (< (+ i1 24) N1) (<= (+ i2 37) N2) (<= N1 (+ 23 i1))), 128178#(or (< (+ i1 11) N1) (<= (+ i2 37) N2) (<= N1 (+ i1 10))), 128179#(or (<= (+ i2 37) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 128180#(or (<= N1 (+ i1 12)) (< (+ i1 13) N1) (<= (+ i2 37) N2)), 128142#(or (<= (+ i2 12) N2) (< i1 N1)), 128202#(or (< (+ 35 i1) N1) (<= N1 (+ i1 34)) (<= (+ i2 37) N2)), 128197#(or (<= N1 (+ 29 i1)) (< (+ 30 i1) N1) (<= (+ i2 37) N2)), 128135#(or (< i1 N1) (<= (+ 5 i2) N2)), 128136#(or (< i1 N1) (<= (+ 6 i2) N2)), 128203#(or (<= N1 (+ 35 i1)) (< (+ i1 36) N1) (<= (+ i2 37) N2)), 128143#(or (< i1 N1) (<= (+ i2 13) N2)), 128134#(or (<= (+ i2 4) N2) (< i1 N1)), 128196#(or (<= N1 (+ i1 28)) (< (+ 29 i1) N1) (<= (+ i2 37) N2)), 128162#(or (<= (+ 32 i2) N2) (< i1 N1)), 128165#(or (<= (+ 35 i2) N2) (< i1 N1)), 128158#(or (< i1 N1) (<= (+ i2 28) N2)), 128171#(or (<= N1 (+ 3 i1)) (<= (+ i2 37) N2) (< (+ i1 4) N1)), 128193#(or (< (+ i1 26) N1) (<= N1 (+ i1 25)) (<= (+ i2 37) N2)), 128154#(or (< i1 N1) (<= (+ i2 24) N2)), 128176#(or (< (+ 9 i1) N1) (<= N1 (+ i1 8)) (<= (+ i2 37) N2)), 128172#(or (<= N1 (+ i1 4)) (<= (+ i2 37) N2) (< (+ 5 i1) N1)), 128160#(or (<= (+ 30 i2) N2) (< i1 N1)), 128145#(or (<= (+ i2 15) N2) (< i1 N1)), 128188#(or (< (+ 21 i1) N1) (<= (+ i2 37) N2) (<= N1 (+ i1 20))), 128181#(or (<= N1 (+ i1 13)) (<= (+ i2 37) N2) (< (+ 14 i1) N1)), 128144#(or (<= (+ 14 i2) N2) (< i1 N1)), 128201#(or (<= (+ i2 37) N2) (<= N1 (+ i1 33)) (< (+ i1 34) N1)), 128137#(or (<= (+ 7 i2) N2) (< i1 N1)), 128174#(or (< (+ 7 i1) N1) (<= N1 (+ 6 i1)) (<= (+ i2 37) N2)), 128167#(or (<= (+ i2 37) N2) (< i1 N1)), 128131#(or (< i2 N2) (< i1 N1)), 128152#(or (<= (+ 22 i2) N2) (< i1 N1)), 128161#(or (<= (+ i2 31) N2) (< i1 N1)), 128189#(or (<= N1 (+ 21 i1)) (<= (+ i2 37) N2) (< (+ 22 i1) N1)), 128163#(or (<= (+ i2 33) N2) (< i1 N1)), 128146#(or (<= (+ 16 i2) N2) (< i1 N1)), 128140#(or (<= (+ i2 10) N2) (< i1 N1)), 128183#(or (< (+ 16 i1) N1) (<= (+ i2 37) N2) (<= N1 (+ i1 15))), 128173#(or (<= N1 (+ 5 i1)) (<= (+ i2 37) N2) (< (+ 6 i1) N1)), 128177#(or (<= (+ i2 37) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 128168#(or (< (+ i1 1) N1) (<= (+ i2 37) N2) (<= N1 i1)), 128186#(or (<= N1 (+ i1 18)) (<= (+ i2 37) N2) (< (+ 19 i1) N1)), 128182#(or (<= N1 (+ 14 i1)) (< (+ i1 15) N1) (<= (+ i2 37) N2)), 128199#(or (< (+ 32 i1) N1) (<= (+ i2 37) N2) (<= N1 (+ i1 31))), 128184#(or (< (+ i1 17) N1) (<= (+ i2 37) N2) (<= N1 (+ 16 i1))), 128155#(or (<= (+ i2 25) N2) (< i1 N1)), 128194#(or (<= N1 (+ i1 26)) (<= (+ i2 37) N2) (< (+ i1 27) N1)), 128204#(or (< (+ i1 37) N1) (<= (+ i2 37) N2) (<= N1 (+ i1 36))), 128133#(or (< i1 N1) (<= (+ 3 i2) N2)), 128192#(or (<= N1 (+ i1 24)) (<= (+ i2 37) N2) (< (+ i1 25) N1)), 128156#(or (<= (+ i2 26) N2) (< i1 N1)), 128148#(or (< i1 N1) (<= (+ i2 18) N2)), 128157#(or (<= (+ i2 27) N2) (< i1 N1)), 128149#(or (<= (+ 19 i2) N2) (< i1 N1)), 128185#(or (< (+ i1 18) N1) (<= N1 (+ i1 17)) (<= (+ i2 37) N2)), 128166#(or (< i1 N1) (<= (+ i2 36) N2)), 128169#(or (<= N1 (+ i1 1)) (<= (+ i2 37) N2) (< (+ 2 i1) N1)), 128130#(< i1 N1), 128195#(or (<= N1 (+ i1 27)) (< (+ i1 28) N1) (<= (+ i2 37) N2)), 128190#(or (< (+ 23 i1) N1) (<= (+ i2 37) N2) (<= N1 (+ 22 i1)))] [2022-03-15 21:36:41,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 152 states [2022-03-15 21:36:41,833 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:36:41,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2022-03-15 21:36:41,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10476, Invalid=58430, Unknown=0, NotChecked=0, Total=68906 [2022-03-15 21:36:41,837 INFO L87 Difference]: Start difference. First operand 482 states and 1102 transitions. Second operand has 152 states, 152 states have (on average 1.763157894736842) internal successors, (268), 151 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:51,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:36:51,089 INFO L93 Difference]: Finished difference Result 1102 states and 2048 transitions. [2022-03-15 21:36:51,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2022-03-15 21:36:51,089 INFO L78 Accepts]: Start accepts. Automaton has has 152 states, 152 states have (on average 1.763157894736842) internal successors, (268), 151 states have internal predecessors, (268), 0 states have call successors, (0), 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 81 [2022-03-15 21:36:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:36:51,091 INFO L225 Difference]: With dead ends: 1102 [2022-03-15 21:36:51,091 INFO L226 Difference]: Without dead ends: 822 [2022-03-15 21:36:51,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 406 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58776 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=35487, Invalid=130569, Unknown=0, NotChecked=0, Total=166056 [2022-03-15 21:36:51,098 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1567 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 3902 mSolverCounterSat, 880 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 880 IncrementalHoareTripleChecker+Valid, 3902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:36:51,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1567 Valid, 0 Invalid, 4782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [880 Valid, 3902 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 21:36:51,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-03-15 21:36:51,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 271. [2022-03-15 21:36:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 2.1259259259259258) internal successors, (574), 270 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 574 transitions. [2022-03-15 21:36:51,102 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 574 transitions. Word has length 81 [2022-03-15 21:36:51,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:36:51,102 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 574 transitions. [2022-03-15 21:36:51,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 152 states, 152 states have (on average 1.763157894736842) internal successors, (268), 151 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:36:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 574 transitions. [2022-03-15 21:36:51,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-03-15 21:36:51,102 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:36:51,103 INFO L514 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:36:51,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Forceful destruction successful, exit code 0 [2022-03-15 21:36:51,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:51,319 INFO L402 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:36:51,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:36:51,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1941510260, now seen corresponding path program 108 times [2022-03-15 21:36:51,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:36:51,321 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610694762] [2022-03-15 21:36:51,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:36:51,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:36:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:36:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 667 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:52,182 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:36:52,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610694762] [2022-03-15 21:36:52,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610694762] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:36:52,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141576707] [2022-03-15 21:36:52,183 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:36:52,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:36:52,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:36:52,184 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:36:52,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2022-03-15 21:36:52,262 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2022-03-15 21:36:52,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:36:52,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-15 21:36:52,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:36:54,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 667 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:54,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:36:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:36:58,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141576707] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:36:58,045 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:36:58,045 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 75, 75] total 186 [2022-03-15 21:36:58,045 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2122192935] [2022-03-15 21:36:58,045 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:36:58,055 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:36:58,148 INFO L252 McrAutomatonBuilder]: Finished intersection with 121 states and 159 transitions. [2022-03-15 21:36:58,148 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:37:00,267 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [130816#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= (+ i2 25) i1) (<= N1 (+ i1 10)))), 130839#(and (or (<= N1 (+ 32 i1)) (<= (+ 3 i2) i1)) (or (<= N1 (+ 32 i1)) (= (+ N1 (* (- 1) N2)) 0))), 130830#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 24)) (<= (+ i2 11) i1))), 130824#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= (+ i2 17) i1))), 130815#(and (or (<= (+ i2 26) i1) (<= N1 (+ 9 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 130817#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ i2 24) i1) (<= N1 (+ i1 11)))), 130840#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 33))) (or (<= N1 (+ i1 33)) (<= (+ 2 i2) i1))), 130821#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= N1 (+ i1 15)) (<= (+ i2 20) i1))), 130831#(and (or (<= N1 (+ i1 25)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 25)) (<= (+ i2 10) i1))), 130833#(and (or (<= N1 (+ i1 27)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 27)) (<= (+ i2 8) i1))), 130832#(and (or (<= N1 (+ i1 26)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 9 i2) i1) (<= N1 (+ i1 26)))), 130820#(and (or (<= N1 (+ 14 i1)) (<= (+ 21 i2) i1)) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0))), 130836#(and (or (<= N1 (+ 29 i1)) (<= (+ 6 i2) i1)) (or (<= N1 (+ 29 i1)) (= (+ N1 (* (- 1) N2)) 0))), 130809#(and (or (<= (+ 32 i2) i1) (<= N1 (+ 3 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 130810#(and (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 4)) (<= (+ i2 31) i1))), 130819#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 13)) (<= (+ 22 i2) i1))), 130825#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ 16 i2) i1))), 130818#(and (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 12)) (<= (+ 23 i2) i1))), 130807#(and (or (<= (+ i2 34) i1) (<= N1 (+ i1 1))) (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0))), 130838#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 31))) (or (<= (+ i2 4) i1) (<= N1 (+ i1 31)))), 130811#(and (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 5 i1)) (<= (+ 30 i2) i1))), 130827#(and (or (<= N1 (+ 21 i1)) (<= (+ 14 i2) i1)) (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0))), 130806#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ 35 i2) i1) (<= N1 i1))), 130835#(and (or (<= (+ 7 i2) i1) (<= N1 (+ i1 28))) (or (<= N1 (+ i1 28)) (= (+ N1 (* (- 1) N2)) 0))), 130842#(and (or (<= N1 (+ 35 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 35 i1)) (<= i2 i1))), 130826#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20))) (or (<= (+ i2 15) i1) (<= N1 (+ i1 20)))), 130841#(and (or (<= N1 (+ i1 34)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 34)) (<= (+ i2 1) i1))), 130808#(and (or (<= N1 (+ 2 i1)) (<= (+ i2 33) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 130814#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= (+ i2 27) i1) (<= N1 (+ i1 8)))), 130823#(and (or (<= N1 (+ i1 17)) (<= (+ i2 18) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 130828#(and (or (<= (+ i2 13) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 130813#(and (or (<= (+ i2 28) i1) (<= N1 (+ 7 i1))) (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0))), 130822#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= (+ 19 i2) i1) (<= N1 (+ 16 i1)))), 130829#(and (or (<= N1 (+ 23 i1)) (<= (+ i2 12) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1)))), 130812#(and (or (<= N1 (+ 6 i1)) (<= (+ 29 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 130834#(< i2 N2), 130837#(and (or (<= N1 (+ 30 i1)) (<= (+ 5 i2) i1)) (or (<= N1 (+ 30 i1)) (= (+ N1 (* (- 1) N2)) 0)))] [2022-03-15 21:37:00,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-03-15 21:37:00,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:37:00,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-03-15 21:37:00,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10171, Invalid=39781, Unknown=0, NotChecked=0, Total=49952 [2022-03-15 21:37:00,269 INFO L87 Difference]: Start difference. First operand 271 states and 574 transitions. Second operand has 77 states, 77 states have (on average 2.038961038961039) internal successors, (157), 76 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 21:37:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:37:04,021 INFO L93 Difference]: Finished difference Result 524 states and 1038 transitions. [2022-03-15 21:37:04,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2022-03-15 21:37:04,021 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 2.038961038961039) internal successors, (157), 76 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) Word has length 81 [2022-03-15 21:37:04,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:37:04,022 INFO L225 Difference]: With dead ends: 524 [2022-03-15 21:37:04,022 INFO L226 Difference]: Without dead ends: 523 [2022-03-15 21:37:04,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37985 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=25810, Invalid=84082, Unknown=0, NotChecked=0, Total=109892 [2022-03-15 21:37:04,027 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 446 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:37:04,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 0 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:37:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-03-15 21:37:04,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 235. [2022-03-15 21:37:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 2.1452991452991452) internal successors, (502), 234 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 502 transitions. [2022-03-15 21:37:04,030 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 502 transitions. Word has length 81 [2022-03-15 21:37:04,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:37:04,030 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 502 transitions. [2022-03-15 21:37:04,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 2.038961038961039) internal successors, (157), 76 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 21:37:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 502 transitions. [2022-03-15 21:37:04,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-03-15 21:37:04,030 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:37:04,030 INFO L514 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:37:04,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Forceful destruction successful, exit code 0 [2022-03-15 21:37:04,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable110 [2022-03-15 21:37:04,246 INFO L402 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:37:04,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:37:04,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1117940255, now seen corresponding path program 109 times [2022-03-15 21:37:04,247 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:37:04,247 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692250713] [2022-03-15 21:37:04,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:37:04,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:37:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:37:04,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:04,885 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:37:04,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692250713] [2022-03-15 21:37:04,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692250713] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:37:04,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470360809] [2022-03-15 21:37:04,886 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:37:04,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:37:04,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:37:04,887 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:37:04,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2022-03-15 21:37:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:37:04,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 151 conjunts are in the unsatisfiable core [2022-03-15 21:37:04,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:37:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:05,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:37:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:05,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470360809] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:37:05,507 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:37:05,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2022-03-15 21:37:05,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [272631453] [2022-03-15 21:37:05,507 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:37:05,517 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:37:05,624 INFO L252 McrAutomatonBuilder]: Finished intersection with 197 states and 310 transitions. [2022-03-15 21:37:05,624 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:37:06,569 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:37:06,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 21:37:06,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:37:06,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 21:37:06,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 21:37:06,570 INFO L87 Difference]: Start difference. First operand 235 states and 502 transitions. Second operand has 40 states, 39 states have (on average 4.948717948717949) internal successors, (193), 39 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:08,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:37:08,930 INFO L93 Difference]: Finished difference Result 761 states and 1477 transitions. [2022-03-15 21:37:08,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 21:37:08,930 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 4.948717948717949) internal successors, (193), 39 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-03-15 21:37:08,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:37:08,931 INFO L225 Difference]: With dead ends: 761 [2022-03-15 21:37:08,931 INFO L226 Difference]: Without dead ends: 681 [2022-03-15 21:37:08,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 310 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 21:37:08,931 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 7071 mSDsCounter, 0 mSdLazyCounter, 11596 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 11597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:37:08,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 0 Invalid, 11597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11596 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 21:37:08,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-03-15 21:37:08,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 495. [2022-03-15 21:37:08,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 494 states have (on average 2.291497975708502) internal successors, (1132), 494 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1132 transitions. [2022-03-15 21:37:08,936 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 1132 transitions. Word has length 82 [2022-03-15 21:37:08,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:37:08,937 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 1132 transitions. [2022-03-15 21:37:08,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 4.948717948717949) internal successors, (193), 39 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:08,937 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 1132 transitions. [2022-03-15 21:37:08,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-03-15 21:37:08,939 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:37:08,939 INFO L514 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:37:08,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Forceful destruction successful, exit code 0 [2022-03-15 21:37:09,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2022-03-15 21:37:09,151 INFO L402 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:37:09,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:37:09,152 INFO L85 PathProgramCache]: Analyzing trace with hash -448739232, now seen corresponding path program 110 times [2022-03-15 21:37:09,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:37:09,152 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221672386] [2022-03-15 21:37:09,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:37:09,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:37:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:37:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:10,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:37:10,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221672386] [2022-03-15 21:37:10,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221672386] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:37:10,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65586221] [2022-03-15 21:37:10,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:37:10,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:37:10,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:37:10,367 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:37:10,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2022-03-15 21:37:10,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:37:10,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:37:10,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 79 conjunts are in the unsatisfiable core [2022-03-15 21:37:10,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:37:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:12,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:37:14,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:14,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65586221] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:37:14,234 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:37:14,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 77, 77] total 192 [2022-03-15 21:37:14,234 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1930688162] [2022-03-15 21:37:14,234 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:37:14,264 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:37:14,376 INFO L252 McrAutomatonBuilder]: Finished intersection with 199 states and 313 transitions. [2022-03-15 21:37:14,376 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:37:19,209 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 77 new interpolants: [135018#(or (< i1 N1) (<= (+ 3 i2) N2)), 135084#(or (<= (+ i2 38) N2) (<= N1 (+ 30 i1)) (< (+ i1 31) N1)), 135037#(or (<= (+ 22 i2) N2) (< i1 N1)), 135033#(or (< i1 N1) (<= (+ i2 18) N2)), 135043#(or (< i1 N1) (<= (+ i2 28) N2)), 135062#(or (<= (+ i2 38) N2) (< (+ 9 i1) N1) (<= N1 (+ i1 8))), 135073#(or (<= (+ i2 38) N2) (<= N1 (+ 19 i1)) (< (+ i1 20) N1)), 135055#(or (<= (+ i2 38) N2) (<= N1 (+ i1 1)) (< (+ 2 i1) N1)), 135090#(or (<= (+ i2 38) N2) (< (+ i1 37) N1) (<= N1 (+ i1 36))), 135088#(or (< (+ 35 i1) N1) (<= (+ i2 38) N2) (<= N1 (+ i1 34))), 135082#(or (<= (+ i2 38) N2) (<= N1 (+ i1 28)) (< (+ 29 i1) N1)), 135056#(or (<= (+ i2 38) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 135070#(or (<= (+ i2 38) N2) (< (+ i1 17) N1) (<= N1 (+ 16 i1))), 135065#(or (<= (+ i2 38) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 135022#(or (<= (+ 7 i2) N2) (< i1 N1)), 135053#(or (<= (+ i2 38) N2) (< i1 N1)), 135081#(or (<= (+ i2 38) N2) (<= N1 (+ i1 27)) (< (+ i1 28) N1)), 135089#(or (<= N1 (+ 35 i1)) (<= (+ i2 38) N2) (< (+ i1 36) N1)), 135057#(or (<= (+ i2 38) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 135068#(or (<= N1 (+ 14 i1)) (<= (+ i2 38) N2) (< (+ i1 15) N1)), 135079#(or (< (+ i1 26) N1) (<= (+ i2 38) N2) (<= N1 (+ i1 25))), 135078#(or (<= (+ i2 38) N2) (<= N1 (+ i1 24)) (< (+ i1 25) N1)), 135025#(or (<= (+ i2 10) N2) (< i1 N1)), 135039#(or (< i1 N1) (<= (+ i2 24) N2)), 135028#(or (< i1 N1) (<= (+ i2 13) N2)), 135054#(or (<= (+ i2 38) N2) (< (+ i1 1) N1) (<= N1 i1)), 135045#(or (<= (+ 30 i2) N2) (< i1 N1)), 135035#(or (<= (+ i2 20) N2) (< i1 N1)), 135020#(or (< i1 N1) (<= (+ 5 i2) N2)), 135087#(or (<= (+ i2 38) N2) (<= N1 (+ i1 33)) (< (+ i1 34) N1)), 135047#(or (<= (+ 32 i2) N2) (< i1 N1)), 135038#(or (<= (+ 23 i2) N2) (< i1 N1)), 135086#(or (<= N1 (+ 32 i1)) (<= (+ i2 38) N2) (< (+ i1 33) N1)), 135031#(or (<= (+ 16 i2) N2) (< i1 N1)), 135034#(or (<= (+ 19 i2) N2) (< i1 N1)), 135063#(or (<= (+ i2 38) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 135069#(or (< (+ 16 i1) N1) (<= (+ i2 38) N2) (<= N1 (+ i1 15))), 135042#(or (<= (+ i2 27) N2) (< i1 N1)), 135074#(or (<= (+ i2 38) N2) (< (+ 21 i1) N1) (<= N1 (+ i1 20))), 135027#(or (<= (+ i2 12) N2) (< i1 N1)), 135072#(or (<= (+ i2 38) N2) (<= N1 (+ i1 18)) (< (+ 19 i1) N1)), 135029#(or (<= (+ 14 i2) N2) (< i1 N1)), 135044#(or (<= (+ 29 i2) N2) (< i1 N1)), 135017#(or (< i1 N1) (<= (+ 2 i2) N2)), 135040#(or (<= (+ i2 25) N2) (< i1 N1)), 135085#(or (<= (+ i2 38) N2) (< (+ 32 i1) N1) (<= N1 (+ i1 31))), 135071#(or (<= (+ i2 38) N2) (< (+ i1 18) N1) (<= N1 (+ i1 17))), 135059#(or (<= (+ i2 38) N2) (<= N1 (+ 5 i1)) (< (+ 6 i1) N1)), 135046#(or (<= (+ i2 31) N2) (< i1 N1)), 135064#(or (<= (+ i2 38) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 135030#(or (<= (+ i2 15) N2) (< i1 N1)), 135041#(or (<= (+ i2 26) N2) (< i1 N1)), 135049#(or (<= (+ i2 34) N2) (< i1 N1)), 135060#(or (<= (+ i2 38) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 135051#(or (< i1 N1) (<= (+ i2 36) N2)), 135048#(or (<= (+ i2 33) N2) (< i1 N1)), 135032#(or (< i1 N1) (<= (+ i2 17) N2)), 135024#(or (<= (+ 9 i2) N2) (< i1 N1)), 135021#(or (< i1 N1) (<= (+ 6 i2) N2)), 135058#(or (<= N1 (+ i1 4)) (<= (+ i2 38) N2) (< (+ 5 i1) N1)), 135061#(or (<= N1 (+ 7 i1)) (<= (+ i2 38) N2) (< (+ i1 8) N1)), 135019#(or (<= (+ i2 4) N2) (< i1 N1)), 135050#(or (<= (+ 35 i2) N2) (< i1 N1)), 135016#(or (< i2 N2) (< i1 N1)), 135066#(or (<= (+ i2 38) N2) (<= N1 (+ i1 12)) (< (+ i1 13) N1)), 135023#(or (< i1 N1) (<= (+ i2 8) N2)), 135075#(or (<= N1 (+ 21 i1)) (<= (+ i2 38) N2) (< (+ 22 i1) N1)), 135091#(or (<= N1 (+ i1 37)) (<= (+ i2 38) N2) (< (+ i1 38) N1)), 135015#(< i1 N1), 135026#(or (<= (+ i2 11) N2) (< i1 N1)), 135080#(or (<= (+ i2 38) N2) (<= N1 (+ i1 26)) (< (+ i1 27) N1)), 135077#(or (<= (+ i2 38) N2) (< (+ i1 24) N1) (<= N1 (+ 23 i1))), 135067#(or (<= (+ i2 38) N2) (<= N1 (+ i1 13)) (< (+ 14 i1) N1)), 135036#(or (<= (+ 21 i2) N2) (< i1 N1)), 135052#(or (<= (+ i2 37) N2) (< i1 N1)), 135083#(or (<= (+ i2 38) N2) (<= N1 (+ 29 i1)) (< (+ 30 i1) N1)), 135076#(or (<= (+ i2 38) N2) (< (+ 23 i1) N1) (<= N1 (+ 22 i1)))] [2022-03-15 21:37:19,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 156 states [2022-03-15 21:37:19,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:37:19,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2022-03-15 21:37:19,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11025, Invalid=61605, Unknown=0, NotChecked=0, Total=72630 [2022-03-15 21:37:19,214 INFO L87 Difference]: Start difference. First operand 495 states and 1132 transitions. Second operand has 156 states, 156 states have (on average 1.7628205128205128) internal successors, (275), 155 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:37:28,958 INFO L93 Difference]: Finished difference Result 1132 states and 2104 transitions. [2022-03-15 21:37:28,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2022-03-15 21:37:28,958 INFO L78 Accepts]: Start accepts. Automaton has has 156 states, 156 states have (on average 1.7628205128205128) internal successors, (275), 155 states have internal predecessors, (275), 0 states have call successors, (0), 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 83 [2022-03-15 21:37:28,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:37:28,960 INFO L225 Difference]: With dead ends: 1132 [2022-03-15 21:37:28,960 INFO L226 Difference]: Without dead ends: 844 [2022-03-15 21:37:28,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 417 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62036 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=37415, Invalid=137727, Unknown=0, NotChecked=0, Total=175142 [2022-03-15 21:37:28,967 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1649 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 4054 mSolverCounterSat, 914 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1649 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 4054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:37:28,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1649 Valid, 0 Invalid, 4968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 4054 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 21:37:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2022-03-15 21:37:28,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 278. [2022-03-15 21:37:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 2.1263537906137184) internal successors, (589), 277 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 589 transitions. [2022-03-15 21:37:28,971 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 589 transitions. Word has length 83 [2022-03-15 21:37:28,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:37:28,971 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 589 transitions. [2022-03-15 21:37:28,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 156 states, 156 states have (on average 1.7628205128205128) internal successors, (275), 155 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:28,971 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 589 transitions. [2022-03-15 21:37:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-03-15 21:37:28,972 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:37:28,972 INFO L514 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:37:29,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Forceful destruction successful, exit code 0 [2022-03-15 21:37:29,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2022-03-15 21:37:29,188 INFO L402 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:37:29,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:37:29,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2023596426, now seen corresponding path program 111 times [2022-03-15 21:37:29,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:37:29,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503957983] [2022-03-15 21:37:29,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:37:29,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:37:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:37:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 704 proven. 740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:29,764 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:37:29,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503957983] [2022-03-15 21:37:29,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503957983] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:37:29,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161546365] [2022-03-15 21:37:29,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:37:29,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:37:29,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:37:29,765 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:37:29,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2022-03-15 21:37:29,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2022-03-15 21:37:29,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:37:29,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 79 conjunts are in the unsatisfiable core [2022-03-15 21:37:29,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:37:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 704 proven. 740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:32,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:37:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:35,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161546365] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:37:35,139 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:37:35,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 77, 77] total 191 [2022-03-15 21:37:35,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [621193134] [2022-03-15 21:37:35,139 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:37:35,149 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:37:35,275 INFO L252 McrAutomatonBuilder]: Finished intersection with 124 states and 163 transitions. [2022-03-15 21:37:35,275 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:37:37,287 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 38 new interpolants: [137798#(and (or (<= N1 (+ 35 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 35 i1)) (<= (+ i2 1) i1))), 137779#(and (or (<= N1 (+ i1 17)) (<= (+ 19 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 137795#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 33))) (or (<= N1 (+ i1 33)) (<= (+ 3 i2) i1))), 137786#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 24)) (<= (+ i2 12) i1))), 137793#(and (or (<= N1 (+ i1 31)) (<= (+ 5 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 31)))), 137796#(and (or (<= N1 (+ i1 34)) (<= (+ 2 i2) i1)) (or (<= N1 (+ i1 34)) (= (+ N1 (* (- 1) N2)) 0))), 137774#(and (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 12)) (<= (+ i2 24) i1))), 137768#(and (or (<= N1 (+ 6 i1)) (<= (+ 30 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 137773#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ i2 25) i1) (<= N1 (+ i1 11)))), 137791#(and (or (<= N1 (+ 29 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 7 i2) i1) (<= N1 (+ 29 i1)))), 137763#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 1)) (<= (+ 35 i2) i1))), 137784#(and (or (<= (+ 14 i2) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 137765#(and (or (<= N1 (+ 3 i1)) (<= (+ i2 33) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 137769#(and (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 7 i1)) (<= (+ 29 i2) i1))), 137778#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= N1 (+ 16 i1)) (<= (+ i2 20) i1))), 137772#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= (+ i2 26) i1) (<= N1 (+ i1 10)))), 137785#(and (or (<= (+ i2 13) i1) (<= N1 (+ 23 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1)))), 137792#(and (or (<= N1 (+ 30 i1)) (<= (+ 6 i2) i1)) (or (<= N1 (+ 30 i1)) (= (+ N1 (* (- 1) N2)) 0))), 137775#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 13)) (<= (+ 23 i2) i1))), 137767#(and (or (<= (+ i2 31) i1) (<= N1 (+ 5 i1))) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 137790#(and (or (<= N1 (+ i1 28)) (<= (+ i2 8) i1)) (or (<= N1 (+ i1 28)) (= (+ N1 (* (- 1) N2)) 0))), 137762#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ i2 36) i1) (<= N1 i1))), 137776#(and (or (<= N1 (+ 14 i1)) (<= (+ 22 i2) i1)) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0))), 137787#(and (or (<= N1 (+ i1 25)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 25)) (<= (+ i2 11) i1))), 137770#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= (+ i2 28) i1) (<= N1 (+ i1 8)))), 137771#(and (or (<= (+ i2 27) i1) (<= N1 (+ 9 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 137780#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= (+ i2 18) i1))), 137797#(< i2 N2), 137794#(and (or (<= N1 (+ 32 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 32 i1)) (<= (+ i2 4) i1))), 137799#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 36))) (or (<= N1 (+ i1 36)) (<= i2 i1))), 137781#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ i2 17) i1))), 137782#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20))) (or (<= (+ 16 i2) i1) (<= N1 (+ i1 20)))), 137789#(and (or (<= N1 (+ i1 27)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 9 i2) i1) (<= N1 (+ i1 27)))), 137788#(and (or (<= N1 (+ i1 26)) (<= (+ i2 10) i1)) (or (<= N1 (+ i1 26)) (= (+ N1 (* (- 1) N2)) 0))), 137766#(and (or (<= N1 (+ i1 4)) (<= (+ 32 i2) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 137777#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= (+ 21 i2) i1) (<= N1 (+ i1 15)))), 137783#(and (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 15) i1) (<= N1 (+ 21 i1)))), 137764#(and (or (<= (+ i2 34) i1) (<= N1 (+ 2 i1))) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0)))] [2022-03-15 21:37:37,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-03-15 21:37:37,287 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:37:37,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-03-15 21:37:37,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10712, Invalid=41958, Unknown=0, NotChecked=0, Total=52670 [2022-03-15 21:37:37,291 INFO L87 Difference]: Start difference. First operand 278 states and 589 transitions. Second operand has 79 states, 79 states have (on average 2.037974683544304) internal successors, (161), 78 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 21:37:40,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:37:40,927 INFO L93 Difference]: Finished difference Result 538 states and 1066 transitions. [2022-03-15 21:37:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2022-03-15 21:37:40,927 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 2.037974683544304) internal successors, (161), 78 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) Word has length 83 [2022-03-15 21:37:40,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:37:40,928 INFO L225 Difference]: With dead ends: 538 [2022-03-15 21:37:40,928 INFO L226 Difference]: Without dead ends: 537 [2022-03-15 21:37:40,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40119 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=27211, Invalid=88729, Unknown=0, NotChecked=0, Total=115940 [2022-03-15 21:37:40,932 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 530 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:37:40,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [530 Valid, 0 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:37:40,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-03-15 21:37:40,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 241. [2022-03-15 21:37:40,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 2.1458333333333335) internal successors, (515), 240 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 515 transitions. [2022-03-15 21:37:40,935 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 515 transitions. Word has length 83 [2022-03-15 21:37:40,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:37:40,935 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 515 transitions. [2022-03-15 21:37:40,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 2.037974683544304) internal successors, (161), 78 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 21:37:40,935 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 515 transitions. [2022-03-15 21:37:40,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-03-15 21:37:40,936 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:37:40,936 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:37:40,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Forceful destruction successful, exit code 0 [2022-03-15 21:37:41,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2022-03-15 21:37:41,150 INFO L402 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:37:41,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:37:41,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1026099047, now seen corresponding path program 112 times [2022-03-15 21:37:41,151 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:37:41,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868464217] [2022-03-15 21:37:41,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:37:41,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:37:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:37:41,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:41,930 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:37:41,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868464217] [2022-03-15 21:37:41,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868464217] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:37:41,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307763358] [2022-03-15 21:37:41,930 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:37:41,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:37:41,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:37:41,931 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:37:41,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2022-03-15 21:37:41,987 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:37:41,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:37:41,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 155 conjunts are in the unsatisfiable core [2022-03-15 21:37:41,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:37:42,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:42,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:37:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:42,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307763358] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:37:42,392 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:37:42,392 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 39 [2022-03-15 21:37:42,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [971831232] [2022-03-15 21:37:42,392 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:37:42,402 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:37:42,600 INFO L252 McrAutomatonBuilder]: Finished intersection with 202 states and 318 transitions. [2022-03-15 21:37:42,600 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:37:43,888 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:37:43,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 21:37:43,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:37:43,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 21:37:43,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 21:37:43,889 INFO L87 Difference]: Start difference. First operand 241 states and 515 transitions. Second operand has 41 states, 40 states have (on average 4.95) internal successors, (198), 40 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 21:37:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:37:46,463 INFO L93 Difference]: Finished difference Result 781 states and 1516 transitions. [2022-03-15 21:37:46,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 21:37:46,463 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 4.95) internal successors, (198), 40 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) Word has length 84 [2022-03-15 21:37:46,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:37:46,464 INFO L225 Difference]: With dead ends: 781 [2022-03-15 21:37:46,464 INFO L226 Difference]: Without dead ends: 699 [2022-03-15 21:37:46,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 318 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 21:37:46,464 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 7452 mSDsCounter, 0 mSdLazyCounter, 12213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 12214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:37:46,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 12214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12213 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 21:37:46,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-03-15 21:37:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 508. [2022-03-15 21:37:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 2.2919132149901382) internal successors, (1162), 507 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:37:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1162 transitions. [2022-03-15 21:37:46,470 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1162 transitions. Word has length 84 [2022-03-15 21:37:46,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:37:46,470 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 1162 transitions. [2022-03-15 21:37:46,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 4.95) internal successors, (198), 40 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 21:37:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1162 transitions. [2022-03-15 21:37:46,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-03-15 21:37:46,471 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:37:46,471 INFO L514 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:37:46,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Forceful destruction successful, exit code 0 [2022-03-15 21:37:46,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:37:46,687 INFO L402 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:37:46,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:37:46,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2125956952, now seen corresponding path program 113 times [2022-03-15 21:37:46,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:37:46,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92715278] [2022-03-15 21:37:46,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:37:46,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:37:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:37:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 741 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:47,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:37:47,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92715278] [2022-03-15 21:37:47,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92715278] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:37:47,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263870822] [2022-03-15 21:37:47,956 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:37:47,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:37:47,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:37:47,957 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:37:47,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2022-03-15 21:37:48,022 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2022-03-15 21:37:48,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:37:48,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 81 conjunts are in the unsatisfiable core [2022-03-15 21:37:48,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:37:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 741 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:50,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:37:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:37:51,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263870822] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:37:51,894 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:37:51,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 79, 79] total 197 [2022-03-15 21:37:51,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1077965145] [2022-03-15 21:37:51,894 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:37:51,905 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:37:52,095 INFO L252 McrAutomatonBuilder]: Finished intersection with 204 states and 321 transitions. [2022-03-15 21:37:52,096 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:37:57,047 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 79 new interpolants: [142091#(or (<= (+ i2 11) N2) (< i1 N1)), 142109#(or (<= (+ 29 i2) N2) (< i1 N1)), 142151#(or (< (+ 32 i1) N1) (<= (+ i2 39) N2) (<= N1 (+ i1 31))), 142148#(or (<= N1 (+ i1 28)) (< (+ 29 i1) N1) (<= (+ i2 39) N2)), 142092#(or (<= (+ i2 12) N2) (< i1 N1)), 142115#(or (<= (+ 35 i2) N2) (< i1 N1)), 142090#(or (<= (+ i2 10) N2) (< i1 N1)), 142158#(or (<= (+ i2 39) N2) (< (+ i1 39) N1) (<= N1 (+ i1 38))), 142087#(or (<= (+ 7 i2) N2) (< i1 N1)), 142089#(or (<= (+ 9 i2) N2) (< i1 N1)), 142094#(or (<= (+ 14 i2) N2) (< i1 N1)), 142099#(or (<= (+ 19 i2) N2) (< i1 N1)), 142128#(or (< (+ 9 i1) N1) (<= N1 (+ i1 8)) (<= (+ i2 39) N2)), 142105#(or (<= (+ i2 25) N2) (< i1 N1)), 142145#(or (< (+ i1 26) N1) (<= N1 (+ i1 25)) (<= (+ i2 39) N2)), 142155#(or (<= N1 (+ 35 i1)) (< (+ i1 36) N1) (<= (+ i2 39) N2)), 142120#(or (< (+ i1 1) N1) (<= (+ i2 39) N2) (<= N1 i1)), 142116#(or (< i1 N1) (<= (+ i2 36) N2)), 142085#(or (< i1 N1) (<= (+ 5 i2) N2)), 142131#(or (<= (+ i2 39) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 142104#(or (< i1 N1) (<= (+ i2 24) N2)), 142142#(or (< (+ 23 i1) N1) (<= (+ i2 39) N2) (<= N1 (+ 22 i1))), 142136#(or (< (+ i1 17) N1) (<= (+ i2 39) N2) (<= N1 (+ 16 i1))), 142122#(or (<= N1 (+ 2 i1)) (<= (+ i2 39) N2) (< (+ 3 i1) N1)), 142127#(or (<= N1 (+ 7 i1)) (< (+ i1 8) N1) (<= (+ i2 39) N2)), 142102#(or (<= (+ 22 i2) N2) (< i1 N1)), 142157#(or (<= N1 (+ i1 37)) (<= (+ i2 39) N2) (< (+ i1 38) N1)), 142126#(or (< (+ 7 i1) N1) (<= N1 (+ 6 i1)) (<= (+ i2 39) N2)), 142108#(or (< i1 N1) (<= (+ i2 28) N2)), 142154#(or (< (+ 35 i1) N1) (<= N1 (+ i1 34)) (<= (+ i2 39) N2)), 142080#(< i1 N1), 142121#(or (<= N1 (+ i1 1)) (<= (+ i2 39) N2) (< (+ 2 i1) N1)), 142095#(or (<= (+ i2 15) N2) (< i1 N1)), 142088#(or (< i1 N1) (<= (+ i2 8) N2)), 142093#(or (< i1 N1) (<= (+ i2 13) N2)), 142138#(or (<= N1 (+ i1 18)) (< (+ 19 i1) N1) (<= (+ i2 39) N2)), 142153#(or (<= N1 (+ i1 33)) (<= (+ i2 39) N2) (< (+ i1 34) N1)), 142112#(or (<= (+ 32 i2) N2) (< i1 N1)), 142096#(or (<= (+ 16 i2) N2) (< i1 N1)), 142156#(or (< (+ i1 37) N1) (<= (+ i2 39) N2) (<= N1 (+ i1 36))), 142103#(or (<= (+ 23 i2) N2) (< i1 N1)), 142132#(or (<= N1 (+ i1 12)) (< (+ i1 13) N1) (<= (+ i2 39) N2)), 142111#(or (<= (+ i2 31) N2) (< i1 N1)), 142129#(or (<= (+ i2 39) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 142135#(or (< (+ 16 i1) N1) (<= (+ i2 39) N2) (<= N1 (+ i1 15))), 142097#(or (< i1 N1) (<= (+ i2 17) N2)), 142123#(or (<= N1 (+ 3 i1)) (<= (+ i2 39) N2) (< (+ i1 4) N1)), 142110#(or (<= (+ 30 i2) N2) (< i1 N1)), 142084#(or (<= (+ i2 4) N2) (< i1 N1)), 142134#(or (<= N1 (+ 14 i1)) (< (+ i1 15) N1) (<= (+ i2 39) N2)), 142146#(or (<= N1 (+ i1 26)) (<= (+ i2 39) N2) (< (+ i1 27) N1)), 142143#(or (< (+ i1 24) N1) (<= (+ i2 39) N2) (<= N1 (+ 23 i1))), 142125#(or (<= N1 (+ 5 i1)) (<= (+ i2 39) N2) (< (+ 6 i1) N1)), 142133#(or (<= N1 (+ i1 13)) (<= (+ i2 39) N2) (< (+ 14 i1) N1)), 142098#(or (< i1 N1) (<= (+ i2 18) N2)), 142114#(or (<= (+ i2 34) N2) (< i1 N1)), 142082#(or (< i1 N1) (<= (+ 2 i2) N2)), 142119#(or (<= (+ i2 39) N2) (< i1 N1)), 142081#(or (< i2 N2) (< i1 N1)), 142117#(or (<= (+ i2 37) N2) (< i1 N1)), 142083#(or (< i1 N1) (<= (+ 3 i2) N2)), 142106#(or (<= (+ i2 26) N2) (< i1 N1)), 142113#(or (<= (+ i2 33) N2) (< i1 N1)), 142118#(or (<= (+ i2 38) N2) (< i1 N1)), 142152#(or (<= N1 (+ 32 i1)) (<= (+ i2 39) N2) (< (+ i1 33) N1)), 142101#(or (<= (+ 21 i2) N2) (< i1 N1)), 142137#(or (< (+ i1 18) N1) (<= N1 (+ i1 17)) (<= (+ i2 39) N2)), 142107#(or (<= (+ i2 27) N2) (< i1 N1)), 142141#(or (<= N1 (+ 21 i1)) (<= (+ i2 39) N2) (< (+ 22 i1) N1)), 142086#(or (< i1 N1) (<= (+ 6 i2) N2)), 142100#(or (<= (+ i2 20) N2) (< i1 N1)), 142150#(or (<= N1 (+ 30 i1)) (<= (+ i2 39) N2) (< (+ i1 31) N1)), 142124#(or (<= N1 (+ i1 4)) (<= (+ i2 39) N2) (< (+ 5 i1) N1)), 142130#(or (< (+ i1 11) N1) (<= (+ i2 39) N2) (<= N1 (+ i1 10))), 142144#(or (<= N1 (+ i1 24)) (<= (+ i2 39) N2) (< (+ i1 25) N1)), 142139#(or (<= N1 (+ 19 i1)) (< (+ i1 20) N1) (<= (+ i2 39) N2)), 142140#(or (< (+ 21 i1) N1) (<= (+ i2 39) N2) (<= N1 (+ i1 20))), 142149#(or (<= N1 (+ 29 i1)) (< (+ 30 i1) N1) (<= (+ i2 39) N2)), 142147#(or (<= N1 (+ i1 27)) (< (+ i1 28) N1) (<= (+ i2 39) N2))] [2022-03-15 21:37:57,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 160 states [2022-03-15 21:37:57,047 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:37:57,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2022-03-15 21:37:57,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11588, Invalid=64864, Unknown=0, NotChecked=0, Total=76452 [2022-03-15 21:37:57,051 INFO L87 Difference]: Start difference. First operand 508 states and 1162 transitions. Second operand has 160 states, 160 states have (on average 1.7625) internal successors, (282), 159 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:07,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:38:07,996 INFO L93 Difference]: Finished difference Result 1162 states and 2160 transitions. [2022-03-15 21:38:07,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2022-03-15 21:38:07,996 INFO L78 Accepts]: Start accepts. Automaton has has 160 states, 160 states have (on average 1.7625) internal successors, (282), 159 states have internal predecessors, (282), 0 states have call successors, (0), 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 85 [2022-03-15 21:38:07,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:38:07,997 INFO L225 Difference]: With dead ends: 1162 [2022-03-15 21:38:07,997 INFO L226 Difference]: Without dead ends: 866 [2022-03-15 21:38:08,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 428 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65384 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=39394, Invalid=145076, Unknown=0, NotChecked=0, Total=184470 [2022-03-15 21:38:08,004 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1797 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 4128 mSolverCounterSat, 975 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1797 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 975 IncrementalHoareTripleChecker+Valid, 4128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:38:08,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1797 Valid, 0 Invalid, 5103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [975 Valid, 4128 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 21:38:08,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2022-03-15 21:38:08,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 285. [2022-03-15 21:38:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 284 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 604 transitions. [2022-03-15 21:38:08,009 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 604 transitions. Word has length 85 [2022-03-15 21:38:08,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:38:08,009 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 604 transitions. [2022-03-15 21:38:08,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 160 states, 160 states have (on average 1.7625) internal successors, (282), 159 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:08,009 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 604 transitions. [2022-03-15 21:38:08,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-03-15 21:38:08,009 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:38:08,009 INFO L514 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:38:08,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Ended with exit code 0 [2022-03-15 21:38:08,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115,115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:08,217 INFO L402 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:38:08,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:38:08,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2085412596, now seen corresponding path program 114 times [2022-03-15 21:38:08,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:38:08,218 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543065783] [2022-03-15 21:38:08,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:38:08,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:38:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 742 proven. 779 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:08,825 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:38:08,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543065783] [2022-03-15 21:38:08,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543065783] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:38:08,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968620921] [2022-03-15 21:38:08,826 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:38:08,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:08,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:38:08,827 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:38:08,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2022-03-15 21:38:08,895 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-03-15 21:38:08,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:38:08,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 81 conjunts are in the unsatisfiable core [2022-03-15 21:38:08,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:38:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 742 proven. 779 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:11,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:38:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:14,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968620921] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:38:14,413 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:38:14,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 79, 79] total 196 [2022-03-15 21:38:14,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1872204063] [2022-03-15 21:38:14,413 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:38:14,423 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:38:14,548 INFO L252 McrAutomatonBuilder]: Finished intersection with 127 states and 167 transitions. [2022-03-15 21:38:14,549 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:38:16,703 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 39 new interpolants: [144934#(< i2 N2), 144927#(and (or (<= N1 (+ 29 i1)) (<= (+ i2 8) i1)) (or (<= N1 (+ 29 i1)) (= (+ N1 (* (- 1) N2)) 0))), 144929#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 31))) (or (<= (+ 6 i2) i1) (<= N1 (+ i1 31)))), 144917#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ i2 18) i1))), 144922#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 24)) (<= (+ i2 13) i1))), 144901#(and (or (<= (+ i2 34) i1) (<= N1 (+ 3 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 144933#(and (or (<= N1 (+ 35 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 35 i1)) (<= (+ 2 i2) i1))), 144898#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ i2 37) i1) (<= N1 i1))), 144928#(and (or (<= (+ 7 i2) i1) (<= N1 (+ 30 i1))) (or (<= N1 (+ 30 i1)) (= (+ N1 (* (- 1) N2)) 0))), 144936#(and (or (<= N1 (+ i1 37)) (<= i2 i1)) (or (<= N1 (+ i1 37)) (= (+ N1 (* (- 1) N2)) 0))), 144924#(and (or (<= N1 (+ i1 26)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 26)) (<= (+ i2 11) i1))), 144899#(and (or (<= N1 (+ i1 1)) (<= (+ i2 36) i1)) (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0))), 144915#(and (or (<= N1 (+ i1 17)) (<= (+ i2 20) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 144925#(and (or (<= N1 (+ i1 27)) (<= (+ i2 10) i1)) (or (<= N1 (+ i1 27)) (= (+ N1 (* (- 1) N2)) 0))), 144909#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ i2 26) i1) (<= N1 (+ i1 11)))), 144907#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1))) (or (<= (+ i2 28) i1) (<= N1 (+ 9 i1)))), 144921#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1))) (or (<= (+ 14 i2) i1) (<= N1 (+ 23 i1)))), 144905#(and (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 7 i1)) (<= (+ 30 i2) i1))), 144926#(and (or (<= (+ 9 i2) i1) (<= N1 (+ i1 28))) (or (<= N1 (+ i1 28)) (= (+ N1 (* (- 1) N2)) 0))), 144931#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 33))) (or (<= (+ i2 4) i1) (<= N1 (+ i1 33)))), 144900#(and (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 2 i1)) (<= (+ 35 i2) i1))), 144916#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= (+ 19 i2) i1))), 144935#(and (or (<= N1 (+ i1 36)) (<= (+ i2 1) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 36)))), 144911#(and (or (<= N1 (+ i1 13)) (<= (+ i2 24) i1)) (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0))), 144908#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= (+ i2 27) i1) (<= N1 (+ i1 10)))), 144930#(and (or (<= N1 (+ 32 i1)) (<= (+ 5 i2) i1)) (or (<= N1 (+ 32 i1)) (= (+ N1 (* (- 1) N2)) 0))), 144906#(and (or (<= N1 (+ i1 8)) (<= (+ 29 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8)))), 144923#(and (or (<= N1 (+ i1 25)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 25)) (<= (+ i2 12) i1))), 144918#(and (or (<= N1 (+ i1 20)) (<= (+ i2 17) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20)))), 144903#(and (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 32 i2) i1) (<= N1 (+ 5 i1)))), 144914#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= (+ 21 i2) i1) (<= N1 (+ 16 i1)))), 144904#(and (or (<= (+ i2 31) i1) (<= N1 (+ 6 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 144932#(and (or (<= N1 (+ i1 34)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 34)) (<= (+ 3 i2) i1))), 144912#(and (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 14 i1)) (<= (+ 23 i2) i1))), 144902#(and (or (<= N1 (+ i1 4)) (<= (+ i2 33) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 144913#(and (or (<= N1 (+ i1 15)) (<= (+ 22 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15)))), 144910#(and (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 25) i1) (<= N1 (+ i1 12)))), 144919#(and (or (<= N1 (+ 21 i1)) (<= (+ 16 i2) i1)) (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0))), 144920#(and (or (<= (+ i2 15) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1))))] [2022-03-15 21:38:16,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-03-15 21:38:16,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:38:16,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-03-15 21:38:16,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11267, Invalid=44193, Unknown=0, NotChecked=0, Total=55460 [2022-03-15 21:38:16,707 INFO L87 Difference]: Start difference. First operand 285 states and 604 transitions. Second operand has 81 states, 81 states have (on average 2.037037037037037) internal successors, (165), 80 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 21:38:20,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:38:20,968 INFO L93 Difference]: Finished difference Result 552 states and 1094 transitions. [2022-03-15 21:38:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2022-03-15 21:38:20,968 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 2.037037037037037) internal successors, (165), 80 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) Word has length 85 [2022-03-15 21:38:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:38:20,969 INFO L225 Difference]: With dead ends: 552 [2022-03-15 21:38:20,969 INFO L226 Difference]: Without dead ends: 551 [2022-03-15 21:38:20,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42305 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=28649, Invalid=93501, Unknown=0, NotChecked=0, Total=122150 [2022-03-15 21:38:20,974 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 561 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:38:20,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [561 Valid, 0 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:38:20,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-03-15 21:38:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 247. [2022-03-15 21:38:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 2.1463414634146343) internal successors, (528), 246 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 528 transitions. [2022-03-15 21:38:20,977 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 528 transitions. Word has length 85 [2022-03-15 21:38:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:38:20,977 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 528 transitions. [2022-03-15 21:38:20,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 2.037037037037037) internal successors, (165), 80 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 21:38:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 528 transitions. [2022-03-15 21:38:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-03-15 21:38:20,977 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:38:20,977 INFO L514 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:38:20,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Forceful destruction successful, exit code 0 [2022-03-15 21:38:21,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable116 [2022-03-15 21:38:21,191 INFO L402 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:38:21,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:38:21,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1480071329, now seen corresponding path program 115 times [2022-03-15 21:38:21,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:38:21,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275875181] [2022-03-15 21:38:21,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:38:21,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:38:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:21,871 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:38:21,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275875181] [2022-03-15 21:38:21,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275875181] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:38:21,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565919969] [2022-03-15 21:38:21,871 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:38:21,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:21,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:38:21,872 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:38:21,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2022-03-15 21:38:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:21,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 159 conjunts are in the unsatisfiable core [2022-03-15 21:38:21,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:38:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:22,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:38:22,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:22,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565919969] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:38:22,437 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:38:22,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2022-03-15 21:38:22,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1190023714] [2022-03-15 21:38:22,438 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:38:22,501 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:38:22,620 INFO L252 McrAutomatonBuilder]: Finished intersection with 207 states and 326 transitions. [2022-03-15 21:38:22,620 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:38:24,089 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:38:24,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 21:38:24,090 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:38:24,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 21:38:24,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 21:38:24,090 INFO L87 Difference]: Start difference. First operand 247 states and 528 transitions. Second operand has 42 states, 41 states have (on average 4.951219512195122) internal successors, (203), 41 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:27,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:38:27,202 INFO L93 Difference]: Finished difference Result 801 states and 1555 transitions. [2022-03-15 21:38:27,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 21:38:27,203 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 4.951219512195122) internal successors, (203), 41 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-03-15 21:38:27,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:38:27,204 INFO L225 Difference]: With dead ends: 801 [2022-03-15 21:38:27,204 INFO L226 Difference]: Without dead ends: 717 [2022-03-15 21:38:27,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 326 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 21:38:27,204 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 7843 mSDsCounter, 0 mSdLazyCounter, 12846 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 12847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:38:27,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 12847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12846 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-03-15 21:38:27,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-03-15 21:38:27,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 521. [2022-03-15 21:38:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 2.292307692307692) internal successors, (1192), 520 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1192 transitions. [2022-03-15 21:38:27,209 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 1192 transitions. Word has length 86 [2022-03-15 21:38:27,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:38:27,209 INFO L470 AbstractCegarLoop]: Abstraction has 521 states and 1192 transitions. [2022-03-15 21:38:27,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 4.951219512195122) internal successors, (203), 41 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:27,209 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 1192 transitions. [2022-03-15 21:38:27,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-03-15 21:38:27,210 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:38:27,210 INFO L514 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:38:27,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Forceful destruction successful, exit code 0 [2022-03-15 21:38:27,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,117 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:27,423 INFO L402 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:38:27,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:38:27,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1641024608, now seen corresponding path program 116 times [2022-03-15 21:38:27,424 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:38:27,424 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278510307] [2022-03-15 21:38:27,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:38:27,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:38:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:28,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:28,809 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:38:28,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278510307] [2022-03-15 21:38:28,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278510307] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:38:28,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775640312] [2022-03-15 21:38:28,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:38:28,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:28,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:38:28,810 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:38:28,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2022-03-15 21:38:28,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:38:28,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:38:28,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 83 conjunts are in the unsatisfiable core [2022-03-15 21:38:28,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:38:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:31,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:38:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:33,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775640312] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:38:33,138 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:38:33,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 81, 81] total 202 [2022-03-15 21:38:33,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [830558909] [2022-03-15 21:38:33,139 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:38:33,149 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:38:33,317 INFO L252 McrAutomatonBuilder]: Finished intersection with 209 states and 329 transitions. [2022-03-15 21:38:33,317 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:38:39,246 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 81 new interpolants: [149343#(or (< i1 N1) (<= (+ i2 18) N2)), 149374#(or (< (+ 9 i1) N1) (<= N1 (+ i1 8)) (<= (+ 40 i2) N2)), 149389#(or (< (+ i1 24) N1) (<= (+ 40 i2) N2) (<= N1 (+ 23 i1))), 149351#(or (<= (+ i2 26) N2) (< i1 N1)), 149334#(or (<= (+ 9 i2) N2) (< i1 N1)), 149377#(or (<= (+ 40 i2) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 149362#(or (<= (+ i2 37) N2) (< i1 N1)), 149348#(or (<= (+ 23 i2) N2) (< i1 N1)), 149370#(or (<= N1 (+ i1 4)) (<= (+ 40 i2) N2) (< (+ 5 i1) N1)), 149378#(or (<= N1 (+ i1 12)) (< (+ i1 13) N1) (<= (+ 40 i2) N2)), 149364#(or (<= (+ i2 39) N2) (< i1 N1)), 149344#(or (<= (+ 19 i2) N2) (< i1 N1)), 149372#(or (< (+ 7 i1) N1) (<= N1 (+ 6 i1)) (<= (+ 40 i2) N2)), 149393#(or (<= N1 (+ i1 27)) (< (+ i1 28) N1) (<= (+ 40 i2) N2)), 149388#(or (< (+ 23 i1) N1) (<= (+ 40 i2) N2) (<= N1 (+ 22 i1))), 149398#(or (<= N1 (+ 32 i1)) (<= (+ 40 i2) N2) (< (+ i1 33) N1)), 149335#(or (<= (+ i2 10) N2) (< i1 N1)), 149392#(or (<= N1 (+ i1 26)) (< (+ i1 27) N1) (<= (+ 40 i2) N2)), 149379#(or (<= N1 (+ i1 13)) (<= (+ 40 i2) N2) (< (+ 14 i1) N1)), 149363#(or (<= (+ i2 38) N2) (< i1 N1)), 149387#(or (<= N1 (+ 21 i1)) (<= (+ 40 i2) N2) (< (+ 22 i1) N1)), 149354#(or (<= (+ 29 i2) N2) (< i1 N1)), 149356#(or (<= (+ i2 31) N2) (< i1 N1)), 149401#(or (<= N1 (+ 35 i1)) (< (+ i1 36) N1) (<= (+ 40 i2) N2)), 149376#(or (< (+ i1 11) N1) (<= (+ 40 i2) N2) (<= N1 (+ i1 10))), 149371#(or (<= N1 (+ 5 i1)) (<= (+ 40 i2) N2) (< (+ 6 i1) N1)), 149341#(or (<= (+ 16 i2) N2) (< i1 N1)), 149358#(or (<= (+ i2 33) N2) (< i1 N1)), 149365#(or (<= (+ 40 i2) N2) (< i1 N1)), 149380#(or (<= N1 (+ 14 i1)) (< (+ i1 15) N1) (<= (+ 40 i2) N2)), 149375#(or (<= (+ 40 i2) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 149391#(or (< (+ i1 26) N1) (<= N1 (+ i1 25)) (<= (+ 40 i2) N2)), 149346#(or (<= (+ 21 i2) N2) (< i1 N1)), 149390#(or (<= N1 (+ i1 24)) (<= (+ 40 i2) N2) (< (+ i1 25) N1)), 149357#(or (<= (+ 32 i2) N2) (< i1 N1)), 149383#(or (< (+ i1 18) N1) (<= N1 (+ i1 17)) (<= (+ 40 i2) N2)), 149353#(or (< i1 N1) (<= (+ i2 28) N2)), 149373#(or (<= N1 (+ 7 i1)) (< (+ i1 8) N1) (<= (+ 40 i2) N2)), 149325#(< i1 N1), 149342#(or (< i1 N1) (<= (+ i2 17) N2)), 149367#(or (<= N1 (+ i1 1)) (<= (+ 40 i2) N2) (< (+ 2 i1) N1)), 149330#(or (< i1 N1) (<= (+ 5 i2) N2)), 149349#(or (< i1 N1) (<= (+ i2 24) N2)), 149328#(or (< i1 N1) (<= (+ 3 i2) N2)), 149404#(or (<= (+ 40 i2) N2) (< (+ i1 39) N1) (<= N1 (+ i1 38))), 149350#(or (<= (+ i2 25) N2) (< i1 N1)), 149340#(or (<= (+ i2 15) N2) (< i1 N1)), 149369#(or (<= N1 (+ 3 i1)) (<= (+ 40 i2) N2) (< (+ i1 4) N1)), 149332#(or (<= (+ 7 i2) N2) (< i1 N1)), 149336#(or (<= (+ i2 11) N2) (< i1 N1)), 149386#(or (< (+ 21 i1) N1) (<= N1 (+ i1 20)) (<= (+ 40 i2) N2)), 149400#(or (< (+ 35 i1) N1) (<= N1 (+ i1 34)) (<= (+ 40 i2) N2)), 149352#(or (<= (+ i2 27) N2) (< i1 N1)), 149339#(or (<= (+ 14 i2) N2) (< i1 N1)), 149327#(or (< i1 N1) (<= (+ 2 i2) N2)), 149399#(or (<= N1 (+ i1 33)) (<= (+ 40 i2) N2) (< (+ i1 34) N1)), 149326#(or (< i2 N2) (< i1 N1)), 149397#(or (< (+ 32 i1) N1) (<= N1 (+ i1 31)) (<= (+ 40 i2) N2)), 149333#(or (< i1 N1) (<= (+ i2 8) N2)), 149345#(or (<= (+ i2 20) N2) (< i1 N1)), 149359#(or (<= (+ i2 34) N2) (< i1 N1)), 149395#(or (<= N1 (+ 29 i1)) (< (+ 30 i1) N1) (<= (+ 40 i2) N2)), 149382#(or (< (+ i1 17) N1) (<= (+ 40 i2) N2) (<= N1 (+ 16 i1))), 149384#(or (<= N1 (+ i1 18)) (< (+ 19 i1) N1) (<= (+ 40 i2) N2)), 149338#(or (< i1 N1) (<= (+ i2 13) N2)), 149360#(or (<= (+ 35 i2) N2) (< i1 N1)), 149396#(or (<= N1 (+ 30 i1)) (<= (+ 40 i2) N2) (< (+ i1 31) N1)), 149385#(or (<= N1 (+ 19 i1)) (< (+ i1 20) N1) (<= (+ 40 i2) N2)), 149405#(or (< (+ 40 i1) N1) (<= (+ 40 i2) N2) (<= N1 (+ i1 39))), 149331#(or (< i1 N1) (<= (+ 6 i2) N2)), 149366#(or (< (+ i1 1) N1) (<= (+ 40 i2) N2) (<= N1 i1)), 149355#(or (<= (+ 30 i2) N2) (< i1 N1)), 149329#(or (<= (+ i2 4) N2) (< i1 N1)), 149402#(or (< (+ i1 37) N1) (<= (+ 40 i2) N2) (<= N1 (+ i1 36))), 149368#(or (<= N1 (+ 2 i1)) (<= (+ 40 i2) N2) (< (+ 3 i1) N1)), 149381#(or (< (+ 16 i1) N1) (<= (+ 40 i2) N2) (<= N1 (+ i1 15))), 149394#(or (<= N1 (+ i1 28)) (< (+ 29 i1) N1) (<= (+ 40 i2) N2)), 149337#(or (<= (+ i2 12) N2) (< i1 N1)), 149361#(or (< i1 N1) (<= (+ i2 36) N2)), 149347#(or (<= (+ 22 i2) N2) (< i1 N1)), 149403#(or (<= N1 (+ i1 37)) (<= (+ 40 i2) N2) (< (+ i1 38) N1))] [2022-03-15 21:38:39,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 164 states [2022-03-15 21:38:39,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:38:39,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2022-03-15 21:38:39,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12165, Invalid=68207, Unknown=0, NotChecked=0, Total=80372 [2022-03-15 21:38:39,250 INFO L87 Difference]: Start difference. First operand 521 states and 1192 transitions. Second operand has 164 states, 164 states have (on average 1.7621951219512195) internal successors, (289), 163 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:50,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:38:50,231 INFO L93 Difference]: Finished difference Result 1192 states and 2216 transitions. [2022-03-15 21:38:50,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2022-03-15 21:38:50,231 INFO L78 Accepts]: Start accepts. Automaton has has 164 states, 164 states have (on average 1.7621951219512195) internal successors, (289), 163 states have internal predecessors, (289), 0 states have call successors, (0), 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 87 [2022-03-15 21:38:50,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:38:50,232 INFO L225 Difference]: With dead ends: 1192 [2022-03-15 21:38:50,232 INFO L226 Difference]: Without dead ends: 888 [2022-03-15 21:38:50,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 439 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68820 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=41424, Invalid=152616, Unknown=0, NotChecked=0, Total=194040 [2022-03-15 21:38:50,239 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1884 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 4255 mSolverCounterSat, 1010 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1884 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1010 IncrementalHoareTripleChecker+Valid, 4255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:38:50,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1884 Valid, 0 Invalid, 5265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1010 Valid, 4255 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 21:38:50,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2022-03-15 21:38:50,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 292. [2022-03-15 21:38:50,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 2.127147766323024) internal successors, (619), 291 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 619 transitions. [2022-03-15 21:38:50,243 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 619 transitions. Word has length 87 [2022-03-15 21:38:50,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:38:50,243 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 619 transitions. [2022-03-15 21:38:50,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 164 states, 164 states have (on average 1.7621951219512195) internal successors, (289), 163 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:38:50,244 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 619 transitions. [2022-03-15 21:38:50,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-03-15 21:38:50,244 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:38:50,244 INFO L514 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:38:50,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Forceful destruction successful, exit code 0 [2022-03-15 21:38:50,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118,118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:50,458 INFO L402 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:38:50,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:38:50,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1684931210, now seen corresponding path program 117 times [2022-03-15 21:38:50,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:38:50,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402564393] [2022-03-15 21:38:50,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:38:50,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:38:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:38:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 781 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:51,491 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:38:51,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402564393] [2022-03-15 21:38:51,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402564393] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:38:51,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930037213] [2022-03-15 21:38:51,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:38:51,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:38:51,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:38:51,493 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:38:51,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2022-03-15 21:38:51,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2022-03-15 21:38:51,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:38:51,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 83 conjunts are in the unsatisfiable core [2022-03-15 21:38:51,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:38:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 781 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:54,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:38:58,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:38:58,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930037213] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:38:58,829 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:38:58,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 81, 81] total 201 [2022-03-15 21:38:58,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1454822808] [2022-03-15 21:38:58,829 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:38:58,840 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:38:59,026 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 171 transitions. [2022-03-15 21:38:59,026 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:01,266 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [152216#(and (or (<= N1 (+ 2 i1)) (<= (+ i2 36) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 152223#(and (or (<= N1 (+ 9 i1)) (<= (+ 29 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 152252#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 38))) (or (<= N1 (+ i1 38)) (<= i2 i1))), 152249#(and (or (<= N1 (+ 35 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 35 i1)) (<= (+ 3 i2) i1))), 152246#(and (or (<= N1 (+ 32 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 32 i1)) (<= (+ 6 i2) i1))), 152240#(and (or (<= N1 (+ i1 26)) (<= (+ i2 12) i1)) (or (<= N1 (+ i1 26)) (= (+ N1 (* (- 1) N2)) 0))), 152231#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17))) (or (<= (+ 21 i2) i1) (<= N1 (+ i1 17)))), 152219#(and (or (<= N1 (+ 5 i1)) (<= (+ i2 33) i1)) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 152217#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1))) (or (<= (+ 35 i2) i1) (<= N1 (+ 3 i1)))), 152225#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ i2 27) i1) (<= N1 (+ i1 11)))), 152238#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 24)) (<= (+ 14 i2) i1))), 152228#(and (or (<= N1 (+ 14 i1)) (<= (+ i2 24) i1)) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0))), 152233#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ 19 i2) i1))), 152243#(and (or (<= (+ 9 i2) i1) (<= N1 (+ 29 i1))) (or (<= N1 (+ 29 i1)) (= (+ N1 (* (- 1) N2)) 0))), 152242#(and (or (<= N1 (+ i1 28)) (<= (+ i2 10) i1)) (or (<= N1 (+ i1 28)) (= (+ N1 (* (- 1) N2)) 0))), 152235#(and (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 21 i1)) (<= (+ i2 17) i1))), 152232#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= (+ i2 20) i1))), 152224#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= (+ i2 28) i1) (<= N1 (+ i1 10)))), 152226#(and (or (<= N1 (+ i1 12)) (<= (+ i2 26) i1)) (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0))), 152248#(and (or (<= N1 (+ i1 34)) (<= (+ i2 4) i1)) (or (<= N1 (+ i1 34)) (= (+ N1 (* (- 1) N2)) 0))), 152253#(< i2 N2), 152239#(and (or (<= N1 (+ i1 25)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 25)) (<= (+ i2 13) i1))), 152229#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= (+ 23 i2) i1) (<= N1 (+ i1 15)))), 152230#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= N1 (+ 16 i1)) (<= (+ 22 i2) i1))), 152245#(and (or (<= (+ 7 i2) i1) (<= N1 (+ i1 31))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 31)))), 152241#(and (or (<= N1 (+ i1 27)) (<= (+ i2 11) i1)) (or (<= N1 (+ i1 27)) (= (+ N1 (* (- 1) N2)) 0))), 152237#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1))) (or (<= (+ i2 15) i1) (<= N1 (+ 23 i1)))), 152221#(and (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 7 i1)) (<= (+ i2 31) i1))), 152218#(and (or (<= (+ i2 34) i1) (<= N1 (+ i1 4))) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 152214#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ i2 38) i1) (<= N1 i1))), 152220#(and (or (<= (+ 32 i2) i1) (<= N1 (+ 6 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 152244#(and (or (<= N1 (+ 30 i1)) (<= (+ i2 8) i1)) (or (<= N1 (+ 30 i1)) (= (+ N1 (* (- 1) N2)) 0))), 152247#(and (or (<= N1 (+ i1 33)) (<= (+ 5 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 33)))), 152250#(and (or (<= (+ 2 i2) i1) (<= N1 (+ i1 36))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 36)))), 152215#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 37) i1) (<= N1 (+ i1 1)))), 152251#(and (or (<= N1 (+ i1 37)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 37)) (<= (+ i2 1) i1))), 152234#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20))) (or (<= N1 (+ i1 20)) (<= (+ i2 18) i1))), 152236#(and (or (<= (+ 16 i2) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 152222#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= N1 (+ i1 8)) (<= (+ 30 i2) i1))), 152227#(and (or (<= (+ i2 25) i1) (<= N1 (+ i1 13))) (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)))] [2022-03-15 21:39:01,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-03-15 21:39:01,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:01,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-03-15 21:39:01,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11836, Invalid=46486, Unknown=0, NotChecked=0, Total=58322 [2022-03-15 21:39:01,269 INFO L87 Difference]: Start difference. First operand 292 states and 619 transitions. Second operand has 83 states, 83 states have (on average 2.036144578313253) internal successors, (169), 82 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:05,353 INFO L93 Difference]: Finished difference Result 566 states and 1122 transitions. [2022-03-15 21:39:05,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-03-15 21:39:05,353 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 2.036144578313253) internal successors, (169), 82 states have internal predecessors, (169), 0 states have call successors, (0), 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 87 [2022-03-15 21:39:05,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:05,354 INFO L225 Difference]: With dead ends: 566 [2022-03-15 21:39:05,354 INFO L226 Difference]: Without dead ends: 565 [2022-03-15 21:39:05,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44551 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=30124, Invalid=98398, Unknown=0, NotChecked=0, Total=128522 [2022-03-15 21:39:05,360 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 351 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:05,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 0 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:39:05,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-03-15 21:39:05,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 253. [2022-03-15 21:39:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 2.1468253968253967) internal successors, (541), 252 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 541 transitions. [2022-03-15 21:39:05,364 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 541 transitions. Word has length 87 [2022-03-15 21:39:05,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:05,364 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 541 transitions. [2022-03-15 21:39:05,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 2.036144578313253) internal successors, (169), 82 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:05,364 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 541 transitions. [2022-03-15 21:39:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-15 21:39:05,365 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:05,365 INFO L514 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:05,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Forceful destruction successful, exit code 0 [2022-03-15 21:39:05,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable119 [2022-03-15 21:39:05,581 INFO L402 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:39:05,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:05,581 INFO L85 PathProgramCache]: Analyzing trace with hash 667759961, now seen corresponding path program 118 times [2022-03-15 21:39:05,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:05,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372603290] [2022-03-15 21:39:05,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:05,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:06,460 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:06,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372603290] [2022-03-15 21:39:06,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372603290] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:06,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156779959] [2022-03-15 21:39:06,460 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:39:06,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:06,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:06,480 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:39:06,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2022-03-15 21:39:06,537 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:39:06,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:06,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 163 conjunts are in the unsatisfiable core [2022-03-15 21:39:06,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:06,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:07,142 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156779959] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:07,142 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:07,142 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 41 [2022-03-15 21:39:07,142 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [227704987] [2022-03-15 21:39:07,143 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:07,154 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:07,321 INFO L252 McrAutomatonBuilder]: Finished intersection with 212 states and 334 transitions. [2022-03-15 21:39:07,322 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:09,108 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:39:09,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 21:39:09,108 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:09,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 21:39:09,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 21:39:09,108 INFO L87 Difference]: Start difference. First operand 253 states and 541 transitions. Second operand has 43 states, 42 states have (on average 4.9523809523809526) internal successors, (208), 42 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:12,127 INFO L93 Difference]: Finished difference Result 821 states and 1594 transitions. [2022-03-15 21:39:12,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 21:39:12,128 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 4.9523809523809526) internal successors, (208), 42 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-03-15 21:39:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:12,128 INFO L225 Difference]: With dead ends: 821 [2022-03-15 21:39:12,128 INFO L226 Difference]: Without dead ends: 735 [2022-03-15 21:39:12,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 334 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 21:39:12,129 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 8244 mSDsCounter, 0 mSdLazyCounter, 13495 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 13496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:12,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 13496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13495 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-03-15 21:39:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-03-15 21:39:12,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 534. [2022-03-15 21:39:12,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 2.292682926829268) internal successors, (1222), 533 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1222 transitions. [2022-03-15 21:39:12,134 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 1222 transitions. Word has length 88 [2022-03-15 21:39:12,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:12,134 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 1222 transitions. [2022-03-15 21:39:12,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 4.9523809523809526) internal successors, (208), 42 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 1222 transitions. [2022-03-15 21:39:12,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-03-15 21:39:12,134 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:12,135 INFO L514 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:12,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Forceful destruction successful, exit code 0 [2022-03-15 21:39:12,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,120 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:12,351 INFO L402 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:39:12,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:12,351 INFO L85 PathProgramCache]: Analyzing trace with hash -818262888, now seen corresponding path program 119 times [2022-03-15 21:39:12,352 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:12,352 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943359159] [2022-03-15 21:39:12,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:12,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:13,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 820 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:13,776 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:13,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943359159] [2022-03-15 21:39:13,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943359159] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:13,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836407057] [2022-03-15 21:39:13,776 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:39:13,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:13,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:13,778 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:39:13,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2022-03-15 21:39:13,846 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2022-03-15 21:39:13,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:13,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 85 conjunts are in the unsatisfiable core [2022-03-15 21:39:13,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 820 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:16,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:18,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836407057] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:18,215 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:18,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 83, 83] total 207 [2022-03-15 21:39:18,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2083380510] [2022-03-15 21:39:18,215 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:18,226 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:18,455 INFO L252 McrAutomatonBuilder]: Finished intersection with 214 states and 337 transitions. [2022-03-15 21:39:18,456 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:23,856 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 83 new interpolants: [156831#(or (<= (+ 41 i2) N2) (< (+ 40 i1) N1) (<= N1 (+ i1 39))), 156757#(or (<= (+ 7 i2) N2) (< i1 N1)), 156788#(or (<= (+ i2 38) N2) (< i1 N1)), 156782#(or (<= (+ 32 i2) N2) (< i1 N1)), 156811#(or (<= N1 (+ 19 i1)) (<= (+ 41 i2) N2) (< (+ i1 20) N1)), 156779#(or (<= (+ 29 i2) N2) (< i1 N1)), 156768#(or (< i1 N1) (<= (+ i2 18) N2)), 156777#(or (<= (+ i2 27) N2) (< i1 N1)), 156778#(or (< i1 N1) (<= (+ i2 28) N2)), 156827#(or (<= N1 (+ 35 i1)) (< (+ i1 36) N1) (<= (+ 41 i2) N2)), 156815#(or (<= (+ 41 i2) N2) (< (+ i1 24) N1) (<= N1 (+ 23 i1))), 156784#(or (<= (+ i2 34) N2) (< i1 N1)), 156767#(or (< i1 N1) (<= (+ i2 17) N2)), 156820#(or (<= (+ 41 i2) N2) (<= N1 (+ i1 28)) (< (+ 29 i1) N1)), 156830#(or (<= (+ 41 i2) N2) (< (+ i1 39) N1) (<= N1 (+ i1 38))), 156765#(or (<= (+ i2 15) N2) (< i1 N1)), 156804#(or (<= (+ 41 i2) N2) (<= N1 (+ i1 12)) (< (+ i1 13) N1)), 156794#(or (<= (+ 41 i2) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 156771#(or (<= (+ 21 i2) N2) (< i1 N1)), 156773#(or (<= (+ 23 i2) N2) (< i1 N1)), 156790#(or (<= (+ 40 i2) N2) (< i1 N1)), 156780#(or (<= (+ 30 i2) N2) (< i1 N1)), 156819#(or (<= N1 (+ i1 27)) (<= (+ 41 i2) N2) (< (+ i1 28) N1)), 156783#(or (<= (+ i2 33) N2) (< i1 N1)), 156755#(or (< i1 N1) (<= (+ 5 i2) N2)), 156805#(or (<= N1 (+ i1 13)) (<= (+ 41 i2) N2) (< (+ 14 i1) N1)), 156776#(or (<= (+ i2 26) N2) (< i1 N1)), 156781#(or (<= (+ i2 31) N2) (< i1 N1)), 156829#(or (<= N1 (+ i1 37)) (<= (+ 41 i2) N2) (< (+ i1 38) N1)), 156807#(or (< (+ 16 i1) N1) (<= (+ 41 i2) N2) (<= N1 (+ i1 15))), 156796#(or (<= N1 (+ i1 4)) (<= (+ 41 i2) N2) (< (+ 5 i1) N1)), 156806#(or (<= N1 (+ 14 i1)) (<= (+ 41 i2) N2) (< (+ i1 15) N1)), 156817#(or (< (+ i1 26) N1) (<= N1 (+ i1 25)) (<= (+ 41 i2) N2)), 156762#(or (<= (+ i2 12) N2) (< i1 N1)), 156756#(or (< i1 N1) (<= (+ 6 i2) N2)), 156752#(or (< i1 N1) (<= (+ 2 i2) N2)), 156810#(or (<= (+ 41 i2) N2) (<= N1 (+ i1 18)) (< (+ 19 i1) N1)), 156786#(or (< i1 N1) (<= (+ i2 36) N2)), 156761#(or (<= (+ i2 11) N2) (< i1 N1)), 156789#(or (<= (+ i2 39) N2) (< i1 N1)), 156818#(or (<= (+ 41 i2) N2) (<= N1 (+ i1 26)) (< (+ i1 27) N1)), 156828#(or (< (+ i1 37) N1) (<= (+ 41 i2) N2) (<= N1 (+ i1 36))), 156764#(or (<= (+ 14 i2) N2) (< i1 N1)), 156832#(or (<= N1 (+ 40 i1)) (<= (+ 41 i2) N2) (< (+ 41 i1) N1)), 156808#(or (< (+ i1 17) N1) (<= (+ 41 i2) N2) (<= N1 (+ 16 i1))), 156813#(or (<= N1 (+ 21 i1)) (<= (+ 41 i2) N2) (< (+ 22 i1) N1)), 156753#(or (< i1 N1) (<= (+ 3 i2) N2)), 156760#(or (<= (+ i2 10) N2) (< i1 N1)), 156758#(or (< i1 N1) (<= (+ i2 8) N2)), 156750#(< i1 N1), 156772#(or (<= (+ 22 i2) N2) (< i1 N1)), 156825#(or (<= (+ 41 i2) N2) (<= N1 (+ i1 33)) (< (+ i1 34) N1)), 156791#(or (<= (+ 41 i2) N2) (< i1 N1)), 156800#(or (< (+ 9 i1) N1) (<= (+ 41 i2) N2) (<= N1 (+ i1 8))), 156826#(or (< (+ 35 i1) N1) (<= N1 (+ i1 34)) (<= (+ 41 i2) N2)), 156803#(or (<= (+ 41 i2) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 156785#(or (<= (+ 35 i2) N2) (< i1 N1)), 156769#(or (<= (+ 19 i2) N2) (< i1 N1)), 156759#(or (<= (+ 9 i2) N2) (< i1 N1)), 156751#(or (< i2 N2) (< i1 N1)), 156812#(or (< (+ 21 i1) N1) (<= (+ 41 i2) N2) (<= N1 (+ i1 20))), 156801#(or (<= (+ 41 i2) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 156814#(or (<= (+ 41 i2) N2) (< (+ 23 i1) N1) (<= N1 (+ 22 i1))), 156816#(or (<= (+ 41 i2) N2) (<= N1 (+ i1 24)) (< (+ i1 25) N1)), 156799#(or (<= N1 (+ 7 i1)) (<= (+ 41 i2) N2) (< (+ i1 8) N1)), 156824#(or (<= N1 (+ 32 i1)) (<= (+ 41 i2) N2) (< (+ i1 33) N1)), 156787#(or (<= (+ i2 37) N2) (< i1 N1)), 156795#(or (<= (+ 41 i2) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 156798#(or (<= (+ 41 i2) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 156775#(or (<= (+ i2 25) N2) (< i1 N1)), 156770#(or (<= (+ i2 20) N2) (< i1 N1)), 156766#(or (<= (+ 16 i2) N2) (< i1 N1)), 156754#(or (<= (+ i2 4) N2) (< i1 N1)), 156821#(or (<= N1 (+ 29 i1)) (<= (+ 41 i2) N2) (< (+ 30 i1) N1)), 156774#(or (< i1 N1) (<= (+ i2 24) N2)), 156797#(or (<= (+ 41 i2) N2) (<= N1 (+ 5 i1)) (< (+ 6 i1) N1)), 156792#(or (<= (+ 41 i2) N2) (< (+ i1 1) N1) (<= N1 i1)), 156793#(or (<= (+ 41 i2) N2) (<= N1 (+ i1 1)) (< (+ 2 i1) N1)), 156822#(or (<= N1 (+ 30 i1)) (<= (+ 41 i2) N2) (< (+ i1 31) N1)), 156763#(or (< i1 N1) (<= (+ i2 13) N2)), 156802#(or (<= (+ 41 i2) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 156823#(or (< (+ 32 i1) N1) (<= (+ 41 i2) N2) (<= N1 (+ i1 31))), 156809#(or (< (+ i1 18) N1) (<= (+ 41 i2) N2) (<= N1 (+ i1 17)))] [2022-03-15 21:39:23,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 168 states [2022-03-15 21:39:23,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:23,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2022-03-15 21:39:23,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12756, Invalid=71634, Unknown=0, NotChecked=0, Total=84390 [2022-03-15 21:39:23,860 INFO L87 Difference]: Start difference. First operand 534 states and 1222 transitions. Second operand has 168 states, 168 states have (on average 1.7619047619047619) internal successors, (296), 167 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:36,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:36,661 INFO L93 Difference]: Finished difference Result 1222 states and 2272 transitions. [2022-03-15 21:39:36,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2022-03-15 21:39:36,661 INFO L78 Accepts]: Start accepts. Automaton has has 168 states, 168 states have (on average 1.7619047619047619) internal successors, (296), 167 states have internal predecessors, (296), 0 states have call successors, (0), 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 89 [2022-03-15 21:39:36,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:36,662 INFO L225 Difference]: With dead ends: 1222 [2022-03-15 21:39:36,662 INFO L226 Difference]: Without dead ends: 910 [2022-03-15 21:39:36,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 450 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72344 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=43505, Invalid=160347, Unknown=0, NotChecked=0, Total=203852 [2022-03-15 21:39:36,672 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1840 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 4559 mSolverCounterSat, 1056 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1840 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1056 IncrementalHoareTripleChecker+Valid, 4559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:36,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1840 Valid, 0 Invalid, 5615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1056 Valid, 4559 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 21:39:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2022-03-15 21:39:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 299. [2022-03-15 21:39:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 2.12751677852349) internal successors, (634), 298 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 634 transitions. [2022-03-15 21:39:36,676 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 634 transitions. Word has length 89 [2022-03-15 21:39:36,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:36,677 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 634 transitions. [2022-03-15 21:39:36,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 168 states, 168 states have (on average 1.7619047619047619) internal successors, (296), 167 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:36,677 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 634 transitions. [2022-03-15 21:39:36,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-03-15 21:39:36,677 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:36,677 INFO L514 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:36,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Forceful destruction successful, exit code 0 [2022-03-15 21:39:36,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,121 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:36,882 INFO L402 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:39:36,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:36,883 INFO L85 PathProgramCache]: Analyzing trace with hash -519837044, now seen corresponding path program 120 times [2022-03-15 21:39:36,883 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:36,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555505223] [2022-03-15 21:39:36,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:36,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 821 proven. 860 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:37,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:37,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555505223] [2022-03-15 21:39:37,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555505223] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:37,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328908851] [2022-03-15 21:39:37,925 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:39:37,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:37,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:37,926 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:39:37,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2022-03-15 21:39:37,995 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2022-03-15 21:39:37,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:37,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 85 conjunts are in the unsatisfiable core [2022-03-15 21:39:37,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 821 proven. 860 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:40,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:44,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328908851] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:44,466 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:44,466 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 83, 83] total 206 [2022-03-15 21:39:44,466 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1081538315] [2022-03-15 21:39:44,466 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:44,478 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:44,565 INFO L252 McrAutomatonBuilder]: Finished intersection with 133 states and 175 transitions. [2022-03-15 21:39:44,565 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:47,040 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [159738#(and (or (<= N1 (+ i1 27)) (<= (+ i2 12) i1)) (or (<= N1 (+ i1 27)) (= (+ N1 (* (- 1) N2)) 0))), 159732#(and (or (<= (+ i2 17) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 159739#(and (or (<= N1 (+ i1 28)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 28)) (<= (+ i2 11) i1))), 159737#(and (or (<= N1 (+ i1 26)) (<= (+ i2 13) i1)) (or (<= N1 (+ i1 26)) (= (+ N1 (* (- 1) N2)) 0))), 159721#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ i2 28) i1) (<= N1 (+ i1 11)))), 159713#(and (or (<= N1 (+ 3 i1)) (<= (+ i2 36) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 159742#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 31))) (or (<= (+ i2 8) i1) (<= N1 (+ i1 31)))), 159730#(and (or (<= N1 (+ i1 20)) (<= (+ 19 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20)))), 159745#(and (or (<= N1 (+ i1 34)) (<= (+ 5 i2) i1)) (or (<= N1 (+ i1 34)) (= (+ N1 (* (- 1) N2)) 0))), 159729#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ i2 20) i1))), 159740#(and (or (<= N1 (+ 29 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 29 i1)) (<= (+ i2 10) i1))), 159716#(and (or (<= N1 (+ 6 i1)) (<= (+ i2 33) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 159717#(and (or (<= N1 (+ 7 i1)) (<= (+ 32 i2) i1)) (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0))), 159728#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= (+ 21 i2) i1))), 159744#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 33))) (or (<= (+ 6 i2) i1) (<= N1 (+ i1 33)))), 159722#(and (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 12)) (<= (+ i2 27) i1))), 159749#(and (or (<= N1 (+ i1 38)) (<= (+ i2 1) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 38)))), 159733#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1))) (or (<= (+ 16 i2) i1) (<= N1 (+ 23 i1)))), 159725#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= (+ i2 24) i1) (<= N1 (+ i1 15)))), 159734#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 15) i1) (<= N1 (+ i1 24)))), 159724#(and (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 14 i1)) (<= (+ i2 25) i1))), 159726#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= (+ 23 i2) i1) (<= N1 (+ 16 i1)))), 159741#(and (or (<= (+ 9 i2) i1) (<= N1 (+ 30 i1))) (or (<= N1 (+ 30 i1)) (= (+ N1 (* (- 1) N2)) 0))), 159710#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ i2 39) i1) (<= N1 i1))), 159723#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 13)) (<= (+ i2 26) i1))), 159750#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 39))) (or (<= N1 (+ i1 39)) (<= i2 i1))), 159714#(and (or (<= N1 (+ i1 4)) (<= (+ 35 i2) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 159747#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 36))) (or (<= N1 (+ i1 36)) (<= (+ 3 i2) i1))), 159711#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 38) i1) (<= N1 (+ i1 1)))), 159727#(and (or (<= N1 (+ i1 17)) (<= (+ 22 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 159731#(and (or (<= N1 (+ 21 i1)) (<= (+ i2 18) i1)) (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0))), 159718#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= (+ i2 31) i1) (<= N1 (+ i1 8)))), 159720#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= (+ 29 i2) i1) (<= N1 (+ i1 10)))), 159719#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1))) (or (<= (+ 30 i2) i1) (<= N1 (+ 9 i1)))), 159736#(and (or (<= N1 (+ i1 25)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 25)) (<= (+ 14 i2) i1))), 159735#(< i2 N2), 159743#(and (or (<= N1 (+ 32 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 7 i2) i1) (<= N1 (+ 32 i1)))), 159746#(and (or (<= N1 (+ 35 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 35 i1)) (<= (+ i2 4) i1))), 159712#(and (or (<= (+ i2 37) i1) (<= N1 (+ 2 i1))) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 159748#(and (or (<= N1 (+ i1 37)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 37)) (<= (+ 2 i2) i1))), 159715#(and (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 34) i1) (<= N1 (+ 5 i1))))] [2022-03-15 21:39:47,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-03-15 21:39:47,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:47,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-03-15 21:39:47,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12419, Invalid=48837, Unknown=0, NotChecked=0, Total=61256 [2022-03-15 21:39:47,044 INFO L87 Difference]: Start difference. First operand 299 states and 634 transitions. Second operand has 85 states, 85 states have (on average 2.0352941176470587) internal successors, (173), 84 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:51,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:51,174 INFO L93 Difference]: Finished difference Result 580 states and 1150 transitions. [2022-03-15 21:39:51,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2022-03-15 21:39:51,175 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 2.0352941176470587) internal successors, (173), 84 states have internal predecessors, (173), 0 states have call successors, (0), 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 89 [2022-03-15 21:39:51,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:51,175 INFO L225 Difference]: With dead ends: 580 [2022-03-15 21:39:51,175 INFO L226 Difference]: Without dead ends: 579 [2022-03-15 21:39:51,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 366 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46838 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=31636, Invalid=103420, Unknown=0, NotChecked=0, Total=135056 [2022-03-15 21:39:51,180 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 617 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:51,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 0 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:39:51,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-03-15 21:39:51,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 259. [2022-03-15 21:39:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 2.147286821705426) internal successors, (554), 258 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 554 transitions. [2022-03-15 21:39:51,183 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 554 transitions. Word has length 89 [2022-03-15 21:39:51,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:51,184 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 554 transitions. [2022-03-15 21:39:51,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 2.0352941176470587) internal successors, (173), 84 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 554 transitions. [2022-03-15 21:39:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-03-15 21:39:51,184 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:51,184 INFO L514 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:51,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Forceful destruction successful, exit code 0 [2022-03-15 21:39:51,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2022-03-15 21:39:51,398 INFO L402 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:39:51,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:51,398 INFO L85 PathProgramCache]: Analyzing trace with hash 403569505, now seen corresponding path program 121 times [2022-03-15 21:39:51,399 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:51,399 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793293979] [2022-03-15 21:39:51,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:51,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:52,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:52,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793293979] [2022-03-15 21:39:52,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793293979] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:52,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683649500] [2022-03-15 21:39:52,166 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:39:52,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:52,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:52,168 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:39:52,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2022-03-15 21:39:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:52,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 167 conjunts are in the unsatisfiable core [2022-03-15 21:39:52,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:39:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:52,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:39:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:52,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683649500] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:39:52,581 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:39:52,581 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2022-03-15 21:39:52,582 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [386064242] [2022-03-15 21:39:52,582 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:39:52,593 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:39:52,726 INFO L252 McrAutomatonBuilder]: Finished intersection with 217 states and 342 transitions. [2022-03-15 21:39:52,727 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:39:53,816 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:39:53,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 21:39:53,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:39:53,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 21:39:53,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 21:39:53,817 INFO L87 Difference]: Start difference. First operand 259 states and 554 transitions. Second operand has 44 states, 43 states have (on average 4.953488372093023) internal successors, (213), 43 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 21:39:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:39:56,497 INFO L93 Difference]: Finished difference Result 841 states and 1633 transitions. [2022-03-15 21:39:56,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 21:39:56,498 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 4.953488372093023) internal successors, (213), 43 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) Word has length 90 [2022-03-15 21:39:56,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:39:56,498 INFO L225 Difference]: With dead ends: 841 [2022-03-15 21:39:56,499 INFO L226 Difference]: Without dead ends: 753 [2022-03-15 21:39:56,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 342 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 21:39:56,499 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 123 mSDsluCounter, 8655 mSDsCounter, 0 mSdLazyCounter, 14160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:39:56,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 0 Invalid, 14161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14160 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 21:39:56,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2022-03-15 21:39:56,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 547. [2022-03-15 21:39:56,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 2.293040293040293) internal successors, (1252), 546 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:39:56,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1252 transitions. [2022-03-15 21:39:56,504 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1252 transitions. Word has length 90 [2022-03-15 21:39:56,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:39:56,504 INFO L470 AbstractCegarLoop]: Abstraction has 547 states and 1252 transitions. [2022-03-15 21:39:56,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 4.953488372093023) internal successors, (213), 43 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 21:39:56,504 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1252 transitions. [2022-03-15 21:39:56,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-03-15 21:39:56,505 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:39:56,505 INFO L514 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:39:56,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Forceful destruction successful, exit code 0 [2022-03-15 21:39:56,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:56,720 INFO L402 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:39:56,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:39:56,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1735246112, now seen corresponding path program 122 times [2022-03-15 21:39:56,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:39:56,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268699598] [2022-03-15 21:39:56,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:39:56,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:39:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:39:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:39:58,644 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:39:58,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268699598] [2022-03-15 21:39:58,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268699598] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:39:58,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839283261] [2022-03-15 21:39:58,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:39:58,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:39:58,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:39:58,645 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:39:58,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2022-03-15 21:39:58,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:39:58,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:39:58,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 87 conjunts are in the unsatisfiable core [2022-03-15 21:39:58,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:02,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:04,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839283261] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:04,830 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:04,830 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 85, 85] total 212 [2022-03-15 21:40:04,830 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [928825225] [2022-03-15 21:40:04,830 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:04,842 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:04,989 INFO L252 McrAutomatonBuilder]: Finished intersection with 219 states and 345 transitions. [2022-03-15 21:40:04,989 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:10,474 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 85 new interpolants: [164432#(or (< (+ 35 i1) N1) (<= N1 (+ i1 34)) (<= (+ 42 i2) N2)), 164411#(or (<= N1 (+ i1 13)) (<= (+ 42 i2) N2) (< (+ 14 i1) N1)), 164363#(or (< i1 N1) (<= (+ i2 8) N2)), 164403#(or (<= N1 (+ 5 i1)) (<= (+ 42 i2) N2) (< (+ 6 i1) N1)), 164437#(or (< (+ 40 i1) N1) (<= (+ 42 i2) N2) (<= N1 (+ i1 39))), 164393#(or (<= (+ i2 38) N2) (< i1 N1)), 164400#(or (<= N1 (+ 2 i1)) (<= (+ 42 i2) N2) (< (+ 3 i1) N1)), 164382#(or (<= (+ i2 27) N2) (< i1 N1)), 164412#(or (<= N1 (+ 14 i1)) (< (+ i1 15) N1) (<= (+ 42 i2) N2)), 164399#(or (<= N1 (+ i1 1)) (<= (+ 42 i2) N2) (< (+ 2 i1) N1)), 164428#(or (<= N1 (+ 30 i1)) (<= (+ 42 i2) N2) (< (+ i1 31) N1)), 164384#(or (<= (+ 29 i2) N2) (< i1 N1)), 164431#(or (<= (+ 42 i2) N2) (<= N1 (+ i1 33)) (< (+ i1 34) N1)), 164410#(or (<= N1 (+ i1 12)) (< (+ i1 13) N1) (<= (+ 42 i2) N2)), 164421#(or (< (+ i1 24) N1) (<= (+ 42 i2) N2) (<= N1 (+ 23 i1))), 164388#(or (<= (+ i2 33) N2) (< i1 N1)), 164398#(or (< (+ i1 1) N1) (<= (+ 42 i2) N2) (<= N1 i1)), 164376#(or (<= (+ 21 i2) N2) (< i1 N1)), 164404#(or (< (+ 7 i1) N1) (<= (+ 42 i2) N2) (<= N1 (+ 6 i1))), 164370#(or (<= (+ i2 15) N2) (< i1 N1)), 164438#(or (<= N1 (+ 40 i1)) (<= (+ 42 i2) N2) (< (+ 41 i1) N1)), 164396#(or (<= (+ 41 i2) N2) (< i1 N1)), 164360#(or (< i1 N1) (<= (+ 5 i2) N2)), 164390#(or (<= (+ 35 i2) N2) (< i1 N1)), 164373#(or (< i1 N1) (<= (+ i2 18) N2)), 164381#(or (<= (+ i2 26) N2) (< i1 N1)), 164372#(or (< i1 N1) (<= (+ i2 17) N2)), 164401#(or (<= (+ 42 i2) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1)), 164418#(or (< (+ 21 i1) N1) (<= (+ 42 i2) N2) (<= N1 (+ i1 20))), 164408#(or (<= (+ 42 i2) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 164433#(or (<= N1 (+ 35 i1)) (< (+ i1 36) N1) (<= (+ 42 i2) N2)), 164425#(or (<= N1 (+ i1 27)) (< (+ i1 28) N1) (<= (+ 42 i2) N2)), 164374#(or (<= (+ 19 i2) N2) (< i1 N1)), 164409#(or (<= (+ 42 i2) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 164369#(or (<= (+ 14 i2) N2) (< i1 N1)), 164397#(or (<= (+ 42 i2) N2) (< i1 N1)), 164402#(or (<= N1 (+ i1 4)) (<= (+ 42 i2) N2) (< (+ 5 i1) N1)), 164389#(or (<= (+ i2 34) N2) (< i1 N1)), 164395#(or (<= (+ 40 i2) N2) (< i1 N1)), 164375#(or (<= (+ i2 20) N2) (< i1 N1)), 164407#(or (<= (+ 42 i2) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 164420#(or (< (+ 23 i1) N1) (<= (+ 42 i2) N2) (<= N1 (+ 22 i1))), 164434#(or (< (+ i1 37) N1) (<= (+ 42 i2) N2) (<= N1 (+ i1 36))), 164416#(or (<= N1 (+ i1 18)) (<= (+ 42 i2) N2) (< (+ 19 i1) N1)), 164359#(or (<= (+ i2 4) N2) (< i1 N1)), 164358#(or (< i1 N1) (<= (+ 3 i2) N2)), 164387#(or (<= (+ 32 i2) N2) (< i1 N1)), 164406#(or (< (+ 9 i1) N1) (<= (+ 42 i2) N2) (<= N1 (+ i1 8))), 164415#(or (< (+ i1 18) N1) (<= (+ 42 i2) N2) (<= N1 (+ i1 17))), 164413#(or (< (+ 16 i1) N1) (<= (+ 42 i2) N2) (<= N1 (+ i1 15))), 164419#(or (<= N1 (+ 21 i1)) (<= (+ 42 i2) N2) (< (+ 22 i1) N1)), 164379#(or (< i1 N1) (<= (+ i2 24) N2)), 164436#(or (<= (+ 42 i2) N2) (< (+ i1 39) N1) (<= N1 (+ i1 38))), 164361#(or (< i1 N1) (<= (+ 6 i2) N2)), 164368#(or (< i1 N1) (<= (+ i2 13) N2)), 164391#(or (< i1 N1) (<= (+ i2 36) N2)), 164380#(or (<= (+ i2 25) N2) (< i1 N1)), 164429#(or (< (+ 32 i1) N1) (<= (+ 42 i2) N2) (<= N1 (+ i1 31))), 164362#(or (<= (+ 7 i2) N2) (< i1 N1)), 164366#(or (<= (+ i2 11) N2) (< i1 N1)), 164423#(or (< (+ i1 26) N1) (<= N1 (+ i1 25)) (<= (+ 42 i2) N2)), 164405#(or (<= N1 (+ 7 i1)) (<= (+ 42 i2) N2) (< (+ i1 8) N1)), 164383#(or (< i1 N1) (<= (+ i2 28) N2)), 164392#(or (<= (+ i2 37) N2) (< i1 N1)), 164371#(or (<= (+ 16 i2) N2) (< i1 N1)), 164430#(or (<= N1 (+ 32 i1)) (<= (+ 42 i2) N2) (< (+ i1 33) N1)), 164426#(or (<= N1 (+ i1 28)) (<= (+ 42 i2) N2) (< (+ 29 i1) N1)), 164394#(or (<= (+ i2 39) N2) (< i1 N1)), 164367#(or (<= (+ i2 12) N2) (< i1 N1)), 164435#(or (<= N1 (+ i1 37)) (<= (+ 42 i2) N2) (< (+ i1 38) N1)), 164439#(or (<= N1 (+ 41 i1)) (<= (+ 42 i2) N2) (< (+ 42 i1) N1)), 164377#(or (<= (+ 22 i2) N2) (< i1 N1)), 164427#(or (<= N1 (+ 29 i1)) (<= (+ 42 i2) N2) (< (+ 30 i1) N1)), 164365#(or (<= (+ i2 10) N2) (< i1 N1)), 164424#(or (<= N1 (+ i1 26)) (<= (+ 42 i2) N2) (< (+ i1 27) N1)), 164357#(or (< i1 N1) (<= (+ 2 i2) N2)), 164364#(or (<= (+ 9 i2) N2) (< i1 N1)), 164378#(or (<= (+ 23 i2) N2) (< i1 N1)), 164355#(< i1 N1), 164385#(or (<= (+ 30 i2) N2) (< i1 N1)), 164386#(or (<= (+ i2 31) N2) (< i1 N1)), 164414#(or (< (+ i1 17) N1) (<= (+ 42 i2) N2) (<= N1 (+ 16 i1))), 164417#(or (<= N1 (+ 19 i1)) (< (+ i1 20) N1) (<= (+ 42 i2) N2)), 164356#(or (< i2 N2) (< i1 N1)), 164422#(or (<= N1 (+ i1 24)) (<= (+ 42 i2) N2) (< (+ i1 25) N1))] [2022-03-15 21:40:10,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 172 states [2022-03-15 21:40:10,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:10,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2022-03-15 21:40:10,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13361, Invalid=75145, Unknown=0, NotChecked=0, Total=88506 [2022-03-15 21:40:10,531 INFO L87 Difference]: Start difference. First operand 547 states and 1252 transitions. Second operand has 172 states, 172 states have (on average 1.7616279069767442) internal successors, (303), 171 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:23,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:23,097 INFO L93 Difference]: Finished difference Result 1252 states and 2328 transitions. [2022-03-15 21:40:23,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2022-03-15 21:40:23,097 INFO L78 Accepts]: Start accepts. Automaton has has 172 states, 172 states have (on average 1.7616279069767442) internal successors, (303), 171 states have internal predecessors, (303), 0 states have call successors, (0), 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 91 [2022-03-15 21:40:23,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:23,098 INFO L225 Difference]: With dead ends: 1252 [2022-03-15 21:40:23,098 INFO L226 Difference]: Without dead ends: 932 [2022-03-15 21:40:23,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 461 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75956 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=45637, Invalid=168269, Unknown=0, NotChecked=0, Total=213906 [2022-03-15 21:40:23,108 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2037 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 4816 mSolverCounterSat, 1105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2037 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1105 IncrementalHoareTripleChecker+Valid, 4816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:23,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2037 Valid, 0 Invalid, 5921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1105 Valid, 4816 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 21:40:23,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-03-15 21:40:23,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 306. [2022-03-15 21:40:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 2.1278688524590166) internal successors, (649), 305 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 649 transitions. [2022-03-15 21:40:23,112 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 649 transitions. Word has length 91 [2022-03-15 21:40:23,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:23,113 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 649 transitions. [2022-03-15 21:40:23,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 172 states, 172 states have (on average 1.7616279069767442) internal successors, (303), 171 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:23,113 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 649 transitions. [2022-03-15 21:40:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-03-15 21:40:23,113 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:23,113 INFO L514 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:23,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Ended with exit code 0 [2022-03-15 21:40:23,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2022-03-15 21:40:23,329 INFO L402 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:23,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:23,329 INFO L85 PathProgramCache]: Analyzing trace with hash 585550966, now seen corresponding path program 123 times [2022-03-15 21:40:23,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:23,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080706492] [2022-03-15 21:40:23,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:23,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 862 proven. 902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:24,295 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:24,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080706492] [2022-03-15 21:40:24,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080706492] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:24,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467101417] [2022-03-15 21:40:24,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:40:24,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:24,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:24,296 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:40:24,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-03-15 21:40:24,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2022-03-15 21:40:24,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:24,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 87 conjunts are in the unsatisfiable core [2022-03-15 21:40:24,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 862 proven. 902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:28,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:31,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467101417] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:31,571 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:31,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 85, 85] total 211 [2022-03-15 21:40:31,571 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1876387356] [2022-03-15 21:40:31,571 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:31,583 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:31,676 INFO L252 McrAutomatonBuilder]: Finished intersection with 136 states and 179 transitions. [2022-03-15 21:40:31,676 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:34,164 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 42 new interpolants: [167391#(and (or (<= N1 (+ i1 4)) (<= (+ i2 36) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 167410#(and (or (<= N1 (+ 23 i1)) (<= (+ i2 17) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1)))), 167406#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ 21 i2) i1))), 167408#(and (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 21 i1)) (<= (+ 19 i2) i1))), 167398#(and (or (<= (+ 29 i2) i1) (<= N1 (+ i1 11))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11)))), 167425#(and (or (<= (+ 2 i2) i1) (<= N1 (+ i1 38))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 38)))), 167397#(and (or (<= (+ 30 i2) i1) (<= N1 (+ i1 10))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10)))), 167424#(and (or (<= N1 (+ i1 37)) (<= (+ 3 i2) i1)) (or (<= N1 (+ i1 37)) (= (+ N1 (* (- 1) N2)) 0))), 167405#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= (+ 22 i2) i1))), 167416#(and (or (<= N1 (+ 29 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 29 i1)) (<= (+ i2 11) i1))), 167419#(and (or (<= N1 (+ 32 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 32 i1)) (<= (+ i2 8) i1))), 167417#(and (or (<= N1 (+ 30 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 30 i1)) (<= (+ i2 10) i1))), 167423#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 36))) (or (<= (+ i2 4) i1) (<= N1 (+ i1 36)))), 167396#(and (or (<= (+ i2 31) i1) (<= N1 (+ 9 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 167403#(and (or (<= (+ i2 24) i1) (<= N1 (+ 16 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1)))), 167395#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= (+ 32 i2) i1) (<= N1 (+ i1 8)))), 167400#(and (or (<= N1 (+ i1 13)) (<= (+ i2 27) i1)) (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0))), 167426#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 39))) (or (<= N1 (+ i1 39)) (<= (+ i2 1) i1))), 167414#(and (or (<= N1 (+ i1 27)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 27)) (<= (+ i2 13) i1))), 167390#(and (or (<= (+ i2 37) i1) (<= N1 (+ 3 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 167422#(and (or (<= N1 (+ 35 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 35 i1)) (<= (+ 5 i2) i1))), 167399#(and (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 28) i1) (<= N1 (+ i1 12)))), 167413#(and (or (<= N1 (+ i1 26)) (<= (+ 14 i2) i1)) (or (<= N1 (+ i1 26)) (= (+ N1 (* (- 1) N2)) 0))), 167401#(and (or (<= N1 (+ 14 i1)) (<= (+ i2 26) i1)) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0))), 167386#(< i2 N2), 167415#(and (or (<= N1 (+ i1 28)) (<= (+ i2 12) i1)) (or (<= N1 (+ i1 28)) (= (+ N1 (* (- 1) N2)) 0))), 167392#(and (or (<= N1 (+ 5 i1)) (<= (+ 35 i2) i1)) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 167394#(and (or (<= N1 (+ 7 i1)) (<= (+ i2 33) i1)) (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0))), 167418#(and (or (<= (+ 9 i2) i1) (<= N1 (+ i1 31))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 31)))), 167409#(and (or (<= N1 (+ 22 i1)) (<= (+ i2 18) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 167393#(and (or (<= (+ i2 34) i1) (<= N1 (+ 6 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 167402#(and (or (<= (+ i2 25) i1) (<= N1 (+ i1 15))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15)))), 167421#(and (or (<= N1 (+ i1 34)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 34)) (<= (+ 6 i2) i1))), 167387#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ 40 i2) i1) (<= N1 i1))), 167404#(and (or (<= N1 (+ i1 17)) (<= (+ 23 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 167407#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20))) (or (<= N1 (+ i1 20)) (<= (+ i2 20) i1))), 167420#(and (or (<= (+ 7 i2) i1) (<= N1 (+ i1 33))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 33)))), 167411#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 24)) (<= (+ 16 i2) i1))), 167427#(and (or (<= N1 (+ 40 i1)) (<= i2 i1)) (or (<= N1 (+ 40 i1)) (= (+ N1 (* (- 1) N2)) 0))), 167412#(and (or (<= N1 (+ i1 25)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 15) i1) (<= N1 (+ i1 25)))), 167389#(and (or (<= (+ i2 38) i1) (<= N1 (+ 2 i1))) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 167388#(and (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 1)) (<= (+ i2 39) i1)))] [2022-03-15 21:40:34,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-03-15 21:40:34,165 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:34,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-03-15 21:40:34,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13016, Invalid=51246, Unknown=0, NotChecked=0, Total=64262 [2022-03-15 21:40:34,168 INFO L87 Difference]: Start difference. First operand 306 states and 649 transitions. Second operand has 87 states, 87 states have (on average 2.0344827586206895) internal successors, (177), 86 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:38,999 INFO L93 Difference]: Finished difference Result 594 states and 1178 transitions. [2022-03-15 21:40:38,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2022-03-15 21:40:38,999 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 2.0344827586206895) internal successors, (177), 86 states have internal predecessors, (177), 0 states have call successors, (0), 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 91 [2022-03-15 21:40:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:39,000 INFO L225 Difference]: With dead ends: 594 [2022-03-15 21:40:39,000 INFO L226 Difference]: Without dead ends: 593 [2022-03-15 21:40:39,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49171 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=33185, Invalid=108567, Unknown=0, NotChecked=0, Total=141752 [2022-03-15 21:40:39,004 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 509 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:39,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 0 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:40:39,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-03-15 21:40:39,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 265. [2022-03-15 21:40:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 2.147727272727273) internal successors, (567), 264 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:39,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 567 transitions. [2022-03-15 21:40:39,007 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 567 transitions. Word has length 91 [2022-03-15 21:40:39,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:39,007 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 567 transitions. [2022-03-15 21:40:39,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 2.0344827586206895) internal successors, (177), 86 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:39,007 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 567 transitions. [2022-03-15 21:40:39,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-03-15 21:40:39,008 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:39,008 INFO L514 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:39,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Ended with exit code 0 [2022-03-15 21:40:39,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2022-03-15 21:40:39,215 INFO L402 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:39,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:39,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2041860633, now seen corresponding path program 124 times [2022-03-15 21:40:39,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:39,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261157354] [2022-03-15 21:40:39,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:39,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:40,072 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:40,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261157354] [2022-03-15 21:40:40,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261157354] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:40,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177070854] [2022-03-15 21:40:40,073 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:40:40,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:40,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:40,074 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:40:40,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-03-15 21:40:40,130 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:40:40,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:40,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 171 conjunts are in the unsatisfiable core [2022-03-15 21:40:40,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:40,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:40,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177070854] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:40,746 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:40,746 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 43 [2022-03-15 21:40:40,746 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1800161514] [2022-03-15 21:40:40,746 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:40,758 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:40,901 INFO L252 McrAutomatonBuilder]: Finished intersection with 222 states and 350 transitions. [2022-03-15 21:40:40,901 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:40:42,682 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:40:42,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 21:40:42,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:40:42,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 21:40:42,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:40:42,683 INFO L87 Difference]: Start difference. First operand 265 states and 567 transitions. Second operand has 45 states, 44 states have (on average 4.954545454545454) internal successors, (218), 44 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:46,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:40:46,282 INFO L93 Difference]: Finished difference Result 861 states and 1672 transitions. [2022-03-15 21:40:46,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 21:40:46,282 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 4.954545454545454) internal successors, (218), 44 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2022-03-15 21:40:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:40:46,283 INFO L225 Difference]: With dead ends: 861 [2022-03-15 21:40:46,283 INFO L226 Difference]: Without dead ends: 771 [2022-03-15 21:40:46,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:40:46,284 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 126 mSDsluCounter, 9076 mSDsCounter, 0 mSdLazyCounter, 14841 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:40:46,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 0 Invalid, 14842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14841 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-03-15 21:40:46,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2022-03-15 21:40:46,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 560. [2022-03-15 21:40:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 2.2933810375670842) internal successors, (1282), 559 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1282 transitions. [2022-03-15 21:40:46,289 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1282 transitions. Word has length 92 [2022-03-15 21:40:46,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:40:46,289 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 1282 transitions. [2022-03-15 21:40:46,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 4.954545454545454) internal successors, (218), 44 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:40:46,289 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1282 transitions. [2022-03-15 21:40:46,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-15 21:40:46,290 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:40:46,290 INFO L514 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:40:46,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Ended with exit code 0 [2022-03-15 21:40:46,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126 [2022-03-15 21:40:46,491 INFO L402 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:40:46,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:40:46,491 INFO L85 PathProgramCache]: Analyzing trace with hash -365579816, now seen corresponding path program 125 times [2022-03-15 21:40:46,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:40:46,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539926287] [2022-03-15 21:40:46,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:40:46,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:40:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:40:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 903 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:48,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:40:48,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539926287] [2022-03-15 21:40:48,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539926287] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:40:48,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231613680] [2022-03-15 21:40:48,609 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:40:48,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:40:48,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:40:48,610 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:40:48,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2022-03-15 21:40:48,679 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-03-15 21:40:48,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:40:48,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 89 conjunts are in the unsatisfiable core [2022-03-15 21:40:48,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:40:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 903 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:53,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:40:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:40:55,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231613680] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:40:55,838 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:40:55,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 87, 87] total 217 [2022-03-15 21:40:55,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1317018272] [2022-03-15 21:40:55,838 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:40:55,851 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:40:56,000 INFO L252 McrAutomatonBuilder]: Finished intersection with 224 states and 353 transitions. [2022-03-15 21:40:56,001 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:02,998 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 87 new interpolants: [172181#(or (<= (+ 41 i2) N2) (< i1 N1)), 172154#(or (<= (+ 14 i2) N2) (< i1 N1)), 172209#(or (< (+ i1 26) N1) (<= N1 (+ i1 25)) (<= (+ i2 43) N2)), 172155#(or (<= (+ i2 15) N2) (< i1 N1)), 172192#(or (< (+ 9 i1) N1) (<= N1 (+ i1 8)) (<= (+ i2 43) N2)), 172190#(or (< (+ 7 i1) N1) (<= N1 (+ 6 i1)) (<= (+ i2 43) N2)), 172202#(or (<= N1 (+ i1 18)) (< (+ 19 i1) N1) (<= (+ i2 43) N2)), 172173#(or (<= (+ i2 33) N2) (< i1 N1)), 172210#(or (<= N1 (+ i1 26)) (< (+ i1 27) N1) (<= (+ i2 43) N2)), 172167#(or (<= (+ i2 27) N2) (< i1 N1)), 172208#(or (<= N1 (+ i1 24)) (<= (+ i2 43) N2) (< (+ i1 25) N1)), 172144#(or (<= (+ i2 4) N2) (< i1 N1)), 172195#(or (<= (+ i2 43) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 172201#(or (< (+ i1 18) N1) (<= N1 (+ i1 17)) (<= (+ i2 43) N2)), 172158#(or (< i1 N1) (<= (+ i2 18) N2)), 172176#(or (< i1 N1) (<= (+ i2 36) N2)), 172186#(or (<= N1 (+ 2 i1)) (<= (+ i2 43) N2) (< (+ 3 i1) N1)), 172218#(or (< (+ 35 i1) N1) (<= N1 (+ i1 34)) (<= (+ i2 43) N2)), 172166#(or (<= (+ i2 26) N2) (< i1 N1)), 172223#(or (< (+ 40 i1) N1) (<= (+ i2 43) N2) (<= N1 (+ i1 39))), 172183#(or (< i1 N1) (<= (+ i2 43) N2)), 172203#(or (<= N1 (+ 19 i1)) (< (+ i1 20) N1) (<= (+ i2 43) N2)), 172219#(or (<= N1 (+ 35 i1)) (< (+ i1 36) N1) (<= (+ i2 43) N2)), 172185#(or (<= N1 (+ i1 1)) (<= (+ i2 43) N2) (< (+ 2 i1) N1)), 172212#(or (<= N1 (+ i1 28)) (< (+ 29 i1) N1) (<= (+ i2 43) N2)), 172141#(or (< i2 N2) (< i1 N1)), 172191#(or (<= N1 (+ 7 i1)) (< (+ i1 8) N1) (<= (+ i2 43) N2)), 172213#(or (<= N1 (+ 29 i1)) (< (+ 30 i1) N1) (<= (+ i2 43) N2)), 172180#(or (<= (+ 40 i2) N2) (< i1 N1)), 172177#(or (<= (+ i2 37) N2) (< i1 N1)), 172159#(or (<= (+ 19 i2) N2) (< i1 N1)), 172220#(or (< (+ i1 37) N1) (<= (+ i2 43) N2) (<= N1 (+ i1 36))), 172193#(or (<= N1 (+ 9 i1)) (<= (+ i2 43) N2) (< (+ i1 10) N1)), 172214#(or (<= N1 (+ 30 i1)) (<= (+ i2 43) N2) (< (+ i1 31) N1)), 172198#(or (<= N1 (+ 14 i1)) (< (+ i1 15) N1) (<= (+ i2 43) N2)), 172216#(or (<= N1 (+ 32 i1)) (<= (+ i2 43) N2) (< (+ i1 33) N1)), 172225#(or (<= N1 (+ 41 i1)) (< (+ 42 i1) N1) (<= (+ i2 43) N2)), 172152#(or (<= (+ i2 12) N2) (< i1 N1)), 172194#(or (< (+ i1 11) N1) (<= (+ i2 43) N2) (<= N1 (+ i1 10))), 172187#(or (<= N1 (+ 3 i1)) (<= (+ i2 43) N2) (< (+ i1 4) N1)), 172150#(or (<= (+ i2 10) N2) (< i1 N1)), 172157#(or (< i1 N1) (<= (+ i2 17) N2)), 172182#(or (<= (+ 42 i2) N2) (< i1 N1)), 172197#(or (<= N1 (+ i1 13)) (<= (+ i2 43) N2) (< (+ 14 i1) N1)), 172149#(or (<= (+ 9 i2) N2) (< i1 N1)), 172199#(or (< (+ 16 i1) N1) (<= (+ i2 43) N2) (<= N1 (+ i1 15))), 172211#(or (<= N1 (+ i1 27)) (< (+ i1 28) N1) (<= (+ i2 43) N2)), 172153#(or (< i1 N1) (<= (+ i2 13) N2)), 172206#(or (< (+ 23 i1) N1) (<= (+ i2 43) N2) (<= N1 (+ 22 i1))), 172226#(or (<= N1 (+ 42 i1)) (< (+ i1 43) N1) (<= (+ i2 43) N2)), 172147#(or (<= (+ 7 i2) N2) (< i1 N1)), 172205#(or (<= N1 (+ 21 i1)) (<= (+ i2 43) N2) (< (+ 22 i1) N1)), 172160#(or (<= (+ i2 20) N2) (< i1 N1)), 172179#(or (<= (+ i2 39) N2) (< i1 N1)), 172224#(or (<= N1 (+ 40 i1)) (< (+ 41 i1) N1) (<= (+ i2 43) N2)), 172145#(or (< i1 N1) (<= (+ 5 i2) N2)), 172151#(or (<= (+ i2 11) N2) (< i1 N1)), 172169#(or (<= (+ 29 i2) N2) (< i1 N1)), 172217#(or (<= N1 (+ i1 33)) (<= (+ i2 43) N2) (< (+ i1 34) N1)), 172189#(or (<= N1 (+ 5 i1)) (<= (+ i2 43) N2) (< (+ 6 i1) N1)), 172196#(or (<= N1 (+ i1 12)) (< (+ i1 13) N1) (<= (+ i2 43) N2)), 172140#(< i1 N1), 172221#(or (<= N1 (+ i1 37)) (<= (+ i2 43) N2) (< (+ i1 38) N1)), 172174#(or (<= (+ i2 34) N2) (< i1 N1)), 172204#(or (< (+ 21 i1) N1) (<= N1 (+ i1 20)) (<= (+ i2 43) N2)), 172184#(or (< (+ i1 1) N1) (<= (+ i2 43) N2) (<= N1 i1)), 172161#(or (<= (+ 21 i2) N2) (< i1 N1)), 172162#(or (<= (+ 22 i2) N2) (< i1 N1)), 172143#(or (< i1 N1) (<= (+ 3 i2) N2)), 172142#(or (< i1 N1) (<= (+ 2 i2) N2)), 172222#(or (<= (+ i2 43) N2) (< (+ i1 39) N1) (<= N1 (+ i1 38))), 172188#(or (<= N1 (+ i1 4)) (<= (+ i2 43) N2) (< (+ 5 i1) N1)), 172165#(or (<= (+ i2 25) N2) (< i1 N1)), 172175#(or (<= (+ 35 i2) N2) (< i1 N1)), 172168#(or (< i1 N1) (<= (+ i2 28) N2)), 172163#(or (<= (+ 23 i2) N2) (< i1 N1)), 172172#(or (<= (+ 32 i2) N2) (< i1 N1)), 172207#(or (< (+ i1 24) N1) (<= N1 (+ 23 i1)) (<= (+ i2 43) N2)), 172200#(or (< (+ i1 17) N1) (<= (+ i2 43) N2) (<= N1 (+ 16 i1))), 172148#(or (< i1 N1) (<= (+ i2 8) N2)), 172170#(or (<= (+ 30 i2) N2) (< i1 N1)), 172164#(or (< i1 N1) (<= (+ i2 24) N2)), 172215#(or (< (+ 32 i1) N1) (<= N1 (+ i1 31)) (<= (+ i2 43) N2)), 172146#(or (< i1 N1) (<= (+ 6 i2) N2)), 172178#(or (<= (+ i2 38) N2) (< i1 N1)), 172171#(or (<= (+ i2 31) N2) (< i1 N1)), 172156#(or (<= (+ 16 i2) N2) (< i1 N1))] [2022-03-15 21:41:02,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 176 states [2022-03-15 21:41:03,000 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:03,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2022-03-15 21:41:03,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13980, Invalid=78740, Unknown=0, NotChecked=0, Total=92720 [2022-03-15 21:41:03,008 INFO L87 Difference]: Start difference. First operand 560 states and 1282 transitions. Second operand has 176 states, 176 states have (on average 1.7613636363636365) internal successors, (310), 175 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:15,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:15,783 INFO L93 Difference]: Finished difference Result 1282 states and 2384 transitions. [2022-03-15 21:41:15,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2022-03-15 21:41:15,783 INFO L78 Accepts]: Start accepts. Automaton has has 176 states, 176 states have (on average 1.7613636363636365) internal successors, (310), 175 states have internal predecessors, (310), 0 states have call successors, (0), 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 93 [2022-03-15 21:41:15,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:15,784 INFO L225 Difference]: With dead ends: 1282 [2022-03-15 21:41:15,784 INFO L226 Difference]: Without dead ends: 954 [2022-03-15 21:41:15,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 472 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79656 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=47820, Invalid=176382, Unknown=0, NotChecked=0, Total=224202 [2022-03-15 21:41:15,794 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1996 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 5170 mSolverCounterSat, 1141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1996 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1141 IncrementalHoareTripleChecker+Valid, 5170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:15,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1996 Valid, 0 Invalid, 6311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1141 Valid, 5170 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 21:41:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2022-03-15 21:41:15,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 313. [2022-03-15 21:41:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 2.128205128205128) internal successors, (664), 312 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 664 transitions. [2022-03-15 21:41:15,798 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 664 transitions. Word has length 93 [2022-03-15 21:41:15,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:15,798 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 664 transitions. [2022-03-15 21:41:15,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 176 states, 176 states have (on average 1.7613636363636365) internal successors, (310), 175 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:15,798 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 664 transitions. [2022-03-15 21:41:15,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-15 21:41:15,799 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:15,799 INFO L514 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:15,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Ended with exit code 0 [2022-03-15 21:41:16,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127,127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:16,000 INFO L402 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:16,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:16,001 INFO L85 PathProgramCache]: Analyzing trace with hash 224216076, now seen corresponding path program 126 times [2022-03-15 21:41:16,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:16,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814140460] [2022-03-15 21:41:16,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:16,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 904 proven. 945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:17,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:17,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814140460] [2022-03-15 21:41:17,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814140460] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:17,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222118897] [2022-03-15 21:41:17,095 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:41:17,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:17,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:17,096 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:41:17,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2022-03-15 21:41:17,169 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2022-03-15 21:41:17,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:17,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 89 conjunts are in the unsatisfiable core [2022-03-15 21:41:17,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 904 proven. 945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:20,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:23,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222118897] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:23,955 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:23,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 87, 87] total 216 [2022-03-15 21:41:23,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1204059540] [2022-03-15 21:41:23,956 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:23,974 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:24,078 INFO L252 McrAutomatonBuilder]: Finished intersection with 139 states and 183 transitions. [2022-03-15 21:41:24,078 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:27,206 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [175257#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= (+ i2 26) i1) (<= N1 (+ i1 15)))), 175258#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= (+ i2 25) i1) (<= N1 (+ 16 i1)))), 175270#(and (or (<= N1 (+ i1 28)) (<= (+ i2 13) i1)) (or (<= N1 (+ i1 28)) (= (+ N1 (* (- 1) N2)) 0))), 175262#(and (or (<= (+ 21 i2) i1) (<= N1 (+ i1 20))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20)))), 175284#(< i2 N2), 175273#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 31))) (or (<= N1 (+ i1 31)) (<= (+ i2 10) i1))), 175269#(and (or (<= N1 (+ i1 27)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 27)) (<= (+ 14 i2) i1))), 175280#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 38))) (or (<= N1 (+ i1 38)) (<= (+ 3 i2) i1))), 175250#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= N1 (+ i1 8)) (<= (+ i2 33) i1))), 175276#(and (or (<= N1 (+ i1 34)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ 7 i2) i1) (<= N1 (+ i1 34)))), 175244#(and (or (<= N1 (+ 2 i1)) (<= (+ i2 39) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 175281#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 39))) (or (<= N1 (+ i1 39)) (<= (+ 2 i2) i1))), 175247#(and (or (<= N1 (+ 5 i1)) (<= (+ i2 36) i1)) (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0))), 175271#(and (or (<= N1 (+ 29 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 29 i1)) (<= (+ i2 12) i1))), 175274#(and (or (<= N1 (+ 32 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 32 i1)) (<= (+ 9 i2) i1))), 175264#(and (or (<= (+ 19 i2) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 175252#(and (or (<= (+ i2 31) i1) (<= N1 (+ i1 10))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10)))), 175283#(and (or (<= N1 (+ 41 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 41 i1)) (<= i2 i1))), 175246#(and (or (<= N1 (+ i1 4)) (<= (+ i2 37) i1)) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 175245#(and (or (<= (+ i2 38) i1) (<= N1 (+ 3 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 175275#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 33))) (or (<= (+ i2 8) i1) (<= N1 (+ i1 33)))), 175256#(and (or (<= N1 (+ 14 i1)) (<= (+ i2 27) i1)) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0))), 175261#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ 22 i2) i1))), 175277#(and (or (<= N1 (+ 35 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 35 i1)) (<= (+ 6 i2) i1))), 175263#(and (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 21 i1)) (<= (+ i2 20) i1))), 175272#(and (or (<= N1 (+ 30 i1)) (<= (+ i2 11) i1)) (or (<= N1 (+ 30 i1)) (= (+ N1 (* (- 1) N2)) 0))), 175242#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ 41 i2) i1) (<= N1 i1))), 175260#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= (+ 23 i2) i1))), 175253#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ 30 i2) i1) (<= N1 (+ i1 11)))), 175268#(and (or (<= (+ i2 15) i1) (<= N1 (+ i1 26))) (or (<= N1 (+ i1 26)) (= (+ N1 (* (- 1) N2)) 0))), 175251#(and (or (<= (+ 32 i2) i1) (<= N1 (+ 9 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1)))), 175278#(and (or (<= (+ 5 i2) i1) (<= N1 (+ i1 36))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 36)))), 175243#(and (or (<= N1 (+ i1 1)) (<= (+ 40 i2) i1)) (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0))), 175267#(and (or (<= N1 (+ i1 25)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 25)) (<= (+ 16 i2) i1))), 175279#(and (or (<= N1 (+ i1 37)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 37)) (<= (+ i2 4) i1))), 175248#(and (or (<= N1 (+ 6 i1)) (<= (+ 35 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 175255#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 28) i1) (<= N1 (+ i1 13)))), 175266#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 24)) (<= (+ i2 17) i1))), 175282#(and (or (<= N1 (+ 40 i1)) (<= (+ i2 1) i1)) (or (<= N1 (+ 40 i1)) (= (+ N1 (* (- 1) N2)) 0))), 175259#(and (or (<= (+ i2 24) i1) (<= N1 (+ i1 17))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 175254#(and (or (<= N1 (+ i1 12)) (<= (+ 29 i2) i1)) (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0))), 175249#(and (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 7 i1)) (<= (+ i2 34) i1))), 175265#(and (or (<= N1 (+ 23 i1)) (<= (+ i2 18) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1))))] [2022-03-15 21:41:27,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-03-15 21:41:27,207 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:27,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-03-15 21:41:27,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13627, Invalid=53713, Unknown=0, NotChecked=0, Total=67340 [2022-03-15 21:41:27,212 INFO L87 Difference]: Start difference. First operand 313 states and 664 transitions. Second operand has 89 states, 89 states have (on average 2.033707865168539) internal successors, (181), 88 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:32,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:32,382 INFO L93 Difference]: Finished difference Result 608 states and 1206 transitions. [2022-03-15 21:41:32,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2022-03-15 21:41:32,382 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 2.033707865168539) internal successors, (181), 88 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-03-15 21:41:32,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:32,383 INFO L225 Difference]: With dead ends: 608 [2022-03-15 21:41:32,383 INFO L226 Difference]: Without dead ends: 607 [2022-03-15 21:41:32,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 384 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51631 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=34771, Invalid=113839, Unknown=0, NotChecked=0, Total=148610 [2022-03-15 21:41:32,389 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 647 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:32,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [647 Valid, 0 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:41:32,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2022-03-15 21:41:32,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 271. [2022-03-15 21:41:32,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 2.1481481481481484) internal successors, (580), 270 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:32,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 580 transitions. [2022-03-15 21:41:32,392 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 580 transitions. Word has length 93 [2022-03-15 21:41:32,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:32,392 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 580 transitions. [2022-03-15 21:41:32,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 2.033707865168539) internal successors, (181), 88 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:32,393 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 580 transitions. [2022-03-15 21:41:32,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-03-15 21:41:32,393 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:32,393 INFO L514 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:32,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Forceful destruction successful, exit code 0 [2022-03-15 21:41:32,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128,128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:32,606 INFO L402 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:32,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:32,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1551842849, now seen corresponding path program 127 times [2022-03-15 21:41:32,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:32,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104655074] [2022-03-15 21:41:32,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:32,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:33,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:33,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104655074] [2022-03-15 21:41:33,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104655074] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:33,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679007753] [2022-03-15 21:41:33,456 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:41:33,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:33,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:33,457 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:41:33,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2022-03-15 21:41:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:33,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 175 conjunts are in the unsatisfiable core [2022-03-15 21:41:33,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:33,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:34,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679007753] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:34,149 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:34,149 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2022-03-15 21:41:34,149 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [620379530] [2022-03-15 21:41:34,149 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:34,162 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:34,355 INFO L252 McrAutomatonBuilder]: Finished intersection with 227 states and 358 transitions. [2022-03-15 21:41:34,355 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:35,556 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:41:35,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 21:41:35,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:35,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 21:41:35,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:41:35,557 INFO L87 Difference]: Start difference. First operand 271 states and 580 transitions. Second operand has 46 states, 45 states have (on average 4.955555555555556) internal successors, (223), 45 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:38,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:41:38,646 INFO L93 Difference]: Finished difference Result 881 states and 1711 transitions. [2022-03-15 21:41:38,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 21:41:38,646 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 4.955555555555556) internal successors, (223), 45 states have internal predecessors, (223), 0 states have call successors, (0), 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 94 [2022-03-15 21:41:38,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:41:38,647 INFO L225 Difference]: With dead ends: 881 [2022-03-15 21:41:38,647 INFO L226 Difference]: Without dead ends: 789 [2022-03-15 21:41:38,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 358 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:41:38,648 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 9507 mSDsCounter, 0 mSdLazyCounter, 15538 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 15539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:41:38,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 15539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15538 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-03-15 21:41:38,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2022-03-15 21:41:38,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 573. [2022-03-15 21:41:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 2.2937062937062938) internal successors, (1312), 572 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1312 transitions. [2022-03-15 21:41:38,653 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1312 transitions. Word has length 94 [2022-03-15 21:41:38,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:41:38,653 INFO L470 AbstractCegarLoop]: Abstraction has 573 states and 1312 transitions. [2022-03-15 21:41:38,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 4.955555555555556) internal successors, (223), 45 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:41:38,653 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1312 transitions. [2022-03-15 21:41:38,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-03-15 21:41:38,654 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:41:38,654 INFO L514 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:41:38,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Forceful destruction successful, exit code 0 [2022-03-15 21:41:38,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 129 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable129 [2022-03-15 21:41:38,855 INFO L402 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:41:38,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:41:38,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1306023392, now seen corresponding path program 128 times [2022-03-15 21:41:38,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:41:38,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126942836] [2022-03-15 21:41:38,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:41:38,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:41:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:41:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:40,495 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:41:40,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126942836] [2022-03-15 21:41:40,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126942836] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:41:40,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581666460] [2022-03-15 21:41:40,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:41:40,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:41:40,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:41:40,496 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:41:40,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2022-03-15 21:41:40,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:41:40,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:41:40,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 91 conjunts are in the unsatisfiable core [2022-03-15 21:41:40,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:41:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:45,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:41:47,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:41:47,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581666460] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:41:47,146 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:41:47,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 89, 89] total 222 [2022-03-15 21:41:47,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [447551694] [2022-03-15 21:41:47,146 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:41:47,159 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:41:47,345 INFO L252 McrAutomatonBuilder]: Finished intersection with 229 states and 361 transitions. [2022-03-15 21:41:47,345 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:41:53,513 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 89 new interpolants: [180159#(or (<= (+ 44 i2) N2) (<= N1 (+ 9 i1)) (< (+ i1 10) N1)), 180175#(or (< (+ i1 26) N1) (<= N1 (+ i1 25)) (<= (+ 44 i2) N2)), 180134#(or (<= (+ 29 i2) N2) (< i1 N1)), 180136#(or (<= (+ i2 31) N2) (< i1 N1)), 180170#(or (< (+ 21 i1) N1) (<= (+ 44 i2) N2) (<= N1 (+ i1 20))), 180181#(or (< (+ 32 i1) N1) (<= (+ 44 i2) N2) (<= N1 (+ i1 31))), 180139#(or (<= (+ i2 34) N2) (< i1 N1)), 180161#(or (<= (+ 44 i2) N2) (< (+ i1 12) N1) (<= N1 (+ i1 11))), 180112#(or (<= (+ 7 i2) N2) (< i1 N1)), 180111#(or (< i1 N1) (<= (+ 6 i2) N2)), 180116#(or (<= (+ i2 11) N2) (< i1 N1)), 180146#(or (<= (+ 41 i2) N2) (< i1 N1)), 180188#(or (<= (+ 44 i2) N2) (< (+ i1 39) N1) (<= N1 (+ i1 38))), 180191#(or (<= N1 (+ 41 i1)) (<= (+ 44 i2) N2) (< (+ 42 i1) N1)), 180141#(or (< i1 N1) (<= (+ i2 36) N2)), 180151#(or (<= (+ 44 i2) N2) (<= N1 (+ i1 1)) (< (+ 2 i1) N1)), 180120#(or (<= (+ i2 15) N2) (< i1 N1)), 180186#(or (< (+ i1 37) N1) (<= (+ 44 i2) N2) (<= N1 (+ i1 36))), 180156#(or (<= (+ 44 i2) N2) (< (+ 7 i1) N1) (<= N1 (+ 6 i1))), 180160#(or (<= (+ 44 i2) N2) (< (+ i1 11) N1) (<= N1 (+ i1 10))), 180125#(or (<= (+ i2 20) N2) (< i1 N1)), 180122#(or (< i1 N1) (<= (+ i2 17) N2)), 180115#(or (<= (+ i2 10) N2) (< i1 N1)), 180162#(or (<= (+ 44 i2) N2) (<= N1 (+ i1 12)) (< (+ i1 13) N1)), 180138#(or (<= (+ i2 33) N2) (< i1 N1)), 180143#(or (<= (+ i2 38) N2) (< i1 N1)), 180113#(or (< i1 N1) (<= (+ i2 8) N2)), 180184#(or (< (+ 35 i1) N1) (<= N1 (+ i1 34)) (<= (+ 44 i2) N2)), 180142#(or (<= (+ i2 37) N2) (< i1 N1)), 180155#(or (<= (+ 44 i2) N2) (<= N1 (+ 5 i1)) (< (+ 6 i1) N1)), 180180#(or (<= N1 (+ 30 i1)) (<= (+ 44 i2) N2) (< (+ i1 31) N1)), 180182#(or (<= N1 (+ 32 i1)) (<= (+ 44 i2) N2) (< (+ i1 33) N1)), 180144#(or (<= (+ i2 39) N2) (< i1 N1)), 180132#(or (<= (+ i2 27) N2) (< i1 N1)), 180109#(or (<= (+ i2 4) N2) (< i1 N1)), 180123#(or (< i1 N1) (<= (+ i2 18) N2)), 180126#(or (<= (+ 21 i2) N2) (< i1 N1)), 180135#(or (<= (+ 30 i2) N2) (< i1 N1)), 180158#(or (< (+ 9 i1) N1) (<= (+ 44 i2) N2) (<= N1 (+ i1 8))), 180133#(or (< i1 N1) (<= (+ i2 28) N2)), 180148#(or (< i1 N1) (<= (+ i2 43) N2)), 180150#(or (<= (+ 44 i2) N2) (< (+ i1 1) N1) (<= N1 i1)), 180171#(or (<= N1 (+ 21 i1)) (<= (+ 44 i2) N2) (< (+ 22 i1) N1)), 180185#(or (<= N1 (+ 35 i1)) (< (+ i1 36) N1) (<= (+ 44 i2) N2)), 180187#(or (<= N1 (+ i1 37)) (<= (+ 44 i2) N2) (< (+ i1 38) N1)), 180129#(or (< i1 N1) (<= (+ i2 24) N2)), 180119#(or (<= (+ 14 i2) N2) (< i1 N1)), 180176#(or (<= (+ 44 i2) N2) (<= N1 (+ i1 26)) (< (+ i1 27) N1)), 180167#(or (< (+ i1 18) N1) (<= (+ 44 i2) N2) (<= N1 (+ i1 17))), 180164#(or (<= N1 (+ 14 i1)) (<= (+ 44 i2) N2) (< (+ i1 15) N1)), 180145#(or (<= (+ 40 i2) N2) (< i1 N1)), 180189#(or (<= (+ 44 i2) N2) (< (+ 40 i1) N1) (<= N1 (+ i1 39))), 180121#(or (<= (+ 16 i2) N2) (< i1 N1)), 180173#(or (<= (+ 44 i2) N2) (< (+ i1 24) N1) (<= N1 (+ 23 i1))), 180128#(or (<= (+ 23 i2) N2) (< i1 N1)), 180140#(or (<= (+ 35 i2) N2) (< i1 N1)), 180137#(or (<= (+ 32 i2) N2) (< i1 N1)), 180177#(or (<= N1 (+ i1 27)) (<= (+ 44 i2) N2) (< (+ i1 28) N1)), 180110#(or (< i1 N1) (<= (+ 5 i2) N2)), 180163#(or (<= N1 (+ i1 13)) (<= (+ 44 i2) N2) (< (+ 14 i1) N1)), 180107#(or (< i1 N1) (<= (+ 2 i2) N2)), 180108#(or (< i1 N1) (<= (+ 3 i2) N2)), 180118#(or (< i1 N1) (<= (+ i2 13) N2)), 180179#(or (<= N1 (+ 29 i1)) (<= (+ 44 i2) N2) (< (+ 30 i1) N1)), 180124#(or (<= (+ 19 i2) N2) (< i1 N1)), 180157#(or (<= N1 (+ 7 i1)) (<= (+ 44 i2) N2) (< (+ i1 8) N1)), 180147#(or (<= (+ 42 i2) N2) (< i1 N1)), 180174#(or (<= (+ 44 i2) N2) (<= N1 (+ i1 24)) (< (+ i1 25) N1)), 180114#(or (<= (+ 9 i2) N2) (< i1 N1)), 180172#(or (< (+ 23 i1) N1) (<= (+ 44 i2) N2) (<= N1 (+ 22 i1))), 180117#(or (<= (+ i2 12) N2) (< i1 N1)), 180127#(or (<= (+ 22 i2) N2) (< i1 N1)), 180190#(or (<= N1 (+ 40 i1)) (<= (+ 44 i2) N2) (< (+ 41 i1) N1)), 180131#(or (<= (+ i2 26) N2) (< i1 N1)), 180166#(or (< (+ i1 17) N1) (<= (+ 44 i2) N2) (<= N1 (+ 16 i1))), 180183#(or (<= (+ 44 i2) N2) (<= N1 (+ i1 33)) (< (+ i1 34) N1)), 180165#(or (< (+ 16 i1) N1) (<= (+ 44 i2) N2) (<= N1 (+ i1 15))), 180168#(or (<= (+ 44 i2) N2) (<= N1 (+ i1 18)) (< (+ 19 i1) N1)), 180178#(or (<= (+ 44 i2) N2) (<= N1 (+ i1 28)) (< (+ 29 i1) N1)), 180105#(< i1 N1), 180169#(or (<= N1 (+ 19 i1)) (<= (+ 44 i2) N2) (< (+ i1 20) N1)), 180106#(or (< i2 N2) (< i1 N1)), 180152#(or (<= (+ 44 i2) N2) (<= N1 (+ 2 i1)) (< (+ 3 i1) N1)), 180154#(or (<= N1 (+ i1 4)) (<= (+ 44 i2) N2) (< (+ 5 i1) N1)), 180193#(or (< (+ 44 i1) N1) (<= (+ 44 i2) N2) (<= N1 (+ i1 43))), 180192#(or (<= N1 (+ 42 i1)) (<= (+ 44 i2) N2) (< (+ i1 43) N1)), 180130#(or (<= (+ i2 25) N2) (< i1 N1)), 180149#(or (<= (+ 44 i2) N2) (< i1 N1)), 180153#(or (<= (+ 44 i2) N2) (<= N1 (+ 3 i1)) (< (+ i1 4) N1))] [2022-03-15 21:41:53,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 180 states [2022-03-15 21:41:53,513 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:41:53,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2022-03-15 21:41:53,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14613, Invalid=82419, Unknown=0, NotChecked=0, Total=97032 [2022-03-15 21:41:53,518 INFO L87 Difference]: Start difference. First operand 573 states and 1312 transitions. Second operand has 180 states, 180 states have (on average 1.761111111111111) internal successors, (317), 179 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:07,111 INFO L93 Difference]: Finished difference Result 1312 states and 2440 transitions. [2022-03-15 21:42:07,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2022-03-15 21:42:07,111 INFO L78 Accepts]: Start accepts. Automaton has has 180 states, 180 states have (on average 1.761111111111111) internal successors, (317), 179 states have internal predecessors, (317), 0 states have call successors, (0), 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 95 [2022-03-15 21:42:07,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:07,113 INFO L225 Difference]: With dead ends: 1312 [2022-03-15 21:42:07,113 INFO L226 Difference]: Without dead ends: 976 [2022-03-15 21:42:07,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 483 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83444 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=50054, Invalid=184686, Unknown=0, NotChecked=0, Total=234740 [2022-03-15 21:42:07,123 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2225 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 4934 mSolverCounterSat, 1193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2225 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1193 IncrementalHoareTripleChecker+Valid, 4934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:07,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2225 Valid, 0 Invalid, 6127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1193 Valid, 4934 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 21:42:07,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2022-03-15 21:42:07,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 320. [2022-03-15 21:42:07,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 2.128526645768025) internal successors, (679), 319 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 679 transitions. [2022-03-15 21:42:07,128 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 679 transitions. Word has length 95 [2022-03-15 21:42:07,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:07,128 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 679 transitions. [2022-03-15 21:42:07,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 180 states, 180 states have (on average 1.761111111111111) internal successors, (317), 179 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:07,129 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 679 transitions. [2022-03-15 21:42:07,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-03-15 21:42:07,129 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:07,129 INFO L514 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:07,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Forceful destruction successful, exit code 0 [2022-03-15 21:42:07,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 130 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable130 [2022-03-15 21:42:07,346 INFO L402 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 21:42:07,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:07,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1457310582, now seen corresponding path program 129 times [2022-03-15 21:42:07,347 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:07,347 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94691579] [2022-03-15 21:42:07,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:07,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 947 proven. 989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:08,195 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:08,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94691579] [2022-03-15 21:42:08,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94691579] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:08,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685596103] [2022-03-15 21:42:08,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:42:08,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:08,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:08,196 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:42:08,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2022-03-15 21:42:08,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2022-03-15 21:42:08,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:08,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 91 conjunts are in the unsatisfiable core [2022-03-15 21:42:08,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 947 proven. 989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:11,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:16,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685596103] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:16,095 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:16,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 89, 89] total 221 [2022-03-15 21:42:16,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1764448537] [2022-03-15 21:42:16,095 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:16,108 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:16,212 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 187 transitions. [2022-03-15 21:42:16,212 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:19,133 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 44 new interpolants: [183317#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 39))) (or (<= N1 (+ i1 39)) (<= (+ 3 i2) i1))), 183310#(and (or (<= N1 (+ 32 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 32 i1)) (<= (+ i2 10) i1))), 183294#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 16 i1))) (or (<= (+ i2 26) i1) (<= N1 (+ 16 i1)))), 183300#(and (or (<= (+ i2 20) i1) (<= N1 (+ 22 i1))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 22 i1)))), 183283#(and (or (<= N1 (+ 5 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 37) i1) (<= N1 (+ 5 i1)))), 183304#(and (or (<= N1 (+ i1 26)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 26)) (<= (+ 16 i2) i1))), 183308#(and (or (<= N1 (+ 30 i1)) (<= (+ i2 12) i1)) (or (<= N1 (+ 30 i1)) (= (+ N1 (* (- 1) N2)) 0))), 183313#(and (or (<= N1 (+ 35 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 35 i1)) (<= (+ 7 i2) i1))), 183298#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 20))) (or (<= N1 (+ i1 20)) (<= (+ 22 i2) i1))), 183307#(and (or (<= N1 (+ 29 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 29 i1)) (<= (+ i2 13) i1))), 183312#(and (or (<= N1 (+ i1 34)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 34)) (<= (+ i2 8) i1))), 183319#(and (or (<= N1 (+ 41 i1)) (<= (+ i2 1) i1)) (or (<= N1 (+ 41 i1)) (= (+ N1 (* (- 1) N2)) 0))), 183315#(and (or (<= N1 (+ i1 37)) (<= (+ 5 i2) i1)) (or (<= N1 (+ i1 37)) (= (+ N1 (* (- 1) N2)) 0))), 183287#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 9 i1))) (or (<= N1 (+ 9 i1)) (<= (+ i2 33) i1))), 183292#(and (or (<= (+ i2 28) i1) (<= N1 (+ 14 i1))) (or (<= N1 (+ 14 i1)) (= (+ N1 (* (- 1) N2)) 0))), 183321#(and (or (<= N1 (+ 42 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 42 i1)) (<= i2 i1))), 183302#(and (or (<= N1 (+ i1 24)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 24)) (<= (+ i2 18) i1))), 183320#(< i2 N2), 183301#(and (or (<= N1 (+ 23 i1)) (<= (+ 19 i2) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 23 i1)))), 183299#(and (or (<= N1 (+ 21 i1)) (<= (+ 21 i2) i1)) (or (<= N1 (+ 21 i1)) (= (+ N1 (* (- 1) N2)) 0))), 183316#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 38))) (or (<= (+ i2 4) i1) (<= N1 (+ i1 38)))), 183286#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 8))) (or (<= (+ i2 34) i1) (<= N1 (+ i1 8)))), 183314#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 36))) (or (<= (+ 6 i2) i1) (<= N1 (+ i1 36)))), 183306#(and (or (<= N1 (+ i1 28)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 28)) (<= (+ 14 i2) i1))), 183303#(and (or (<= N1 (+ i1 25)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 25)) (<= (+ i2 17) i1))), 183309#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 31))) (or (<= N1 (+ i1 31)) (<= (+ i2 11) i1))), 183285#(and (or (<= N1 (+ 7 i1)) (<= (+ 35 i2) i1)) (or (<= N1 (+ 7 i1)) (= (+ N1 (* (- 1) N2)) 0))), 183282#(and (or (<= (+ i2 38) i1) (<= N1 (+ i1 4))) (or (<= N1 (+ i1 4)) (= (+ N1 (* (- 1) N2)) 0))), 183284#(and (or (<= N1 (+ 6 i1)) (<= (+ i2 36) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 6 i1)))), 183289#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 11))) (or (<= (+ i2 31) i1) (<= N1 (+ i1 11)))), 183311#(and (or (<= (+ 9 i2) i1) (<= N1 (+ i1 33))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 33)))), 183280#(and (or (<= N1 (+ 2 i1)) (<= (+ 40 i2) i1)) (or (<= N1 (+ 2 i1)) (= (+ N1 (* (- 1) N2)) 0))), 183295#(and (or (<= (+ i2 25) i1) (<= N1 (+ i1 17))) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 17)))), 183297#(and (or (<= N1 (+ 19 i1)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ 19 i1)) (<= (+ 23 i2) i1))), 183305#(and (or (<= N1 (+ i1 27)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= (+ i2 15) i1) (<= N1 (+ i1 27)))), 183318#(and (or (<= N1 (+ 40 i1)) (<= (+ 2 i2) i1)) (or (<= N1 (+ 40 i1)) (= (+ N1 (* (- 1) N2)) 0))), 183279#(and (or (<= N1 (+ i1 1)) (<= (+ 41 i2) i1)) (or (<= N1 (+ i1 1)) (= (+ N1 (* (- 1) N2)) 0))), 183278#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 i1)) (or (<= (+ 42 i2) i1) (<= N1 i1))), 183293#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 15))) (or (<= (+ i2 27) i1) (<= N1 (+ i1 15)))), 183281#(and (or (<= N1 (+ 3 i1)) (<= (+ i2 39) i1)) (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ 3 i1)))), 183291#(and (or (<= N1 (+ i1 13)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 13)) (<= (+ 29 i2) i1))), 183290#(and (or (<= N1 (+ i1 12)) (<= (+ 30 i2) i1)) (or (<= N1 (+ i1 12)) (= (+ N1 (* (- 1) N2)) 0))), 183296#(and (or (<= N1 (+ i1 18)) (= (+ N1 (* (- 1) N2)) 0)) (or (<= N1 (+ i1 18)) (<= (+ i2 24) i1))), 183288#(and (or (= (+ N1 (* (- 1) N2)) 0) (<= N1 (+ i1 10))) (or (<= (+ 32 i2) i1) (<= N1 (+ i1 10))))] [2022-03-15 21:42:19,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-03-15 21:42:19,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:19,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-03-15 21:42:19,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14252, Invalid=56238, Unknown=0, NotChecked=0, Total=70490 [2022-03-15 21:42:19,136 INFO L87 Difference]: Start difference. First operand 320 states and 679 transitions. Second operand has 91 states, 91 states have (on average 2.032967032967033) internal successors, (185), 90 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 21:42:23,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2022-03-15 21:42:23,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49135 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=31619, Invalid=105651, Unknown=0, NotChecked=0, Total=137270 [2022-03-15 21:42:23,007 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 433 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:23,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [433 Valid, 0 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:42:23,007 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2022-03-15 21:42:23,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Forceful destruction successful, exit code 0 [2022-03-15 21:42:23,038 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:42:23,038 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:42:23,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,131 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:23,228 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (320states) and FLOYD_HOARE automaton (currently 150 states, 91 states before enhancement),while ReachableStatesComputation was computing reachable states (471 states constructed, input type IntersectNwa). [2022-03-15 21:42:23,230 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 21:42:23,230 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 21:42:23,232 INFO L732 BasicCegarLoop]: Path program histogram: [129, 2, 1] [2022-03-15 21:42:23,234 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 21:42:23,234 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 21:42:23,236 INFO L202 PluginConnector]: Adding new model figure1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 09:42:23 BasicIcfg [2022-03-15 21:42:23,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 21:42:23,236 INFO L158 Benchmark]: Toolchain (without parser) took 872745.52ms. Allocated memory was 209.7MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 170.8MB in the beginning and 563.9MB in the end (delta: -393.1MB). Peak memory consumption was 610.8MB. Max. memory is 8.0GB. [2022-03-15 21:42:23,237 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 171.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 21:42:23,237 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.68ms. Allocated memory is still 209.7MB. Free memory was 170.7MB in the beginning and 169.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 21:42:23,237 INFO L158 Benchmark]: Boogie Preprocessor took 11.97ms. Allocated memory is still 209.7MB. Free memory was 169.1MB in the beginning and 168.2MB in the end (delta: 866.5kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:42:23,237 INFO L158 Benchmark]: RCFGBuilder took 191.35ms. Allocated memory is still 209.7MB. Free memory was 168.1MB in the beginning and 158.9MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 21:42:23,237 INFO L158 Benchmark]: TraceAbstraction took 872520.71ms. Allocated memory was 209.7MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 158.5MB in the beginning and 563.9MB in the end (delta: -405.5MB). Peak memory consumption was 598.2MB. Max. memory is 8.0GB. [2022-03-15 21:42:23,238 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 171.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.68ms. Allocated memory is still 209.7MB. Free memory was 170.7MB in the beginning and 169.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.97ms. Allocated memory is still 209.7MB. Free memory was 169.1MB in the beginning and 168.2MB in the end (delta: 866.5kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 191.35ms. Allocated memory is still 209.7MB. Free memory was 168.1MB in the beginning and 158.9MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 872520.71ms. Allocated memory was 209.7MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 158.5MB in the beginning and 563.9MB in the end (delta: -405.5MB). Peak memory consumption was 598.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 27 PlacesBefore, 18 PlacesAfterwards, 22 TransitionsBefore, 13 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 42 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 42, positive conditional: 0, positive unconditional: 42, 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: 24, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , 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 (320states) and FLOYD_HOARE automaton (currently 150 states, 91 states before enhancement),while ReachableStatesComputation was computing reachable states (471 states constructed, input type IntersectNwa). - 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 (320states) and FLOYD_HOARE automaton (currently 150 states, 91 states before enhancement),while ReachableStatesComputation was computing reachable states (471 states constructed, input type IntersectNwa). - 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 (320states) and FLOYD_HOARE automaton (currently 150 states, 91 states before enhancement),while ReachableStatesComputation was computing reachable states (471 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 31 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 872.4s, OverallIterations: 132, TraceHistogramMax: 44, PathProgramHistogramMax: 129, EmptinessCheckTime: 0.1s, AutomataDifference: 341.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54448 SdHoareTripleChecker+Valid, 92.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54448 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 78.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181465 mSDsCounter, 28708 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 353570 IncrementalHoareTripleChecker+Invalid, 382278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28708 mSolverCounterUnsat, 0 mSDtfsCounter, 353570 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33088 GetRequests, 12236 SyntacticMatches, 259 SemanticMatches, 20593 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2054926 ImplicationChecksByTransitivity, 590.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=573occurred in iteration=130, InterpolantAutomatonStates: 8787, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 131 MinimizatonAttempts, 26678 StatesRemovedByMinimization, 130 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 5.1s SatisfiabilityAnalysisTime, 297.1s InterpolantComputationTime, 13624 NumberOfCodeBlocks, 13624 NumberOfCodeBlocksAsserted, 1105 NumberOfCheckSat, 20035 ConstructedInterpolants, 0 QuantifiedInterpolants, 168121 SizeOfPredicates, 218 NumberOfNonLiveVariables, 34903 ConjunctsInSsa, 8132 ConjunctsInUnsatCore, 392 InterpolantComputations, 3 PerfectInterpolantSequences, 87208/261360 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