/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/threaded-sum-3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:42:25,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:42:25,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:42:25,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:42:25,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:42:25,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:42:25,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:42:25,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:42:25,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:42:25,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:42:25,799 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:42:25,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:42:25,800 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:42:25,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:42:25,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:42:25,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:42:25,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:42:25,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:42:25,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:42:25,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:42:25,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:42:25,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:42:25,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:42:25,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:42:25,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:42:25,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:42:25,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:42:25,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:42:25,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:42:25,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:42:25,827 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:42:25,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:42:25,828 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:42:25,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:42:25,829 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:42:25,829 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:42:25,829 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:42:25,829 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:42:25,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:42:25,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:42:25,830 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:42:25,843 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:42:25,863 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:42:25,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:42:25,864 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:42:25,864 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:42:25,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:42:25,865 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:42:25,865 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:42:25,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:42:25,865 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:42:25,865 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:42:25,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:42:25,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:42:25,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:42:25,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:42:25,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:42:25,866 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:42:25,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:42:25,866 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:42:25,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:42:25,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:42:25,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:42:25,867 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:42:25,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:42:25,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:42:25,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:42:25,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:42:25,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:42:25,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:42:25,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:42:25,868 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:42:25,868 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:42:25,869 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:42:25,869 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:42:26,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:42:26,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:42:26,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:42:26,079 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:42:26,079 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:42:26,080 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/threaded-sum-3.wvr.bpl [2022-03-15 21:42:26,080 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/threaded-sum-3.wvr.bpl' [2022-03-15 21:42:26,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:42:26,097 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:42:26,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:42:26,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:42:26,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:42:26,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:42:26" (1/1) ... [2022-03-15 21:42:26,109 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:42:26" (1/1) ... [2022-03-15 21:42:26,114 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:42:26,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:42:26,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:42:26,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:42:26,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:42:26,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:42:26" (1/1) ... [2022-03-15 21:42:26,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:42:26" (1/1) ... [2022-03-15 21:42:26,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:42:26" (1/1) ... [2022-03-15 21:42:26,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:42:26" (1/1) ... [2022-03-15 21:42:26,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:42:26" (1/1) ... [2022-03-15 21:42:26,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:42:26" (1/1) ... [2022-03-15 21:42:26,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:42:26" (1/1) ... [2022-03-15 21:42:26,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:42:26,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:42:26,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:42:26,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:42:26,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:42:26" (1/1) ... [2022-03-15 21:42:26,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:42:26,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:26,161 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:42:26,184 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:42:26,210 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:42:26,210 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:42:26,210 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:42:26,210 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:42:26,210 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:42:26,210 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:42:26,210 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:42:26,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:42:26,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:42:26,211 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:42:26,211 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:42:26,211 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:42:26,212 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:42:26,247 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:42:26,248 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:42:26,358 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:42:26,373 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:42:26,373 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 21:42:26,375 INFO L202 PluginConnector]: Adding new model threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:42:26 BoogieIcfgContainer [2022-03-15 21:42:26,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:42:26,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:42:26,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:42:26,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:42:26,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:42:26" (1/2) ... [2022-03-15 21:42:26,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e3321b and model type threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:42:26, skipping insertion in model container [2022-03-15 21:42:26,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:42:26" (2/2) ... [2022-03-15 21:42:26,380 INFO L111 eAbstractionObserver]: Analyzing ICFG threaded-sum-3.wvr.bpl [2022-03-15 21:42:26,385 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:42:26,385 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:42:26,385 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:42:26,385 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:42:26,435 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 21:42:26,524 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:42:26,529 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:42:26,529 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 21:42:26,536 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:42:26,542 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 33 transitions, 90 flow [2022-03-15 21:42:26,543 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 33 transitions, 90 flow [2022-03-15 21:42:26,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 90 flow [2022-03-15 21:42:26,560 INFO L129 PetriNetUnfolder]: 3/30 cut-off events. [2022-03-15 21:42:26,560 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 21:42:26,562 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 33 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2022-03-15 21:42:26,562 INFO L116 LiptonReduction]: Number of co-enabled transitions 164 [2022-03-15 21:42:26,770 INFO L131 LiptonReduction]: Checked pairs total: 442 [2022-03-15 21:42:26,771 INFO L133 LiptonReduction]: Total number of compositions: 13 [2022-03-15 21:42:26,776 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 21 transitions, 66 flow [2022-03-15 21:42:26,789 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 55 states, 54 states have (on average 2.7962962962962963) internal successors, (151), 54 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:42:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 54 states have (on average 2.7962962962962963) internal successors, (151), 54 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:42:26,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 21:42:26,794 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:26,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:26,794 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:26,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:26,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1670748187, now seen corresponding path program 1 times [2022-03-15 21:42:26,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:26,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498106680] [2022-03-15 21:42:26,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:26,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:26,885 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:42:26,885 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:26,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498106680] [2022-03-15 21:42:26,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498106680] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:42:26,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:42:26,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 21:42:26,887 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [101401978] [2022-03-15 21:42:26,887 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:26,889 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:26,915 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 21:42:26,915 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:27,104 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:42:27,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:42:27,108 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:27,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:42:27,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:42:27,126 INFO L87 Difference]: Start difference. First operand has 55 states, 54 states have (on average 2.7962962962962963) internal successors, (151), 54 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) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:27,158 INFO L93 Difference]: Finished difference Result 53 states and 139 transitions. [2022-03-15 21:42:27,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:42:27,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 21:42:27,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:27,169 INFO L225 Difference]: With dead ends: 53 [2022-03-15 21:42:27,169 INFO L226 Difference]: Without dead ends: 53 [2022-03-15 21:42:27,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 9 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:42:27,176 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:27,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:42:27,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-03-15 21:42:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-03-15 21:42:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 2.673076923076923) internal successors, (139), 52 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:42:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 139 transitions. [2022-03-15 21:42:27,205 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 139 transitions. Word has length 11 [2022-03-15 21:42:27,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:27,206 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 139 transitions. [2022-03-15 21:42:27,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:27,206 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 139 transitions. [2022-03-15 21:42:27,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:42:27,208 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:27,208 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:27,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:42:27,209 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:27,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:27,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1676659093, now seen corresponding path program 1 times [2022-03-15 21:42:27,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:27,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217751682] [2022-03-15 21:42:27,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:27,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:27,254 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:42:27,255 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:27,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217751682] [2022-03-15 21:42:27,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217751682] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:42:27,255 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:42:27,255 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 21:42:27,255 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1532209859] [2022-03-15 21:42:27,255 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:27,257 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:27,259 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 31 transitions. [2022-03-15 21:42:27,259 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:27,370 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:42:27,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:42:27,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:27,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:42:27,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:42:27,375 INFO L87 Difference]: Start difference. First operand 53 states and 139 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:27,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:27,412 INFO L93 Difference]: Finished difference Result 81 states and 219 transitions. [2022-03-15 21:42:27,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:42:27,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 21:42:27,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:27,414 INFO L225 Difference]: With dead ends: 81 [2022-03-15 21:42:27,414 INFO L226 Difference]: Without dead ends: 81 [2022-03-15 21:42:27,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 1 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:42:27,415 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:27,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 4 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:42:27,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-03-15 21:42:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2022-03-15 21:42:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 2.712121212121212) internal successors, (179), 66 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 179 transitions. [2022-03-15 21:42:27,422 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 179 transitions. Word has length 13 [2022-03-15 21:42:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:27,423 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 179 transitions. [2022-03-15 21:42:27,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 179 transitions. [2022-03-15 21:42:27,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:42:27,428 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:27,428 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:27,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 21:42:27,434 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:27,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:27,435 INFO L85 PathProgramCache]: Analyzing trace with hash 613473623, now seen corresponding path program 1 times [2022-03-15 21:42:27,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:27,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187324847] [2022-03-15 21:42:27,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:27,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:27,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:27,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187324847] [2022-03-15 21:42:27,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187324847] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:27,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950728026] [2022-03-15 21:42:27,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:27,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:27,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:27,473 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:42:27,498 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:42:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:27,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:42:27,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:27,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:42:27,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950728026] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:42:27,562 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:42:27,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-03-15 21:42:27,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2000959403] [2022-03-15 21:42:27,563 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:27,565 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:27,568 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 52 transitions. [2022-03-15 21:42:27,568 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:27,719 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:42:27,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:42:27,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:27,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:42:27,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:42:27,720 INFO L87 Difference]: Start difference. First operand 67 states and 179 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:27,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:27,771 INFO L93 Difference]: Finished difference Result 115 states and 323 transitions. [2022-03-15 21:42:27,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:42:27,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 21:42:27,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:27,772 INFO L225 Difference]: With dead ends: 115 [2022-03-15 21:42:27,772 INFO L226 Difference]: Without dead ends: 115 [2022-03-15 21:42:27,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:42:27,773 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 6 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:27,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 3 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:42:27,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-03-15 21:42:27,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-03-15 21:42:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 2.8333333333333335) internal successors, (323), 114 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call 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:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 323 transitions. [2022-03-15 21:42:27,782 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 323 transitions. Word has length 15 [2022-03-15 21:42:27,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:27,782 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 323 transitions. [2022-03-15 21:42:27,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:27,782 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 323 transitions. [2022-03-15 21:42:27,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:42:27,783 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:27,783 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:27,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 21:42:27,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:28,000 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:28,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:28,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2019403573, now seen corresponding path program 1 times [2022-03-15 21:42:28,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:28,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931682630] [2022-03-15 21:42:28,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:28,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:28,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:28,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931682630] [2022-03-15 21:42:28,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931682630] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:28,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896607120] [2022-03-15 21:42:28,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:28,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:28,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:28,039 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:42:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:28,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:42:28,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:28,082 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:42:28,113 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:42:28,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:42:28,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896607120] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:42:28,113 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:42:28,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-03-15 21:42:28,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [349197795] [2022-03-15 21:42:28,114 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:28,115 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:28,118 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 57 transitions. [2022-03-15 21:42:28,118 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:28,267 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:42:28,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:42:28,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:28,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:42:28,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:42:28,268 INFO L87 Difference]: Start difference. First operand 115 states and 323 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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:42:28,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:28,300 INFO L93 Difference]: Finished difference Result 159 states and 431 transitions. [2022-03-15 21:42:28,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:42:28,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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 17 [2022-03-15 21:42:28,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:28,304 INFO L225 Difference]: With dead ends: 159 [2022-03-15 21:42:28,305 INFO L226 Difference]: Without dead ends: 150 [2022-03-15 21:42:28,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:42:28,307 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:28,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 2 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:42:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-03-15 21:42:28,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 130. [2022-03-15 21:42:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.875968992248062) internal successors, (371), 129 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call 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:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 371 transitions. [2022-03-15 21:42:28,333 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 371 transitions. Word has length 17 [2022-03-15 21:42:28,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:28,334 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 371 transitions. [2022-03-15 21:42:28,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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:42:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 371 transitions. [2022-03-15 21:42:28,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:42:28,339 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:28,339 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:28,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 21:42:28,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 21:42:28,553 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:28,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:28,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1644576357, now seen corresponding path program 2 times [2022-03-15 21:42:28,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:28,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628867365] [2022-03-15 21:42:28,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:28,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:28,635 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:28,635 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628867365] [2022-03-15 21:42:28,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628867365] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:28,635 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283582852] [2022-03-15 21:42:28,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:42:28,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:28,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:28,640 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:42:28,640 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:42:28,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:42:28,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:28,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 21:42:28,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:28,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:28,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283582852] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:28,908 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:28,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 6] total 14 [2022-03-15 21:42:28,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1924210365] [2022-03-15 21:42:28,908 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:28,910 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:28,915 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 71 transitions. [2022-03-15 21:42:28,915 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:29,394 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [1527#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s)))), 1523#(or (< 0 u) (<= 2 s)), 1525#(or (< 1 u) (< 0 s)), 1524#(and (or (< 0 u) (<= 1 s)) (or (< 0 u) (not (<= t 0)))), 1521#(or (< 0 u) (< 0 s) (< 0 t)), 1522#(or (< 0 u) (< 0 t)), 1479#(or (< 0 u) (< 0 s)), 1526#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 1520#(< 0 u)] [2022-03-15 21:42:29,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 21:42:29,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:29,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 21:42:29,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:42:29,396 INFO L87 Difference]: Start difference. First operand 130 states and 371 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:29,881 INFO L93 Difference]: Finished difference Result 445 states and 1267 transitions. [2022-03-15 21:42:29,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 21:42:29,882 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:42:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:29,893 INFO L225 Difference]: With dead ends: 445 [2022-03-15 21:42:29,893 INFO L226 Difference]: Without dead ends: 445 [2022-03-15 21:42:29,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 38 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=564, Invalid=1506, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:42:29,894 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 241 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:29,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 0 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:42:29,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-03-15 21:42:29,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 294. [2022-03-15 21:42:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.030716723549488) internal successors, (888), 293 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call 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:29,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 888 transitions. [2022-03-15 21:42:29,923 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 888 transitions. Word has length 19 [2022-03-15 21:42:29,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:29,923 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 888 transitions. [2022-03-15 21:42:29,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:29,923 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 888 transitions. [2022-03-15 21:42:29,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:42:29,924 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:29,924 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:29,956 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:42:30,156 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:42:30,156 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:30,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:30,157 INFO L85 PathProgramCache]: Analyzing trace with hash -709924295, now seen corresponding path program 3 times [2022-03-15 21:42:30,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:30,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90643270] [2022-03-15 21:42:30,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:30,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:30,291 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:30,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90643270] [2022-03-15 21:42:30,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90643270] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:30,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557895602] [2022-03-15 21:42:30,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:42:30,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:30,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:30,293 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:42:30,294 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:42:30,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:42:30,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:30,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:42:30,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:42:30,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:42:30,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557895602] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:30,632 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:30,632 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 18 [2022-03-15 21:42:30,632 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2132032365] [2022-03-15 21:42:30,632 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:30,634 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:30,639 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 85 transitions. [2022-03-15 21:42:30,639 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:31,511 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [2746#(or (< 0 u) (< 0 s) (< 0 t)), 2749#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 2753#(or (< 1 u) (<= 0 s)), 2669#(< 0 u), 2747#(or (< 0 u) (< 0 t)), 2752#(or (< 0 u) (<= 0 s)), 2750#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 u)) (<= 1 T)) (or (not (< 1 s)) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 1 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 2748#(and (or (< 0 u) (not (<= t 0))) (or (< 0 u) (<= 0 s))), 2754#(or (< 1 u) (< 0 s)), 2751#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s)))), 2700#(or (< 0 u) (< 0 s))] [2022-03-15 21:42:31,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 21:42:31,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:31,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 21:42:31,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:42:31,512 INFO L87 Difference]: Start difference. First operand 294 states and 888 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 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:42:32,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:32,069 INFO L93 Difference]: Finished difference Result 611 states and 1781 transitions. [2022-03-15 21:42:32,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 21:42:32,070 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:42:32,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:32,072 INFO L225 Difference]: With dead ends: 611 [2022-03-15 21:42:32,072 INFO L226 Difference]: Without dead ends: 611 [2022-03-15 21:42:32,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 43 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=696, Invalid=1754, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:42:32,074 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 267 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:32,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 0 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:42:32,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-03-15 21:42:32,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 400. [2022-03-15 21:42:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 3.1904761904761907) internal successors, (1273), 399 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call 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:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1273 transitions. [2022-03-15 21:42:32,084 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1273 transitions. Word has length 21 [2022-03-15 21:42:32,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:32,085 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 1273 transitions. [2022-03-15 21:42:32,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 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:42:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1273 transitions. [2022-03-15 21:42:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:42:32,086 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:32,086 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:32,103 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:42:32,302 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:42:32,302 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:32,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:32,303 INFO L85 PathProgramCache]: Analyzing trace with hash 494295929, now seen corresponding path program 4 times [2022-03-15 21:42:32,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:32,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251117514] [2022-03-15 21:42:32,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:32,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:32,385 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:42:32,385 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:32,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251117514] [2022-03-15 21:42:32,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251117514] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:32,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237116186] [2022-03-15 21:42:32,386 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:42:32,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:32,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:32,395 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:42:32,396 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:42:32,417 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:42:32,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:32,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:42:32,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:32,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:42:32,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:32,709 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:42:32,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237116186] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:32,710 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:32,710 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2022-03-15 21:42:32,710 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1347677434] [2022-03-15 21:42:32,710 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:32,712 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:32,717 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 89 transitions. [2022-03-15 21:42:32,717 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:33,128 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [4346#(or (< 0 s) (< 0 t)), 4345#(< 0 t)] [2022-03-15 21:42:33,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 21:42:33,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:33,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 21:42:33,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:42:33,129 INFO L87 Difference]: Start difference. First operand 400 states and 1273 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call 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:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:33,199 INFO L93 Difference]: Finished difference Result 740 states and 2283 transitions. [2022-03-15 21:42:33,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:42:33,199 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have 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:42:33,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:33,202 INFO L225 Difference]: With dead ends: 740 [2022-03-15 21:42:33,202 INFO L226 Difference]: Without dead ends: 740 [2022-03-15 21:42:33,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 15 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:42:33,203 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 93 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:33,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 7 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:42:33,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2022-03-15 21:42:33,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 407. [2022-03-15 21:42:33,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 3.184729064039409) internal successors, (1293), 406 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call 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:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1293 transitions. [2022-03-15 21:42:33,214 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1293 transitions. Word has length 21 [2022-03-15 21:42:33,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:33,214 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 1293 transitions. [2022-03-15 21:42:33,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call 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:33,215 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1293 transitions. [2022-03-15 21:42:33,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:42:33,216 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:33,216 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:33,232 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:42:33,431 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:42:33,432 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:33,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:33,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1660609607, now seen corresponding path program 5 times [2022-03-15 21:42:33,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:33,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689722107] [2022-03-15 21:42:33,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:33,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:33,510 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:33,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689722107] [2022-03-15 21:42:33,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689722107] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:33,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728156683] [2022-03-15 21:42:33,510 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:42:33,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:33,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:33,511 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:42:33,527 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:42:33,552 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 21:42:33,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:33,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:42:33,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:33,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:33,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728156683] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:33,943 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:33,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2022-03-15 21:42:33,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1387707132] [2022-03-15 21:42:33,943 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:33,945 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:33,949 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 85 transitions. [2022-03-15 21:42:33,950 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:34,317 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [6036#(or (<= 1 s) (< 0 t)), 6035#(< 0 t)] [2022-03-15 21:42:34,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 21:42:34,318 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:34,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 21:42:34,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:42:34,318 INFO L87 Difference]: Start difference. First operand 407 states and 1293 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 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:42:34,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:34,393 INFO L93 Difference]: Finished difference Result 862 states and 2773 transitions. [2022-03-15 21:42:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 21:42:34,393 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 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 21 [2022-03-15 21:42:34,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:34,397 INFO L225 Difference]: With dead ends: 862 [2022-03-15 21:42:34,397 INFO L226 Difference]: Without dead ends: 862 [2022-03-15 21:42:34,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 14 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:42:34,398 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 55 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:34,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 13 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:42:34,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2022-03-15 21:42:34,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 717. [2022-03-15 21:42:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 716 states have (on average 3.356145251396648) internal successors, (2403), 716 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call 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:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 2403 transitions. [2022-03-15 21:42:34,440 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 2403 transitions. Word has length 21 [2022-03-15 21:42:34,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:34,440 INFO L470 AbstractCegarLoop]: Abstraction has 717 states and 2403 transitions. [2022-03-15 21:42:34,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 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:42:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 2403 transitions. [2022-03-15 21:42:34,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:42:34,442 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:34,442 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:34,468 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:42:34,642 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:42:34,643 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:34,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:34,643 INFO L85 PathProgramCache]: Analyzing trace with hash -169286589, now seen corresponding path program 6 times [2022-03-15 21:42:34,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:34,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423478553] [2022-03-15 21:42:34,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:34,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:34,756 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:34,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423478553] [2022-03-15 21:42:34,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423478553] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:34,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678472162] [2022-03-15 21:42:34,756 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:42:34,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:34,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:34,757 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:42:34,775 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:42:34,782 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:42:34,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:34,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 21:42:34,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:34,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:35,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678472162] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:35,143 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:35,143 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 24 [2022-03-15 21:42:35,143 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1661454258] [2022-03-15 21:42:35,144 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:35,145 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:35,149 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 79 transitions. [2022-03-15 21:42:35,149 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:35,696 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [8485#(or (< 0 u) (< 0 t)), 8487#(and (or (< 0 u) (<= 3 s)) (or (<= t 0) (< 0 u))), 8490#(or (<= 2 s) (< 1 u)), 8491#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s)))), 8433#(or (< 0 u) (< 1 s) (< 0 t)), 8429#(or (< 0 u) (< 0 s) (< 0 t)), 8486#(and (or (< 0 u) (<= 2 s)) (or (<= t 0) (< 0 u))), 8482#(< 0 u), 8488#(or (< 0 u) (<= 3 s)), 8489#(and (or (< 0 u) (< 0 t)) (or (< 0 u) (<= 2 s))), 8483#(or (< 0 u) (<= 1 s)), 8484#(or (< 0 u) (<= 2 s))] [2022-03-15 21:42:35,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:42:35,696 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:35,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:42:35,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=870, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:42:35,697 INFO L87 Difference]: Start difference. First operand 717 states and 2403 transitions. Second operand has 24 states, 24 states have (on average 2.625) internal successors, (63), 23 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:42:36,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:36,212 INFO L93 Difference]: Finished difference Result 1804 states and 5977 transitions. [2022-03-15 21:42:36,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:42:36,212 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 23 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 21 [2022-03-15 21:42:36,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:36,222 INFO L225 Difference]: With dead ends: 1804 [2022-03-15 21:42:36,222 INFO L226 Difference]: Without dead ends: 1804 [2022-03-15 21:42:36,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=668, Invalid=1782, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:42:36,224 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 224 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:36,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 0 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:42:36,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2022-03-15 21:42:36,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1238. [2022-03-15 21:42:36,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1237 states have (on average 3.489086499595796) internal successors, (4316), 1237 states have internal predecessors, (4316), 0 states have call successors, (0), 0 states have call 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:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 4316 transitions. [2022-03-15 21:42:36,276 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 4316 transitions. Word has length 21 [2022-03-15 21:42:36,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:36,278 INFO L470 AbstractCegarLoop]: Abstraction has 1238 states and 4316 transitions. [2022-03-15 21:42:36,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 23 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:42:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 4316 transitions. [2022-03-15 21:42:36,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:42:36,282 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:36,282 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:36,310 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:42:36,483 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:42:36,484 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:36,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:36,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1093957309, now seen corresponding path program 7 times [2022-03-15 21:42:36,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:36,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52356791] [2022-03-15 21:42:36,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:36,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:36,568 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:36,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52356791] [2022-03-15 21:42:36,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52356791] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:36,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396006071] [2022-03-15 21:42:36,568 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:42:36,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:36,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:36,570 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:42:36,570 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:42:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:36,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 21:42:36,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:36,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:37,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396006071] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:37,139 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:37,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2022-03-15 21:42:37,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2109605156] [2022-03-15 21:42:37,139 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:37,140 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:37,144 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 77 transitions. [2022-03-15 21:42:37,144 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:37,696 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [12945#(< 0 u), 12947#(or (< 0 u) (<= 2 s)), 12949#(or (< 0 u) (<= 1 s) (< 0 t)), 12953#(and (or (< 0 u) (<= 3 s)) (or (<= t 0) (< 0 u))), 12952#(or (<= 2 s) (< 1 u) (< 0 t)), 12948#(or (< 0 u) (< 0 t)), 12955#(or (<= 3 s) (< 1 u)), 12946#(or (< 0 u) (<= 1 s)), 12954#(or (< 0 u) (<= 3 s)), 12944#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s)))), 12950#(or (< 0 u) (<= 2 s) (< 0 t)), 12951#(and (or (< 0 u) (<= 2 s)) (or (<= t 0) (< 0 u)))] [2022-03-15 21:42:37,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:42:37,697 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:37,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:42:37,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:42:37,697 INFO L87 Difference]: Start difference. First operand 1238 states and 4316 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 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:42:38,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:38,728 INFO L93 Difference]: Finished difference Result 3519 states and 11751 transitions. [2022-03-15 21:42:38,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 21:42:38,728 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 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 21 [2022-03-15 21:42:38,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:38,773 INFO L225 Difference]: With dead ends: 3519 [2022-03-15 21:42:38,773 INFO L226 Difference]: Without dead ends: 3519 [2022-03-15 21:42:38,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1728 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1454, Invalid=4096, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 21:42:38,775 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 223 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:38,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 0 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:42:38,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2022-03-15 21:42:38,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 1372. [2022-03-15 21:42:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1371 states have (on average 3.4952589350838803) internal successors, (4792), 1371 states have internal predecessors, (4792), 0 states have call successors, (0), 0 states have call 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:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 4792 transitions. [2022-03-15 21:42:38,822 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 4792 transitions. Word has length 21 [2022-03-15 21:42:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:38,822 INFO L470 AbstractCegarLoop]: Abstraction has 1372 states and 4792 transitions. [2022-03-15 21:42:38,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 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:42:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 4792 transitions. [2022-03-15 21:42:38,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:42:38,825 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:38,825 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:38,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 21:42:39,040 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:42:39,041 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:39,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:39,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1380882545, now seen corresponding path program 8 times [2022-03-15 21:42:39,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:39,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401117003] [2022-03-15 21:42:39,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:39,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:39,118 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:42:39,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:39,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401117003] [2022-03-15 21:42:39,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401117003] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:39,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993606388] [2022-03-15 21:42:39,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:42:39,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:39,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:39,120 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:42:39,121 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:42:39,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:42:39,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:39,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:42:39,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:39,205 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:42:39,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:39,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993606388] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:39,398 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:39,398 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 21:42:39,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1916262883] [2022-03-15 21:42:39,399 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:39,400 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:39,402 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 59 transitions. [2022-03-15 21:42:39,403 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:39,644 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [19435#(< 0 t), 19434#(or (< 1 s) (< 0 t)), 19433#(or (< 0 s) (< 0 t))] [2022-03-15 21:42:39,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 21:42:39,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:39,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 21:42:39,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:42:39,645 INFO L87 Difference]: Start difference. First operand 1372 states and 4792 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 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:42:39,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:39,816 INFO L93 Difference]: Finished difference Result 2807 states and 9588 transitions. [2022-03-15 21:42:39,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 21:42:39,817 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 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 21 [2022-03-15 21:42:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:39,828 INFO L225 Difference]: With dead ends: 2807 [2022-03-15 21:42:39,829 INFO L226 Difference]: Without dead ends: 2807 [2022-03-15 21:42:39,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-03-15 21:42:39,829 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 53 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:39,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 31 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:42:39,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2022-03-15 21:42:39,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 1996. [2022-03-15 21:42:39,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1996 states, 1995 states have (on average 3.4791979949874685) internal successors, (6941), 1995 states have internal predecessors, (6941), 0 states have call successors, (0), 0 states have call 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:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 6941 transitions. [2022-03-15 21:42:39,889 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 6941 transitions. Word has length 21 [2022-03-15 21:42:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:39,890 INFO L470 AbstractCegarLoop]: Abstraction has 1996 states and 6941 transitions. [2022-03-15 21:42:39,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 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:42:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 6941 transitions. [2022-03-15 21:42:39,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:42:39,896 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:39,896 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:39,913 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:42:40,113 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:42:40,114 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:40,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:40,114 INFO L85 PathProgramCache]: Analyzing trace with hash 579847943, now seen corresponding path program 9 times [2022-03-15 21:42:40,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:40,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954912930] [2022-03-15 21:42:40,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:40,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:40,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:40,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:40,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954912930] [2022-03-15 21:42:40,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954912930] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:40,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589648239] [2022-03-15 21:42:40,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:42:40,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:40,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:40,209 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:42:40,212 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:42:40,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 21:42:40,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:40,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 21:42:40,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:40,343 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:42:40,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:40,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589648239] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:40,722 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:40,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 8] total 20 [2022-03-15 21:42:40,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [954553923] [2022-03-15 21:42:40,722 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:40,723 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:40,727 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 81 transitions. [2022-03-15 21:42:40,727 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:41,255 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [26331#(or (< 0 u) (< 0 s) (< 0 t)), 26335#(or (< 0 u) (< 1 s) (< 0 t)), 26385#(or (< 0 u) (<= 2 s)), 26383#(< 0 u), 26387#(and (or (< 0 u) (<= 2 s)) (or (<= t 0) (< 0 u))), 26391#(or (< 0 u) (<= 3 s)), 26388#(or (< 1 s) (< 1 u) (< 0 t)), 26386#(or (< 0 u) (< 0 t)), 26389#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s)))), 26390#(and (or (< 0 u) (<= 3 s)) (or (<= t 0) (< 0 u))), 26384#(or (< 0 u) (<= 1 s)), 26392#(or (<= 3 s) (< 1 u))] [2022-03-15 21:42:41,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:42:41,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:41,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:42:41,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2022-03-15 21:42:41,260 INFO L87 Difference]: Start difference. First operand 1996 states and 6941 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:42,149 INFO L93 Difference]: Finished difference Result 4147 states and 13759 transitions. [2022-03-15 21:42:42,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 21:42:42,149 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:42:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:42,190 INFO L225 Difference]: With dead ends: 4147 [2022-03-15 21:42:42,190 INFO L226 Difference]: Without dead ends: 4147 [2022-03-15 21:42:42,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1200, Invalid=3356, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 21:42:42,192 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 296 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:42,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 0 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:42:42,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4147 states. [2022-03-15 21:42:42,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4147 to 2018. [2022-03-15 21:42:42,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2018 states, 2017 states have (on average 3.479920674268716) internal successors, (7019), 2017 states have internal predecessors, (7019), 0 states have call successors, (0), 0 states have call 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:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 7019 transitions. [2022-03-15 21:42:42,311 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 7019 transitions. Word has length 21 [2022-03-15 21:42:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:42,311 INFO L470 AbstractCegarLoop]: Abstraction has 2018 states and 7019 transitions. [2022-03-15 21:42:42,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 7019 transitions. [2022-03-15 21:42:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:42:42,316 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:42,316 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:42,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-03-15 21:42:42,529 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:42:42,529 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:42,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:42,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1240279499, now seen corresponding path program 10 times [2022-03-15 21:42:42,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:42,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440684857] [2022-03-15 21:42:42,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:42,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:42,581 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:42:42,581 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:42,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440684857] [2022-03-15 21:42:42,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440684857] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:42,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983443022] [2022-03-15 21:42:42,581 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:42:42,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:42,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:42,586 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:42:42,587 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:42:42,608 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:42:42,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:42,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 21:42:42,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:42,666 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:42:42,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:42,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983443022] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:42,875 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:42,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 21:42:42,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [535492528] [2022-03-15 21:42:42,876 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:42,877 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:42,880 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 63 transitions. [2022-03-15 21:42:42,880 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:43,155 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [34784#(< 0 t), 34782#(or (< 0 s) (< 0 t)), 34783#(or (< 1 s) (< 0 t))] [2022-03-15 21:42:43,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 21:42:43,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:43,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 21:42:43,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:42:43,156 INFO L87 Difference]: Start difference. First operand 2018 states and 7019 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call 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:43,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:43,289 INFO L93 Difference]: Finished difference Result 3996 states and 13697 transitions. [2022-03-15 21:42:43,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 21:42:43,289 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have 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:42:43,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:43,323 INFO L225 Difference]: With dead ends: 3996 [2022-03-15 21:42:43,323 INFO L226 Difference]: Without dead ends: 3996 [2022-03-15 21:42:43,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 45 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:42:43,330 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 46 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:43,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 21 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:42:43,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3996 states. [2022-03-15 21:42:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3996 to 2791. [2022-03-15 21:42:43,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2791 states, 2790 states have (on average 3.5555555555555554) internal successors, (9920), 2790 states have internal predecessors, (9920), 0 states have call successors, (0), 0 states have call 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:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 9920 transitions. [2022-03-15 21:42:43,411 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 9920 transitions. Word has length 21 [2022-03-15 21:42:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:43,412 INFO L470 AbstractCegarLoop]: Abstraction has 2791 states and 9920 transitions. [2022-03-15 21:42:43,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call 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:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 9920 transitions. [2022-03-15 21:42:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:42:43,416 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:43,416 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:43,434 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:42:43,631 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:42:43,631 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:43,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:43,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1532749477, now seen corresponding path program 11 times [2022-03-15 21:42:43,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:43,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201314612] [2022-03-15 21:42:43,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:43,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:43,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:43,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201314612] [2022-03-15 21:42:43,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201314612] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:43,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758378335] [2022-03-15 21:42:43,906 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:42:43,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:43,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:43,907 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:42:43,908 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:42:43,929 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:42:43,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:43,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:42:43,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:44,519 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:44,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:45,882 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:45,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758378335] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:45,882 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:45,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2022-03-15 21:42:45,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1270914353] [2022-03-15 21:42:45,882 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:45,884 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:45,889 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 101 transitions. [2022-03-15 21:42:45,889 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:47,838 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [44545#(and (or (not (< 0 s)) (not (<= t 0))) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 44546#(and (or (< 0 u) (not (< 0 s)) (not (<= t 0))) (or (< 0 u) (<= 0 s) (not (< 0 t))) (or (< 0 u) (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t)))), 44544#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 0 s))), 44554#(and (or (<= 1 s) (not (< 0 t))) (or (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t))), 44553#(and (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 44549#(and (or (< 0 u) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 1 s))), 44540#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 44541#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 44538#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 44542#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 44547#(and (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (<= s 1) (< 0 t))), 44543#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m t s))) (or (< 0 u) (not (<= t 0))) (or (< 0 u) (<= 0 s))), 44548#(and (or (< 0 u) (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= 0 s) (not (< 0 t))) (or (<= s 1) (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t)))), 44550#(and (or (< 1 u) (<= 0 s)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m 1) (+ U T S)) (< 1 u))), 44551#(and (or (<= (+ 2 m) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= 1 s) (< 1 u))), 44539#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 44552#(and (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 44537#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u)))] [2022-03-15 21:42:47,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:42:47,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:47,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:42:47,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=2501, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 21:42:47,839 INFO L87 Difference]: Start difference. First operand 2791 states and 9920 transitions. Second operand has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 31 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:49,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:49,362 INFO L93 Difference]: Finished difference Result 3772 states and 13105 transitions. [2022-03-15 21:42:49,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 21:42:49,363 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 31 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 21:42:49,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:49,373 INFO L225 Difference]: With dead ends: 3772 [2022-03-15 21:42:49,373 INFO L226 Difference]: Without dead ends: 3757 [2022-03-15 21:42:49,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2424 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1376, Invalid=6280, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 21:42:49,375 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 438 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:49,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [438 Valid, 0 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:42:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2022-03-15 21:42:49,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 2866. [2022-03-15 21:42:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2866 states, 2865 states have (on average 3.5525305410122163) internal successors, (10178), 2865 states have internal predecessors, (10178), 0 states have call successors, (0), 0 states have call 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:49,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 10178 transitions. [2022-03-15 21:42:49,495 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 10178 transitions. Word has length 23 [2022-03-15 21:42:49,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:49,495 INFO L470 AbstractCegarLoop]: Abstraction has 2866 states and 10178 transitions. [2022-03-15 21:42:49,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 31 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:42:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 10178 transitions. [2022-03-15 21:42:49,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:42:49,503 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:49,503 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:49,522 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:42:49,719 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:42:49,719 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:49,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:49,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1353397071, now seen corresponding path program 12 times [2022-03-15 21:42:49,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:49,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315928812] [2022-03-15 21:42:49,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:49,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:49,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:49,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315928812] [2022-03-15 21:42:49,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315928812] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:49,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735622473] [2022-03-15 21:42:49,890 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:42:49,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:49,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:49,904 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:42:49,931 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:42:49,957 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 21:42:49,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:42:49,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:42:49,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:50,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:51,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735622473] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:51,800 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:51,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 21:42:51,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1769256958] [2022-03-15 21:42:51,800 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:51,802 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:51,808 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 87 transitions. [2022-03-15 21:42:51,808 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:53,583 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [54292#(and (or (<= (+ U T S) m) (< 0 (+ s 1)) (<= (+ U T S) (+ m u t s))) (or (< m (+ U T S)) (not (< 0 s))) (or (<= (+ U T S) (+ m 1)) (<= (+ U T S) (+ m u t s))) (or (< m (+ U T S)) (not (< 0 t)) (not (< 0 (+ s 1)))) (< m (+ U T S 1)) (or (<= (+ U T S) m) (<= (+ U T S) (+ m u t s)) (< 0 s) (< 0 t))), 54294#(and (or (<= 1 t) (not (< 0 s))) (or (<= 0 s) (not (< 0 t))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 54289#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 54287#(and (or (< 0 u) (<= (+ U T S) (+ m 1)) (< 1 t) (< 0 s)) (or (< 0 u) (< 0 (+ s 1)) (< 1 t) (< m (+ U T S 1))) (or (< 0 u) (< m (+ U T S)) (< 1 t) (not (< 0 t)) (< 0 s) (not (< 0 (+ s 1)))) (or (< 0 u) (< 1 s) (<= (+ U T S) (+ m 1)) (< 0 t)) (or (< 0 u) (< m (+ U T S 1)) (< 0 s) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 (+ s 1)) (< 1 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 s) (< 0 t)) (or (< 0 u) (< m (+ U T S)) (< 1 s) (<= s 0) (< 0 t))), 54288#(and (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 54290#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 54286#(and (or (< 0 u) (< m (+ U T S)) (< 1 s) (not (< 0 s)) (< 0 t)) (or (< 0 u) (< 1 s) (<= (+ U T S) (+ m 1)) (< 0 t)) (or (< 0 u) (< m (+ U T S 1)) (< 0 s) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 s) (< 0 t))), 54285#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 54232#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 54291#(and (or (< m (+ U T S)) (not (< 0 s))) (or (<= (+ U T S) (+ m 1)) (<= (+ U T S) (+ m u t s))) (< m (+ U T S 1)) (or (<= (+ U T S) m) (<= (+ U T S) (+ m u t s)) (< 0 s))), 54293#(and (or (<= 1 s) (not (< 0 t))) (or (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u)))), 54295#(and (or (<= 0 s) (not (< 0 t))) (or (<= 1 t) (not (< 0 u))) (or (<= s 1) (<= 1 t)) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t))))] [2022-03-15 21:42:53,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:42:53,583 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:53,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:42:53,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1159, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 21:42:53,584 INFO L87 Difference]: Start difference. First operand 2866 states and 10178 transitions. Second operand has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 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:42:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:55,268 INFO L93 Difference]: Finished difference Result 6662 states and 22571 transitions. [2022-03-15 21:42:55,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:42:55,268 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 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:42:55,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:55,284 INFO L225 Difference]: With dead ends: 6662 [2022-03-15 21:42:55,284 INFO L226 Difference]: Without dead ends: 6647 [2022-03-15 21:42:55,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 35 SyntacticMatches, 10 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1658 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1063, Invalid=3493, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 21:42:55,286 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 332 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:55,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 0 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:42:55,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6647 states. [2022-03-15 21:42:55,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6647 to 2884. [2022-03-15 21:42:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2884 states, 2883 states have (on average 3.5497745404092957) internal successors, (10234), 2883 states have internal predecessors, (10234), 0 states have call successors, (0), 0 states have call 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:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 10234 transitions. [2022-03-15 21:42:55,359 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 10234 transitions. Word has length 23 [2022-03-15 21:42:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:42:55,360 INFO L470 AbstractCegarLoop]: Abstraction has 2884 states and 10234 transitions. [2022-03-15 21:42:55,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 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:42:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 10234 transitions. [2022-03-15 21:42:55,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:42:55,364 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:42:55,364 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:42:55,407 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:42:55,580 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:42:55,581 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:42:55,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:42:55,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2019103823, now seen corresponding path program 13 times [2022-03-15 21:42:55,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:42:55,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085497720] [2022-03-15 21:42:55,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:42:55,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:42:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:55,726 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:55,727 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:42:55,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085497720] [2022-03-15 21:42:55,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085497720] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:42:55,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479699935] [2022-03-15 21:42:55,727 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:42:55,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:42:55,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:42:55,728 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:42:55,729 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:42:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:42:55,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:42:55,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:42:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:56,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:42:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:42:57,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479699935] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:42:57,595 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:42:57,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 21:42:57,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1435508405] [2022-03-15 21:42:57,595 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:42:57,596 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:42:57,600 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 79 transitions. [2022-03-15 21:42:57,600 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:42:58,879 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [66946#(and (or (< 0 u) (< m (+ U T S)) (< 1 s) (not (< 0 s)) (< 0 t)) (or (< 0 u) (< 1 s) (<= (+ U T S) (+ m 1)) (< 0 t)) (or (< 0 u) (< m (+ U T S 1)) (< 0 s) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 s) (< 0 t))), 66944#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 66949#(and (or (<= 1 s) (not (< 0 t))) (or (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t))), 66948#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 66950#(and (or (< m (+ U T S)) (not (< 0 s))) (or (<= (+ U T S) (+ m 1)) (<= (+ U T S) (+ m u t s))) (< m (+ U T S 1)) (or (<= (+ U T S) m) (<= (+ U T S) (+ m u t s)) (< 0 s))), 66891#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 66945#(and (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 66947#(and (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t))))] [2022-03-15 21:42:58,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:42:58,880 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:42:58,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:42:58,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=915, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:42:58,880 INFO L87 Difference]: Start difference. First operand 2884 states and 10234 transitions. Second operand has 19 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 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:42:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:42:59,927 INFO L93 Difference]: Finished difference Result 6256 states and 21312 transitions. [2022-03-15 21:42:59,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 21:42:59,928 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 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 23 [2022-03-15 21:42:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:42:59,963 INFO L225 Difference]: With dead ends: 6256 [2022-03-15 21:42:59,963 INFO L226 Difference]: Without dead ends: 6241 [2022-03-15 21:42:59,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 35 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=735, Invalid=2235, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 21:42:59,964 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 229 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:42:59,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 0 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:42:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6241 states. [2022-03-15 21:43:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6241 to 2894. [2022-03-15 21:43:00,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2894 states, 2893 states have (on average 3.5485655029381267) internal successors, (10266), 2893 states have internal predecessors, (10266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 10266 transitions. [2022-03-15 21:43:00,061 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 10266 transitions. Word has length 23 [2022-03-15 21:43:00,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:00,061 INFO L470 AbstractCegarLoop]: Abstraction has 2894 states and 10266 transitions. [2022-03-15 21:43:00,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 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:43:00,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 10266 transitions. [2022-03-15 21:43:00,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:43:00,067 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:00,067 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:00,087 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:43:00,283 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:43:00,283 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:43:00,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:00,285 INFO L85 PathProgramCache]: Analyzing trace with hash 209706789, now seen corresponding path program 14 times [2022-03-15 21:43:00,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:00,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846669643] [2022-03-15 21:43:00,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:00,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:00,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:00,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846669643] [2022-03-15 21:43:00,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846669643] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:00,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644724022] [2022-03-15 21:43:00,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:43:00,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:00,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:00,464 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:43:00,465 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:43:00,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:43:00,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:43:00,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:43:00,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:00,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:02,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644724022] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:02,475 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:02,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2022-03-15 21:43:02,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2062414794] [2022-03-15 21:43:02,475 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:02,476 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:02,481 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 101 transitions. [2022-03-15 21:43:02,481 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:43:03,923 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [79199#(and (or (not (< 0 s)) (<= 0 t)) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (not (< 0 s)) (<= (+ m 1) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 0 t))), 79204#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 79208#(and (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 79205#(and (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 79206#(and (or (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (< 1 u) (<= (+ U T S) (+ m s)) (< 0 t))), 79197#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 79201#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 79207#(and (or (<= (+ U T S) (+ m t s)) (< 1 u)) (or (<= (+ m 1) (+ U T S)) (< 1 u)) (or (<= 1 s) (< 1 u))), 79198#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 79200#(and (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= s 1) (<= (+ 2 m) (+ U T S))) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 u))) (or (<= s 1) (<= (+ U T S) (+ m u t s))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 u))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 0 t)) (or (<= s 1) (<= 0 t))), 79202#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 79203#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 79209#(and (or (<= 1 s) (not (< 0 t))) (or (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)))] [2022-03-15 21:43:03,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 21:43:03,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:43:03,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 21:43:03,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1450, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 21:43:03,924 INFO L87 Difference]: Start difference. First operand 2894 states and 10266 transitions. Second operand has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:05,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:43:05,812 INFO L93 Difference]: Finished difference Result 6704 states and 22610 transitions. [2022-03-15 21:43:05,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 21:43:05,812 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 21:43:05,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:43:05,826 INFO L225 Difference]: With dead ends: 6704 [2022-03-15 21:43:05,827 INFO L226 Difference]: Without dead ends: 6680 [2022-03-15 21:43:05,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2311 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1495, Invalid=5815, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 21:43:05,829 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 525 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:43:05,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [525 Valid, 0 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:43:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6680 states. [2022-03-15 21:43:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6680 to 3034. [2022-03-15 21:43:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 3033 states have (on average 3.5502802505769866) internal successors, (10768), 3033 states have internal predecessors, (10768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 10768 transitions. [2022-03-15 21:43:05,902 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 10768 transitions. Word has length 23 [2022-03-15 21:43:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:05,902 INFO L470 AbstractCegarLoop]: Abstraction has 3034 states and 10768 transitions. [2022-03-15 21:43:05,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 10768 transitions. [2022-03-15 21:43:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:43:05,908 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:05,908 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:05,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 21:43:06,124 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:43:06,124 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:43:06,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:06,124 INFO L85 PathProgramCache]: Analyzing trace with hash 691628515, now seen corresponding path program 15 times [2022-03-15 21:43:06,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:06,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261882036] [2022-03-15 21:43:06,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:06,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:06,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:06,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261882036] [2022-03-15 21:43:06,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261882036] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:06,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326363938] [2022-03-15 21:43:06,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:43:06,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:06,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:06,278 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:43:06,279 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:43:06,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 21:43:06,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:43:06,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:43:06,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:06,730 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:06,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:07,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326363938] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:07,478 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:07,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 29 [2022-03-15 21:43:07,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [216127971] [2022-03-15 21:43:07,478 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:07,479 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:07,484 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 101 transitions. [2022-03-15 21:43:07,484 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:43:09,123 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [92232#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 92235#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 92231#(and (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 92236#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 92239#(and (or (< 0 u) (<= (+ 2 m) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (< 0 t))), 92240#(and (or (< 0 u) (< 1 t) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (< 1 t) (<= (+ U T S) (+ m u t s)))), 92241#(and (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 92243#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= s 0)) (or (<= t 0) (< 0 u))), 92237#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 92242#(and (or (<= 1 s) (not (< 0 t))) (or (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u)))), 92233#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 92244#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s)) (<= s 0) (< 0 t)) (or (<= (+ m 1) (+ U T S)) (< 1 u) (<= s 0) (< 0 t))), 92238#(and (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= s 0) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0) (< 0 t))), 92234#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t)))] [2022-03-15 21:43:09,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:43:09,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:43:09,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:43:09,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1558, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:43:09,125 INFO L87 Difference]: Start difference. First operand 3034 states and 10768 transitions. Second operand has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 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:43:09,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:43:09,720 INFO L93 Difference]: Finished difference Result 4311 states and 14683 transitions. [2022-03-15 21:43:09,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 21:43:09,721 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 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 23 [2022-03-15 21:43:09,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:43:09,729 INFO L225 Difference]: With dead ends: 4311 [2022-03-15 21:43:09,729 INFO L226 Difference]: Without dead ends: 4296 [2022-03-15 21:43:09,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=840, Invalid=2820, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 21:43:09,730 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 281 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:43:09,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 0 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:43:09,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2022-03-15 21:43:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 3059. [2022-03-15 21:43:09,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3059 states, 3058 states have (on average 3.5444735120994113) internal successors, (10839), 3058 states have internal predecessors, (10839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 10839 transitions. [2022-03-15 21:43:09,783 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 10839 transitions. Word has length 23 [2022-03-15 21:43:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:09,784 INFO L470 AbstractCegarLoop]: Abstraction has 3059 states and 10839 transitions. [2022-03-15 21:43:09,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 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:43:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 10839 transitions. [2022-03-15 21:43:09,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:43:09,788 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:09,789 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:09,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 21:43:09,996 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:43:09,996 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:43:09,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:09,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1726184679, now seen corresponding path program 16 times [2022-03-15 21:43:09,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:09,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389459764] [2022-03-15 21:43:09,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:09,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:10,118 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:10,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389459764] [2022-03-15 21:43:10,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389459764] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:10,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125307870] [2022-03-15 21:43:10,119 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:43:10,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:10,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:10,132 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:43:10,149 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:43:10,178 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:43:10,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:43:10,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:43:10,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:10,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:12,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125307870] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:12,074 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:12,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-03-15 21:43:12,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2015512955] [2022-03-15 21:43:12,074 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:12,075 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:12,080 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 83 transitions. [2022-03-15 21:43:12,081 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:43:13,363 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [102869#(and (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 102874#(and (or (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (< 1 u) (<= (+ U T S) (+ m s)) (< 0 t))), 102870#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 102873#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 102877#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 102872#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 102876#(and (or (<= 1 s) (not (< 0 t))) (or (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t))), 102875#(and (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 102871#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s))))] [2022-03-15 21:43:13,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 21:43:13,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:43:13,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 21:43:13,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1254, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 21:43:13,364 INFO L87 Difference]: Start difference. First operand 3059 states and 10839 transitions. Second operand has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:14,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:43:14,097 INFO L93 Difference]: Finished difference Result 5416 states and 18195 transitions. [2022-03-15 21:43:14,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 21:43:14,098 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 21:43:14,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:43:14,110 INFO L225 Difference]: With dead ends: 5416 [2022-03-15 21:43:14,110 INFO L226 Difference]: Without dead ends: 5401 [2022-03-15 21:43:14,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=732, Invalid=2808, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 21:43:14,111 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 165 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:43:14,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 0 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:43:14,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5401 states. [2022-03-15 21:43:14,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5401 to 3055. [2022-03-15 21:43:14,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3055 states, 3054 states have (on average 3.545841519318926) internal successors, (10829), 3054 states have internal predecessors, (10829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 10829 transitions. [2022-03-15 21:43:14,171 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 10829 transitions. Word has length 23 [2022-03-15 21:43:14,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:14,172 INFO L470 AbstractCegarLoop]: Abstraction has 3055 states and 10829 transitions. [2022-03-15 21:43:14,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 10829 transitions. [2022-03-15 21:43:14,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:43:14,178 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:14,178 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:14,215 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:43:14,401 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:43:14,401 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:43:14,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:14,402 INFO L85 PathProgramCache]: Analyzing trace with hash -394371931, now seen corresponding path program 17 times [2022-03-15 21:43:14,402 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:14,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257781912] [2022-03-15 21:43:14,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:14,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:14,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:14,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257781912] [2022-03-15 21:43:14,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257781912] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:14,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200748714] [2022-03-15 21:43:14,607 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:43:14,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:14,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:14,608 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:43:14,609 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:43:14,630 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:43:14,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:43:14,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:43:14,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:15,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:16,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200748714] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:16,651 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:16,651 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-03-15 21:43:16,651 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [915141684] [2022-03-15 21:43:16,651 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:16,652 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:16,657 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 96 transitions. [2022-03-15 21:43:16,657 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:43:18,216 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [114624#(and (or (< 0 u) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 1 s))), 114616#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 114623#(and (or (< 0 u) (<= (+ U T S) (+ m u t s)) (not (<= s 0))) (or (< 0 u) (<= (+ m 1) (+ U T S)) (not (<= s 0))) (or (< 0 u) (<= 0 s))), 114625#(and (or (< 0 u) (<= (+ 2 m) (+ U T S))) (or (<= 2 t) (< 0 u)) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 0 s))), 114617#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 2 s)) (or (< 0 u) (<= 1 s))), 114614#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t))), 114621#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (<= s 1)) (not (< 0 t))) (or (<= (+ U T S) (+ m t s)) (not (< 0 u)) (not (<= s 1))) (or (<= t 0) (<= (+ m 1) (+ U T S)) (< 0 s)) (or (<= u 0) (<= (+ m 1) (+ U T S)) (< 0 s)) (or (<= (+ U T S) (+ m t s)) (not (<= s 1)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 u)) (not (<= s 1))) (or (<= s 1) (< 0 t))), 114626#(and (or (< 1 u) (<= 0 s)) (or (<= 2 t) (< 1 u)) (or (<= (+ 2 m) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s)))), 114620#(and (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t)) (not (<= s 0))) (or (< 0 u) (not (< 0 s)) (not (<= t 0))) (or (< 0 u) (<= 0 s) (not (< 0 t))) (or (< 0 u) (<= (+ m 1) (+ U T S)) (not (< 0 t)) (not (<= s 0)))), 114622#(and (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (<= s 1)) (not (< 0 t))) (or (<= s 1) (< 0 u) (< 0 t)) (or (< 0 u) (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (<= s 1)) (not (< 0 t))) (or (<= t 0) (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 s)) (or (<= t 0) (< 0 u) (<= 0 s))), 114618#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m t 1))) (or (< 0 u) (<= 1 s))), 114619#(and (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (<= s 0))) (or (< 0 u) (<= (+ m 1) (+ U T S)) (not (<= s 0))) (or (< 0 u) (not (<= t 0))) (or (< 0 u) (<= 0 s))), 114615#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 114612#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 s)) (not (<= t 0))) (or (<= (+ U T S) (+ m t s)) (not (< 0 t)) (not (<= s 0))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)) (not (<= s 0))) (or (<= (+ U T S) (+ m t s)) (not (< 0 u)) (not (<= s 0))) (or (<= (+ m 1) (+ U T S)) (not (< 0 u)) (not (<= s 0)))), 114628#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 114613#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 114627#(and (or (<= (+ 2 m) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (not (< 0 u)) (< 1 u) (<= 0 s)) (or (<= 1 t) (not (< 0 u)) (< 1 u)) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s)) (< 1 u)))] [2022-03-15 21:43:18,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:43:18,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:43:18,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:43:18,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=2240, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:43:18,217 INFO L87 Difference]: Start difference. First operand 3055 states and 10829 transitions. Second operand has 31 states, 30 states have (on average 2.5) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:43:21,235 INFO L93 Difference]: Finished difference Result 7069 states and 24233 transitions. [2022-03-15 21:43:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 21:43:21,235 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.5) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:43:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:43:21,251 INFO L225 Difference]: With dead ends: 7069 [2022-03-15 21:43:21,251 INFO L226 Difference]: Without dead ends: 7058 [2022-03-15 21:43:21,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4176 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2268, Invalid=9074, Unknown=0, NotChecked=0, Total=11342 [2022-03-15 21:43:21,254 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 361 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:43:21,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 0 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:43:21,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7058 states. [2022-03-15 21:43:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7058 to 3087. [2022-03-15 21:43:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3087 states, 3086 states have (on average 3.54601425793908) internal successors, (10943), 3086 states have internal predecessors, (10943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 10943 transitions. [2022-03-15 21:43:21,336 INFO L78 Accepts]: Start accepts. Automaton has 3087 states and 10943 transitions. Word has length 23 [2022-03-15 21:43:21,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:21,336 INFO L470 AbstractCegarLoop]: Abstraction has 3087 states and 10943 transitions. [2022-03-15 21:43:21,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.5) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:21,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 10943 transitions. [2022-03-15 21:43:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:43:21,341 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:21,341 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:21,371 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:43:21,574 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:43:21,574 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:43:21,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:21,574 INFO L85 PathProgramCache]: Analyzing trace with hash 517058537, now seen corresponding path program 18 times [2022-03-15 21:43:21,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:21,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451127913] [2022-03-15 21:43:21,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:21,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:21,795 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:21,795 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451127913] [2022-03-15 21:43:21,795 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451127913] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:21,795 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556602603] [2022-03-15 21:43:21,795 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:43:21,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:21,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:21,796 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:43:21,832 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 21:43:21,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:43:21,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:43:21,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:21,833 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:43:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:22,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:23,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556602603] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:23,169 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:23,169 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 30 [2022-03-15 21:43:23,169 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1576027157] [2022-03-15 21:43:23,169 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:23,170 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:23,175 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 97 transitions. [2022-03-15 21:43:23,175 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:43:25,044 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [128150#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 128159#(and (or (< 0 u) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 1 s))), 128153#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 0 s))), 128162#(and (or (<= (+ 3 m) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= 2 s) (< 1 u))), 128155#(and (or (<= t 0) (<= 0 s)) (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (<= s 1) (< 0 t))), 128156#(and (or (<= t 0) (<= 0 s)) (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u))) (or (<= s 2) (< 0 t)) (or (<= s 1) (<= t 0) (<= (+ 3 m) (+ U T S))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 128148#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 128151#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m t s))) (or (< 0 u) (not (<= t 0))) (or (< 0 u) (<= 0 s))), 128157#(and (or (< 0 u) (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (<= t 0) (< 0 u) (<= 0 s))), 128158#(and (or (< 0 u) (<= s 2) (< 0 t)) (or (< 0 u) (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (<= s 1) (<= t 0) (< 0 u) (<= (+ 3 m) (+ U T S))) (or (<= t 0) (< 0 u) (<= 0 s))), 128149#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 128152#(and (or (< 0 u) (not (< 0 s)) (not (<= t 0))) (or (< 0 u) (<= 0 s) (not (< 0 t))) (or (< 0 u) (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t)))), 128154#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 128161#(and (or (< 0 u) (<= (+ 3 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 2 s))), 128146#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 128160#(and (or (<= (+ 2 m) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= 1 s) (< 1 u))), 128145#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 128147#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 128144#(and (or (not (< 0 s)) (not (<= t 0))) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t))))] [2022-03-15 21:43:25,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:43:25,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:43:25,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:43:25,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=2076, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:43:25,045 INFO L87 Difference]: Start difference. First operand 3087 states and 10943 transitions. Second operand has 33 states, 32 states have (on average 2.46875) internal successors, (79), 32 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:43:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:43:26,328 INFO L93 Difference]: Finished difference Result 3948 states and 13891 transitions. [2022-03-15 21:43:26,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:43:26,328 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 32 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 23 [2022-03-15 21:43:26,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:43:26,335 INFO L225 Difference]: With dead ends: 3948 [2022-03-15 21:43:26,335 INFO L226 Difference]: Without dead ends: 3933 [2022-03-15 21:43:26,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1036, Invalid=4220, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 21:43:26,336 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 275 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:43:26,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 0 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:43:26,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3933 states. [2022-03-15 21:43:26,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3933 to 3183. [2022-03-15 21:43:26,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3183 states, 3182 states have (on average 3.547140163419233) internal successors, (11287), 3182 states have internal predecessors, (11287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:26,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 11287 transitions. [2022-03-15 21:43:26,390 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 11287 transitions. Word has length 23 [2022-03-15 21:43:26,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:26,391 INFO L470 AbstractCegarLoop]: Abstraction has 3183 states and 11287 transitions. [2022-03-15 21:43:26,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 32 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:43:26,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 11287 transitions. [2022-03-15 21:43:26,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:43:26,396 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:26,396 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:26,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-03-15 21:43:26,611 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:43:26,611 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:43:26,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:26,612 INFO L85 PathProgramCache]: Analyzing trace with hash -10996799, now seen corresponding path program 19 times [2022-03-15 21:43:26,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:26,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940294700] [2022-03-15 21:43:26,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:26,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:26,761 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:26,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940294700] [2022-03-15 21:43:26,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940294700] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:26,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520673241] [2022-03-15 21:43:26,762 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:43:26,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:26,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:26,763 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:43:26,764 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:43:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:26,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:43:26,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:27,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:28,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520673241] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:28,523 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:28,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2022-03-15 21:43:28,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [426764455] [2022-03-15 21:43:28,523 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:28,525 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:28,530 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 94 transitions. [2022-03-15 21:43:28,531 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:43:29,824 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [138699#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 138701#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m t s))) (or (< 0 u) (not (<= t 0))) (or (< 0 u) (<= 0 s))), 138694#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 138690#(and (<= u 0) (<= (+ 2 m) (+ U T S)) (<= (+ U T S) (+ m u t s)) (<= 0 s)), 138697#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 138698#(and (or (not (< 0 s)) (not (<= t 0))) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 138691#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 138696#(and (or (<= 1 s) (< 0 t)) (<= (+ 2 m) (+ U T S)) (<= (+ U T S) (+ m u t s)) (<= 0 s)), 138703#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 0 s))), 138692#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 138705#(and (or (< 1 u) (<= 0 s)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m 1) (+ U T S)) (< 1 u))), 138706#(and (or (< 0 u) (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= 0 s) (not (< 0 t))) (or (<= s 1) (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t)))), 138695#(and (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ 2 m) (+ U T S)) (not (< 0 u)))), 138702#(and (or (< 0 u) (not (< 0 s)) (not (<= t 0))) (or (< 0 u) (<= 0 s) (not (< 0 t))) (or (< 0 u) (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t)))), 138700#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 138693#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 138704#(and (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (<= s 1) (< 0 t)))] [2022-03-15 21:43:29,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:43:29,826 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:43:29,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:43:29,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=476, Invalid=2386, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 21:43:29,826 INFO L87 Difference]: Start difference. First operand 3183 states and 11287 transitions. Second operand has 31 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:31,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:43:31,193 INFO L93 Difference]: Finished difference Result 5480 states and 18747 transitions. [2022-03-15 21:43:31,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 21:43:31,193 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 21:43:31,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:43:31,206 INFO L225 Difference]: With dead ends: 5480 [2022-03-15 21:43:31,206 INFO L226 Difference]: Without dead ends: 5465 [2022-03-15 21:43:31,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2404 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1194, Invalid=5448, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 21:43:31,209 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 276 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:43:31,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 0 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:43:31,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5465 states. [2022-03-15 21:43:31,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5465 to 3139. [2022-03-15 21:43:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3139 states, 3138 states have (on average 3.5509878903760357) internal successors, (11143), 3138 states have internal predecessors, (11143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 11143 transitions. [2022-03-15 21:43:31,300 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 11143 transitions. Word has length 23 [2022-03-15 21:43:31,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:31,300 INFO L470 AbstractCegarLoop]: Abstraction has 3139 states and 11143 transitions. [2022-03-15 21:43:31,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 11143 transitions. [2022-03-15 21:43:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:43:31,304 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:31,304 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:31,320 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:43:31,520 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:43:31,520 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:43:31,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:31,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1281961551, now seen corresponding path program 20 times [2022-03-15 21:43:31,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:31,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894368864] [2022-03-15 21:43:31,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:31,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:31,675 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:31,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:31,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894368864] [2022-03-15 21:43:31,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894368864] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:31,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626923366] [2022-03-15 21:43:31,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:43:31,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:31,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:31,677 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:43:31,678 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:43:31,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:43:31,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:43:31,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:43:31,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:32,111 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:32,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:33,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626923366] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:33,933 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:33,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 21:43:33,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [106839716] [2022-03-15 21:43:33,934 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:33,935 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:33,939 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 80 transitions. [2022-03-15 21:43:33,939 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:43:35,144 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [150681#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 150628#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 150689#(and (or (<= 1 t) (not (< 0 s))) (or (<= 0 s) (not (< 0 t))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 150687#(and (or (< m (+ U T S)) (not (< 0 s))) (or (<= (+ U T S) (+ m 1)) (<= (+ U T S) (+ m u t s))) (< m (+ U T S 1)) (or (<= (+ U T S) m) (<= (+ U T S) (+ m u t s)) (< 0 s))), 150685#(and (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ 2 m) (+ U T S)) (not (< 0 u)))), 150683#(and (or (< 0 u) (<= (+ U T S) (+ m 1)) (< 1 t) (< 0 s)) (or (< 0 u) (< 0 (+ s 1)) (< 1 t) (< m (+ U T S 1))) (or (< 0 u) (< m (+ U T S)) (< 1 t) (not (< 0 t)) (< 0 s) (not (< 0 (+ s 1)))) (or (< 0 u) (< 1 s) (<= (+ U T S) (+ m 1)) (< 0 t)) (or (< 0 u) (< m (+ U T S 1)) (< 0 s) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 (+ s 1)) (< 1 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 s) (< 0 t)) (or (< 0 u) (< m (+ U T S)) (< 1 s) (<= s 0) (< 0 t))), 150686#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 150690#(and (or (<= t 0) (<= 0 s)) (or (<= 1 t) (not (< 0 u))) (or (<= s 1) (<= 1 t)) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 150682#(and (or (< 0 u) (< m (+ U T S)) (< 1 s) (not (< 0 s)) (< 0 t)) (or (< 0 u) (< 1 s) (<= (+ U T S) (+ m 1)) (< 0 t)) (or (< 0 u) (< m (+ U T S 1)) (< 0 s) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 s) (< 0 t))), 150684#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 150688#(and (or (<= (+ U T S) m) (< 0 (+ s 1)) (<= (+ U T S) (+ m u t s))) (or (< m (+ U T S)) (not (< 0 s))) (or (<= (+ U T S) (+ m 1)) (<= (+ U T S) (+ m u t s))) (or (< m (+ U T S)) (not (< 0 t)) (not (< 0 (+ s 1)))) (< m (+ U T S 1)) (or (<= (+ U T S) m) (<= (+ U T S) (+ m u t s)) (< 0 s) (< 0 t)))] [2022-03-15 21:43:35,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 21:43:35,145 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:43:35,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 21:43:35,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=1061, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 21:43:35,145 INFO L87 Difference]: Start difference. First operand 3139 states and 11143 transitions. Second operand has 22 states, 21 states have (on average 3.0) internal successors, (63), 21 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:43:36,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:43:36,696 INFO L93 Difference]: Finished difference Result 8820 states and 29354 transitions. [2022-03-15 21:43:36,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 21:43:36,696 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 21 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 23 [2022-03-15 21:43:36,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:43:36,713 INFO L225 Difference]: With dead ends: 8820 [2022-03-15 21:43:36,713 INFO L226 Difference]: Without dead ends: 8805 [2022-03-15 21:43:36,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1228, Invalid=3884, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 21:43:36,720 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 287 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:43:36,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 0 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:43:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8805 states. [2022-03-15 21:43:36,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8805 to 3129. [2022-03-15 21:43:36,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3129 states, 3128 states have (on average 3.5521099744245523) internal successors, (11111), 3128 states have internal predecessors, (11111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 11111 transitions. [2022-03-15 21:43:36,803 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 11111 transitions. Word has length 23 [2022-03-15 21:43:36,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:36,803 INFO L470 AbstractCegarLoop]: Abstraction has 3129 states and 11111 transitions. [2022-03-15 21:43:36,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 21 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:43:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 11111 transitions. [2022-03-15 21:43:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:43:36,808 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:36,808 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:36,824 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:43:37,023 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:43:37,024 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:43:37,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:37,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1947668303, now seen corresponding path program 21 times [2022-03-15 21:43:37,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:37,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73100171] [2022-03-15 21:43:37,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:37,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:37,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:37,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73100171] [2022-03-15 21:43:37,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73100171] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:37,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497291409] [2022-03-15 21:43:37,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:43:37,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:37,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:37,216 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:43:37,217 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:43:37,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:43:37,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:43:37,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:43:37,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:37,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:39,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497291409] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:39,333 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:39,333 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 21:43:39,333 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [395040672] [2022-03-15 21:43:39,333 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:39,334 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:39,338 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 72 transitions. [2022-03-15 21:43:39,338 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:43:40,004 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [165999#(and (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ 2 m) (+ U T S)) (not (< 0 u)))), 165998#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 165997#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 166000#(and (or (< 0 u) (< m (+ U T S)) (< 1 s) (not (< 0 s)) (< 0 t)) (or (< 0 u) (< 1 s) (<= (+ U T S) (+ m 1)) (< 0 t)) (or (< 0 u) (< m (+ U T S 1)) (< 0 s) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 s) (< 0 t))), 166002#(and (or (< m (+ U T S)) (not (< 0 s))) (or (<= (+ U T S) (+ m 1)) (<= (+ U T S) (+ m u t s))) (< m (+ U T S 1)) (or (<= (+ U T S) m) (<= (+ U T S) (+ m u t s)) (< 0 s))), 166001#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 165944#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t))] [2022-03-15 21:43:40,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 21:43:40,004 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:43:40,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 21:43:40,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=836, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:43:40,005 INFO L87 Difference]: Start difference. First operand 3129 states and 11111 transitions. Second operand has 18 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:40,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:43:40,972 INFO L93 Difference]: Finished difference Result 7751 states and 25795 transitions. [2022-03-15 21:43:40,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 21:43:40,972 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 21:43:40,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:43:40,988 INFO L225 Difference]: With dead ends: 7751 [2022-03-15 21:43:40,988 INFO L226 Difference]: Without dead ends: 7736 [2022-03-15 21:43:40,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=916, Invalid=2624, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 21:43:40,989 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 170 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:43:40,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 0 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:43:40,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7736 states. [2022-03-15 21:43:41,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7736 to 3149. [2022-03-15 21:43:41,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 3148 states have (on average 3.5536848792884372) internal successors, (11187), 3148 states have internal predecessors, (11187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 11187 transitions. [2022-03-15 21:43:41,066 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 11187 transitions. Word has length 23 [2022-03-15 21:43:41,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:41,066 INFO L470 AbstractCegarLoop]: Abstraction has 3149 states and 11187 transitions. [2022-03-15 21:43:41,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 11187 transitions. [2022-03-15 21:43:41,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:43:41,071 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:41,071 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:41,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 21:43:41,287 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:43:41,287 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:43:41,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:41,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1535865193, now seen corresponding path program 22 times [2022-03-15 21:43:41,299 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:41,299 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452246162] [2022-03-15 21:43:41,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:41,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:41,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:41,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452246162] [2022-03-15 21:43:41,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452246162] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:41,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079727270] [2022-03-15 21:43:41,463 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:43:41,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:41,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:41,464 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:43:41,465 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:43:41,485 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:43:41,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:43:41,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:43:41,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:42,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:43,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079727270] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:43,069 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:43,069 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2022-03-15 21:43:43,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1727774490] [2022-03-15 21:43:43,069 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:43,070 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:43,074 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 79 transitions. [2022-03-15 21:43:43,074 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:43:44,041 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [180275#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 180284#(and (or (<= t 0) (<= 0 s)) (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (<= s 1) (< 0 t))), 180274#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 180282#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 180273#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 180279#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m t s))) (or (< 0 u) (not (<= t 0))) (or (< 0 u) (<= 0 s))), 180280#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 0 s))), 180286#(and (or (< 0 u) (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (<= t 0) (< 0 u) (<= 0 s))), 180281#(and (or (not (< 0 s)) (not (<= t 0))) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 180278#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 180276#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 180285#(and (<= u 0) (<= (+ m 1) (+ U T S)) (<= (+ U T S) (+ m u t s)) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S))) (<= 0 s)), 180283#(and (or (< 0 u) (not (< 0 s)) (not (<= t 0))) (or (< 0 u) (<= 0 s) (not (< 0 t))) (or (< 0 u) (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t)))), 180277#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 180287#(and (<= (+ m 1) (+ U T S)) (<= (+ U T S) (+ m u t s)) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S))) (<= 0 s))] [2022-03-15 21:43:44,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 21:43:44,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:43:44,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 21:43:44,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=2194, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 21:43:44,043 INFO L87 Difference]: Start difference. First operand 3149 states and 11187 transitions. Second operand has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 28 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:45,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:43:45,066 INFO L93 Difference]: Finished difference Result 5639 states and 19543 transitions. [2022-03-15 21:43:45,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 21:43:45,066 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 28 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 21:43:45,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:43:45,078 INFO L225 Difference]: With dead ends: 5639 [2022-03-15 21:43:45,078 INFO L226 Difference]: Without dead ends: 5624 [2022-03-15 21:43:45,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1063, Invalid=4789, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 21:43:45,082 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 261 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:43:45,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 0 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:43:45,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5624 states. [2022-03-15 21:43:45,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5624 to 3311. [2022-03-15 21:43:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3311 states, 3310 states have (on average 3.5555891238670694) internal successors, (11769), 3310 states have internal predecessors, (11769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 11769 transitions. [2022-03-15 21:43:45,151 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 11769 transitions. Word has length 23 [2022-03-15 21:43:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:45,151 INFO L470 AbstractCegarLoop]: Abstraction has 3311 states and 11769 transitions. [2022-03-15 21:43:45,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 28 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 11769 transitions. [2022-03-15 21:43:45,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:43:45,156 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:45,156 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:45,174 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:43:45,371 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:43:45,371 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:43:45,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:45,371 INFO L85 PathProgramCache]: Analyzing trace with hash 993312915, now seen corresponding path program 23 times [2022-03-15 21:43:45,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:45,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303351814] [2022-03-15 21:43:45,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:45,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:45,491 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:45,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303351814] [2022-03-15 21:43:45,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303351814] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:45,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57223272] [2022-03-15 21:43:45,492 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:43:45,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:45,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:45,494 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:43:45,494 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:43:45,516 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 21:43:45,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:43:45,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:43:45,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:45,939 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:45,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:47,331 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:47,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57223272] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:47,331 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:47,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 21:43:47,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [532318372] [2022-03-15 21:43:47,331 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:47,333 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:47,336 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 73 transitions. [2022-03-15 21:43:47,337 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:43:48,766 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [192759#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 192765#(and (or (<= t 0) (<= 0 s)) (or (<= 1 t) (not (< 0 u))) (or (<= s 1) (<= 1 t)) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 192762#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 192760#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 192763#(and (or (< 0 u) (<= (+ U T S) (+ m 1)) (< 1 t) (< 0 s)) (or (< 0 u) (< 0 (+ s 1)) (< 1 t) (< m (+ U T S 1))) (or (< 0 u) (< m (+ U T S)) (< 1 t) (not (< 0 t)) (< 0 s) (not (< 0 (+ s 1)))) (or (< 0 u) (< 1 s) (<= (+ U T S) (+ m 1)) (< 0 t)) (or (< 0 u) (< m (+ U T S 1)) (< 0 s) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 (+ s 1)) (< 1 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 s) (< 0 t)) (or (< 0 u) (< m (+ U T S)) (< 1 s) (<= s 0) (< 0 t))), 192766#(and (or (< m (+ U T S)) (not (< 0 s))) (or (<= (+ U T S) (+ m 1)) (<= (+ U T S) (+ m u t s))) (< m (+ U T S 1)) (or (<= (+ U T S) m) (<= (+ U T S) (+ m u t s)) (< 0 s))), 192761#(and (or (< 0 u) (< m (+ U T S)) (< 1 s) (not (< 0 s)) (< 0 t)) (or (< 0 u) (< 1 s) (<= (+ U T S) (+ m 1)) (< 0 t)) (or (< 0 u) (< m (+ U T S 1)) (< 0 s) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 s) (< 0 t))), 192768#(and (or (<= t 0) (<= 0 s)) (or (<= 1 t) (<= s 2)) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= s 1) (<= t 0) (<= (+ 3 m) (+ U T S))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 192706#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 192767#(and (or (<= (+ U T S) m) (< 0 (+ s 1)) (<= (+ U T S) (+ m u t s))) (or (< m (+ U T S)) (not (< 0 s))) (or (<= (+ U T S) (+ m 1)) (<= (+ U T S) (+ m u t s))) (or (< m (+ U T S)) (not (< 0 t)) (not (< 0 (+ s 1)))) (< m (+ U T S 1)) (or (<= (+ U T S) m) (<= (+ U T S) (+ m u t s)) (< 0 s) (< 0 t))), 192764#(and (or (<= 1 t) (not (< 0 s))) (or (<= 0 s) (not (< 0 t))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t))))] [2022-03-15 21:43:48,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 21:43:48,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:43:48,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 21:43:48,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1063, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 21:43:48,767 INFO L87 Difference]: Start difference. First operand 3311 states and 11769 transitions. Second operand has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 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:43:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:43:50,021 INFO L93 Difference]: Finished difference Result 7235 states and 24785 transitions. [2022-03-15 21:43:50,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 21:43:50,022 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 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 23 [2022-03-15 21:43:50,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:43:50,037 INFO L225 Difference]: With dead ends: 7235 [2022-03-15 21:43:50,037 INFO L226 Difference]: Without dead ends: 7220 [2022-03-15 21:43:50,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 32 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1569 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1014, Invalid=3018, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 21:43:50,038 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 248 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:43:50,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 0 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:43:50,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7220 states. [2022-03-15 21:43:50,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7220 to 3321. [2022-03-15 21:43:50,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3321 states, 3320 states have (on average 3.5545180722891567) internal successors, (11801), 3320 states have internal predecessors, (11801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 11801 transitions. [2022-03-15 21:43:50,112 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 11801 transitions. Word has length 23 [2022-03-15 21:43:50,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:50,112 INFO L470 AbstractCegarLoop]: Abstraction has 3321 states and 11801 transitions. [2022-03-15 21:43:50,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 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:43:50,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 11801 transitions. [2022-03-15 21:43:50,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:43:50,117 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:50,117 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:50,135 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:43:50,335 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:43:50,336 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:43:50,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:50,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1659019667, now seen corresponding path program 24 times [2022-03-15 21:43:50,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:50,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229973269] [2022-03-15 21:43:50,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:50,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:50,463 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:50,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:50,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229973269] [2022-03-15 21:43:50,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229973269] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:50,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31727007] [2022-03-15 21:43:50,463 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:43:50,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:50,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:50,464 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:43:50,465 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:43:50,485 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:43:50,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:43:50,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:43:50,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:50,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:52,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31727007] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:52,473 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:52,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 21:43:52,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1558242271] [2022-03-15 21:43:52,474 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:52,476 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:52,481 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 65 transitions. [2022-03-15 21:43:52,481 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:43:53,465 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [206863#(and (or (<= 2 s) (not (< 0 u))) (or (<= s 1) (<= 1 t)) (or (<= s 1) (<= (+ 3 m) (+ U T S))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= 2 s) (not (< 0 t)))), 206864#(and (or (< m (+ U T S)) (not (< 0 s))) (or (<= (+ U T S) (+ m 1)) (<= (+ U T S) (+ m u t s))) (< m (+ U T S 1)) (or (<= (+ U T S) m) (<= (+ U T S) (+ m u t s)) (< 0 s))), 206860#(and (or (< 0 u) (< m (+ U T S)) (< 1 s) (not (< 0 s)) (< 0 t)) (or (< 0 u) (< 1 s) (<= (+ U T S) (+ m 1)) (< 0 t)) (or (< 0 u) (< m (+ U T S 1)) (< 0 s) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 s) (< 0 t))), 206862#(and (or (<= 1 t) (not (< 0 s))) (or (<= 1 s) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 206859#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 206858#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 206861#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 206805#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t))] [2022-03-15 21:43:53,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:43:53,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:43:53,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:43:53,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=900, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 21:43:53,466 INFO L87 Difference]: Start difference. First operand 3321 states and 11801 transitions. Second operand has 19 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:54,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:43:54,265 INFO L93 Difference]: Finished difference Result 6458 states and 22215 transitions. [2022-03-15 21:43:54,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 21:43:54,265 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 21:43:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:43:54,278 INFO L225 Difference]: With dead ends: 6458 [2022-03-15 21:43:54,278 INFO L226 Difference]: Without dead ends: 6443 [2022-03-15 21:43:54,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=711, Invalid=2151, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 21:43:54,279 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 154 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:43:54,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 0 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:43:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6443 states. [2022-03-15 21:43:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6443 to 3327. [2022-03-15 21:43:54,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 3326 states have (on average 3.5541190619362597) internal successors, (11821), 3326 states have internal predecessors, (11821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 11821 transitions. [2022-03-15 21:43:54,417 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 11821 transitions. Word has length 23 [2022-03-15 21:43:54,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:54,417 INFO L470 AbstractCegarLoop]: Abstraction has 3327 states and 11821 transitions. [2022-03-15 21:43:54,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:54,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 11821 transitions. [2022-03-15 21:43:54,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:43:54,423 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:54,423 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:54,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-03-15 21:43:54,630 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:43:54,630 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:43:54,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:54,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1453081235, now seen corresponding path program 25 times [2022-03-15 21:43:54,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:54,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493052163] [2022-03-15 21:43:54,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:54,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:54,793 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:54,793 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:54,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493052163] [2022-03-15 21:43:54,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493052163] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:54,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682238046] [2022-03-15 21:43:54,794 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:43:54,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:54,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:54,803 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:43:54,804 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:43:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:54,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:43:54,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:55,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:43:56,640 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:56,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682238046] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:43:56,641 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:43:56,641 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 21:43:56,641 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1667488330] [2022-03-15 21:43:56,641 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:43:56,642 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:43:56,645 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 61 transitions. [2022-03-15 21:43:56,645 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:43:57,278 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [220175#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 220122#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 220179#(and (or (< m (+ U T S)) (not (< 0 s))) (or (<= (+ U T S) (+ m 1)) (<= (+ U T S) (+ m u t s))) (< m (+ U T S 1)) (or (<= (+ U T S) m) (<= (+ U T S) (+ m u t s)) (< 0 s))), 220177#(and (or (< 0 u) (< m (+ U T S)) (< 1 s) (not (< 0 s)) (< 0 t)) (or (< 0 u) (< 1 s) (<= (+ U T S) (+ m 1)) (< 0 t)) (or (< 0 u) (< m (+ U T S 1)) (< 0 s) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 s) (< 0 t))), 220178#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 220176#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u)))] [2022-03-15 21:43:57,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 21:43:57,279 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:43:57,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 21:43:57,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=775, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:43:57,279 INFO L87 Difference]: Start difference. First operand 3327 states and 11821 transitions. Second operand has 17 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:57,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:43:57,852 INFO L93 Difference]: Finished difference Result 6380 states and 21970 transitions. [2022-03-15 21:43:57,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 21:43:57,852 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 21:43:57,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:43:57,866 INFO L225 Difference]: With dead ends: 6380 [2022-03-15 21:43:57,866 INFO L226 Difference]: Without dead ends: 6365 [2022-03-15 21:43:57,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=687, Invalid=1863, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:43:57,867 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 146 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:43:57,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 0 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:43:57,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6365 states. [2022-03-15 21:43:57,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6365 to 3329. [2022-03-15 21:43:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3328 states have (on average 3.554387019230769) internal successors, (11829), 3328 states have internal predecessors, (11829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 11829 transitions. [2022-03-15 21:43:57,970 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 11829 transitions. Word has length 23 [2022-03-15 21:43:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:43:57,970 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 11829 transitions. [2022-03-15 21:43:57,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:43:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 11829 transitions. [2022-03-15 21:43:57,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:43:57,975 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:43:57,975 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:43:58,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 21:43:58,191 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:43:58,192 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:43:58,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:43:58,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1688822235, now seen corresponding path program 26 times [2022-03-15 21:43:58,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:43:58,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408208313] [2022-03-15 21:43:58,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:43:58,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:43:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:43:58,307 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:58,308 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:43:58,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408208313] [2022-03-15 21:43:58,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408208313] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:43:58,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372539978] [2022-03-15 21:43:58,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:43:58,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:43:58,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:43:58,310 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:43:58,311 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:43:58,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:43:58,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:43:58,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:43:58,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:43:58,834 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:43:58,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:00,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372539978] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:00,422 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:00,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2022-03-15 21:44:00,423 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [945273524] [2022-03-15 21:44:00,423 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:00,424 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:00,429 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 97 transitions. [2022-03-15 21:44:00,429 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:02,102 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [233426#(and (or (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (< 1 u) (<= (+ U T S) (+ m s)) (< 0 t))), 233420#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 233419#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 233423#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= s 1) (<= (+ 2 m) (+ U T S))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= u 0) (<= 0 s)) (or (<= (+ m 1) (+ U T S)) (not (< 0 u))) (or (<= s 1) (<= (+ U T S) (+ m u t s))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 u))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 0 t)) (or (<= s 1) (<= 0 t))), 233425#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 233418#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 233421#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 233427#(and (or (<= (+ U T S) (+ m t s)) (< 1 u)) (or (<= (+ m 1) (+ U T S)) (< 1 u)) (or (<= 1 s) (< 1 u))), 233416#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 233424#(and (or (<= t 0) (<= 0 s)) (or (<= s 2) (<= (+ 3 m) (+ U T S))) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= s 2) (<= (+ U T S) (+ m u t s))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= u 0) (<= 0 s)) (or (<= (+ m 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 u))) (or (<= s 1) (<= u 0) (<= (+ 3 m) (+ U T S))) (or (<= s 1) (<= t 0) (<= (+ 3 m) (+ U T S))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 2) (<= 0 t)) (or (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 0 t))), 233422#(and (or (not (< 0 s)) (<= 0 t)) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (not (< 0 s)) (<= (+ m 1) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 0 t))), 233417#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s))))] [2022-03-15 21:44:02,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:44:02,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:02,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:44:02,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1366, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 21:44:02,102 INFO L87 Difference]: Start difference. First operand 3329 states and 11829 transitions. Second operand has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 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:44:04,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:04,149 INFO L93 Difference]: Finished difference Result 7679 states and 26346 transitions. [2022-03-15 21:44:04,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-15 21:44:04,149 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 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:44:04,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:04,165 INFO L225 Difference]: With dead ends: 7679 [2022-03-15 21:44:04,165 INFO L226 Difference]: Without dead ends: 7664 [2022-03-15 21:44:04,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2694 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1741, Invalid=6631, Unknown=0, NotChecked=0, Total=8372 [2022-03-15 21:44:04,167 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 325 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:04,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 0 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:44:04,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7664 states. [2022-03-15 21:44:04,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7664 to 3517. [2022-03-15 21:44:04,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3517 states, 3516 states have (on average 3.560011376564278) internal successors, (12517), 3516 states have internal predecessors, (12517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3517 states to 3517 states and 12517 transitions. [2022-03-15 21:44:04,268 INFO L78 Accepts]: Start accepts. Automaton has 3517 states and 12517 transitions. Word has length 23 [2022-03-15 21:44:04,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:04,269 INFO L470 AbstractCegarLoop]: Abstraction has 3517 states and 12517 transitions. [2022-03-15 21:44:04,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 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:44:04,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3517 states and 12517 transitions. [2022-03-15 21:44:04,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:44:04,276 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:04,276 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:04,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 21:44:04,483 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:44:04,483 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:04,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:04,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1206900509, now seen corresponding path program 27 times [2022-03-15 21:44:04,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:04,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207263859] [2022-03-15 21:44:04,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:04,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:04,641 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:04,641 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207263859] [2022-03-15 21:44:04,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207263859] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:04,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740434497] [2022-03-15 21:44:04,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:44:04,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:04,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:04,643 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:44:04,643 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:44:04,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:44:04,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:44:04,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 21:44:04,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:05,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:05,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740434497] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:05,841 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:05,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 29 [2022-03-15 21:44:05,841 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1705325797] [2022-03-15 21:44:05,842 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:05,843 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:05,848 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 97 transitions. [2022-03-15 21:44:05,848 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:07,032 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [248409#(and (or (<= 2 s) (not (< 0 u))) (or (<= s 1) (<= (+ U T S) (+ m u t s))) (or (<= s 1) (<= (+ 3 m) (+ U T S))) (or (<= 2 s) (not (< 0 t))) (or (<= s 1) (<= 0 t))), 248406#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 248418#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s)) (< 0 t)) (or (<= (+ m 1) (+ U T S)) (< 1 u) (< 0 t))), 248411#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 248412#(and (or (< 0 u) (<= (+ U T S) (+ m u t s)) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t))), 248415#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (<= t 0) (< 0 u))), 248416#(and (or (<= 2 s) (< 0 t)) (<= 1 s) (<= (+ 2 m) (+ U T S)) (<= (+ U T S) (+ m u t s))), 248410#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 248405#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 248417#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 248414#(and (or (< 0 u) (< 1 t) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (< 1 t) (<= (+ U T S) (+ m u t s)))), 248404#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 248407#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 248408#(and (or (not (< 0 s)) (<= 0 t)) (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (<= 1 s) (not (< 0 u))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)))), 248413#(and (or (< 0 u) (<= (+ 2 m) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (< 0 t)))] [2022-03-15 21:44:07,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:44:07,032 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:07,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:44:07,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=1620, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:44:07,033 INFO L87 Difference]: Start difference. First operand 3517 states and 12517 transitions. Second operand has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 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:44:07,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:07,991 INFO L93 Difference]: Finished difference Result 5183 states and 17758 transitions. [2022-03-15 21:44:07,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 21:44:07,991 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 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 23 [2022-03-15 21:44:07,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:08,002 INFO L225 Difference]: With dead ends: 5183 [2022-03-15 21:44:08,002 INFO L226 Difference]: Without dead ends: 5168 [2022-03-15 21:44:08,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1729 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1254, Invalid=4148, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 21:44:08,003 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 277 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:08,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 0 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:44:08,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2022-03-15 21:44:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 3649. [2022-03-15 21:44:08,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3649 states, 3648 states have (on average 3.560032894736842) internal successors, (12987), 3648 states have internal predecessors, (12987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:08,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 12987 transitions. [2022-03-15 21:44:08,064 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 12987 transitions. Word has length 23 [2022-03-15 21:44:08,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:08,065 INFO L470 AbstractCegarLoop]: Abstraction has 3649 states and 12987 transitions. [2022-03-15 21:44:08,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 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:44:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 12987 transitions. [2022-03-15 21:44:08,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:44:08,071 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:08,071 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:08,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 21:44:08,279 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:44:08,279 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash 683074307, now seen corresponding path program 28 times [2022-03-15 21:44:08,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:08,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374126147] [2022-03-15 21:44:08,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:08,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:08,533 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:08,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374126147] [2022-03-15 21:44:08,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374126147] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:08,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655389941] [2022-03-15 21:44:08,533 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:44:08,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:08,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:08,534 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:44:08,536 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:44:08,561 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:44:08,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:44:08,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:44:08,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:09,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:10,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655389941] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:10,828 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:10,828 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2022-03-15 21:44:10,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [674348381] [2022-03-15 21:44:10,829 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:10,830 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:10,836 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 121 transitions. [2022-03-15 21:44:10,836 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:13,331 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [261148#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m t s))) (or (< 0 u) (not (<= t 0))) (or (< 0 u) (<= 0 s))), 261152#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 261156#(and (or (<= (+ 2 m) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= 1 s) (< 1 u))), 261149#(and (or (< 0 u) (not (< 0 s)) (not (<= t 0))) (or (< 0 u) (<= 0 s) (not (< 0 t))) (or (< 0 u) (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t)))), 261154#(and (or (< 0 u) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 1 s))), 261145#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 261155#(and (or (< 1 u) (<= 0 s)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m 1) (+ U T S)) (< 1 u))), 261153#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 0 s))), 261147#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 261140#(and (or (not (< 0 s)) (not (<= t 0))) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 261150#(and (or (< 0 u) (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (<= t 0) (< 0 u) (<= 0 s))), 261143#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 261151#(and (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 261144#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 261158#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 261141#(and (or (<= t 0) (<= 0 s)) (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (<= s 1) (< 0 t))), 261146#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 261157#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= t 0) (<= (+ m 4) (+ U T S))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 2) (<= 1 T)) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 2) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 261142#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u)))] [2022-03-15 21:44:13,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 21:44:13,331 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:13,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 21:44:13,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=2871, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 21:44:13,339 INFO L87 Difference]: Start difference. First operand 3649 states and 12987 transitions. Second operand has 34 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 33 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:14,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:14,354 INFO L93 Difference]: Finished difference Result 4748 states and 16673 transitions. [2022-03-15 21:44:14,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 21:44:14,354 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 33 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have 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:44:14,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:14,365 INFO L225 Difference]: With dead ends: 4748 [2022-03-15 21:44:14,365 INFO L226 Difference]: Without dead ends: 4733 [2022-03-15 21:44:14,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2204 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1104, Invalid=5376, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 21:44:14,370 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 295 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:14,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 0 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:44:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4733 states. [2022-03-15 21:44:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4733 to 3677. [2022-03-15 21:44:14,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3677 states, 3676 states have (on average 3.557943416757345) internal successors, (13079), 3676 states have internal predecessors, (13079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:14,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 13079 transitions. [2022-03-15 21:44:14,455 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 13079 transitions. Word has length 25 [2022-03-15 21:44:14,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:14,455 INFO L470 AbstractCegarLoop]: Abstraction has 3677 states and 13079 transitions. [2022-03-15 21:44:14,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 33 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:14,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 13079 transitions. [2022-03-15 21:44:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:44:14,462 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:14,462 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:14,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-03-15 21:44:14,675 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:44:14,676 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:14,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:14,676 INFO L85 PathProgramCache]: Analyzing trace with hash 503721901, now seen corresponding path program 29 times [2022-03-15 21:44:14,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:14,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491475596] [2022-03-15 21:44:14,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:14,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:14,857 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:14,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:14,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491475596] [2022-03-15 21:44:14,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491475596] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:14,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527915534] [2022-03-15 21:44:14,857 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:44:14,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:14,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:14,872 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:44:14,896 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:44:14,929 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:44:14,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:44:14,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:44:14,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:15,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:18,035 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:18,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527915534] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:18,035 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:18,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-03-15 21:44:18,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [822087140] [2022-03-15 21:44:18,036 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:18,037 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:18,043 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 107 transitions. [2022-03-15 21:44:18,043 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:20,677 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [273489#(and (or (<= (+ U T S) m) (<= (+ U T S) (+ m u t)) (< 0 s)) (or (< m (+ U T S)) (not (< 0 s))) (< m (+ U T S 1)) (or (<= (+ U T S) (+ m 1)) (not (< 0 s)) (<= (+ U T S) (+ m u t s)))), 273482#(and (or (<= 1 t) (not (< 0 s))) (or (<= 0 s) (not (< 0 t))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 273483#(and (or (<= t 0) (<= 0 s)) (or (<= 1 t) (not (< 0 u))) (or (<= s 1) (<= 1 t)) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 273480#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 273484#(and (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 273491#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 273485#(and (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 273481#(and (or (< 0 u) (< m (+ U T S)) (< 1 s) (not (< 0 s)) (< 0 t)) (or (< 0 u) (< 1 s) (<= (+ U T S) (+ m 1)) (< 0 t)) (or (< 0 u) (< m (+ U T S 1)) (< 0 s) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 s) (< 0 t))), 273490#(and (or (< m (+ U T S)) (not (< 0 s))) (or (< m (+ U T S)) (not (< 0 t)) (not (< 0 (+ s 1)))) (< m (+ U T S 1)) (or (<= (+ U T S) m) (<= (+ U T S) (+ m u t)) (< 0 s) (< 0 t)) (or (<= (+ U T S) m) (<= (+ U T S 1) (+ m u t)) (< 0 (+ s 1)) (not (< 0 t))) (or (<= (+ U T S) (+ m 1)) (<= (+ U T S) (+ m u t s)) (not (< 0 (+ s 1))))), 273488#(and (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= t 0) (<= (+ m 4) (+ U T S))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 2) (<= 1 T)) (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 2) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 273420#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 273486#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 273487#(and (or (< 0 u) (<= (+ U T S) (+ m 1)) (< 1 t) (< 0 s)) (or (< 0 u) (< 0 (+ s 1)) (< 1 t) (< m (+ U T S 1))) (or (< 0 u) (< m (+ U T S)) (< 1 t) (not (< 0 t)) (< 0 s) (not (< 0 (+ s 1)))) (or (< 0 u) (< 1 s) (<= (+ U T S) (+ m 1)) (< 0 t)) (or (< 0 u) (< m (+ U T S 1)) (< 0 s) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 (+ s 1)) (< 1 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 s) (< 0 t)) (or (< 0 u) (< m (+ U T S)) (< 1 s) (<= s 0) (< 0 t)))] [2022-03-15 21:44:20,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:44:20,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:20,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:44:20,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=1400, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 21:44:20,678 INFO L87 Difference]: Start difference. First operand 3677 states and 13079 transitions. Second operand has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 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:44:21,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:21,773 INFO L93 Difference]: Finished difference Result 7281 states and 24991 transitions. [2022-03-15 21:44:21,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 21:44:21,773 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 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 25 [2022-03-15 21:44:21,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:21,788 INFO L225 Difference]: With dead ends: 7281 [2022-03-15 21:44:21,788 INFO L226 Difference]: Without dead ends: 7266 [2022-03-15 21:44:21,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 45 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1748 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1024, Invalid=3266, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 21:44:21,791 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:21,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:44:21,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7266 states. [2022-03-15 21:44:21,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7266 to 3693. [2022-03-15 21:44:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3693 states, 3692 states have (on average 3.555525460455038) internal successors, (13127), 3692 states have internal predecessors, (13127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 13127 transitions. [2022-03-15 21:44:21,896 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 13127 transitions. Word has length 25 [2022-03-15 21:44:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:21,896 INFO L470 AbstractCegarLoop]: Abstraction has 3693 states and 13127 transitions. [2022-03-15 21:44:21,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 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:44:21,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 13127 transitions. [2022-03-15 21:44:21,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:44:21,906 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:21,906 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:21,922 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:44:22,119 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:44:22,119 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:22,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:22,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1169428653, now seen corresponding path program 30 times [2022-03-15 21:44:22,121 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:22,122 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545486128] [2022-03-15 21:44:22,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:22,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:22,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:22,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545486128] [2022-03-15 21:44:22,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545486128] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:22,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684743290] [2022-03-15 21:44:22,328 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:44:22,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:22,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:22,329 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:44:22,330 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:44:22,353 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 21:44:22,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:44:22,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:44:22,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:23,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:24,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684743290] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:24,737 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:24,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-03-15 21:44:24,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1499510301] [2022-03-15 21:44:24,737 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:24,738 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:24,744 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 99 transitions. [2022-03-15 21:44:24,744 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:26,780 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [288385#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 288384#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= t 0) (<= (+ m 4) (+ U T S))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 2) (<= 1 T)) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 2) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 288387#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 288386#(and (or (<= (+ U T S) m) (<= (+ U T S) (+ m u t)) (< 0 s)) (or (< m (+ U T S)) (not (< 0 s))) (< m (+ U T S 1)) (or (<= (+ U T S) (+ m 1)) (not (< 0 s)) (<= (+ U T S) (+ m u t s)))), 288320#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 288382#(and (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 288381#(and (or (< 0 u) (< m (+ U T S)) (< 1 s) (not (< 0 s)) (< 0 t)) (or (< 0 u) (< 1 s) (<= (+ U T S) (+ m 1)) (< 0 t)) (or (< 0 u) (< m (+ U T S 1)) (< 0 s) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 s) (< 0 t))), 288380#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 288383#(and (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t))))] [2022-03-15 21:44:26,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 21:44:26,780 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:26,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 21:44:26,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1153, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 21:44:26,781 INFO L87 Difference]: Start difference. First operand 3693 states and 13127 transitions. Second operand has 21 states, 20 states have (on average 3.25) internal successors, (65), 20 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:44:27,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:27,784 INFO L93 Difference]: Finished difference Result 6773 states and 23351 transitions. [2022-03-15 21:44:27,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 21:44:27,785 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.25) internal successors, (65), 20 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 25 [2022-03-15 21:44:27,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:27,823 INFO L225 Difference]: With dead ends: 6773 [2022-03-15 21:44:27,823 INFO L226 Difference]: Without dead ends: 6758 [2022-03-15 21:44:27,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 45 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=795, Invalid=2511, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 21:44:27,824 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 178 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:27,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 0 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:44:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6758 states. [2022-03-15 21:44:27,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6758 to 3701. [2022-03-15 21:44:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3701 states, 3700 states have (on average 3.554324324324324) internal successors, (13151), 3700 states have internal predecessors, (13151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 13151 transitions. [2022-03-15 21:44:27,903 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 13151 transitions. Word has length 25 [2022-03-15 21:44:27,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:27,903 INFO L470 AbstractCegarLoop]: Abstraction has 3701 states and 13151 transitions. [2022-03-15 21:44:27,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.25) internal successors, (65), 20 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:44:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 13151 transitions. [2022-03-15 21:44:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:44:27,910 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:27,910 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:27,926 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:44:28,110 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:44:28,110 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:28,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:28,112 INFO L85 PathProgramCache]: Analyzing trace with hash -639968381, now seen corresponding path program 31 times [2022-03-15 21:44:28,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:28,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729618253] [2022-03-15 21:44:28,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:28,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:28,347 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:28,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729618253] [2022-03-15 21:44:28,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729618253] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:28,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488670993] [2022-03-15 21:44:28,347 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:44:28,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:28,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:28,358 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:44:28,359 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:44:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:28,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:44:28,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:29,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:31,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488670993] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:31,696 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:31,696 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-03-15 21:44:31,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1924310609] [2022-03-15 21:44:31,697 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:31,698 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:31,705 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 121 transitions. [2022-03-15 21:44:31,705 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:34,249 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [302786#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t))), 302782#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 302788#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m t 1))) (or (< 0 u) (<= 1 s))), 302784#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 302787#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 2 s)) (or (< 0 u) (<= 1 s))), 302783#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 302792#(and (or (<= 1 s) (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (<= 1 s) (< 1 u) (< 0 t))), 302790#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 s)) (<= 0 t)) (or (<= u 0) (<= 0 s)) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t)) (not (<= s 0))) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s)) (not (<= s 0))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)) (not (<= s 0))) (or (<= (+ m 1) (+ U T S)) (not (< 0 u)) (not (<= s 0))) (or (not (< 0 u)) (<= 0 t))), 302789#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= t 0) (<= (+ m 4) (+ U T S))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 2) (<= 1 T)) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 2) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 302791#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (<= s 1)) (not (< 0 t))) (or (<= t 0) (<= (+ m 1) (+ U T S)) (< 0 s)) (or (<= u 0) (<= 0 s)) (or (<= u 0) (<= (+ m 1) (+ U T S)) (< 0 s)) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s)) (not (<= s 1))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 u)) (not (<= s 1))) (or (<= (+ U T S) (+ m u t s)) (not (<= s 1)) (not (< 0 t))) (or (not (< 0 u)) (<= 0 t)) (or (<= s 1) (<= 0 t))), 302781#(and (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 302794#(and (or (<= 2 s) (< 1 u) (<= (+ U T S) (+ m t 1))) (or (<= 2 s) (<= (+ m 1) (+ U T S)) (< 1 u)) (or (<= 1 s) (< 1 u))), 302793#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 302785#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t)))] [2022-03-15 21:44:34,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:44:34,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:34,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:44:34,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=1979, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:44:34,249 INFO L87 Difference]: Start difference. First operand 3701 states and 13151 transitions. Second operand has 28 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:36,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:36,410 INFO L93 Difference]: Finished difference Result 7464 states and 24967 transitions. [2022-03-15 21:44:36,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 21:44:36,410 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:44:36,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:36,424 INFO L225 Difference]: With dead ends: 7464 [2022-03-15 21:44:36,425 INFO L226 Difference]: Without dead ends: 7449 [2022-03-15 21:44:36,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 45 SyntacticMatches, 10 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3387 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1904, Invalid=7216, Unknown=0, NotChecked=0, Total=9120 [2022-03-15 21:44:36,425 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 436 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:36,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 0 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:44:36,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7449 states. [2022-03-15 21:44:36,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7449 to 3929. [2022-03-15 21:44:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3929 states, 3928 states have (on average 3.5496435845213847) internal successors, (13943), 3928 states have internal predecessors, (13943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 13943 transitions. [2022-03-15 21:44:36,506 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 13943 transitions. Word has length 25 [2022-03-15 21:44:36,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:36,506 INFO L470 AbstractCegarLoop]: Abstraction has 3929 states and 13943 transitions. [2022-03-15 21:44:36,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 13943 transitions. [2022-03-15 21:44:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:44:36,512 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:36,512 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:36,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-03-15 21:44:36,727 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:44:36,727 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:36,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:36,728 INFO L85 PathProgramCache]: Analyzing trace with hash 380129667, now seen corresponding path program 32 times [2022-03-15 21:44:36,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:36,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853592311] [2022-03-15 21:44:36,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:36,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:36,953 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:36,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853592311] [2022-03-15 21:44:36,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853592311] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:36,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091209863] [2022-03-15 21:44:36,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:44:36,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:36,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:36,969 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:44:36,970 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:44:36,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:44:36,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:44:36,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:44:36,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:37,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:39,925 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:39,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091209863] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:39,926 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:39,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2022-03-15 21:44:39,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1856470473] [2022-03-15 21:44:39,926 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:39,927 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:39,934 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 118 transitions. [2022-03-15 21:44:39,934 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:41,776 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [318386#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 318391#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 318395#(and (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 t)) (= T t))), 318392#(and (or (< 0 u) (<= 1 t)) (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m t s))) (or (< 0 u) (<= 0 s))), 318388#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 318393#(and (or (< 1 u) (<= 0 s)) (or (<= (+ U T S) (+ m t s)) (< 1 u)) (or (<= (+ m 1) (+ U T S)) (< 1 u)) (or (<= 1 t) (< 1 u))), 318396#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (not (< 0 t)) (= T t))), 318390#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 318394#(and (or (<= (+ U T S) (+ m t s 1)) (not (< 0 u)) (< 1 u)) (or (<= (+ m 1) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (not (< 0 u)) (< 1 u) (<= 0 s)) (or (not (< 0 u)) (< 1 u) (<= 0 t))), 318398#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 318387#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 318389#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 318397#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= t 0) (<= (+ m 4) (+ U T S))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 2) (<= 1 T)) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 2) (= T t)) (or (not (< 0 t)) (= T t)))] [2022-03-15 21:44:41,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:44:41,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:41,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:44:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=1661, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:44:41,778 INFO L87 Difference]: Start difference. First operand 3929 states and 13943 transitions. Second operand has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 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:44:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:42,676 INFO L93 Difference]: Finished difference Result 6207 states and 21298 transitions. [2022-03-15 21:44:42,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 21:44:42,676 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 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 25 [2022-03-15 21:44:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:42,689 INFO L225 Difference]: With dead ends: 6207 [2022-03-15 21:44:42,689 INFO L226 Difference]: Without dead ends: 6196 [2022-03-15 21:44:42,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1511 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=976, Invalid=3854, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 21:44:42,690 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 209 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:42,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 0 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:44:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6196 states. [2022-03-15 21:44:42,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6196 to 3979. [2022-03-15 21:44:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3979 states, 3978 states have (on average 3.547762694821518) internal successors, (14113), 3978 states have internal predecessors, (14113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3979 states to 3979 states and 14113 transitions. [2022-03-15 21:44:42,761 INFO L78 Accepts]: Start accepts. Automaton has 3979 states and 14113 transitions. Word has length 25 [2022-03-15 21:44:42,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:42,762 INFO L470 AbstractCegarLoop]: Abstraction has 3979 states and 14113 transitions. [2022-03-15 21:44:42,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 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:44:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3979 states and 14113 transitions. [2022-03-15 21:44:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:44:42,768 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:42,768 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:42,784 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:44:42,968 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:44:42,969 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:42,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:42,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1736263085, now seen corresponding path program 33 times [2022-03-15 21:44:42,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:42,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063671974] [2022-03-15 21:44:42,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:42,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:43,222 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:43,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063671974] [2022-03-15 21:44:43,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063671974] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:43,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517837166] [2022-03-15 21:44:43,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:44:43,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:43,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:43,224 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:44:43,239 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:44:43,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 21:44:43,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:44:43,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:44:43,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:44,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:45,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517837166] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:45,127 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:45,127 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 11] total 33 [2022-03-15 21:44:45,127 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1504840385] [2022-03-15 21:44:45,127 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:45,128 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:45,135 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 121 transitions. [2022-03-15 21:44:45,135 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:47,767 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [332806#(and (or (<= (+ 2 m) (+ U T S)) (< 1 u)) (or (<= (+ U T S) (+ m u t 1)) (< 1 u) (<= (+ U T S 1) (+ m u t s)))), 332792#(and (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 s)) (not (< 0 t))) (or (<= (+ U S) (+ m u)) (not (< 0 t)) (< 0 s)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 332797#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 332794#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 332801#(and (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= t 0) (<= (+ m 4) (+ U T S))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)) (not (< 0 t))) (or (<= s 2) (<= 1 T)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 2) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= t 0) (<= (+ U S) (+ m u)) (< 0 s)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 332802#(and (<= t 0) (or (<= s 1) (<= (+ 2 m) (+ U T S))) (<= u 0) (or (<= s 1) (<= (+ U T S) (+ m u t s)))), 332793#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 332804#(and (or (< 0 u) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= (+ U T S) (+ 2 m u t)))), 332805#(and (or (<= (+ m 1) (+ U T S)) (< 1 u) (<= s 0)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s)) (<= s 0))), 332800#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= s 0))), 332791#(and (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ U S) (+ m u s)) (<= (+ U S) (+ m u)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 332796#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 332807#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 332799#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= s 0)) (or (<= t 0) (< 0 u))), 332803#(and (or (<= s 1) (< 0 u) (<= (+ U T S) (+ m u t s))) (or (<= s 1) (< 0 u) (<= (+ 2 m) (+ U T S))) (or (<= t 0) (< 0 u))), 332795#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 332798#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S))))] [2022-03-15 21:44:47,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:44:47,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:47,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:44:47,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=2170, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 21:44:47,768 INFO L87 Difference]: Start difference. First operand 3979 states and 14113 transitions. Second operand has 32 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 31 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:44:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:48,618 INFO L93 Difference]: Finished difference Result 4950 states and 17282 transitions. [2022-03-15 21:44:48,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 21:44:48,619 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 31 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 25 [2022-03-15 21:44:48,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:48,640 INFO L225 Difference]: With dead ends: 4950 [2022-03-15 21:44:48,640 INFO L226 Difference]: Without dead ends: 4935 [2022-03-15 21:44:48,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 41 SyntacticMatches, 13 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1981 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=923, Invalid=3907, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 21:44:48,657 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 308 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:48,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 0 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:44:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4935 states. [2022-03-15 21:44:48,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4935 to 4057. [2022-03-15 21:44:48,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4057 states, 4056 states have (on average 3.543639053254438) internal successors, (14373), 4056 states have internal predecessors, (14373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4057 states to 4057 states and 14373 transitions. [2022-03-15 21:44:48,733 INFO L78 Accepts]: Start accepts. Automaton has 4057 states and 14373 transitions. Word has length 25 [2022-03-15 21:44:48,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:48,733 INFO L470 AbstractCegarLoop]: Abstraction has 4057 states and 14373 transitions. [2022-03-15 21:44:48,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 31 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:44:48,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4057 states and 14373 transitions. [2022-03-15 21:44:48,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:44:48,739 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:48,739 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:48,756 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:44:48,956 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:44:48,956 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:48,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:48,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1519966975, now seen corresponding path program 34 times [2022-03-15 21:44:48,957 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:48,957 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279941428] [2022-03-15 21:44:48,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:48,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:49,120 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:49,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279941428] [2022-03-15 21:44:49,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279941428] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:49,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884959873] [2022-03-15 21:44:49,120 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:44:49,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:49,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:49,121 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:44:49,122 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:44:49,145 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:44:49,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:44:49,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:44:49,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:49,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:52,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884959873] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:52,183 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:52,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-03-15 21:44:52,183 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [568901536] [2022-03-15 21:44:52,183 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:52,184 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:52,191 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 116 transitions. [2022-03-15 21:44:52,191 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:54,025 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [346095#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 346088#(and (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= t 0) (<= (+ m 4) (+ U T S))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 2) (<= 1 T)) (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 2) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 346089#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 346091#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 346086#(and (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 346090#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 346096#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 346097#(and (or (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (< 1 u) (<= (+ U T S) (+ m s)) (< 0 t))), 346098#(and (or (<= 1 s) (< 0 t)) (<= (+ m 1) (+ U T S)) (<= (+ U T S) (+ m u t s)) (<= 0 s)), 346087#(and (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 346093#(and (or (< 0 u) (< 1 t) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m s 1)) (< 1 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 346092#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 346094#(and (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ m 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (not (< 0 u)) (<= 0 t)))] [2022-03-15 21:44:54,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 21:44:54,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:54,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 21:44:54,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1740, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 21:44:54,026 INFO L87 Difference]: Start difference. First operand 4057 states and 14373 transitions. Second operand has 26 states, 25 states have (on average 2.88) internal successors, (72), 25 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:44:55,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:55,712 INFO L93 Difference]: Finished difference Result 9132 states and 30019 transitions. [2022-03-15 21:44:55,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 21:44:55,712 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.88) internal successors, (72), 25 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:44:55,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:55,732 INFO L225 Difference]: With dead ends: 9132 [2022-03-15 21:44:55,732 INFO L226 Difference]: Without dead ends: 9117 [2022-03-15 21:44:55,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2665 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1588, Invalid=6068, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 21:44:55,734 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 262 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:55,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 0 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:44:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9117 states. [2022-03-15 21:44:55,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9117 to 4023. [2022-03-15 21:44:55,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4023 states, 4022 states have (on average 3.546742913973148) internal successors, (14265), 4022 states have internal predecessors, (14265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4023 states to 4023 states and 14265 transitions. [2022-03-15 21:44:55,832 INFO L78 Accepts]: Start accepts. Automaton has 4023 states and 14265 transitions. Word has length 25 [2022-03-15 21:44:55,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:55,832 INFO L470 AbstractCegarLoop]: Abstraction has 4023 states and 14265 transitions. [2022-03-15 21:44:55,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.88) internal successors, (72), 25 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:44:55,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4023 states and 14265 transitions. [2022-03-15 21:44:55,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:44:55,839 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:55,839 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:55,857 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:44:56,057 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:44:56,057 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:56,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:56,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1244047101, now seen corresponding path program 35 times [2022-03-15 21:44:56,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:56,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860469864] [2022-03-15 21:44:56,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:56,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:56,305 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:56,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860469864] [2022-03-15 21:44:56,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860469864] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:56,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907993799] [2022-03-15 21:44:56,306 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:44:56,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:56,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:56,307 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:44:56,308 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:44:56,328 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:44:56,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:44:56,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:44:56,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:57,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:58,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907993799] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:58,665 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:58,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-03-15 21:44:58,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [573787063] [2022-03-15 21:44:58,665 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:58,667 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:58,673 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 116 transitions. [2022-03-15 21:44:58,673 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:00,800 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [363553#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (< 0 u) (<= 2 s) (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (< 0 u) (< 0 t)) (or (<= t 0) (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 s)) (or (<= t 0) (< 0 u) (<= 0 s))), 363558#(and (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 363554#(and (or (< 0 u) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 1 s))), 363559#(and (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= 0 s) (not (< 0 t))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 363550#(and (or (< 0 u) (not (< 0 s)) (not (<= t 0))) (or (< 0 u) (<= 1 s) (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= 1 s) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (<= t 0) (< 0 u) (<= 0 s))), 363551#(and (or (<= t 0) (<= 0 s)) (or (<= 2 s) (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= t 0) (<= (+ m 1) (+ U T S)) (< 0 s)) (or (<= 2 s) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u))) (or (<= s 1) (< 0 t))), 363548#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m t s))) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s))), 363543#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 363556#(and (or (< 1 u) (<= 0 s)) (or (<= 2 t) (< 1 u)) (or (<= (+ 2 m) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s)))), 363557#(and (or (<= (+ 2 m) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (not (< 0 u)) (< 1 u) (<= 0 s)) (or (<= 1 t) (not (< 0 u)) (< 1 u)) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s)) (< 1 u))), 363545#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 363542#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 s)) (not (<= t 0))) (or (<= 1 s) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u))) (or (<= 1 s) (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 363549#(and (or (< 0 u) (<= 1 s) (<= (+ U T S) (+ m t s))) (or (< 0 u) (<= 1 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (not (<= t 0))) (or (< 0 u) (<= 0 s))), 363546#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 363547#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)))), 363552#(and (or (< 0 u) (<= 1 s) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 1 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 0 s))), 363560#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 363555#(and (or (< 0 u) (<= (+ 2 m) (+ U T S))) (or (<= 2 t) (< 0 u)) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 0 s))), 363544#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t)))] [2022-03-15 21:45:00,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 21:45:00,800 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:00,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 21:45:00,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=596, Invalid=2710, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 21:45:00,801 INFO L87 Difference]: Start difference. First operand 4023 states and 14265 transitions. Second operand has 34 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 33 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:03,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:03,454 INFO L93 Difference]: Finished difference Result 8594 states and 29492 transitions. [2022-03-15 21:45:03,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-03-15 21:45:03,454 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 33 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have 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:45:03,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:03,473 INFO L225 Difference]: With dead ends: 8594 [2022-03-15 21:45:03,474 INFO L226 Difference]: Without dead ends: 8583 [2022-03-15 21:45:03,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4971 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2590, Invalid=10982, Unknown=0, NotChecked=0, Total=13572 [2022-03-15 21:45:03,475 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 484 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:03,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [484 Valid, 0 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:45:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8583 states. [2022-03-15 21:45:03,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8583 to 4055. [2022-03-15 21:45:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4055 states, 4054 states have (on average 3.5468672915638875) internal successors, (14379), 4054 states have internal predecessors, (14379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4055 states to 4055 states and 14379 transitions. [2022-03-15 21:45:03,572 INFO L78 Accepts]: Start accepts. Automaton has 4055 states and 14379 transitions. Word has length 25 [2022-03-15 21:45:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:03,572 INFO L470 AbstractCegarLoop]: Abstraction has 4055 states and 14379 transitions. [2022-03-15 21:45:03,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 33 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 4055 states and 14379 transitions. [2022-03-15 21:45:03,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:45:03,578 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:03,578 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:03,594 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:45:03,791 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:45:03,791 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:03,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:03,792 INFO L85 PathProgramCache]: Analyzing trace with hash -332616633, now seen corresponding path program 36 times [2022-03-15 21:45:03,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:03,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615900109] [2022-03-15 21:45:03,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:03,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:04,016 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:04,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615900109] [2022-03-15 21:45:04,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615900109] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:04,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058077587] [2022-03-15 21:45:04,016 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:45:04,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:04,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:04,017 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:45:04,032 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:45:04,053 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 21:45:04,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:45:04,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 21:45:04,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:04,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:05,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058077587] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:05,760 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:05,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 11] total 33 [2022-03-15 21:45:05,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [198328595] [2022-03-15 21:45:05,760 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:05,762 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:05,768 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 117 transitions. [2022-03-15 21:45:05,768 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:08,484 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [380572#(and (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 380564#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 380571#(and (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (<= s 1) (< 0 t))), 380578#(and (or (< 0 u) (<= s 2) (< 0 t)) (or (< 0 u) (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (<= s 1) (<= t 0) (< 0 u) (<= (+ 3 m) (+ U T S))) (or (<= t 0) (< 0 u) (<= 0 s))), 380580#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 380582#(and (or (<= (+ 2 m) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= s 1) (<= (+ 3 m) (+ U T S)) (< 1 u)) (or (<= 1 s) (< 1 u))), 380576#(and (or (<= t 0) (<= 0 s)) (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u))) (or (<= s 2) (< 0 t)) (or (<= s 1) (<= t 0) (<= (+ 3 m) (+ U T S))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 380577#(and (or (< 1 u) (<= 0 s)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ 2 m) (+ U T S)) (< 1 u) (<= s 0)) (or (<= (+ m 1) (+ U T S)) (< 1 u))), 380567#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 380562#(and (or (not (< 0 s)) (not (<= t 0))) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 380574#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 0 s))), 380569#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m t s))) (or (< 0 u) (not (<= t 0))) (or (< 0 u) (<= 0 s))), 380566#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 380573#(and (or (< 0 u) (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= 0 s) (not (< 0 t))) (or (<= s 1) (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t)))), 380570#(and (or (< 0 u) (not (< 0 s)) (not (<= t 0))) (or (< 0 u) (<= 0 s) (not (< 0 t))) (or (< 0 u) (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t)))), 380568#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 380581#(and (or (< 0 u) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 1 s)) (or (<= s 1) (< 0 u) (<= (+ 3 m) (+ U T S)))), 380563#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 380565#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 380579#(and (or (<= t 0) (<= 0 s)) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 380575#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ 2 m) (+ U T S)) (<= s 0)) (or (< 0 u) (<= 0 s)))] [2022-03-15 21:45:08,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:45:08,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:08,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:45:08,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=2539, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 21:45:08,485 INFO L87 Difference]: Start difference. First operand 4055 states and 14379 transitions. Second operand has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 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:45:10,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:10,157 INFO L93 Difference]: Finished difference Result 5070 states and 17828 transitions. [2022-03-15 21:45:10,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 21:45:10,157 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 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 25 [2022-03-15 21:45:10,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:10,168 INFO L225 Difference]: With dead ends: 5070 [2022-03-15 21:45:10,168 INFO L226 Difference]: Without dead ends: 5055 [2022-03-15 21:45:10,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1950 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1292, Invalid=5680, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 21:45:10,172 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 335 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:10,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 0 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:45:10,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5055 states. [2022-03-15 21:45:10,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5055 to 4099. [2022-03-15 21:45:10,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4099 states, 4098 states have (on average 3.544411908247926) internal successors, (14525), 4098 states have internal predecessors, (14525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4099 states to 4099 states and 14525 transitions. [2022-03-15 21:45:10,246 INFO L78 Accepts]: Start accepts. Automaton has 4099 states and 14525 transitions. Word has length 25 [2022-03-15 21:45:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:10,246 INFO L470 AbstractCegarLoop]: Abstraction has 4099 states and 14525 transitions. [2022-03-15 21:45:10,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 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:45:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand 4099 states and 14525 transitions. [2022-03-15 21:45:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:45:10,253 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:10,253 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:10,270 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:45:10,467 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:45:10,467 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:10,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:10,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1396431421, now seen corresponding path program 37 times [2022-03-15 21:45:10,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:10,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550456193] [2022-03-15 21:45:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:10,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:10,728 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:10,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550456193] [2022-03-15 21:45:10,729 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550456193] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:10,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404940402] [2022-03-15 21:45:10,729 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:45:10,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:10,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:10,730 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:45:10,732 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:45:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:10,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:45:10,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:11,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:12,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404940402] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:12,448 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:12,448 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 39 [2022-03-15 21:45:12,448 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [95674367] [2022-03-15 21:45:12,448 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:12,450 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:12,456 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 117 transitions. [2022-03-15 21:45:12,456 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:14,326 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [394108#(and (or (< 1 u) (<= 0 s)) (or (<= (+ m s 1) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s)))), 394112#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 394110#(and (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 394097#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (not (<= s 0)))), 394095#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 394107#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m s 1) (+ U T S))) (or (< 0 u) (<= 1 s))), 394111#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 1 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ U S) (+ m u s)) (not (< 1 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 1 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 394106#(and (or (< 0 u) (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (<= s 1) (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 0 s) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= s 1) (< 0 u) (<= (+ m s 1) (+ U T S)))), 394098#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (<= t 0) (< 0 u))), 394102#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m s 1) (+ U T S))) (or (< 0 u) (<= 0 s))), 394096#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 394104#(and (or (< 0 u) (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 0 s) (not (< 0 t))) (or (< 0 u) (not (< 0 s)) (<= (+ m s 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (not (< 0 t)))), 394100#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 1 s)) (or (<= t 0) (< 0 u))), 394105#(and (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (<= u 0) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= s 1) (<= (+ U T S) (+ m u t s))) (or (<= s 1) (<= (+ m s 1) (+ U T S)))), 394094#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (< 0 t)) (or (< 0 u) (not (<= s 0)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 394101#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 1 s))), 394109#(and (or (<= (+ m s 1) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= 1 s) (< 1 u))), 394103#(and (or (not (< 0 s)) (<= (+ m s 1) (+ U T S))) (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (<= u 0) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ U T S) (+ m u t s)))), 394092#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 394093#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 394099#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (< 0 t)))] [2022-03-15 21:45:14,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:45:14,327 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:14,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:45:14,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=3187, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 21:45:14,327 INFO L87 Difference]: Start difference. First operand 4099 states and 14525 transitions. Second operand has 36 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 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:45:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:15,056 INFO L93 Difference]: Finished difference Result 4646 states and 16337 transitions. [2022-03-15 21:45:15,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 21:45:15,056 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 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 25 [2022-03-15 21:45:15,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:15,065 INFO L225 Difference]: With dead ends: 4646 [2022-03-15 21:45:15,066 INFO L226 Difference]: Without dead ends: 4611 [2022-03-15 21:45:15,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2489 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1052, Invalid=5110, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 21:45:15,066 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 226 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:15,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 0 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:45:15,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4611 states. [2022-03-15 21:45:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4611 to 4139. [2022-03-15 21:45:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4139 states, 4138 states have (on average 3.541565973900435) internal successors, (14655), 4138 states have internal predecessors, (14655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4139 states to 4139 states and 14655 transitions. [2022-03-15 21:45:15,161 INFO L78 Accepts]: Start accepts. Automaton has 4139 states and 14655 transitions. Word has length 25 [2022-03-15 21:45:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:15,161 INFO L470 AbstractCegarLoop]: Abstraction has 4139 states and 14655 transitions. [2022-03-15 21:45:15,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 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:45:15,161 INFO L276 IsEmpty]: Start isEmpty. Operand 4139 states and 14655 transitions. [2022-03-15 21:45:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:45:15,167 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:15,167 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:15,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-03-15 21:45:15,379 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:45:15,379 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:15,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:15,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1534438015, now seen corresponding path program 38 times [2022-03-15 21:45:15,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:15,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847840093] [2022-03-15 21:45:15,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:15,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:15,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:15,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847840093] [2022-03-15 21:45:15,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847840093] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:15,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938190868] [2022-03-15 21:45:15,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:45:15,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:15,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:15,528 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:45:15,529 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:45:15,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:45:15,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:45:15,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:45:15,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:16,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:18,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938190868] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:18,164 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:18,164 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 30 [2022-03-15 21:45:18,164 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1337287174] [2022-03-15 21:45:18,164 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:18,166 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:18,172 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 100 transitions. [2022-03-15 21:45:18,172 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:19,518 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [407258#(and (or (<= 1 t) (not (< 0 s))) (or (<= 0 s) (not (< 0 t))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 407254#(and (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 407257#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 407249#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 407253#(and (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ 2 m) (+ U T S)) (not (< 0 u)))), 407260#(and (or (<= t 0) (<= 0 s)) (or (<= 1 t) (not (< 0 u))) (or (<= s 1) (<= 1 t)) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 407259#(and (or (<= 1 s) (< 0 t)) (<= (+ m 1) (+ U T S)) (<= (+ U T S) (+ m u t s)) (<= 0 s)), 407247#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 407252#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 407256#(and (or (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (< 1 u) (<= (+ U T S) (+ m s)) (< 0 t))), 407248#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 407251#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 407255#(and (or (<= t 0) (<= 0 s)) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 407250#(and (or (< 0 u) (< 1 t) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m s 1)) (< 1 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t)))] [2022-03-15 21:45:19,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:45:19,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:19,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:45:19,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=429, Invalid=1641, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:45:19,521 INFO L87 Difference]: Start difference. First operand 4139 states and 14655 transitions. Second operand has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:20,585 INFO L93 Difference]: Finished difference Result 7914 states and 26011 transitions. [2022-03-15 21:45:20,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 21:45:20,586 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:45:20,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:20,602 INFO L225 Difference]: With dead ends: 7914 [2022-03-15 21:45:20,602 INFO L226 Difference]: Without dead ends: 7899 [2022-03-15 21:45:20,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1787 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1186, Invalid=4364, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 21:45:20,605 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 305 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:20,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 0 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:45:20,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7899 states. [2022-03-15 21:45:20,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7899 to 4161. [2022-03-15 21:45:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4161 states, 4160 states have (on average 3.542548076923077) internal successors, (14737), 4160 states have internal predecessors, (14737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4161 states to 4161 states and 14737 transitions. [2022-03-15 21:45:20,704 INFO L78 Accepts]: Start accepts. Automaton has 4161 states and 14737 transitions. Word has length 25 [2022-03-15 21:45:20,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:20,704 INFO L470 AbstractCegarLoop]: Abstraction has 4161 states and 14737 transitions. [2022-03-15 21:45:20,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:20,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4161 states and 14737 transitions. [2022-03-15 21:45:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:45:20,710 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:20,710 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:20,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 21:45:20,923 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:45:20,923 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:20,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:20,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1293622855, now seen corresponding path program 39 times [2022-03-15 21:45:20,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:20,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373931596] [2022-03-15 21:45:20,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:20,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:21,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:21,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373931596] [2022-03-15 21:45:21,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373931596] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:21,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796837871] [2022-03-15 21:45:21,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:45:21,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:21,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:21,152 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:45:21,186 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:45:21,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 21:45:21,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:45:21,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:45:21,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:21,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:22,792 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:22,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796837871] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:22,792 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:22,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 32 [2022-03-15 21:45:22,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [75321499] [2022-03-15 21:45:22,793 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:22,794 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:22,799 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 110 transitions. [2022-03-15 21:45:22,800 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:24,509 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [423739#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 423744#(and (or (<= 1 s) (not (< 0 t))) (or (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 s)) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u)))), 423743#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 423735#(and (or (<= (+ U T S) (+ m u t)) (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= 1 t) (not (< 0 u))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 u)))), 423733#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 423741#(and (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= s 0) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0) (< 0 t))), 423736#(and (<= t 0) (or (<= s 1) (<= (+ 2 m) (+ U T S))) (<= u 0) (or (<= s 1) (<= (+ U T S) (+ m u t s)))), 423748#(and (or (<= s 1) (<= (+ 2 m) (+ U T S))) (or (<= s 1) (<= (+ U T S) (+ m u t s))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t)) (<= s 0)) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t)) (<= s 0))), 423740#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 423738#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 423734#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 423742#(and (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 423737#(and (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 423746#(and (or (<= s 1) (<= (+ 2 m) (+ U T S))) (or (<= s 1) (<= (+ U T S) (+ m u t s)))), 423745#(and (or (<= s 1) (< 0 u) (<= (+ U T S) (+ m u t s)) (< 0 t)) (or (<= s 1) (< 0 u) (<= (+ 2 m) (+ U T S)) (< 0 t))), 423747#(and (or (<= s 1) (< 0 u) (<= (+ U T S) (+ m u t s)) (< 0 t)) (or (<= s 1) (< 0 u) (<= (+ 2 m) (+ U T S)) (< 0 t)) (or (< 0 u) (< 1 t) (<= (+ 2 m) (+ U T S)) (not (< 0 t)) (<= s 0)) (or (< 0 u) (< 1 t) (<= (+ U T S) (+ m u t s)) (not (< 0 t)) (<= s 0)))] [2022-03-15 21:45:24,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 21:45:24,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:24,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 21:45:24,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=1947, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:45:24,510 INFO L87 Difference]: Start difference. First operand 4161 states and 14737 transitions. Second operand has 30 states, 29 states have (on average 2.689655172413793) internal successors, (78), 29 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:45:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:26,051 INFO L93 Difference]: Finished difference Result 6245 states and 20831 transitions. [2022-03-15 21:45:26,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 21:45:26,051 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.689655172413793) internal successors, (78), 29 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 25 [2022-03-15 21:45:26,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:26,064 INFO L225 Difference]: With dead ends: 6245 [2022-03-15 21:45:26,064 INFO L226 Difference]: Without dead ends: 6230 [2022-03-15 21:45:26,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2542 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1667, Invalid=5815, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 21:45:26,066 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 292 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:26,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 0 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:45:26,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6230 states. [2022-03-15 21:45:26,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6230 to 4171. [2022-03-15 21:45:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4171 states, 4170 states have (on average 3.5412470023980815) internal successors, (14767), 4170 states have internal predecessors, (14767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 14767 transitions. [2022-03-15 21:45:26,142 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 14767 transitions. Word has length 25 [2022-03-15 21:45:26,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:26,142 INFO L470 AbstractCegarLoop]: Abstraction has 4171 states and 14767 transitions. [2022-03-15 21:45:26,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.689655172413793) internal successors, (78), 29 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:45:26,142 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 14767 transitions. [2022-03-15 21:45:26,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:45:26,148 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:26,149 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:26,165 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:45:26,364 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:45:26,365 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:26,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:26,365 INFO L85 PathProgramCache]: Analyzing trace with hash -868731263, now seen corresponding path program 40 times [2022-03-15 21:45:26,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:26,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443187490] [2022-03-15 21:45:26,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:26,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:26,560 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:26,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443187490] [2022-03-15 21:45:26,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443187490] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:26,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529008533] [2022-03-15 21:45:26,560 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:45:26,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:26,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:26,562 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:45:26,563 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:45:26,585 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:45:26,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:45:26,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:45:26,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:27,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:29,122 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:29,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529008533] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:29,122 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:29,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-03-15 21:45:29,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1438592505] [2022-03-15 21:45:29,122 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:29,124 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:29,129 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 92 transitions. [2022-03-15 21:45:29,129 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:30,196 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [438593#(and (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= 0 s) (not (< 0 t))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 438595#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 438589#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 438594#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 438596#(and (or (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (< 1 u) (<= (+ U T S) (+ m s)) (< 0 t))), 438597#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 438592#(and (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 438591#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 438590#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 438588#(and (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ 2 m) (+ U T S)) (not (< 0 u))))] [2022-03-15 21:45:30,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:45:30,197 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:30,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:45:30,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=1519, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 21:45:30,197 INFO L87 Difference]: Start difference. First operand 4171 states and 14767 transitions. Second operand has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:30,920 INFO L93 Difference]: Finished difference Result 7797 states and 25829 transitions. [2022-03-15 21:45:30,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 21:45:30,920 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:45:30,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:30,937 INFO L225 Difference]: With dead ends: 7797 [2022-03-15 21:45:30,937 INFO L226 Difference]: Without dead ends: 7782 [2022-03-15 21:45:30,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1391 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=898, Invalid=3524, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 21:45:30,938 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 257 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:30,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 0 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:45:30,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7782 states. [2022-03-15 21:45:31,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7782 to 4235. [2022-03-15 21:45:31,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4235 states, 4234 states have (on average 3.54298535663675) internal successors, (15001), 4234 states have internal predecessors, (15001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:31,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4235 states to 4235 states and 15001 transitions. [2022-03-15 21:45:31,022 INFO L78 Accepts]: Start accepts. Automaton has 4235 states and 15001 transitions. Word has length 25 [2022-03-15 21:45:31,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:31,023 INFO L470 AbstractCegarLoop]: Abstraction has 4235 states and 15001 transitions. [2022-03-15 21:45:31,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:31,023 INFO L276 IsEmpty]: Start isEmpty. Operand 4235 states and 15001 transitions. [2022-03-15 21:45:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:45:31,029 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:31,030 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:31,046 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:45:31,237 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:45:31,238 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:31,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:31,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1823086651, now seen corresponding path program 41 times [2022-03-15 21:45:31,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:31,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043515915] [2022-03-15 21:45:31,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:31,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:31,409 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:31,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043515915] [2022-03-15 21:45:31,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043515915] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:31,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095680523] [2022-03-15 21:45:31,409 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:45:31,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:31,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:31,410 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:45:31,412 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:45:31,433 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:45:31,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:45:31,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:45:31,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:32,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:34,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095680523] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:34,066 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:34,066 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-03-15 21:45:34,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [693332430] [2022-03-15 21:45:34,066 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:34,067 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:34,073 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 93 transitions. [2022-03-15 21:45:34,073 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:35,636 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [455089#(and (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 455096#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 455097#(and (or (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (< 1 u) (<= (+ U T S) (+ m s)) (< 0 t))), 455102#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 455092#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 455090#(and (or (<= t 0) (<= 0 s)) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 455093#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 455100#(and (or (<= 1 t) (<= s 2)) (or (<= 0 s) (not (< 0 t))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= s 1) (<= t 0) (<= (+ 3 m) (+ U T S))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 455095#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 455091#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 455099#(and (or (<= 0 s) (not (< 0 t))) (or (<= 1 t) (not (< 0 u))) (or (<= s 1) (<= 1 t)) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 455098#(and (or (<= 1 t) (not (< 0 s))) (or (<= 0 s) (not (< 0 t))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)))), 455101#(and (or (<= 1 s) (< 0 t)) (<= (+ m 1) (+ U T S)) (<= (+ U T S) (+ m u t s)) (<= 0 s)), 455094#(and (or (< 0 u) (< 1 t) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m s 1)) (< 1 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t)))] [2022-03-15 21:45:35,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:45:35,636 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:35,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:45:35,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=1832, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 21:45:35,637 INFO L87 Difference]: Start difference. First operand 4235 states and 15001 transitions. Second operand has 27 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 26 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:45:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:36,662 INFO L93 Difference]: Finished difference Result 7417 states and 24984 transitions. [2022-03-15 21:45:36,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 21:45:36,663 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 26 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 25 [2022-03-15 21:45:36,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:36,678 INFO L225 Difference]: With dead ends: 7417 [2022-03-15 21:45:36,678 INFO L226 Difference]: Without dead ends: 7402 [2022-03-15 21:45:36,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 21:45:36,680 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 278 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:36,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 0 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:45:36,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7402 states. [2022-03-15 21:45:36,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7402 to 4261. [2022-03-15 21:45:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4261 states, 4260 states have (on average 3.541079812206573) internal successors, (15085), 4260 states have internal predecessors, (15085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 15085 transitions. [2022-03-15 21:45:36,759 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 15085 transitions. Word has length 25 [2022-03-15 21:45:36,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:36,760 INFO L470 AbstractCegarLoop]: Abstraction has 4261 states and 15085 transitions. [2022-03-15 21:45:36,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 26 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:45:36,760 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 15085 transitions. [2022-03-15 21:45:36,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:45:36,766 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:36,766 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:36,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 21:45:36,979 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:45:36,980 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:36,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:36,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2103031233, now seen corresponding path program 42 times [2022-03-15 21:45:36,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:36,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043957611] [2022-03-15 21:45:36,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:36,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:37,157 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:37,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043957611] [2022-03-15 21:45:37,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043957611] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:37,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990866054] [2022-03-15 21:45:37,157 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:45:37,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:37,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:37,168 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:45:37,215 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:45:37,221 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 21:45:37,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:45:37,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 21:45:37,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:37,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:38,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990866054] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:38,378 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:38,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2022-03-15 21:45:38,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1608651476] [2022-03-15 21:45:38,378 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:38,379 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:38,385 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 103 transitions. [2022-03-15 21:45:38,385 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:39,834 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [471282#(and (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (<= 1 t) (not (< 0 u))) (or (<= s 1) (<= 1 t)) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 471279#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (< 0 t))), 471268#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 471276#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s)) (<= s 0) (< 0 t)) (or (<= (+ m s) (+ U T S)) (< 1 u) (<= s 0) (< 0 t))), 471277#(and (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 471278#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 471269#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (not (<= s 0)))), 471274#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= s 0) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= s 0) (< 0 t))), 471280#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (< 0 t)) (or (< 0 u) (< 1 t) (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (< 1 t) (<= (+ U T S) (+ m u t s)))), 471267#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 471270#(and (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= s 0)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= s 0)) (or (<= t 0) (< 0 u))), 471271#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 471272#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 471283#(and (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (<= (+ m s) (+ U T S)) (<= (+ U T S) (+ m u t s))), 471281#(and (or (<= 1 t) (not (< 0 s))) (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 471275#(and (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 471273#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (< 0 t)) (or (< 0 u) (not (<= s 0)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t)))] [2022-03-15 21:45:39,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:45:39,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:39,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:45:39,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=517, Invalid=2135, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 21:45:39,835 INFO L87 Difference]: Start difference. First operand 4261 states and 15085 transitions. Second operand has 31 states, 30 states have (on average 2.566666666666667) internal successors, (77), 30 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:45:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:40,629 INFO L93 Difference]: Finished difference Result 6559 states and 22332 transitions. [2022-03-15 21:45:40,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 21:45:40,630 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.566666666666667) internal successors, (77), 30 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 25 [2022-03-15 21:45:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:40,642 INFO L225 Difference]: With dead ends: 6559 [2022-03-15 21:45:40,642 INFO L226 Difference]: Without dead ends: 6514 [2022-03-15 21:45:40,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1190, Invalid=4212, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 21:45:40,643 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 341 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:40,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 0 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:45:40,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2022-03-15 21:45:40,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 4406. [2022-03-15 21:45:40,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4406 states, 4405 states have (on average 3.5293984108967082) internal successors, (15547), 4405 states have internal predecessors, (15547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:40,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4406 states to 4406 states and 15547 transitions. [2022-03-15 21:45:40,716 INFO L78 Accepts]: Start accepts. Automaton has 4406 states and 15547 transitions. Word has length 25 [2022-03-15 21:45:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:40,716 INFO L470 AbstractCegarLoop]: Abstraction has 4406 states and 15547 transitions. [2022-03-15 21:45:40,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.566666666666667) internal successors, (77), 30 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:45:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 4406 states and 15547 transitions. [2022-03-15 21:45:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:45:40,723 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:40,723 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:40,753 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:45:40,935 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:45:40,935 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:40,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:40,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1157379899, now seen corresponding path program 43 times [2022-03-15 21:45:40,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:40,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011090965] [2022-03-15 21:45:40,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:40,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:41,127 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:41,127 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011090965] [2022-03-15 21:45:41,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011090965] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:41,127 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20418500] [2022-03-15 21:45:41,127 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:45:41,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:41,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:41,129 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:45:41,147 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:45:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:41,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:45:41,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:41,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:43,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20418500] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:43,684 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:43,684 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-03-15 21:45:43,684 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [802947973] [2022-03-15 21:45:43,684 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:43,685 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:43,690 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 85 transitions. [2022-03-15 21:45:43,690 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:45,235 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [486879#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 486885#(and (or (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (< 1 u) (<= (+ U T S) (+ m s)) (< 0 t))), 486887#(and (or (< 0 u) (<= m (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ m s) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 486878#(and (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 486881#(and (or (<= t 0) (<= 0 s)) (or (not (< 1 s)) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 1 s)) (<= (+ 2 m s) (+ U T S))) (or (<= (+ U S) (+ m u s)) (not (< 1 s))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 486883#(and (or (<= t 0) (<= 0 s)) (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 1 s)) (<= 1 t))), 486886#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 486884#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 486882#(and (or (<= 1 t) (not (< 0 s))) (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (<= 0 s) (not (< 0 t))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 486877#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 486880#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s))))] [2022-03-15 21:45:45,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:45:45,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:45,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:45:45,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=1602, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:45:45,236 INFO L87 Difference]: Start difference. First operand 4406 states and 15547 transitions. Second operand has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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:45:46,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:46,041 INFO L93 Difference]: Finished difference Result 7013 states and 23855 transitions. [2022-03-15 21:45:46,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 21:45:46,041 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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 25 [2022-03-15 21:45:46,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:46,054 INFO L225 Difference]: With dead ends: 7013 [2022-03-15 21:45:46,054 INFO L226 Difference]: Without dead ends: 6979 [2022-03-15 21:45:46,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=895, Invalid=3395, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 21:45:46,055 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:46,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:45:46,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2022-03-15 21:45:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 4345. [2022-03-15 21:45:46,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4345 states, 4344 states have (on average 3.5361418047882136) internal successors, (15361), 4344 states have internal predecessors, (15361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:46,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4345 states to 4345 states and 15361 transitions. [2022-03-15 21:45:46,133 INFO L78 Accepts]: Start accepts. Automaton has 4345 states and 15361 transitions. Word has length 25 [2022-03-15 21:45:46,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:46,133 INFO L470 AbstractCegarLoop]: Abstraction has 4345 states and 15361 transitions. [2022-03-15 21:45:46,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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:45:46,133 INFO L276 IsEmpty]: Start isEmpty. Operand 4345 states and 15361 transitions. [2022-03-15 21:45:46,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:45:46,140 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:46,140 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:46,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-15 21:45:46,355 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:45:46,356 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:46,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:46,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1756469891, now seen corresponding path program 44 times [2022-03-15 21:45:46,378 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:46,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640243917] [2022-03-15 21:45:46,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:46,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:46,599 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:46,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:46,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640243917] [2022-03-15 21:45:46,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640243917] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:46,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142745133] [2022-03-15 21:45:46,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:45:46,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:46,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:46,612 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:45:46,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:45:46,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:45:46,644 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:45:46,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:45:46,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:47,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:49,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142745133] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:49,513 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:49,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2022-03-15 21:45:49,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006120447] [2022-03-15 21:45:49,513 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:49,515 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:49,521 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 117 transitions. [2022-03-15 21:45:49,521 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:52,191 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [502814#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 502822#(and (or (<= 2 s) (< 1 u) (<= (+ U T S) (+ m t 1))) (or (<= 2 s) (<= (+ m 1) (+ U T S)) (< 1 u)) (or (<= 1 s) (< 1 u))), 502817#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m t 1))) (or (< 0 u) (<= 1 s))), 502819#(and (or (<= t 0) (<= 0 s)) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 502818#(and (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 502812#(and (or (<= t 0) (<= 0 s)) (or (<= u 0) (<= (+ U T S) (+ m u t)) (< 0 s)) (or (<= t 0) (<= (+ m 1) (+ U T S)) (< 0 s)) (or (<= u 0) (< 1 s) (not (< 0 s)) (<= (+ 2 m) (+ U T S))) (or (<= u 0) (<= 0 s)) (or (<= s 1) (<= t 0) (< 2 s) (<= (+ 3 m) (+ U T S))) (or (<= u 0) (< 1 s) (<= (+ U T S) (+ m u t 1))) (or (not (< 0 t)) (not (<= s 2)) (<= (+ U T S) (+ 2 m u t))) (or (<= t 0) (< 1 s) (<= (+ U T S) (+ m u t 1))) (or (<= t 0) (< 1 s) (not (< 0 s)) (<= (+ 2 m) (+ U T S))) (or (not (< 0 u)) (not (<= s 2)) (<= (+ U T S) (+ 2 m u t))) (or (<= u 0) (<= (+ m 1) (+ U T S)) (< 0 s)) (or (<= s 1) (< 2 s) (<= u 0) (<= (+ 3 m) (+ U T S))) (or (<= t 0) (<= (+ U T S) (+ m u t)) (< 0 s)) (or (<= s 2) (<= 0 t)) (or (not (< 0 u)) (<= 0 t))), 502744#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 502815#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 502810#(and (or (not (< 0 s)) (<= 0 t)) (or (<= (+ U T S) (+ m u t)) (not (< 0 t)) (not (<= s 0))) (or (<= 0 s) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 t)) (not (<= s 0))) (or (<= (+ U T S) (+ m u t)) (not (< 0 u)) (not (<= s 0))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U T S)) (not (< 0 u)) (not (<= s 0))) (or (not (< 0 u)) (<= 0 t))), 502821#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 502813#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 502816#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 2 s)) (or (< 0 u) (<= 1 s))), 502820#(and (or (<= (+ U T S) m) (< 1 u) (< 0 s) (< 0 t)) (or (< m (+ U T S 1)) (< 1 u) (< 0 s) (< 0 t))), 502811#(and (or (<= t 0) (<= 0 s)) (or (<= u 0) (<= (+ U T S) (+ m u t)) (< 0 s)) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (<= s 1)) (not (< 0 t))) (or (<= (+ U T S) (+ m u t 1)) (not (<= s 1)) (not (< 0 t))) (or (<= t 0) (<= (+ m 1) (+ U T S)) (< 0 s)) (or (<= u 0) (<= 0 s)) (or (<= (+ U T S) (+ m u t 1)) (not (< 0 u)) (not (<= s 1))) (or (<= u 0) (<= (+ m 1) (+ U T S)) (< 0 s)) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 u)) (not (<= s 1))) (or (<= t 0) (<= (+ U T S) (+ m u t)) (< 0 s)) (or (not (< 0 u)) (<= 0 t)) (or (<= s 1) (<= 0 t)))] [2022-03-15 21:45:52,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:45:52,192 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:52,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:45:52,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=1625, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:45:52,192 INFO L87 Difference]: Start difference. First operand 4345 states and 15361 transitions. Second operand has 28 states, 27 states have (on average 2.740740740740741) internal successors, (74), 27 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:56,074 INFO L93 Difference]: Finished difference Result 12603 states and 42450 transitions. [2022-03-15 21:45:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-15 21:45:56,074 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.740740740740741) internal successors, (74), 27 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:45:56,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:56,102 INFO L225 Difference]: With dead ends: 12603 [2022-03-15 21:45:56,102 INFO L226 Difference]: Without dead ends: 12588 [2022-03-15 21:45:56,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5566 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3213, Invalid=10829, Unknown=0, NotChecked=0, Total=14042 [2022-03-15 21:45:56,103 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 482 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:56,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 0 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:45:56,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12588 states. [2022-03-15 21:45:56,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12588 to 5699. [2022-03-15 21:45:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5699 states, 5698 states have (on average 3.5965250965250966) internal successors, (20493), 5698 states have internal predecessors, (20493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5699 states to 5699 states and 20493 transitions. [2022-03-15 21:45:56,289 INFO L78 Accepts]: Start accepts. Automaton has 5699 states and 20493 transitions. Word has length 25 [2022-03-15 21:45:56,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:56,289 INFO L470 AbstractCegarLoop]: Abstraction has 5699 states and 20493 transitions. [2022-03-15 21:45:56,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.740740740740741) internal successors, (74), 27 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:56,289 INFO L276 IsEmpty]: Start isEmpty. Operand 5699 states and 20493 transitions. [2022-03-15 21:45:56,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:45:56,297 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:56,297 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:56,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-03-15 21:45:56,515 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:45:56,516 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:56,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:56,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1518399357, now seen corresponding path program 45 times [2022-03-15 21:45:56,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:56,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816409466] [2022-03-15 21:45:56,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:56,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:45:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:56,702 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:45:56,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816409466] [2022-03-15 21:45:56,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816409466] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:45:56,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637976858] [2022-03-15 21:45:56,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:45:56,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:45:56,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:45:56,703 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:45:56,704 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:45:56,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 21:45:56,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:45:56,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:45:56,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:45:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:57,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:45:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:45:59,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637976858] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:45:59,370 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:45:59,370 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2022-03-15 21:45:59,370 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1386622584] [2022-03-15 21:45:59,370 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:45:59,377 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:45:59,383 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 114 transitions. [2022-03-15 21:45:59,383 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:01,294 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [527158#(and (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 527160#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 527153#(and (or (< 0 u) (<= 1 t)) (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m t s))) (or (< 0 u) (<= 0 s))), 527159#(and (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= 0 s) (not (< 0 t))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 527147#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 527157#(and (or (<= t 0) (<= 0 s)) (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (not (< 1 s)) (<= (+ U T S) (+ m u t s))) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= u 0) (<= 0 s)) (or (<= (+ m s 1) (+ U T S)) (not (< 0 u))) (or (not (< 1 s)) (<= (+ m s 1) (+ U T S))) (or (not (< 0 u)) (<= 0 t))), 527151#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 527152#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 527154#(and (or (< 1 u) (<= 0 s)) (or (<= (+ U T S) (+ m t s)) (< 1 u)) (or (<= (+ m 1) (+ U T S)) (< 1 u)) (or (<= 1 t) (< 1 u))), 527149#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 527155#(and (or (<= (+ U T S) (+ m t s 1)) (not (< 0 u)) (< 1 u)) (or (<= (+ m 1) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (not (< 0 u)) (< 1 u) (<= 0 s)) (or (not (< 0 u)) (< 1 u) (<= 0 t))), 527150#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 527148#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 527156#(and (or (not (< 0 s)) (<= (+ m s 1) (+ U T S))) (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m s 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (not (< 0 u)) (<= 0 s)) (or (not (< 0 u)) (<= 0 t)))] [2022-03-15 21:46:01,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:46:01,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:01,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:46:01,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1711, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 21:46:01,295 INFO L87 Difference]: Start difference. First operand 5699 states and 20493 transitions. Second operand has 28 states, 27 states have (on average 2.740740740740741) internal successors, (74), 27 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:46:02,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:02,184 INFO L93 Difference]: Finished difference Result 8137 states and 28416 transitions. [2022-03-15 21:46:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:46:02,187 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.740740740740741) internal successors, (74), 27 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:46:02,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:02,203 INFO L225 Difference]: With dead ends: 8137 [2022-03-15 21:46:02,203 INFO L226 Difference]: Without dead ends: 8126 [2022-03-15 21:46:02,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1002, Invalid=3828, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 21:46:02,204 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 233 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:02,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 0 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:46:02,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8126 states. [2022-03-15 21:46:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8126 to 5915. [2022-03-15 21:46:02,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5915 states, 5914 states have (on average 3.5872505918160296) internal successors, (21215), 5914 states have internal predecessors, (21215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:46:02,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 21215 transitions. [2022-03-15 21:46:02,294 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 21215 transitions. Word has length 25 [2022-03-15 21:46:02,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:02,294 INFO L470 AbstractCegarLoop]: Abstraction has 5915 states and 21215 transitions. [2022-03-15 21:46:02,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.740740740740741) internal successors, (74), 27 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:46:02,294 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 21215 transitions. [2022-03-15 21:46:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:46:02,302 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:02,302 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:02,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-03-15 21:46:02,520 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:46:02,521 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:46:02,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:02,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1530134973, now seen corresponding path program 46 times [2022-03-15 21:46:02,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:02,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794655975] [2022-03-15 21:46:02,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:02,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:02,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:02,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794655975] [2022-03-15 21:46:02,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794655975] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:02,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830341556] [2022-03-15 21:46:02,653 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:46:02,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:02,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:02,655 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:46:02,656 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:46:02,683 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:46:02,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:02,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 21:46:02,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:03,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:03,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830341556] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:03,900 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:03,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2022-03-15 21:46:03,900 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [26306667] [2022-03-15 21:46:03,900 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:03,902 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:03,908 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 117 transitions. [2022-03-15 21:46:03,908 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:05,737 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [547366#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 547362#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 547374#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 547363#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (not (<= s 0)))), 547370#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (<= t 0) (< 0 u))), 547367#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (< 0 t)) (or (< 0 u) (not (<= s 0)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 547369#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s)) (<= s 0) (< 0 t)) (or (<= (+ m s) (+ U T S)) (< 1 u) (<= s 0) (< 0 t))), 547360#(and (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 547368#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= s 0) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= s 0) (< 0 t))), 547371#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s)))), 547373#(and (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 547365#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 547372#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u))), 547361#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 547359#(and (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m s 1) (+ U T S)) (not (< 0 u))) (or (<= s 1) (<= (+ U T S) (+ m u t s))) (or (<= s 1) (<= (+ m s 1) (+ U T S))) (or (not (< 0 u)) (<= 0 t))), 547364#(and (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= s 0)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= s 0)) (or (<= t 0) (< 0 u))), 547358#(and (or (not (< 0 s)) (<= (+ m s 1) (+ U T S))) (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m s 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (not (< 0 u)) (<= 0 t)))] [2022-03-15 21:46:05,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:46:05,737 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:05,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:46:05,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=2656, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 21:46:05,738 INFO L87 Difference]: Start difference. First operand 5915 states and 21215 transitions. Second operand has 32 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 31 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:46:06,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:06,660 INFO L93 Difference]: Finished difference Result 7352 states and 25943 transitions. [2022-03-15 21:46:06,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 21:46:06,661 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 31 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 25 [2022-03-15 21:46:06,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:06,676 INFO L225 Difference]: With dead ends: 7352 [2022-03-15 21:46:06,676 INFO L226 Difference]: Without dead ends: 7303 [2022-03-15 21:46:06,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2588 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1134, Invalid=5186, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 21:46:06,677 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 322 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:06,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 0 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:46:06,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7303 states. [2022-03-15 21:46:06,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7303 to 6219. [2022-03-15 21:46:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6219 states, 6218 states have (on average 3.5725313605660984) internal successors, (22214), 6218 states have internal predecessors, (22214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:46:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 22214 transitions. [2022-03-15 21:46:06,804 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 22214 transitions. Word has length 25 [2022-03-15 21:46:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:06,804 INFO L470 AbstractCegarLoop]: Abstraction has 6219 states and 22214 transitions. [2022-03-15 21:46:06,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 31 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:46:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 22214 transitions. [2022-03-15 21:46:06,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:46:06,813 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:06,813 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:06,830 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:46:07,029 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:46:07,029 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:46:07,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:07,030 INFO L85 PathProgramCache]: Analyzing trace with hash 876471297, now seen corresponding path program 47 times [2022-03-15 21:46:07,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:07,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677172875] [2022-03-15 21:46:07,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:07,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:07,213 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:07,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677172875] [2022-03-15 21:46:07,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677172875] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:07,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044713230] [2022-03-15 21:46:07,213 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:46:07,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:07,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:07,214 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:46:07,215 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:46:07,237 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:46:07,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:07,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:46:07,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:07,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:09,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044713230] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:09,773 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:09,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 21:46:09,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [779181638] [2022-03-15 21:46:09,774 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:09,775 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:09,781 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 112 transitions. [2022-03-15 21:46:09,781 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:11,790 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [567395#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 567390#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 567392#(and (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ m 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (not (< 0 u)) (<= 0 t))), 567400#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 567388#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 567389#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t))), 567391#(and (or (< 0 u) (< 1 t) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m s 1)) (< 1 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 567397#(and (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= 0 s) (not (< 0 t))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 567394#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 567398#(and (or (<= t 0) (<= 0 s)) (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (not (< 1 s)) (<= (+ U T S) (+ m u t s))) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= u 0) (<= 0 s)) (or (<= (+ m s 1) (+ U T S)) (not (< 0 u))) (or (not (< 1 s)) (<= (+ m s 1) (+ U T S))) (or (not (< 0 u)) (<= 0 t))), 567401#(and (or (<= 1 s) (< 0 t)) (<= (+ m 1) (+ U T S)) (<= (+ U T S) (+ m u t s)) (<= 0 s)), 567393#(and (or (not (< 0 s)) (<= (+ m s 1) (+ U T S))) (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m s 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (not (< 0 u)) (<= 0 s)) (or (not (< 0 u)) (<= 0 t))), 567399#(and (or (<= 1 s) (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (<= 1 s) (< 1 u) (< 0 t))), 567396#(and (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s))))] [2022-03-15 21:46:11,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:46:11,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:11,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:46:11,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=1690, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 21:46:11,791 INFO L87 Difference]: Start difference. First operand 6219 states and 22214 transitions. Second operand has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 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:46:13,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:13,607 INFO L93 Difference]: Finished difference Result 11689 states and 39573 transitions. [2022-03-15 21:46:13,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 21:46:13,607 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 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 25 [2022-03-15 21:46:13,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:13,631 INFO L225 Difference]: With dead ends: 11689 [2022-03-15 21:46:13,631 INFO L226 Difference]: Without dead ends: 11668 [2022-03-15 21:46:13,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2823 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1599, Invalid=5711, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 21:46:13,632 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 405 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:13,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 0 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:46:13,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11668 states. [2022-03-15 21:46:13,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11668 to 6114. [2022-03-15 21:46:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6114 states, 6113 states have (on average 3.5718959594307216) internal successors, (21835), 6113 states have internal predecessors, (21835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:46:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6114 states to 6114 states and 21835 transitions. [2022-03-15 21:46:13,770 INFO L78 Accepts]: Start accepts. Automaton has 6114 states and 21835 transitions. Word has length 25 [2022-03-15 21:46:13,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:13,770 INFO L470 AbstractCegarLoop]: Abstraction has 6114 states and 21835 transitions. [2022-03-15 21:46:13,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 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:46:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 6114 states and 21835 transitions. [2022-03-15 21:46:13,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:46:13,779 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:13,779 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:13,795 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:46:13,995 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:46:13,995 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:46:13,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:13,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1022019515, now seen corresponding path program 48 times [2022-03-15 21:46:13,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:13,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282126506] [2022-03-15 21:46:13,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:14,164 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:14,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282126506] [2022-03-15 21:46:14,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282126506] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:14,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863523886] [2022-03-15 21:46:14,164 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:46:14,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:14,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:14,165 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:46:14,166 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:46:14,189 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 21:46:14,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:14,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:46:14,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:14,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:16,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863523886] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:16,435 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:16,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 30 [2022-03-15 21:46:16,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1405969114] [2022-03-15 21:46:16,435 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:16,436 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:16,442 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 99 transitions. [2022-03-15 21:46:16,442 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:18,094 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [591577#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 591583#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 591582#(and (or (< 0 u) (<= m (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ m s) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 591576#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 591580#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 591573#(and (or (not (< 0 s)) (<= (+ m s 1) (+ U T S))) (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m s 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (not (< 0 u)) (<= 0 s)) (or (not (< 0 u)) (<= 0 t))), 591581#(and (or (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (< 1 u) (<= (+ U T S) (+ m s)) (< 0 t))), 591575#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 591578#(and (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 591579#(and (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= 0 s) (not (< 0 t))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 591574#(and (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m s 1) (+ U T S)) (not (< 0 u))) (or (<= s 1) (<= (+ U T S) (+ m u t s))) (or (not (< 0 u)) (<= 0 s)) (or (<= s 1) (<= (+ m s 1) (+ U T S))) (or (not (< 0 u)) (<= 0 t)))] [2022-03-15 21:46:18,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:46:18,095 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:18,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:46:18,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=1421, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 21:46:18,095 INFO L87 Difference]: Start difference. First operand 6114 states and 21835 transitions. Second operand has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 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:46:18,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:18,924 INFO L93 Difference]: Finished difference Result 9123 states and 31402 transitions. [2022-03-15 21:46:18,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 21:46:18,924 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 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 25 [2022-03-15 21:46:18,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:18,943 INFO L225 Difference]: With dead ends: 9123 [2022-03-15 21:46:18,943 INFO L226 Difference]: Without dead ends: 9089 [2022-03-15 21:46:18,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=937, Invalid=3223, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 21:46:18,944 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 248 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:18,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 0 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:46:18,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9089 states. [2022-03-15 21:46:19,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9089 to 6077. [2022-03-15 21:46:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6077 states, 6076 states have (on average 3.57422646477946) internal successors, (21717), 6076 states have internal predecessors, (21717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:46:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6077 states to 6077 states and 21717 transitions. [2022-03-15 21:46:19,095 INFO L78 Accepts]: Start accepts. Automaton has 6077 states and 21717 transitions. Word has length 25 [2022-03-15 21:46:19,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:19,096 INFO L470 AbstractCegarLoop]: Abstraction has 6077 states and 21717 transitions. [2022-03-15 21:46:19,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 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:46:19,096 INFO L276 IsEmpty]: Start isEmpty. Operand 6077 states and 21717 transitions. [2022-03-15 21:46:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:46:19,104 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:19,104 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:19,122 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:46:19,308 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:46:19,308 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:46:19,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:19,310 INFO L85 PathProgramCache]: Analyzing trace with hash -311195759, now seen corresponding path program 49 times [2022-03-15 21:46:19,311 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:19,311 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2654210] [2022-03-15 21:46:19,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:19,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:19,332 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:46:19,333 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:19,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2654210] [2022-03-15 21:46:19,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2654210] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:19,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456646377] [2022-03-15 21:46:19,333 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:46:19,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:19,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:19,334 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:46:19,335 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:46:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:19,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:46:19,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:46:19,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:46:19,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456646377] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:19,435 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:19,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-03-15 21:46:19,436 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1712439514] [2022-03-15 21:46:19,436 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:19,437 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:19,442 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 84 transitions. [2022-03-15 21:46:19,442 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:19,609 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:46:19,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 21:46:19,609 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:19,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 21:46:19,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:46:19,610 INFO L87 Difference]: Start difference. First operand 6077 states and 21717 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 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:46:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:19,695 INFO L93 Difference]: Finished difference Result 12535 states and 43817 transitions. [2022-03-15 21:46:19,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 21:46:19,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 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 25 [2022-03-15 21:46:19,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:19,722 INFO L225 Difference]: With dead ends: 12535 [2022-03-15 21:46:19,722 INFO L226 Difference]: Without dead ends: 12535 [2022-03-15 21:46:19,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 10 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:46:19,723 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:19,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 7 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:46:19,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12535 states. [2022-03-15 21:46:19,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12535 to 11888. [2022-03-15 21:46:19,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11888 states, 11887 states have (on average 3.531336754437621) internal successors, (41977), 11887 states have internal predecessors, (41977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:46:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11888 states to 11888 states and 41977 transitions. [2022-03-15 21:46:19,911 INFO L78 Accepts]: Start accepts. Automaton has 11888 states and 41977 transitions. Word has length 25 [2022-03-15 21:46:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:19,912 INFO L470 AbstractCegarLoop]: Abstraction has 11888 states and 41977 transitions. [2022-03-15 21:46:19,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 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:46:19,912 INFO L276 IsEmpty]: Start isEmpty. Operand 11888 states and 41977 transitions. [2022-03-15 21:46:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:46:19,927 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:19,927 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:19,943 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:46:20,136 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:46:20,136 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:46:20,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:20,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1916218467, now seen corresponding path program 50 times [2022-03-15 21:46:20,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:20,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202624356] [2022-03-15 21:46:20,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:20,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:46:20,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:20,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202624356] [2022-03-15 21:46:20,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202624356] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:20,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813433584] [2022-03-15 21:46:20,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:46:20,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:20,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:20,228 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:46:20,229 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:46:20,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:46:20,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:20,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 21:46:20,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:46:20,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:20,668 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813433584] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:20,668 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:20,668 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 10] total 19 [2022-03-15 21:46:20,668 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [258131608] [2022-03-15 21:46:20,668 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:20,669 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:20,675 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 103 transitions. [2022-03-15 21:46:20,675 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:21,517 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [649540#(and (or (< 0 u) (<= 1 s) (not (< 0 t))) (or (< 0 u) (<= 1 t) (not (< 0 s)))), 649541#(and (or (<= s 1) (< 0 u) (<= 1 t)) (or (< 0 u) (<= 2 s) (not (< 0 t)))), 649532#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s)))), 649531#(and (or (<= 2 s) (not (< 0 u))) (or (<= 2 s) (not (< 0 t))) (or (<= s 1) (<= 0 t))), 649539#(and (or (< 0 u) (<= 1 t)) (or (< 0 u) (<= 1 s))), 649538#(and (or (<= 2 s) (not (< 0 u))) (or (<= s 1) (<= 1 t)) (or (<= 2 s) (not (< 0 t)))), 649466#(or (< 0 u) (< 0 s)), 649537#(and (or (<= 1 t) (not (< 0 s))) (or (<= 1 s) (not (< 0 t))) (or (<= 1 s) (not (< 0 u)))), 649536#(or (< 0 u) (<= 1 s) (< 0 t)), 649470#(or (< 0 u) (< 1 s)), 649542#(or (< 1 u) (< 0 s)), 649514#(and (or (<= 2 s) (< 0 t)) (<= 1 s)), 649533#(< 0 u), 649534#(and (or (<= 2 s) (< 0 t)) (<= u 0) (<= 1 s)), 649535#(or (< 0 u) (< 0 t)), 649530#(and (or (not (< 0 s)) (<= 0 t)) (or (<= 1 s) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))))] [2022-03-15 21:46:21,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 21:46:21,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:21,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 21:46:21,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=809, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:46:21,518 INFO L87 Difference]: Start difference. First operand 11888 states and 41977 transitions. Second operand has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 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:46:22,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:22,062 INFO L93 Difference]: Finished difference Result 18171 states and 63768 transitions. [2022-03-15 21:46:22,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 21:46:22,062 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 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 25 [2022-03-15 21:46:22,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:22,108 INFO L225 Difference]: With dead ends: 18171 [2022-03-15 21:46:22,108 INFO L226 Difference]: Without dead ends: 18171 [2022-03-15 21:46:22,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 54 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=661, Invalid=1889, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:46:22,109 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 228 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:22,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 0 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:46:22,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18171 states. [2022-03-15 21:46:22,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18171 to 13468. [2022-03-15 21:46:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13468 states, 13467 states have (on average 3.5289968070097273) internal successors, (47525), 13467 states have internal predecessors, (47525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:46:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 47525 transitions. [2022-03-15 21:46:22,389 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 47525 transitions. Word has length 25 [2022-03-15 21:46:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:22,390 INFO L470 AbstractCegarLoop]: Abstraction has 13468 states and 47525 transitions. [2022-03-15 21:46:22,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 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:46:22,390 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 47525 transitions. [2022-03-15 21:46:22,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:46:22,405 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:22,405 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:22,423 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:46:22,619 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:46:22,619 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:46:22,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:22,620 INFO L85 PathProgramCache]: Analyzing trace with hash -428506297, now seen corresponding path program 51 times [2022-03-15 21:46:22,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:22,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120072037] [2022-03-15 21:46:22,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:22,752 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:22,752 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120072037] [2022-03-15 21:46:22,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120072037] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:22,752 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309902034] [2022-03-15 21:46:22,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:46:22,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:22,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:22,753 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:46:22,754 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:46:22,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 21:46:22,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:22,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:46:22,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:23,256 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:23,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:25,246 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:25,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309902034] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:25,247 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:25,247 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 30 [2022-03-15 21:46:25,247 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [591829383] [2022-03-15 21:46:25,247 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:25,248 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:25,253 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 89 transitions. [2022-03-15 21:46:25,253 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:26,428 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [694866#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 694865#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 694867#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)))), 694864#(and (or (<= 2 s) (not (< 0 u))) (or (<= s 1) (<= (+ U T S) (+ m u t s))) (or (<= s 1) (<= (+ 3 m) (+ U T S))) (or (<= 2 s) (not (< 0 t))) (or (<= s 1) (<= 0 t))), 694797#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s)), 694870#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t))), 694869#(and (or (not (< 0 s)) (<= (+ U T S 1) (+ m u t s))) (or (<= 1 s) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (not (< 0 s)) (<= (+ m 1) (+ U T S)))), 694868#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 694873#(and (or (<= 2 s) (< 1 u) (<= (+ U T S) (+ m s))) (or (<= 2 s) (<= (+ m 1) (+ U T S)) (< 1 u))), 694872#(and (or (<= 2 s) (not (< 0 u))) (or (not (< 1 s)) (<= (+ 2 m) (+ U T S))) (or (<= 2 s) (not (< 0 t))) (or (not (< 1 s)) (<= (+ U T S 1) (+ m u t s)))), 694863#(and (or (not (< 0 s)) (<= 0 t)) (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (<= 1 s) (not (< 0 u))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)))), 694871#(and (or (<= 1 s) (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (<= 1 s) (< 1 u) (< 0 t)))] [2022-03-15 21:46:26,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:46:26,428 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:26,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:46:26,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=1454, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 21:46:26,428 INFO L87 Difference]: Start difference. First operand 13468 states and 47525 transitions. Second operand has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 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:46:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:28,372 INFO L93 Difference]: Finished difference Result 29610 states and 101381 transitions. [2022-03-15 21:46:28,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 21:46:28,373 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 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 25 [2022-03-15 21:46:28,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:28,464 INFO L225 Difference]: With dead ends: 29610 [2022-03-15 21:46:28,464 INFO L226 Difference]: Without dead ends: 29595 [2022-03-15 21:46:28,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1966 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1382, Invalid=5260, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 21:46:28,465 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 233 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:28,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 0 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:46:28,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29595 states. [2022-03-15 21:46:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29595 to 13428. [2022-03-15 21:46:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13428 states, 13427 states have (on average 3.5275936545765996) internal successors, (47365), 13427 states have internal predecessors, (47365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:46:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13428 states to 13428 states and 47365 transitions. [2022-03-15 21:46:28,875 INFO L78 Accepts]: Start accepts. Automaton has 13428 states and 47365 transitions. Word has length 25 [2022-03-15 21:46:28,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:28,875 INFO L470 AbstractCegarLoop]: Abstraction has 13428 states and 47365 transitions. [2022-03-15 21:46:28,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 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:46:28,875 INFO L276 IsEmpty]: Start isEmpty. Operand 13428 states and 47365 transitions. [2022-03-15 21:46:28,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:46:28,892 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:28,892 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:28,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-03-15 21:46:29,108 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:46:29,108 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:46:29,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:29,108 INFO L85 PathProgramCache]: Analyzing trace with hash -779402997, now seen corresponding path program 52 times [2022-03-15 21:46:29,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:29,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184618832] [2022-03-15 21:46:29,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:29,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:29,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:29,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184618832] [2022-03-15 21:46:29,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184618832] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:29,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987367502] [2022-03-15 21:46:29,189 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:46:29,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:29,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:29,191 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:46:29,191 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:46:29,212 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:46:29,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:29,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 21:46:29,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:46:29,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:46:29,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987367502] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:29,554 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:29,554 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-03-15 21:46:29,555 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [87135928] [2022-03-15 21:46:29,555 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:29,556 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:29,561 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 103 transitions. [2022-03-15 21:46:29,561 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:30,141 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [751588#(or (< 0 u) (< 0 t)), 751582#(< 0 u), 751597#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s)))), 751593#(and (or (< 0 u) (<= s 2) (< 0 t)) (or (< 0 u) (<= 3 s) (not (< 0 t)))), 751583#(and (or (not (< 0 s)) (not (<= t 0))) (or (<= 1 s) (not (< 0 t))) (or (<= 1 s) (not (< 0 u)))), 751586#(or (< 0 u) (<= 1 s)), 751584#(and (or (not (< 1 s)) (not (<= t 0))) (or (<= 2 s) (not (< 0 u))) (or (<= 2 s) (not (< 0 t)))), 751594#(and (<= u 0) (<= 3 s)), 751585#(and (or (<= 3 s) (not (< 0 u))) (or (<= s 2) (< 0 t)) (or (<= 3 s) (not (< 0 t)))), 751595#(and (or (<= 3 s) (< 0 t)) (<= u 0) (<= 2 s)), 751596#(and (or (<= 3 s) (< 0 t)) (<= 2 s)), 751589#(or (< 0 u) (<= 1 s) (< 0 t)), 751592#(and (or (< 0 u) (<= 2 s) (not (< 0 t))) (or (< 0 u) (not (< 1 s)) (not (<= t 0)))), 751590#(and (or (< 0 u) (<= 1 s)) (or (< 0 u) (not (<= t 0)))), 751591#(and (or (< 0 u) (not (< 0 s)) (not (<= t 0))) (or (< 0 u) (<= 1 s) (not (< 0 t)))), 751587#(or (< 0 u) (<= 2 s))] [2022-03-15 21:46:30,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:46:30,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:30,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:46:30,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=992, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 21:46:30,142 INFO L87 Difference]: Start difference. First operand 13428 states and 47365 transitions. Second operand has 27 states, 27 states have (on average 3.0) internal successors, (81), 26 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:46:30,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:30,722 INFO L93 Difference]: Finished difference Result 20329 states and 71086 transitions. [2022-03-15 21:46:30,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:46:30,723 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 26 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 25 [2022-03-15 21:46:30,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:30,773 INFO L225 Difference]: With dead ends: 20329 [2022-03-15 21:46:30,773 INFO L226 Difference]: Without dead ends: 20329 [2022-03-15 21:46:30,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=718, Invalid=2252, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 21:46:30,773 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 140 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:30,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 0 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:46:30,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20329 states. [2022-03-15 21:46:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20329 to 14718. [2022-03-15 21:46:31,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14718 states, 14717 states have (on average 3.5673710674729904) internal successors, (52501), 14717 states have internal predecessors, (52501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:46:31,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14718 states to 14718 states and 52501 transitions. [2022-03-15 21:46:31,116 INFO L78 Accepts]: Start accepts. Automaton has 14718 states and 52501 transitions. Word has length 25 [2022-03-15 21:46:31,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:31,116 INFO L470 AbstractCegarLoop]: Abstraction has 14718 states and 52501 transitions. [2022-03-15 21:46:31,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 26 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:46:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand 14718 states and 52501 transitions. [2022-03-15 21:46:31,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:46:31,134 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:31,134 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:31,151 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:46:31,341 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:46:31,342 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:46:31,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:31,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1926436431, now seen corresponding path program 53 times [2022-03-15 21:46:31,343 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:31,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705969808] [2022-03-15 21:46:31,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:31,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:31,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:31,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705969808] [2022-03-15 21:46:31,428 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705969808] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:31,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364718955] [2022-03-15 21:46:31,429 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:46:31,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:31,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:31,443 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:46:31,444 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:46:31,466 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:46:31,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:31,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 21:46:31,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:31,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:31,968 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:31,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364718955] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:31,968 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:31,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 26 [2022-03-15 21:46:31,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [10629710] [2022-03-15 21:46:31,969 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:31,970 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:31,975 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 103 transitions. [2022-03-15 21:46:31,975 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:32,719 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [801579#(< 0 u), 801583#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s)))), 801582#(or (< 0 u) (< 1 t) (<= 2 s) (not (< 0 t))), 801581#(and (or (< 0 u) (< 1 t) (<= 2 s) (not (< 0 t))) (or (< 0 u) (not (< 0 s)) (<= 3 s) (< 0 t))), 801575#(or (< 0 u) (< 0 t)), 801588#(or (< 0 u) (< 2 t) (<= 2 s) (<= t 1)), 801586#(and (or (<= t 0) (<= 2 s) (not (<= u 0))) (or (not (<= u 0)) (not (<= t 0)) (<= s 0))), 801578#(or (< 0 u) (<= 3 s) (< 0 t)), 801587#(and (or (<= s 1) (not (<= u 0)) (not (<= t 0))) (or (<= t 0) (not (<= u 0)) (<= 3 s))), 801574#(and (<= t 0) (<= u 0) (<= 3 s)), 801576#(or (< 0 u) (<= 1 s) (< 0 t)), 801580#(and (or (< 0 u) (<= 3 s) (< 0 t)) (or (< 0 u) (< 1 t) (<= 2 s))), 801590#(and (or (<= 3 s) (< 0 t)) (<= 2 s)), 801584#(and (or (< 0 u) (< 1 t) (<= 3 s) (not (< 0 t))) (or (< 0 u) (not (< 1 s)) (<= 4 s) (< 0 t))), 801585#(or (<= t 0) (< 0 u) (< 1 t) (<= 3 s)), 801577#(or (< 0 u) (<= 2 s) (< 0 t)), 801589#(or (< 0 u) (<= 1 s))] [2022-03-15 21:46:32,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 21:46:32,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:32,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 21:46:32,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1450, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 21:46:32,720 INFO L87 Difference]: Start difference. First operand 14718 states and 52501 transitions. Second operand has 29 states, 29 states have (on average 2.8620689655172415) internal successors, (83), 28 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:46:34,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:34,302 INFO L93 Difference]: Finished difference Result 23080 states and 83544 transitions. [2022-03-15 21:46:34,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-03-15 21:46:34,302 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8620689655172415) internal successors, (83), 28 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 25 [2022-03-15 21:46:34,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:34,366 INFO L225 Difference]: With dead ends: 23080 [2022-03-15 21:46:34,366 INFO L226 Difference]: Without dead ends: 23080 [2022-03-15 21:46:34,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3870 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3021, Invalid=7899, Unknown=0, NotChecked=0, Total=10920 [2022-03-15 21:46:34,367 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 227 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:34,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 0 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:46:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23080 states. [2022-03-15 21:46:34,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23080 to 17218. [2022-03-15 21:46:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17218 states, 17217 states have (on average 3.623105070569786) internal successors, (62379), 17217 states have internal predecessors, (62379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:46:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17218 states to 17218 states and 62379 transitions. [2022-03-15 21:46:34,830 INFO L78 Accepts]: Start accepts. Automaton has 17218 states and 62379 transitions. Word has length 25 [2022-03-15 21:46:34,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:34,830 INFO L470 AbstractCegarLoop]: Abstraction has 17218 states and 62379 transitions. [2022-03-15 21:46:34,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8620689655172415) internal successors, (83), 28 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:46:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 17218 states and 62379 transitions. [2022-03-15 21:46:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:46:34,854 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:34,854 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:34,871 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:46:35,070 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:46:35,071 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:46:35,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:35,071 INFO L85 PathProgramCache]: Analyzing trace with hash -788590453, now seen corresponding path program 54 times [2022-03-15 21:46:35,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:35,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816251272] [2022-03-15 21:46:35,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:35,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:35,224 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:35,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816251272] [2022-03-15 21:46:35,224 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816251272] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:35,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916433669] [2022-03-15 21:46:35,224 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:46:35,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:35,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:35,225 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:46:35,325 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:46:35,329 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 21:46:35,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:35,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:46:35,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:35,776 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:35,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:37,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916433669] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:37,576 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:37,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 30 [2022-03-15 21:46:37,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1458759448] [2022-03-15 21:46:37,576 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:37,578 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:37,582 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 79 transitions. [2022-03-15 21:46:37,582 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:38,447 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [859412#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 859413#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t))), 859406#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 859340#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s)), 859408#(and (or (not (< 0 s)) (<= (+ U T S 1) (+ m u t s))) (or (<= 1 s) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (not (< 0 s)) (<= (+ m 1) (+ U T S)))), 859414#(and (or (<= 1 s) (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (<= 1 s) (< 1 u) (< 0 t))), 859410#(and (or (<= s 2) (<= (+ 3 m) (+ U T S))) (or (<= s 2) (<= (+ U T S 1) (+ m u t s))) (or (<= 3 s) (not (< 0 u))) (or (<= 3 s) (not (< 0 t)))), 859415#(and (or (<= 2 s) (< 1 u) (<= (+ U T S) (+ m s))) (or (<= 2 s) (<= (+ m 1) (+ U T S)) (< 1 u))), 859411#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 859409#(and (or (<= s 1) (<= (+ 2 m) (+ U T S))) (or (<= 2 s) (not (< 0 u))) (or (<= s 1) (<= (+ U T S 1) (+ m u t s))) (or (<= 2 s) (not (< 0 t)))), 859407#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s))))] [2022-03-15 21:46:38,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:46:38,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:38,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:46:38,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=1353, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 21:46:38,448 INFO L87 Difference]: Start difference. First operand 17218 states and 62379 transitions. Second operand has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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:46:39,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:39,650 INFO L93 Difference]: Finished difference Result 28711 states and 100679 transitions. [2022-03-15 21:46:39,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 21:46:39,651 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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 25 [2022-03-15 21:46:39,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:39,801 INFO L225 Difference]: With dead ends: 28711 [2022-03-15 21:46:39,801 INFO L226 Difference]: Without dead ends: 28696 [2022-03-15 21:46:39,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1528 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1089, Invalid=4023, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 21:46:39,801 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 224 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:39,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 0 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:46:39,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28696 states. [2022-03-15 21:46:40,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28696 to 17256. [2022-03-15 21:46:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17256 states, 17255 states have (on average 3.6259055346276443) internal successors, (62565), 17255 states have internal predecessors, (62565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:46:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17256 states to 17256 states and 62565 transitions. [2022-03-15 21:46:40,250 INFO L78 Accepts]: Start accepts. Automaton has 17256 states and 62565 transitions. Word has length 25 [2022-03-15 21:46:40,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:40,250 INFO L470 AbstractCegarLoop]: Abstraction has 17256 states and 62565 transitions. [2022-03-15 21:46:40,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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:46:40,250 INFO L276 IsEmpty]: Start isEmpty. Operand 17256 states and 62565 transitions. [2022-03-15 21:46:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:46:40,274 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:40,274 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:40,290 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:46:40,487 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:46:40,488 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:46:40,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:40,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1051695175, now seen corresponding path program 55 times [2022-03-15 21:46:40,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:40,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364394133] [2022-03-15 21:46:40,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:40,640 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:40,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364394133] [2022-03-15 21:46:40,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364394133] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:40,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552265312] [2022-03-15 21:46:40,640 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:46:40,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:40,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:40,641 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:46:40,642 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:46:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:40,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:46:40,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:41,265 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:41,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:43,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552265312] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:43,436 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:43,436 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 21:46:43,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2124570441] [2022-03-15 21:46:43,437 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:43,438 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:43,442 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 79 transitions. [2022-03-15 21:46:43,443 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:44,288 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [922879#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t))), 922881#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 922883#(and (or (<= (+ U T S) (+ m t s)) (< 1 u)) (or (<= (+ m 1) (+ U T S)) (< 1 u)) (or (<= 1 s) (< 1 u))), 922880#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)))), 922884#(and (or (not (< 0 s)) (<= (+ U T S 1) (+ m u t s))) (or (<= 2 s) (not (< 0 u))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S))) (or (<= 2 s) (not (< 0 t)))), 922877#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 922876#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 922886#(and (or (<= (+ m 1) (+ U T S)) (< 1 u) (not (< 0 t))) (or (<= (+ U T S) (+ m t s)) (not (< 0 u)) (< 1 u)) (or (<= (+ m 1) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (<= 1 s) (< 1 u) (not (< 0 t))) (or (<= (+ U T S) (+ m t s)) (< 1 u) (not (< 0 t)))), 922882#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 922878#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 922885#(and (or (not (< 1 s)) (<= (+ 3 m) (+ U T S))) (or (<= 3 s) (not (< 0 u))) (or (<= 3 s) (not (< 0 t))) (or (not (< 1 s)) (<= (+ U T S 1) (+ m u t s))))] [2022-03-15 21:46:44,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:46:44,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:44,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:46:44,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1513, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 21:46:44,289 INFO L87 Difference]: Start difference. First operand 17256 states and 62565 transitions. Second operand has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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:46:45,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:45,441 INFO L93 Difference]: Finished difference Result 24172 states and 88147 transitions. [2022-03-15 21:46:45,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 21:46:45,441 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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 25 [2022-03-15 21:46:45,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:45,511 INFO L225 Difference]: With dead ends: 24172 [2022-03-15 21:46:45,511 INFO L226 Difference]: Without dead ends: 24157 [2022-03-15 21:46:45,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1027, Invalid=4085, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 21:46:45,512 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 202 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:45,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 0 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:46:45,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24157 states. [2022-03-15 21:46:45,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24157 to 17256. [2022-03-15 21:46:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17256 states, 17255 states have (on average 3.6260214430599826) internal successors, (62567), 17255 states have internal predecessors, (62567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:46:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17256 states to 17256 states and 62567 transitions. [2022-03-15 21:46:45,949 INFO L78 Accepts]: Start accepts. Automaton has 17256 states and 62567 transitions. Word has length 25 [2022-03-15 21:46:45,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:45,949 INFO L470 AbstractCegarLoop]: Abstraction has 17256 states and 62567 transitions. [2022-03-15 21:46:45,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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:46:45,949 INFO L276 IsEmpty]: Start isEmpty. Operand 17256 states and 62567 transitions. [2022-03-15 21:46:45,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:46:45,974 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:45,974 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:45,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-03-15 21:46:46,189 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:46:46,189 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:46:46,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:46,190 INFO L85 PathProgramCache]: Analyzing trace with hash 39657731, now seen corresponding path program 56 times [2022-03-15 21:46:46,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:46,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188032889] [2022-03-15 21:46:46,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:46,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:46,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:46,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188032889] [2022-03-15 21:46:46,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188032889] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:46,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921393981] [2022-03-15 21:46:46,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:46:46,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:46,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:46,302 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:46:46,303 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:46:46,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:46:46,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:46,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:46:46,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:46,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:48,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921393981] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:48,951 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:48,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 30 [2022-03-15 21:46:48,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1039032152] [2022-03-15 21:46:48,952 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:48,953 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:48,958 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 79 transitions. [2022-03-15 21:46:48,958 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:49,785 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [981808#(and (or (< 0 u) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (<= 2 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 981811#(and (or (<= (+ U T S) (+ m t s)) (not (< 0 u)) (< 1 u)) (or (<= 2 s) (< 1 u) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (<= (+ 2 m) (+ U T S)) (< 1 u) (not (< 0 t))) (or (<= (+ U T S) (+ m t s)) (< 1 u) (not (< 0 t)))), 981806#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t))), 981805#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 981803#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 981807#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 981804#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)))), 981737#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s)), 981810#(and (or (<= (+ 2 m) (+ U T S)) (< 1 u)) (or (<= 2 s) (< 1 u)) (or (<= (+ U T S) (+ m t s)) (< 1 u))), 981809#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S))) (or (<= (+ U S) (+ m u s)) (not (< 0 s))))] [2022-03-15 21:46:49,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:46:49,785 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:49,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:46:49,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=1281, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 21:46:49,786 INFO L87 Difference]: Start difference. First operand 17256 states and 62567 transitions. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 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:46:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:51,440 INFO L93 Difference]: Finished difference Result 24256 states and 88705 transitions. [2022-03-15 21:46:51,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 21:46:51,440 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:46:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:51,502 INFO L225 Difference]: With dead ends: 24256 [2022-03-15 21:46:51,502 INFO L226 Difference]: Without dead ends: 24245 [2022-03-15 21:46:51,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1678 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1234, Invalid=4466, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 21:46:51,503 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 166 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:51,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 0 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:46:51,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24245 states. [2022-03-15 21:46:51,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24245 to 17250. [2022-03-15 21:46:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17250 states, 17249 states have (on average 3.626587048524552) internal successors, (62555), 17249 states have internal predecessors, (62555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:46:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17250 states to 17250 states and 62555 transitions. [2022-03-15 21:46:51,919 INFO L78 Accepts]: Start accepts. Automaton has 17250 states and 62555 transitions. Word has length 25 [2022-03-15 21:46:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:51,920 INFO L470 AbstractCegarLoop]: Abstraction has 17250 states and 62555 transitions. [2022-03-15 21:46:51,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 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:46:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 17250 states and 62555 transitions. [2022-03-15 21:46:52,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:46:52,009 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:52,009 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:52,027 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:46:52,223 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:46:52,224 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:46:52,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:52,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1911999067, now seen corresponding path program 57 times [2022-03-15 21:46:52,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:52,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952498347] [2022-03-15 21:46:52,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:52,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:46:52,310 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:52,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952498347] [2022-03-15 21:46:52,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952498347] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:52,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209548097] [2022-03-15 21:46:52,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:46:52,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:52,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:52,312 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:46:52,313 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:46:52,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 21:46:52,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:52,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 21:46:52,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:46:52,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:52,856 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:52,856 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209548097] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:52,856 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:52,857 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 22 [2022-03-15 21:46:52,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1146329137] [2022-03-15 21:46:52,857 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:52,858 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:52,866 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 127 transitions. [2022-03-15 21:46:52,866 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:46:53,848 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [1040825#(and (or (< 0 u) (<= 1 s) (not (< 0 t))) (or (< 0 u) (<= 1 t) (not (< 0 s)))), 1040831#(and (or (<= 2 s) (< 0 t)) (<= 1 s)), 1040746#(or (< 0 u) (< 0 s)), 1040817#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 1040821#(or (< 0 u) (< 0 t)), 1040750#(or (< 0 u) (< 1 s)), 1040828#(and (or (<= 2 s) (< 0 t)) (<= u 0) (<= 1 s)), 1040820#(< 0 u), 1040830#(and (or (<= s 1) (< 0 u) (<= 1 t)) (or (< 0 u) (<= 2 s) (not (< 0 t)))), 1040818#(and (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 1040822#(or (< 0 u) (<= 1 s) (< 0 t)), 1040823#(and (or (< 0 u) (<= 1 t)) (or (< 0 u) (<= 1 s))), 1040824#(and (or (<= 1 t) (not (< 0 s))) (or (<= 1 s) (not (< 0 t))) (or (<= 1 s) (not (< 0 u)))), 1040826#(and (or (<= 2 s) (not (< 0 u))) (or (<= s 1) (<= 1 t)) (or (<= 2 s) (not (< 0 t)))), 1040819#(and (or (<= s 2) (<= 1 T)) (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= s 2) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 1040829#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s)))), 1040827#(and (<= u 0) (<= 2 s))] [2022-03-15 21:46:53,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 21:46:53,849 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:46:53,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 21:46:53,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1140, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 21:46:53,849 INFO L87 Difference]: Start difference. First operand 17250 states and 62555 transitions. Second operand has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 25 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:46:54,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:46:54,315 INFO L93 Difference]: Finished difference Result 23479 states and 84982 transitions. [2022-03-15 21:46:54,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 21:46:54,321 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 25 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 27 [2022-03-15 21:46:54,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:46:54,380 INFO L225 Difference]: With dead ends: 23479 [2022-03-15 21:46:54,380 INFO L226 Difference]: Without dead ends: 23479 [2022-03-15 21:46:54,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 56 SyntacticMatches, 17 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=705, Invalid=2375, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 21:46:54,381 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 237 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:46:54,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 0 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:46:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23479 states. [2022-03-15 21:46:54,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23479 to 17258. [2022-03-15 21:46:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17258 states, 17257 states have (on average 3.631627745262792) internal successors, (62671), 17257 states have internal predecessors, (62671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:46:54,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17258 states to 17258 states and 62671 transitions. [2022-03-15 21:46:54,890 INFO L78 Accepts]: Start accepts. Automaton has 17258 states and 62671 transitions. Word has length 27 [2022-03-15 21:46:54,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:46:54,891 INFO L470 AbstractCegarLoop]: Abstraction has 17258 states and 62671 transitions. [2022-03-15 21:46:54,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 25 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:46:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 17258 states and 62671 transitions. [2022-03-15 21:46:54,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:46:54,915 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:46:54,915 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:46:54,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-03-15 21:46:55,130 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:46:55,131 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:46:55,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:46:55,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1797267163, now seen corresponding path program 58 times [2022-03-15 21:46:55,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:46:55,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183919774] [2022-03-15 21:46:55,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:46:55,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:46:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:55,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:55,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183919774] [2022-03-15 21:46:55,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183919774] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:55,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558384571] [2022-03-15 21:46:55,349 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:46:55,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:55,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:55,350 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:46:55,351 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:46:55,372 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:46:55,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:55,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:46:55,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:56,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:59,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558384571] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:59,273 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:59,273 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-03-15 21:46:59,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1121053189] [2022-03-15 21:46:59,274 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:59,275 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:59,282 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 113 transitions. [2022-03-15 21:46:59,282 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:01,508 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [1099058#(and (or (not (< 0 s)) (<= (+ U T S 1) (+ m u t s))) (or (<= 1 s) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (not (< 0 s)) (<= (+ m 1) (+ U T S)))), 1099064#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 1099059#(and (or (<= s 1) (<= (+ 2 m) (+ U T S))) (or (<= 2 s) (not (< 0 u))) (or (<= s 1) (<= (+ U T S 1) (+ m u t s))) (or (<= 2 s) (not (< 0 t)))), 1099067#(and (or (<= (+ U T S) (+ m 1)) (<= 2 s) (< 1 u)) (or (<= 2 s) (<= (+ m 1) (+ U T S)) (< 1 u)) (or (<= 1 s) (< 1 u))), 1099063#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 2 s)) (or (< 0 u) (<= 1 s))), 1099057#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= t 0) (<= (+ m 4) (+ U T S))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 2) (<= 1 T)) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 2) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 1099066#(and (or (<= 1 s) (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (<= 1 s) (< 1 u) (< 0 t))), 1099065#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t))), 1099061#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 1099056#(and (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 1099062#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 1099055#(and (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 1099060#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t)))] [2022-03-15 21:47:01,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:47:01,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:01,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:47:01,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=1929, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 21:47:01,509 INFO L87 Difference]: Start difference. First operand 17258 states and 62671 transitions. Second operand has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 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:47:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:03,287 INFO L93 Difference]: Finished difference Result 34009 states and 119727 transitions. [2022-03-15 21:47:03,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 21:47:03,287 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 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 27 [2022-03-15 21:47:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:03,385 INFO L225 Difference]: With dead ends: 34009 [2022-03-15 21:47:03,386 INFO L226 Difference]: Without dead ends: 33994 [2022-03-15 21:47:03,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2267 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1218, Invalid=5424, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 21:47:03,387 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 205 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:03,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 0 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:47:03,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33994 states. [2022-03-15 21:47:03,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33994 to 17176. [2022-03-15 21:47:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17176 states, 17175 states have (on average 3.632896652110626) internal successors, (62395), 17175 states have internal predecessors, (62395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17176 states to 17176 states and 62395 transitions. [2022-03-15 21:47:03,895 INFO L78 Accepts]: Start accepts. Automaton has 17176 states and 62395 transitions. Word has length 27 [2022-03-15 21:47:03,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:03,895 INFO L470 AbstractCegarLoop]: Abstraction has 17176 states and 62395 transitions. [2022-03-15 21:47:03,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 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:47:03,895 INFO L276 IsEmpty]: Start isEmpty. Operand 17176 states and 62395 transitions. [2022-03-15 21:47:03,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:47:03,996 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:03,996 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:04,012 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:47:04,207 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:47:04,207 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:04,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:04,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1760395611, now seen corresponding path program 59 times [2022-03-15 21:47:04,210 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:04,210 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193387294] [2022-03-15 21:47:04,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:04,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:47:04,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:04,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193387294] [2022-03-15 21:47:04,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193387294] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:04,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780768449] [2022-03-15 21:47:04,405 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:47:04,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:04,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:04,406 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:47:04,407 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:47:04,428 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 21:47:04,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:04,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:47:04,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:05,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:07,769 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:07,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780768449] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:07,769 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:07,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 41 [2022-03-15 21:47:07,769 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1693463008] [2022-03-15 21:47:07,769 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:07,771 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:07,778 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 123 transitions. [2022-03-15 21:47:07,778 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:09,708 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [1167715#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u)))), 1167698#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 1167716#(and (or (<= (+ m t 1) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s)))), 1167710#(and (<= u 0) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (not (< 0 s)) (< 0 t)) (or (<= (+ m t) (+ U T S)) (not (< 0 t)))), 1167704#(and (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (< 0 u) (not (< 0 s)) (< 0 t)) (or (< 0 u) (<= (+ m t) (+ U T S)) (not (< 0 t)))), 1167714#(and (or (<= s 1) (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (< 0 u) (<= (+ m t) (+ U T S)) (not (< 0 t)))), 1167705#(and (or (<= s 1) (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (< 0 u) (<= (+ m t) (+ U T S)) (not (< 0 t)))), 1167696#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 1167709#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 1167708#(and (or (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t) (+ U T S)))), 1167713#(and (<= u 0) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (< 0 t))) (or (<= (+ m t) (+ U T S)) (not (< 0 t))) (or (<= s 1) (< 0 t))), 1167695#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 1167694#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 1167699#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 1167712#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m t) (+ U T S)) (< 1 u))), 1167697#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 1167706#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t) (+ U T S)))), 1167707#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t 1) (+ U T S)))), 1167703#(and (or (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m t s))) (or (< 0 u) (<= (+ m t) (+ U T S)))), 1167702#(and (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (< 0 u)) (< 0 t)) (or (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (< 0 t))) (or (<= (+ m t) (+ U T S)) (not (< 0 t))) (or (<= s 1) (< 0 t))), 1167701#(and (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (< 0 s)) (< 0 t)) (or (not (< 0 u)) (< 0 t)) (or (<= (+ m t) (+ U T S)) (not (< 0 t)))), 1167700#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 1167711#(and (or (< 0 u) (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (< 0 u) (not (< 0 s)) (< 0 t)) (or (< 0 u) (<= (+ m t) (+ U T S)) (not (< 0 t))))] [2022-03-15 21:47:09,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 21:47:09,709 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:09,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 21:47:09,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=3730, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 21:47:09,709 INFO L87 Difference]: Start difference. First operand 17176 states and 62395 transitions. Second operand has 38 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:10,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:10,687 INFO L93 Difference]: Finished difference Result 20068 states and 72871 transitions. [2022-03-15 21:47:10,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 21:47:10,687 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:47:10,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:10,740 INFO L225 Difference]: With dead ends: 20068 [2022-03-15 21:47:10,740 INFO L226 Difference]: Without dead ends: 20057 [2022-03-15 21:47:10,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2502 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1062, Invalid=6078, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 21:47:10,741 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 259 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:10,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 0 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:47:10,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20057 states. [2022-03-15 21:47:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20057 to 17270. [2022-03-15 21:47:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17270 states, 17269 states have (on average 3.6322311656725925) internal successors, (62725), 17269 states have internal predecessors, (62725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17270 states to 17270 states and 62725 transitions. [2022-03-15 21:47:11,139 INFO L78 Accepts]: Start accepts. Automaton has 17270 states and 62725 transitions. Word has length 27 [2022-03-15 21:47:11,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:11,140 INFO L470 AbstractCegarLoop]: Abstraction has 17270 states and 62725 transitions. [2022-03-15 21:47:11,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 17270 states and 62725 transitions. [2022-03-15 21:47:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:47:11,166 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:11,166 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:11,184 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:47:11,379 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:47:11,379 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:11,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:11,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1470756897, now seen corresponding path program 60 times [2022-03-15 21:47:11,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:11,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920385125] [2022-03-15 21:47:11,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:11,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:11,643 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:11,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920385125] [2022-03-15 21:47:11,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920385125] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:11,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878654579] [2022-03-15 21:47:11,643 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:47:11,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:11,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:11,644 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:47:11,645 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:47:11,668 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 21:47:11,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:11,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:47:11,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:12,432 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:12,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:13,213 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:13,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878654579] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:13,213 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:13,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 39 [2022-03-15 21:47:13,214 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [234589615] [2022-03-15 21:47:13,214 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:13,215 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:13,222 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 123 transitions. [2022-03-15 21:47:13,222 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:14,909 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [1222485#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 1222565#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)))), 1222579#(and (or (<= s 1) (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (< 0 u) (<= (+ m t) (+ U T S)) (not (< 0 t)))), 1222564#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 1222560#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 1222578#(and (<= u 0) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (< 0 t))) (or (<= (+ m t) (+ U T S)) (not (< 0 t))) (or (<= s 1) (< 0 t))), 1222568#(and (or (< 0 u) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (<= t 0) (< 0 u))), 1222576#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 1222577#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 1222567#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m u t s)) (< 0 t)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (< 0 t))), 1222561#(and (<= u 0) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (not (< 0 s)) (< 0 t)) (or (<= (+ m t) (+ U T S)) (not (< 0 t)))), 1222575#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m t) (+ U T S)) (< 1 u))), 1222572#(and (or (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t) (+ U T S)))), 1222563#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)) (< 0 t)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (< 0 t))), 1222570#(and (or (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t 1) (+ U T S)))), 1222562#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 1222581#(and (or (<= (+ m t 1) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s)))), 1222573#(and (or (< 0 u) (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (< 0 u) (not (< 0 s)) (< 0 t)) (or (< 0 u) (<= (+ m t) (+ U T S)) (not (< 0 t)))), 1222569#(and (or (< 0 u) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 2 s))), 1222566#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (<= t 0) (< 0 u))), 1222571#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t 1) (+ U T S)))), 1222580#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u)))), 1222574#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t) (+ U T S))))] [2022-03-15 21:47:14,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 21:47:14,909 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:14,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 21:47:14,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=769, Invalid=3137, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 21:47:14,910 INFO L87 Difference]: Start difference. First operand 17270 states and 62725 transitions. Second operand has 40 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 39 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:16,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:16,774 INFO L93 Difference]: Finished difference Result 27288 states and 99354 transitions. [2022-03-15 21:47:16,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 21:47:16,775 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 39 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:47:16,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:16,849 INFO L225 Difference]: With dead ends: 27288 [2022-03-15 21:47:16,849 INFO L226 Difference]: Without dead ends: 27270 [2022-03-15 21:47:16,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4483 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2494, Invalid=9938, Unknown=0, NotChecked=0, Total=12432 [2022-03-15 21:47:16,850 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 439 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:16,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [439 Valid, 0 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:47:16,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27270 states. [2022-03-15 21:47:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27270 to 17428. [2022-03-15 21:47:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17428 states, 17427 states have (on average 3.631778275090377) internal successors, (63291), 17427 states have internal predecessors, (63291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17428 states to 17428 states and 63291 transitions. [2022-03-15 21:47:17,289 INFO L78 Accepts]: Start accepts. Automaton has 17428 states and 63291 transitions. Word has length 27 [2022-03-15 21:47:17,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:17,290 INFO L470 AbstractCegarLoop]: Abstraction has 17428 states and 63291 transitions. [2022-03-15 21:47:17,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 39 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:17,290 INFO L276 IsEmpty]: Start isEmpty. Operand 17428 states and 63291 transitions. [2022-03-15 21:47:17,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:47:17,314 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:17,314 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:17,330 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:47:17,530 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:47:17,530 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:17,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:17,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1966334043, now seen corresponding path program 61 times [2022-03-15 21:47:17,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:17,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130431143] [2022-03-15 21:47:17,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:17,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:17,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:17,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130431143] [2022-03-15 21:47:17,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130431143] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:17,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652875772] [2022-03-15 21:47:17,693 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:47:17,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:17,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:17,695 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:47:17,696 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:47:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:17,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:47:17,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:18,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:20,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652875772] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:20,592 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:20,592 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2022-03-15 21:47:20,592 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [879541117] [2022-03-15 21:47:20,592 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:20,594 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:20,600 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 121 transitions. [2022-03-15 21:47:20,600 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:23,422 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [1285039#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 1285023#(and (or (<= (+ m t 1) (+ U T S)) (< 1 s) (not (< 0 s)) (not (< 0 t))) (or (< 1 s) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (<= t 0) (<= (+ m t) (+ U T S)) (< 0 s)) (or (not (<= t 0)) (not (< 0 u))) (or (<= s 1) (< 0 t))), 1285030#(and (or (< 0 u) (<= (+ m t) (+ U T S)) (< 0 s)) (or (< 0 u) (not (<= t 0))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (< 0 s))), 1285041#(and (or (<= (+ m t 1) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s)))), 1285042#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u)))), 1285032#(and (or (< 0 u) (< 1 s) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (<= s 1) (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ m t 1) (+ U T S)) (< 1 s) (not (< 0 s)) (not (< 0 t))) (or (<= t 0) (< 0 u) (<= (+ m t) (+ U T S)) (< 0 s))), 1285033#(and (or (< 0 u) (<= (+ m t) (+ U T S)) (< 0 s)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (< 0 s))), 1285038#(and (or (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t 1) (+ U T S)))), 1285036#(and (or (< 0 u) (< 2 s) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (< 0 u) (<= s 2) (< 0 t)) (or (<= t 0) (< 0 u) (<= (+ m t 1) (+ U T S)) (< 1 s) (not (< 0 s))) (or (<= t 0) (< 0 u) (<= (+ m t) (+ U T S)) (< 0 s)) (or (<= (+ 2 m t) (+ U T S)) (<= s 1) (<= t 0) (< 0 u) (< 2 s))), 1285024#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 1285034#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t 1) (+ U T S)))), 1285028#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 2 s)) (or (< 0 u) (<= 1 s))), 1285031#(and (or (< 0 u) (not (< 0 s)) (not (<= t 0))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t)) (< 0 s)) (or (< 0 u) (<= (+ m t) (+ U T S)) (not (< 0 t)) (< 0 s))), 1285022#(and (or (not (< 0 s)) (not (<= t 0))) (or (<= (+ U T S) (+ m t s)) (not (< 0 t)) (< 0 s)) (or (not (<= t 0)) (not (< 0 u))) (or (<= (+ m t) (+ U T S)) (not (< 0 t)) (< 0 s))), 1285035#(and (or (< 2 s) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (<= t 0) (<= (+ m t) (+ U T S)) (< 0 s)) (or (not (<= t 0)) (not (< 0 u))) (or (<= (+ 2 m t) (+ U T S)) (<= s 1) (<= t 0) (< 2 s)) (or (<= s 2) (< 0 t)) (or (<= t 0) (<= (+ m t 1) (+ U T S)) (< 1 s) (not (< 0 s)))), 1285040#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 1285037#(and (or (<= (+ 2 m t) (+ U T S)) (< 0 u)) (or (< 0 u) (<= (+ U T S) (+ m u t s)))), 1285025#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t))), 1285027#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 1285029#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m t 1))) (or (< 0 u) (<= 1 s))), 1285026#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u)))] [2022-03-15 21:47:23,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 21:47:23,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:23,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 21:47:23,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=3261, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 21:47:23,423 INFO L87 Difference]: Start difference. First operand 17428 states and 63291 transitions. Second operand has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:26,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:26,321 INFO L93 Difference]: Finished difference Result 30092 states and 108575 transitions. [2022-03-15 21:47:26,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-03-15 21:47:26,321 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:47:26,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:26,415 INFO L225 Difference]: With dead ends: 30092 [2022-03-15 21:47:26,415 INFO L226 Difference]: Without dead ends: 30081 [2022-03-15 21:47:26,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 40 SyntacticMatches, 8 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5575 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2666, Invalid=11854, Unknown=0, NotChecked=0, Total=14520 [2022-03-15 21:47:26,417 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 389 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:26,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 0 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:47:26,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30081 states. [2022-03-15 21:47:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30081 to 17584. [2022-03-15 21:47:26,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17584 states, 17583 states have (on average 3.6301541261445713) internal successors, (63829), 17583 states have internal predecessors, (63829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17584 states to 17584 states and 63829 transitions. [2022-03-15 21:47:26,976 INFO L78 Accepts]: Start accepts. Automaton has 17584 states and 63829 transitions. Word has length 27 [2022-03-15 21:47:26,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:26,977 INFO L470 AbstractCegarLoop]: Abstraction has 17584 states and 63829 transitions. [2022-03-15 21:47:26,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:26,977 INFO L276 IsEmpty]: Start isEmpty. Operand 17584 states and 63829 transitions. [2022-03-15 21:47:27,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:47:27,003 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:27,003 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:27,019 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:47:27,219 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:47:27,219 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:27,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:27,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1264818465, now seen corresponding path program 62 times [2022-03-15 21:47:27,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:27,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824956432] [2022-03-15 21:47:27,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:27,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:47:27,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:27,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824956432] [2022-03-15 21:47:27,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824956432] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:27,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81322287] [2022-03-15 21:47:27,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:47:27,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:27,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:27,471 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:47:27,472 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:47:27,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:47:27,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:27,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:47:27,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:28,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:28,721 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81322287] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:28,721 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:28,721 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 38 [2022-03-15 21:47:28,721 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1096667839] [2022-03-15 21:47:28,721 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:28,722 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:28,729 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 121 transitions. [2022-03-15 21:47:28,729 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:30,713 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [1350623#(and (or (< 0 u) (<= (+ U T S) (+ m u t s)) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t))), 1350618#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 1350628#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 1350627#(and (or (< 0 u) (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (< 0 u) (not (< 0 s)) (< 0 t))), 1350622#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (<= t 0) (< 0 u))), 1350624#(and (or (< 0 u) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (<= t 0) (< 0 u))), 1350617#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 1350619#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 1350620#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 1350616#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 1350629#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 1350630#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t 1) (+ U T S)))), 1350621#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 1350632#(and (or (<= s 1) (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ 2 m t) (+ U T S)) (< 0 u) (not (< 0 t)))), 1350625#(and (or (< 0 u) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 1 s))), 1350633#(and (or (<= (+ 2 m t) (+ U T S)) (< 0 u)) (or (< 0 u) (<= (+ U T S) (+ m u t s)))), 1350635#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u)))), 1350615#(and (<= u 0) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 s)) (< 0 t))), 1350634#(and (or (<= (+ m t 1) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s)))), 1350631#(and (<= u 0) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 t))) (or (<= s 1) (< 0 t))), 1350626#(and (or (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t 1) (+ U T S))))] [2022-03-15 21:47:30,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 21:47:30,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:30,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 21:47:30,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=2955, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 21:47:30,714 INFO L87 Difference]: Start difference. First operand 17584 states and 63829 transitions. Second operand has 37 states, 36 states have (on average 2.5) internal successors, (90), 36 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:31,719 INFO L93 Difference]: Finished difference Result 19035 states and 68867 transitions. [2022-03-15 21:47:31,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 21:47:31,719 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5) internal successors, (90), 36 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have 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:47:31,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:31,769 INFO L225 Difference]: With dead ends: 19035 [2022-03-15 21:47:31,769 INFO L226 Difference]: Without dead ends: 19024 [2022-03-15 21:47:31,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2275 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1213, Invalid=4793, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 21:47:31,770 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 258 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:31,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 0 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:47:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19024 states. [2022-03-15 21:47:32,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19024 to 17618. [2022-03-15 21:47:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17618 states, 17617 states have (on average 3.6298461713118013) internal successors, (63947), 17617 states have internal predecessors, (63947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17618 states to 17618 states and 63947 transitions. [2022-03-15 21:47:32,165 INFO L78 Accepts]: Start accepts. Automaton has 17618 states and 63947 transitions. Word has length 27 [2022-03-15 21:47:32,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:32,165 INFO L470 AbstractCegarLoop]: Abstraction has 17618 states and 63947 transitions. [2022-03-15 21:47:32,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5) internal successors, (90), 36 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 17618 states and 63947 transitions. [2022-03-15 21:47:32,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:47:32,191 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:32,191 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:32,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-03-15 21:47:32,406 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:47:32,407 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:32,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:32,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1141023645, now seen corresponding path program 63 times [2022-03-15 21:47:32,409 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:32,409 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066565539] [2022-03-15 21:47:32,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:32,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:32,763 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:32,763 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:32,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066565539] [2022-03-15 21:47:32,763 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066565539] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:32,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617926774] [2022-03-15 21:47:32,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:47:32,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:32,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:32,765 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:47:32,765 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:47:32,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 21:47:32,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:32,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:47:32,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:33,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:34,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617926774] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:34,234 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:34,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 13] total 41 [2022-03-15 21:47:34,234 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1904707764] [2022-03-15 21:47:34,235 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:34,236 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:34,243 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 121 transitions. [2022-03-15 21:47:34,243 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:35,763 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [1405158#(and (or (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t 1) (+ U T S)))), 1405146#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 1405140#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 1405155#(and (or (< 0 u) (<= (+ 3 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s)))), 1405149#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 1405156#(and (or (< 0 u) (< 0 t)) (or (<= (+ 2 m t) (+ U T S)) (< 0 u)) (or (< 0 u) (<= (+ U T S) (+ m u t s)))), 1405152#(and (or (< 0 u) (<= (+ 2 m) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (< 0 t))), 1405142#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 1405161#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u)))), 1405154#(and (or (< 0 u) (<= (+ 3 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (<= t 0) (< 0 u))), 1405157#(and (or (<= (+ 2 m t) (+ U T S)) (< 0 u)) (or (< 0 u) (<= (+ U T S) (+ m u t s)))), 1405151#(and (or (< 0 u) (<= (+ s 1) 0) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ s 1) 0) (<= (+ U T S) (+ m u t s)) (< 0 t))), 1405145#(and (or (< 0 u) (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (not (< 0 s)) (<= (+ 2 m) (+ U T S))) (or (<= t 0) (< 0 u))), 1405144#(and (or (< 0 u) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (<= t 0) (< 0 u))), 1405150#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 1405143#(and (or (< 0 u) (<= (+ s 1) 0) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ s 1) 0) (<= (+ m 1) (+ U T S))) (or (<= t 0) (< 0 u))), 1405147#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 1405148#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 1405153#(and (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= s 0) (< 0 t)) (or (< 0 u) (<= (+ 2 m) (+ U T S)) (<= s 0) (< 0 t))), 1405160#(and (or (<= (+ m t 1) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s)))), 1405159#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t 1) (+ U T S)))), 1405141#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s))))] [2022-03-15 21:47:35,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 21:47:35,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:35,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 21:47:35,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=808, Invalid=3352, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 21:47:35,764 INFO L87 Difference]: Start difference. First operand 17618 states and 63947 transitions. Second operand has 41 states, 40 states have (on average 2.325) internal successors, (93), 40 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:47:36,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:36,643 INFO L93 Difference]: Finished difference Result 19091 states and 69098 transitions. [2022-03-15 21:47:36,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:47:36,643 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.325) internal successors, (93), 40 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 27 [2022-03-15 21:47:36,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:36,689 INFO L225 Difference]: With dead ends: 19091 [2022-03-15 21:47:36,689 INFO L226 Difference]: Without dead ends: 19080 [2022-03-15 21:47:36,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2691 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1493, Invalid=5817, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 21:47:36,690 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 258 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:36,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 0 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:47:36,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19080 states. [2022-03-15 21:47:36,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19080 to 17738. [2022-03-15 21:47:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17738 states, 17737 states have (on average 3.630884591531826) internal successors, (64401), 17737 states have internal predecessors, (64401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17738 states to 17738 states and 64401 transitions. [2022-03-15 21:47:37,029 INFO L78 Accepts]: Start accepts. Automaton has 17738 states and 64401 transitions. Word has length 27 [2022-03-15 21:47:37,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:37,030 INFO L470 AbstractCegarLoop]: Abstraction has 17738 states and 64401 transitions. [2022-03-15 21:47:37,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.325) internal successors, (93), 40 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:47:37,030 INFO L276 IsEmpty]: Start isEmpty. Operand 17738 states and 64401 transitions. [2022-03-15 21:47:37,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:47:37,054 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:37,055 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:37,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2022-03-15 21:47:37,263 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:47:37,264 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:37,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:37,264 INFO L85 PathProgramCache]: Analyzing trace with hash -425755037, now seen corresponding path program 64 times [2022-03-15 21:47:37,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:37,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36321493] [2022-03-15 21:47:37,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:37,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:37,314 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:37,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36321493] [2022-03-15 21:47:37,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36321493] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:37,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862002555] [2022-03-15 21:47:37,314 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:47:37,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:37,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:37,316 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:47:37,316 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:47:37,337 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:47:37,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:37,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 21:47:37,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:47:37,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:37,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862002555] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:37,786 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:37,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 10] total 18 [2022-03-15 21:47:37,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [457650452] [2022-03-15 21:47:37,787 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:37,788 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:37,793 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 86 transitions. [2022-03-15 21:47:37,794 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:38,003 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1459946#(< 0 t), 1459947#(or (< 0 s) (< 0 t))] [2022-03-15 21:47:38,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 21:47:38,003 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:38,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 21:47:38,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:47:38,003 INFO L87 Difference]: Start difference. First operand 17738 states and 64401 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 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:47:38,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:38,189 INFO L93 Difference]: Finished difference Result 22244 states and 80105 transitions. [2022-03-15 21:47:38,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 21:47:38,189 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 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 27 [2022-03-15 21:47:38,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:38,244 INFO L225 Difference]: With dead ends: 22244 [2022-03-15 21:47:38,244 INFO L226 Difference]: Without dead ends: 22244 [2022-03-15 21:47:38,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 57 SyntacticMatches, 13 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=349, Unknown=0, NotChecked=0, Total=552 [2022-03-15 21:47:38,245 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 68 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:38,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 31 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:47:38,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22244 states. [2022-03-15 21:47:38,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22244 to 17363. [2022-03-15 21:47:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17363 states, 17362 states have (on average 3.6473332565372654) internal successors, (63325), 17362 states have internal predecessors, (63325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17363 states to 17363 states and 63325 transitions. [2022-03-15 21:47:38,738 INFO L78 Accepts]: Start accepts. Automaton has 17363 states and 63325 transitions. Word has length 27 [2022-03-15 21:47:38,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:38,738 INFO L470 AbstractCegarLoop]: Abstraction has 17363 states and 63325 transitions. [2022-03-15 21:47:38,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 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:47:38,738 INFO L276 IsEmpty]: Start isEmpty. Operand 17363 states and 63325 transitions. [2022-03-15 21:47:38,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:47:38,763 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:38,763 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:38,779 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:47:38,979 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:47:38,980 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:38,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1253773869, now seen corresponding path program 65 times [2022-03-15 21:47:38,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:38,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289809377] [2022-03-15 21:47:38,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:38,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:47:39,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:39,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289809377] [2022-03-15 21:47:39,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289809377] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:39,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400533917] [2022-03-15 21:47:39,032 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:47:39,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:39,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:39,033 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:47:39,033 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:47:39,053 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:47:39,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:39,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 21:47:39,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 21:47:39,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:39,284 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:47:39,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400533917] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:39,284 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:39,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 20 [2022-03-15 21:47:39,284 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [550337404] [2022-03-15 21:47:39,284 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:39,286 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:39,292 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 97 transitions. [2022-03-15 21:47:39,292 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:39,813 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [1517104#(or (< 0 u) (< 0 t)), 1517105#(or (< 0 u) (<= 1 s) (< 0 t)), 1517111#(and (or (<= 1 t) (not (< 0 s))) (or (<= 0 s) (not (< 0 t))) (or (<= 1 t) (not (< 0 u)))), 1517106#(and (or (< 0 u) (<= 1 t)) (or (< 0 u) (<= 1 s))), 1517108#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 1517112#(and (or (<= t 0) (<= 0 s)) (or (<= 1 t) (not (< 0 u))) (or (not (< 1 s)) (<= 1 t))), 1517102#(or (< 0 u) (<= 1 s)), 1517109#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 u)) (<= 1 T)) (or (not (< 1 s)) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 1 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 1517101#(< 0 u), 1517107#(or (<= 1 s) (< 1 u)), 1517110#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 s)) (<= 1 T)) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s)))), 1517103#(or (< 0 u) (<= 2 s))] [2022-03-15 21:47:39,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:47:39,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:39,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:47:39,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 21:47:39,814 INFO L87 Difference]: Start difference. First operand 17363 states and 63325 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 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:47:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:40,479 INFO L93 Difference]: Finished difference Result 25456 states and 92066 transitions. [2022-03-15 21:47:40,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 21:47:40,480 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 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 27 [2022-03-15 21:47:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:40,550 INFO L225 Difference]: With dead ends: 25456 [2022-03-15 21:47:40,550 INFO L226 Difference]: Without dead ends: 25456 [2022-03-15 21:47:40,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 56 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=812, Invalid=2268, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 21:47:40,551 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 271 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:40,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 0 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:47:40,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25456 states. [2022-03-15 21:47:41,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25456 to 21063. [2022-03-15 21:47:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21063 states, 21062 states have (on average 3.669689488177761) internal successors, (77291), 21062 states have internal predecessors, (77291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21063 states to 21063 states and 77291 transitions. [2022-03-15 21:47:41,158 INFO L78 Accepts]: Start accepts. Automaton has 21063 states and 77291 transitions. Word has length 27 [2022-03-15 21:47:41,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:41,158 INFO L470 AbstractCegarLoop]: Abstraction has 21063 states and 77291 transitions. [2022-03-15 21:47:41,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 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:47:41,158 INFO L276 IsEmpty]: Start isEmpty. Operand 21063 states and 77291 transitions. [2022-03-15 21:47:41,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:47:41,188 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:41,189 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:41,204 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:47:41,404 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:47:41,404 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:41,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:41,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1183045105, now seen corresponding path program 66 times [2022-03-15 21:47:41,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:41,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764067728] [2022-03-15 21:47:41,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:41,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:41,457 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:41,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764067728] [2022-03-15 21:47:41,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764067728] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:41,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879589749] [2022-03-15 21:47:41,458 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:47:41,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:41,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:41,459 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:47:41,471 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:47:41,492 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 21:47:41,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:41,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 21:47:41,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:41,561 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:47:41,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:41,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879589749] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:41,993 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:41,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 10] total 16 [2022-03-15 21:47:41,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1622331883] [2022-03-15 21:47:41,993 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:41,995 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:42,001 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 95 transitions. [2022-03-15 21:47:42,001 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:42,420 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1584914#(< 0 t), 1584915#(or (<= 1 s) (< 0 t))] [2022-03-15 21:47:42,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 21:47:42,420 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:42,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 21:47:42,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2022-03-15 21:47:42,420 INFO L87 Difference]: Start difference. First operand 21063 states and 77291 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:42,705 INFO L93 Difference]: Finished difference Result 35078 states and 125621 transitions. [2022-03-15 21:47:42,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 21:47:42,705 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:47:42,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:43,037 INFO L225 Difference]: With dead ends: 35078 [2022-03-15 21:47:43,037 INFO L226 Difference]: Without dead ends: 35078 [2022-03-15 21:47:43,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 63 SyntacticMatches, 13 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:47:43,039 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 85 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:43,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 12 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:47:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35078 states. [2022-03-15 21:47:43,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35078 to 29761. [2022-03-15 21:47:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29761 states, 29760 states have (on average 3.6936491935483873) internal successors, (109923), 29760 states have internal predecessors, (109923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29761 states to 29761 states and 109923 transitions. [2022-03-15 21:47:43,954 INFO L78 Accepts]: Start accepts. Automaton has 29761 states and 109923 transitions. Word has length 27 [2022-03-15 21:47:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:43,954 INFO L470 AbstractCegarLoop]: Abstraction has 29761 states and 109923 transitions. [2022-03-15 21:47:43,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 29761 states and 109923 transitions. [2022-03-15 21:47:43,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:47:44,000 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:44,000 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:44,017 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:47:44,205 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:47:44,206 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:44,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:44,206 INFO L85 PathProgramCache]: Analyzing trace with hash 903318043, now seen corresponding path program 67 times [2022-03-15 21:47:44,207 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:44,207 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281863566] [2022-03-15 21:47:44,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:44,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:44,279 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:44,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281863566] [2022-03-15 21:47:44,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281863566] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:44,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880630484] [2022-03-15 21:47:44,280 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:47:44,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:44,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:44,281 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:47:44,282 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:47:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:44,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 21:47:44,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:44,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:44,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880630484] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:44,868 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:44,868 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2022-03-15 21:47:44,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [830719258] [2022-03-15 21:47:44,868 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:44,870 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:44,876 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 85 transitions. [2022-03-15 21:47:44,876 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:45,338 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [1679700#(< 0 t), 1679698#(or (< 0 s) (< 0 t)), 1679699#(or (< 1 s) (< 0 t))] [2022-03-15 21:47:45,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 21:47:45,338 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:45,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 21:47:45,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:47:45,338 INFO L87 Difference]: Start difference. First operand 29761 states and 109923 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 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:47:45,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:45,699 INFO L93 Difference]: Finished difference Result 39455 states and 143394 transitions. [2022-03-15 21:47:45,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:47:45,700 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 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:47:45,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:45,936 INFO L225 Difference]: With dead ends: 39455 [2022-03-15 21:47:45,937 INFO L226 Difference]: Without dead ends: 39455 [2022-03-15 21:47:45,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 55 SyntacticMatches, 14 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2022-03-15 21:47:45,937 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 78 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:45,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 34 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:47:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39455 states. [2022-03-15 21:47:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39455 to 29381. [2022-03-15 21:47:46,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29381 states, 29380 states have (on average 3.6958134785568415) internal successors, (108583), 29380 states have internal predecessors, (108583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:46,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29381 states to 29381 states and 108583 transitions. [2022-03-15 21:47:46,823 INFO L78 Accepts]: Start accepts. Automaton has 29381 states and 108583 transitions. Word has length 27 [2022-03-15 21:47:46,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:46,824 INFO L470 AbstractCegarLoop]: Abstraction has 29381 states and 108583 transitions. [2022-03-15 21:47:46,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 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:47:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 29381 states and 108583 transitions. [2022-03-15 21:47:47,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:47:47,006 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:47,006 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:47,024 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:47:47,221 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:47:47,221 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:47,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:47,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1717844001, now seen corresponding path program 68 times [2022-03-15 21:47:47,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:47,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392884136] [2022-03-15 21:47:47,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:47,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:47,291 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:47,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392884136] [2022-03-15 21:47:47,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392884136] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:47,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626679639] [2022-03-15 21:47:47,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:47:47,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:47,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:47,292 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:47:47,293 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:47:47,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:47:47,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:47,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 21:47:47,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:47,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:47,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626679639] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:47,838 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:47,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2022-03-15 21:47:47,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [886200908] [2022-03-15 21:47:47,838 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:47,840 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:47,845 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 85 transitions. [2022-03-15 21:47:47,845 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:48,241 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [1778098#(or (< 0 s) (< 0 t)), 1778099#(or (< 1 s) (< 0 t)), 1778100#(< 0 t)] [2022-03-15 21:47:48,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 21:47:48,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:48,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 21:47:48,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=277, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:47:48,242 INFO L87 Difference]: Start difference. First operand 29381 states and 108583 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 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:47:48,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:48,580 INFO L93 Difference]: Finished difference Result 36257 states and 130131 transitions. [2022-03-15 21:47:48,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:47:48,580 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 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:47:48,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:48,757 INFO L225 Difference]: With dead ends: 36257 [2022-03-15 21:47:48,757 INFO L226 Difference]: Without dead ends: 36257 [2022-03-15 21:47:48,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 55 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=419, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:47:48,758 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 75 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:48,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 26 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:47:48,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36257 states. [2022-03-15 21:47:49,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36257 to 31736. [2022-03-15 21:47:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31736 states, 31735 states have (on average 3.671498345675122) internal successors, (116515), 31735 states have internal predecessors, (116515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31736 states to 31736 states and 116515 transitions. [2022-03-15 21:47:49,758 INFO L78 Accepts]: Start accepts. Automaton has 31736 states and 116515 transitions. Word has length 27 [2022-03-15 21:47:49,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:49,758 INFO L470 AbstractCegarLoop]: Abstraction has 31736 states and 116515 transitions. [2022-03-15 21:47:49,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 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:47:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand 31736 states and 116515 transitions. [2022-03-15 21:47:49,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:47:49,805 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:49,805 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:49,821 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:47:50,008 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:47:50,008 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:50,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:50,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1639473657, now seen corresponding path program 69 times [2022-03-15 21:47:50,010 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:50,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173237890] [2022-03-15 21:47:50,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:50,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:50,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:50,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173237890] [2022-03-15 21:47:50,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173237890] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:50,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005426049] [2022-03-15 21:47:50,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:47:50,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:50,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:50,124 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:47:50,124 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:47:50,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 21:47:50,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:50,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 21:47:50,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:50,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:47:50,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005426049] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:50,818 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:50,818 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 27 [2022-03-15 21:47:50,818 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2020097672] [2022-03-15 21:47:50,818 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:50,820 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:50,826 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 114 transitions. [2022-03-15 21:47:50,826 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:51,529 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [1878031#(or (< 0 u) (< 0 t)), 1878024#(and (or (<= 1 t) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s))), 1878034#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s)))), 1878029#(or (< 0 u) (<= 2 s)), 1878026#(and (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 1877956#(or (< 0 u) (< 1 s) (< 0 t)), 1878027#(< 0 u), 1878033#(and (or (<= 2 s) (< 0 t)) (<= 1 s)), 1877960#(or (< 0 u) (< 1 s) (<= s 0) (< 0 t)), 1878025#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 1878028#(or (< 0 u) (<= 1 s)), 1877952#(or (< 0 u) (< 0 s) (< 0 t)), 1878035#(and (or (< 0 u) (<= 3 s)) (or (<= t 0) (< 0 u))), 1878037#(and (or (< 0 u) (< 0 t)) (or (< 0 u) (<= 2 s))), 1878030#(and (or (< 0 u) (<= 2 s) (<= s 0)) (or (<= t 0) (< 0 u))), 1878036#(or (< 0 u) (<= 3 s)), 1878032#(and (or (<= 2 s) (< 0 t)) (<= u 0) (<= 1 s))] [2022-03-15 21:47:51,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 21:47:51,530 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:51,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 21:47:51,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1328, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 21:47:51,530 INFO L87 Difference]: Start difference. First operand 31736 states and 116515 transitions. Second operand has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 29 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:47:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:47:52,324 INFO L93 Difference]: Finished difference Result 42936 states and 155068 transitions. [2022-03-15 21:47:52,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 21:47:52,324 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:47:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:47:52,458 INFO L225 Difference]: With dead ends: 42936 [2022-03-15 21:47:52,459 INFO L226 Difference]: Without dead ends: 42936 [2022-03-15 21:47:52,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 54 SyntacticMatches, 11 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2046 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1382, Invalid=4470, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 21:47:52,459 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 224 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:47:52,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 0 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:47:52,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42936 states. [2022-03-15 21:47:53,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42936 to 28188. [2022-03-15 21:47:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28188 states, 28187 states have (on average 3.6862738141696525) internal successors, (103905), 28187 states have internal predecessors, (103905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:47:53,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28188 states to 28188 states and 103905 transitions. [2022-03-15 21:47:53,474 INFO L78 Accepts]: Start accepts. Automaton has 28188 states and 103905 transitions. Word has length 27 [2022-03-15 21:47:53,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:47:53,474 INFO L470 AbstractCegarLoop]: Abstraction has 28188 states and 103905 transitions. [2022-03-15 21:47:53,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 29 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:47:53,475 INFO L276 IsEmpty]: Start isEmpty. Operand 28188 states and 103905 transitions. [2022-03-15 21:47:53,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:47:53,517 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:47:53,518 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:47:53,539 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:47:53,733 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:47:53,733 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:47:53,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:47:53,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2107853603, now seen corresponding path program 70 times [2022-03-15 21:47:53,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:47:53,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827683171] [2022-03-15 21:47:53,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:47:53,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:47:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:47:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:54,057 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:47:54,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827683171] [2022-03-15 21:47:54,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827683171] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:47:54,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161242916] [2022-03-15 21:47:54,057 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:47:54,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:47:54,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:47:54,058 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:47:54,059 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:47:54,086 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:47:54,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:47:54,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:47:54,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:47:55,506 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:55,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:47:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:47:57,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161242916] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:47:57,080 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:47:57,081 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2022-03-15 21:47:57,081 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [709411214] [2022-03-15 21:47:57,081 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:47:57,082 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:47:57,089 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 112 transitions. [2022-03-15 21:47:57,089 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:58,993 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [1977618#(and (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ 2 m) (+ U T S)) (not (< 0 u)))), 1977630#(and (or (<= 2 s) (<= (+ m 1) (+ U T S)) (< 1 u) (<= s 0) (< 0 t)) (or (<= 2 s) (<= (+ U T S) (+ m u)) (< 1 u) (<= s 0) (< 0 t))), 1977626#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)) (< 0 t)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (< 0 t))), 1977629#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (<= s 0)) (or (<= t 0) (< 0 u)) (or (< 0 u) (<= (+ U T S) (+ m u 1)) (<= 2 s) (<= s 0))), 1977627#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (<= s 0) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u 1)) (<= 2 s) (<= s 0) (< 0 t))), 1977619#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 1977622#(and (or (<= t 0) (<= 0 s)) (or (not (< 1 s)) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 1 s)) (<= (+ 2 m s) (+ U T S))) (or (<= (+ U S) (+ m u s)) (not (< 1 s))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 1977620#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 1977631#(and (or (< 0 u) (<= (+ U T S) (+ 2 m u)) (<= 3 s)) (or (< 0 u) (<= 2 s)) (or (< 0 u) (<= (+ 2 m) (+ U T S)) (<= 3 s)) (or (<= t 0) (< 0 u))), 1977624#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 1977633#(and (or (<= (+ U T S) (+ m u 1)) (<= 3 s) (< 1 u)) (or (<= 2 s) (< 1 u)) (or (<= (+ 2 m) (+ U T S)) (<= 3 s) (< 1 u))), 1977628#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)))), 1977621#(and (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 t)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 1977632#(and (or (< 0 u) (<= (+ U T S) (+ 2 m u)) (<= 3 s)) (or (< 0 u) (<= 2 s)) (or (< 0 u) (<= (+ 2 m) (+ U T S)) (<= 3 s))), 1977625#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t))), 1977623#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))))] [2022-03-15 21:47:58,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:47:58,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:58,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:47:58,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=2698, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 21:47:58,994 INFO L87 Difference]: Start difference. First operand 28188 states and 103905 transitions. Second operand has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 31 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:01,881 INFO L93 Difference]: Finished difference Result 55005 states and 194807 transitions. [2022-03-15 21:48:01,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-15 21:48:01,882 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 31 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:48:01,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:02,053 INFO L225 Difference]: With dead ends: 55005 [2022-03-15 21:48:02,054 INFO L226 Difference]: Without dead ends: 54990 [2022-03-15 21:48:02,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4786 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2772, Invalid=11508, Unknown=0, NotChecked=0, Total=14280 [2022-03-15 21:48:02,055 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 324 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:02,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 0 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:48:02,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54990 states. [2022-03-15 21:48:03,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54990 to 28176. [2022-03-15 21:48:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28176 states, 28175 states have (on average 3.6865661047027505) internal successors, (103869), 28175 states have internal predecessors, (103869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28176 states to 28176 states and 103869 transitions. [2022-03-15 21:48:03,289 INFO L78 Accepts]: Start accepts. Automaton has 28176 states and 103869 transitions. Word has length 27 [2022-03-15 21:48:03,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:03,289 INFO L470 AbstractCegarLoop]: Abstraction has 28176 states and 103869 transitions. [2022-03-15 21:48:03,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 31 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand 28176 states and 103869 transitions. [2022-03-15 21:48:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:48:03,329 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:03,329 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:03,345 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:48:03,545 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:48:03,545 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:03,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:03,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1662166949, now seen corresponding path program 71 times [2022-03-15 21:48:03,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:03,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561672794] [2022-03-15 21:48:03,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:03,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:03,803 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:03,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:03,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561672794] [2022-03-15 21:48:03,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561672794] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:03,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224019283] [2022-03-15 21:48:03,804 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:48:03,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:03,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:03,805 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:48:03,806 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:48:03,831 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:48:03,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:03,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:48:03,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:05,100 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:05,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:06,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224019283] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:06,735 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:06,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2022-03-15 21:48:06,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006468656] [2022-03-15 21:48:06,736 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:06,737 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:06,744 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 109 transitions. [2022-03-15 21:48:06,744 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:09,323 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [2089313#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 2089314#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 2089325#(and (or (<= t 0) (<= 0 s)) (or (<= 2 s) (<= (+ U T S) (+ m t 1)) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (<= 2 s) (not (< 0 s)) (not (< 0 t))) (or (<= t 0) (<= (+ m t) (+ U T S)) (< 0 s)) (or (not (<= t 0)) (not (< 0 u))) (or (<= s 1) (< 0 t)) (or (<= t 0) (<= (+ U T S) (+ m t)) (< 0 s))), 2089323#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 2089328#(and (or (< 0 u) (<= (+ m t 1) (+ U T S)) (<= 2 s) (not (< 0 s)) (not (< 0 t))) (or (<= s 1) (< 0 u) (< 0 t)) (or (<= t 0) (< 0 u) (<= (+ U T S) (+ m t)) (< 0 s)) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m t 1)) (not (< 0 t))) (or (<= t 0) (< 0 u) (<= (+ m t) (+ U T S)) (< 0 s)) (or (<= t 0) (< 0 u) (<= 0 s))), 2089327#(and (or (not (<= s 1)) (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= u 0) (<= 0 s)) (or (<= 1 t) (not (< 0 u))) (or (<= t 0) (<= (+ m t) (+ U T S)) (< 0 s)) (or (<= s 1) (<= 1 t)) (or (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (<= s 1)) (not (< 0 t)))), 2089326#(and (or (<= 1 t) (not (< 0 s))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)) (not (<= s 0))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m t) (+ U T S)) (not (< 0 t)) (not (<= s 0)))), 2089318#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m t 1))) (or (< 0 u) (<= 1 s))), 2089320#(and (or (<= t 0) (<= 0 s)) (or (not (< 0 s)) (not (<= t 0))) (or (<= 1 s) (<= (+ U T S) (+ m t)) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u))) (or (<= 1 s) (<= (+ m t) (+ U T S)) (not (< 0 t)))), 2089316#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t))), 2089329#(and (or (< 0 u) (<= (+ U T S) (+ m u t 1)) (<= 2 s)) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ m t 1) (+ U T S)) (<= 2 s))), 2089331#(and (or (<= 2 s) (<= (+ U T S) (+ m u t)) (< 1 u)) (or (<= (+ m t 1) (+ U T S)) (<= 2 s) (< 1 u)) (or (<= 1 s) (< 1 u))), 2089332#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t))), 2089330#(and (or (< 1 u) (<= 0 s)) (or (<= (+ U T S 1) (+ m u t)) (<= 1 s) (< 1 u)) (or (<= 1 s) (<= (+ m t) (+ U T S)) (< 1 u))), 2089319#(and (or (< 0 u) (<= 1 s) (<= (+ U T S) (+ m t))) (or (< 0 u) (<= 1 s) (<= (+ m t) (+ U T S))) (or (< 0 u) (not (<= t 0))) (or (< 0 u) (<= 0 s))), 2089317#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 2 s)) (or (< 0 u) (<= 1 s))), 2089324#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 2089321#(and (or (< 0 u) (<= 1 s) (<= (+ m t) (+ U T S)) (not (< 0 t))) (or (< 0 u) (not (< 0 s)) (not (<= t 0))) (or (< 0 u) (<= 0 s) (not (< 0 t))) (or (< 0 u) (<= 1 s) (<= (+ U T S) (+ m t)) (not (< 0 t)))), 2089315#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 2089322#(and (or (< 0 u) (<= 1 s) (<= (+ U T S) (+ m u t))) (or (< 0 u) (<= 1 s) (<= (+ m t) (+ U T S))) (or (< 0 u) (<= 0 s)))] [2022-03-15 21:48:09,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:48:09,324 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:09,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:48:09,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=3223, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 21:48:09,324 INFO L87 Difference]: Start difference. First operand 28176 states and 103869 transitions. Second operand has 36 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:13,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:13,628 INFO L93 Difference]: Finished difference Result 49549 states and 179505 transitions. [2022-03-15 21:48:13,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-03-15 21:48:13,628 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have 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:48:13,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:13,794 INFO L225 Difference]: With dead ends: 49549 [2022-03-15 21:48:13,794 INFO L226 Difference]: Without dead ends: 49538 [2022-03-15 21:48:13,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4896 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=3014, Invalid=13498, Unknown=0, NotChecked=0, Total=16512 [2022-03-15 21:48:13,795 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 531 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:13,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [531 Valid, 0 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:48:13,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49538 states. [2022-03-15 21:48:14,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49538 to 28258. [2022-03-15 21:48:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28258 states, 28257 states have (on average 3.6851399653183283) internal successors, (104131), 28257 states have internal predecessors, (104131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28258 states to 28258 states and 104131 transitions. [2022-03-15 21:48:14,776 INFO L78 Accepts]: Start accepts. Automaton has 28258 states and 104131 transitions. Word has length 27 [2022-03-15 21:48:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:14,776 INFO L470 AbstractCegarLoop]: Abstraction has 28258 states and 104131 transitions. [2022-03-15 21:48:14,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 28258 states and 104131 transitions. [2022-03-15 21:48:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:48:14,984 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:14,984 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:15,003 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:48:15,199 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:48:15,199 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:15,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:15,200 INFO L85 PathProgramCache]: Analyzing trace with hash 598352161, now seen corresponding path program 72 times [2022-03-15 21:48:15,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:15,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077127416] [2022-03-15 21:48:15,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:15,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:15,492 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:15,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077127416] [2022-03-15 21:48:15,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077127416] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:15,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127629116] [2022-03-15 21:48:15,492 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:48:15,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:15,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:15,493 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:48:15,494 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:48:15,520 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 21:48:15,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:15,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:48:15,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:16,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:16,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127629116] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:16,993 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:16,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 39 [2022-03-15 21:48:16,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [807656904] [2022-03-15 21:48:16,993 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:16,995 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:17,001 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 107 transitions. [2022-03-15 21:48:17,001 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:18,736 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [2195731#(and (or (< 0 u) (not (<= s 0))) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 2 s))), 2195732#(and (or (< 0 u) (<= (+ U T S) (+ m u t 1)) (<= 2 s)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (<= t 0) (< 0 u))), 2195738#(and (or (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t 1)) (<= 2 s)) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ m t 1) (+ U T S)) (<= 2 s))), 2195739#(and (or (< 0 u) (<= (+ U T S) (+ m u t 1)) (<= 2 s)) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ m t 1) (+ U T S)) (<= 2 s))), 2195740#(and (or (<= 2 s) (<= (+ U T S) (+ m u t)) (< 1 u)) (or (<= (+ m t 1) (+ U T S)) (<= 2 s) (< 1 u)) (or (<= 1 s) (< 1 u))), 2195742#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 2195744#(and (or (not (<= s 1)) (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= u 0) (<= 0 s)) (or (<= 1 t) (not (< 0 u))) (or (<= t 0) (<= (+ m t) (+ U T S)) (< 0 s)) (or (<= s 1) (<= 1 t)) (or (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (<= s 1)) (not (< 0 t)))), 2195735#(and (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 2 s) (< 0 t)) (or (< 0 u) (not (<= s 0)) (< 0 t)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (< 0 t))), 2195741#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 2195736#(and (or (< 0 u) (<= (+ U T S) (+ m u t 1)) (<= 2 s) (< 0 t)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (< 0 t))), 2195737#(and (or (< 0 u) (<= 3 s) (<= (+ U T S) (+ 2 m u t))) (or (< 0 u) (<= 2 s)) (or (< 0 u) (<= (+ 2 m) (+ U T S)) (<= 3 s))), 2195745#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t))), 2195730#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 2195654#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 2195733#(and (or (< 0 u) (<= 3 s) (<= (+ U T S) (+ 2 m u t))) (or (< 0 u) (<= 2 s)) (or (< 0 u) (<= (+ 2 m) (+ U T S)) (<= 3 s)) (or (<= t 0) (< 0 u))), 2195734#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 2195743#(and (or (<= 1 t) (not (< 0 s))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)) (not (<= s 0))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m t) (+ U T S)) (not (< 0 t)) (not (<= s 0)))), 2195729#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u)))] [2022-03-15 21:48:18,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:48:18,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:18,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:48:18,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=2637, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 21:48:18,737 INFO L87 Difference]: Start difference. First operand 28258 states and 104131 transitions. Second operand has 35 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 34 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:48:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:21,606 INFO L93 Difference]: Finished difference Result 45819 states and 168193 transitions. [2022-03-15 21:48:21,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-15 21:48:21,606 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 34 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 27 [2022-03-15 21:48:21,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:21,744 INFO L225 Difference]: With dead ends: 45819 [2022-03-15 21:48:21,744 INFO L226 Difference]: Without dead ends: 45808 [2022-03-15 21:48:21,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3929 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2331, Invalid=8799, Unknown=0, NotChecked=0, Total=11130 [2022-03-15 21:48:21,745 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 407 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:21,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 0 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:48:21,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45808 states. [2022-03-15 21:48:22,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45808 to 28328. [2022-03-15 21:48:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28328 states, 28327 states have (on average 3.683305680093197) internal successors, (104337), 28327 states have internal predecessors, (104337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:22,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28328 states to 28328 states and 104337 transitions. [2022-03-15 21:48:22,746 INFO L78 Accepts]: Start accepts. Automaton has 28328 states and 104337 transitions. Word has length 27 [2022-03-15 21:48:22,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:22,746 INFO L470 AbstractCegarLoop]: Abstraction has 28328 states and 104337 transitions. [2022-03-15 21:48:22,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 34 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:48:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 28328 states and 104337 transitions. [2022-03-15 21:48:22,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:48:22,784 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:22,784 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:22,799 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:48:22,999 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:48:23,000 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:23,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:23,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2140098725, now seen corresponding path program 73 times [2022-03-15 21:48:23,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:23,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992458805] [2022-03-15 21:48:23,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:23,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:23,305 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:23,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992458805] [2022-03-15 21:48:23,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992458805] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:23,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047131651] [2022-03-15 21:48:23,305 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:48:23,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:23,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:23,306 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:48:23,307 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:48:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:23,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:48:23,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:23,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:28,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047131651] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:28,094 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:28,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2022-03-15 21:48:28,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1264899443] [2022-03-15 21:48:28,095 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:28,096 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:28,102 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 95 transitions. [2022-03-15 21:48:28,102 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:29,888 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [2298526#(and (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (<= 1 t) (not (< 0 u))) (or (<= s 1) (<= 1 t)) (or (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (< 0 t))) (or (<= (+ m t) (+ U T S)) (not (< 0 t))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 u)) (<= 0 s))), 2298518#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 2298516#(and (or (not (< 0 u)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 s)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (not (< 0 s))) (or (<= (+ m t) (+ U T S)) (not (< 0 t))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m s) (+ U T S)) (not (< 0 u)))), 2298527#(and (or (<= (+ m s) (+ U T S)) (<= (+ m 1) (+ U T S)) (< 1 u)) (or (<= (+ U T S) (+ m t s)) (< 1 u)) (or (<= m (+ U T S)) (< 1 u)) (or (<= 1 s) (< 1 u) (<= (+ U T S) (+ m s)))), 2298523#(and (or (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (< 1 u) (<= (+ U T S) (+ m s)) (< 0 t))), 2298517#(and (or (not (< 0 u)) (<= (+ U T S 1) (+ m u t s))) (or (<= u 0) (<= 0 s)) (or (<= s 1) (<= (+ m s) (+ U T S))) (or (<= s 1) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (< 0 t))) (or (<= (+ m t) (+ U T S)) (not (< 0 t))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (not (< 0 u)))), 2298520#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 2298525#(and (or (<= 1 t) (not (< 0 s))) (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (<= 1 t) (not (< 0 u))) (or (<= (+ m t) (+ U T S)) (not (< 0 t))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 u)) (<= 0 s))), 2298513#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 2298515#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 2298519#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 2298521#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= m (+ U T S)))), 2298524#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ U T S) (+ m t s))) (or (< 0 u) (<= m (+ U T S)))), 2298514#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 2298522#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t)))] [2022-03-15 21:48:29,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 21:48:29,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:29,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 21:48:29,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=2491, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 21:48:29,889 INFO L87 Difference]: Start difference. First operand 28328 states and 104337 transitions. Second operand has 30 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:31,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:31,379 INFO L93 Difference]: Finished difference Result 34859 states and 125619 transitions. [2022-03-15 21:48:31,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 21:48:31,379 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:48:31,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:31,490 INFO L225 Difference]: With dead ends: 34859 [2022-03-15 21:48:31,490 INFO L226 Difference]: Without dead ends: 34844 [2022-03-15 21:48:31,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1204, Invalid=5936, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 21:48:31,491 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 296 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:31,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 0 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:48:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34844 states. [2022-03-15 21:48:32,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34844 to 28338. [2022-03-15 21:48:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28338 states, 28337 states have (on average 3.6832057027914034) internal successors, (104371), 28337 states have internal predecessors, (104371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28338 states to 28338 states and 104371 transitions. [2022-03-15 21:48:32,286 INFO L78 Accepts]: Start accepts. Automaton has 28338 states and 104371 transitions. Word has length 27 [2022-03-15 21:48:32,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:32,287 INFO L470 AbstractCegarLoop]: Abstraction has 28338 states and 104371 transitions. [2022-03-15 21:48:32,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 28338 states and 104371 transitions. [2022-03-15 21:48:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:48:32,326 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:32,326 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:32,342 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:48:32,539 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:48:32,539 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:32,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:32,540 INFO L85 PathProgramCache]: Analyzing trace with hash -314582943, now seen corresponding path program 74 times [2022-03-15 21:48:32,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:32,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947574517] [2022-03-15 21:48:32,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:32,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:32,888 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:32,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947574517] [2022-03-15 21:48:32,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947574517] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:32,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180473545] [2022-03-15 21:48:32,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:48:32,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:32,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:32,890 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:48:32,890 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:48:32,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:48:32,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:32,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:48:32,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:33,619 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:33,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:36,486 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:36,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180473545] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:36,487 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:36,487 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 37 [2022-03-15 21:48:36,487 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1046909962] [2022-03-15 21:48:36,487 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:36,489 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:36,496 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 95 transitions. [2022-03-15 21:48:36,496 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:38,660 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [2390331#(and (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (<= u 0) (<= 0 s)) (or (<= 1 t) (not (< 0 u))) (or (<= t 0) (<= (+ m t) (+ U T S)) (< 0 s)) (or (<= s 1) (<= 1 t)) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (<= s 1)) (not (< 0 t)))), 2390330#(and (or (<= 1 t) (not (< 0 s))) (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (<= u 0) (<= 0 s)) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m t) (+ U T S)) (not (< 0 t)) (not (<= s 0)))), 2390322#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m t 1)) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s))), 2390321#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 2 s)) (or (< 0 u) (<= 1 s))), 2390318#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 2390326#(and (or (< 1 u) (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m 1) (+ U T S)) (not (< 0 u)) (< 1 u) (<= s 0)) (or (<= (+ m 1) (+ U T S)) (< 1 u) (not (< 0 t))) (or (not (< 0 u)) (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= 1 s) (<= (+ m t) (+ U T S)) (< 1 u) (not (< 0 t))) (or (<= 1 s) (<= (+ m t) (+ U T S)) (not (< 0 u)) (< 1 u))), 2390328#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 2390329#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 2390320#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 2390327#(and (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 2390244#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 2390325#(and (or (<= (+ m 1) (+ U T S)) (< 1 u) (<= s 0)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= 1 s) (<= (+ m t) (+ U T S)) (< 1 u))), 2390323#(and (or (< 0 u) (<= 1 s) (<= (+ U T S) (+ m t))) (or (< 0 u) (<= 1 s) (<= (+ m t) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (<= t 0))) (or (< 0 u) (not (<= t 0)) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 0 s))), 2390324#(and (or (< 0 u) (<= 1 s) (<= (+ m t) (+ U T S))) (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0)) (or (< 0 u) (<= (+ U T S) (+ m u t s)))), 2390319#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1))))] [2022-03-15 21:48:38,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:48:38,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:38,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:48:38,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=2271, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:48:38,661 INFO L87 Difference]: Start difference. First operand 28338 states and 104371 transitions. Second operand has 31 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:43,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:43,911 INFO L93 Difference]: Finished difference Result 44581 states and 163761 transitions. [2022-03-15 21:48:43,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-15 21:48:43,911 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:48:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:44,059 INFO L225 Difference]: With dead ends: 44581 [2022-03-15 21:48:44,059 INFO L226 Difference]: Without dead ends: 44566 [2022-03-15 21:48:44,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5967 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3058, Invalid=13972, Unknown=0, NotChecked=0, Total=17030 [2022-03-15 21:48:44,060 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 381 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:44,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 0 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:48:44,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44566 states. [2022-03-15 21:48:44,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44566 to 28337. [2022-03-15 21:48:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28337 states, 28336 states have (on average 3.683476849237719) internal successors, (104375), 28336 states have internal predecessors, (104375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28337 states to 28337 states and 104375 transitions. [2022-03-15 21:48:45,198 INFO L78 Accepts]: Start accepts. Automaton has 28337 states and 104375 transitions. Word has length 27 [2022-03-15 21:48:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:45,198 INFO L470 AbstractCegarLoop]: Abstraction has 28337 states and 104375 transitions. [2022-03-15 21:48:45,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 28337 states and 104375 transitions. [2022-03-15 21:48:45,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:48:45,236 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:45,236 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:45,253 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:48:45,443 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:48:45,443 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:45,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:45,444 INFO L85 PathProgramCache]: Analyzing trace with hash 181796899, now seen corresponding path program 75 times [2022-03-15 21:48:45,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:45,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090182782] [2022-03-15 21:48:45,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:45,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:45,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:45,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090182782] [2022-03-15 21:48:45,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090182782] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:45,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280182062] [2022-03-15 21:48:45,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:48:45,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:45,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:45,782 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:48:45,782 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:48:45,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 21:48:45,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:45,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:48:45,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:46,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:50,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280182062] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:50,634 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:50,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2022-03-15 21:48:50,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1718503002] [2022-03-15 21:48:50,635 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:50,636 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:50,642 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 87 transitions. [2022-03-15 21:48:50,642 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:52,380 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [2491935#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 2491938#(and (or (<= (+ U T S) m) (< 1 u) (< 0 s) (< 0 t)) (or (< m (+ U T S 1)) (< 1 u) (< 0 s) (< 0 t))), 2491939#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 2491942#(and (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (<= 2 s) (not (< 0 s)) (not (< 0 t))) (or (<= u 0) (<= 0 s)) (or (<= 1 t) (not (< 0 u))) (or (<= t 0) (<= (+ m t) (+ U T S)) (< 0 s)) (or (<= s 1) (<= 1 t)) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 2491934#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 2491941#(and (or (<= 1 t) (not (< 0 s))) (or (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (<= 1 t) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 u)) (<= 0 s)) (or (<= 1 s) (<= (+ m t) (+ U T S)) (not (< 0 t)))), 2491943#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 2491861#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 2491937#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 2491940#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 2491936#(and (or (< 0 u) (<= m (+ U T S)) (<= 2 s) (< 0 t)) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)) (< 0 t)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= 2 s) (< 0 t)))] [2022-03-15 21:48:52,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:48:52,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:52,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:48:52,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=1571, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:48:52,381 INFO L87 Difference]: Start difference. First operand 28337 states and 104375 transitions. Second operand has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 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:48:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:54,750 INFO L93 Difference]: Finished difference Result 47616 states and 169194 transitions. [2022-03-15 21:48:54,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 21:48:54,750 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 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 27 [2022-03-15 21:48:54,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:54,917 INFO L225 Difference]: With dead ends: 47616 [2022-03-15 21:48:54,917 INFO L226 Difference]: Without dead ends: 47601 [2022-03-15 21:48:54,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2514 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1522, Invalid=5450, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 21:48:54,918 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 250 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:54,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 0 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:48:54,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47601 states. [2022-03-15 21:48:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47601 to 28341. [2022-03-15 21:48:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28341 states, 28340 states have (on average 3.683380381086803) internal successors, (104387), 28340 states have internal predecessors, (104387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28341 states to 28341 states and 104387 transitions. [2022-03-15 21:48:55,924 INFO L78 Accepts]: Start accepts. Automaton has 28341 states and 104387 transitions. Word has length 27 [2022-03-15 21:48:55,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:55,924 INFO L470 AbstractCegarLoop]: Abstraction has 28341 states and 104387 transitions. [2022-03-15 21:48:55,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 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:48:55,925 INFO L276 IsEmpty]: Start isEmpty. Operand 28341 states and 104387 transitions. [2022-03-15 21:48:55,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:48:55,968 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:55,968 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:55,984 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:48:56,184 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:48:56,184 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:56,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:56,185 INFO L85 PathProgramCache]: Analyzing trace with hash -395592159, now seen corresponding path program 76 times [2022-03-15 21:48:56,186 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:56,186 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212261091] [2022-03-15 21:48:56,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:56,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:48:56,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:56,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212261091] [2022-03-15 21:48:56,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212261091] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:56,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815805486] [2022-03-15 21:48:56,485 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:48:56,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:56,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:56,486 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:48:56,487 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:48:56,510 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:48:56,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:56,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:48:56,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:57,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:48:58,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815805486] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:58,644 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:58,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 43 [2022-03-15 21:48:58,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [550902758] [2022-03-15 21:48:58,644 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:58,645 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:58,652 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 119 transitions. [2022-03-15 21:48:58,652 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:00,888 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [2596536#(and (<= u 0) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= s 1) (<= 1 t)) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 t)))), 2596538#(and (or (<= (+ 2 m t) (+ U T S)) (< 0 u)) (or (< 0 u) (<= (+ U T S) (+ m u t s)))), 2596540#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 2596531#(and (or (< 0 u) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 1 s))), 2596522#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 2596535#(and (or (<= (+ m t 1) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s)))), 2596528#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (<= t 0) (< 0 u))), 2596537#(and (or (< 0 u) (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= s 1) (< 0 u) (<= 1 t)) (or (<= (+ 2 m t) (+ U T S)) (< 0 u) (not (< 0 t)))), 2596523#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 2596541#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 2596532#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 1 t)) (or (< 0 u) (<= (+ m t 1) (+ U T S)))), 2596527#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 2596524#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 2596526#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 2596542#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u)))), 2596525#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 2596529#(and (or (< 0 u) (<= (+ U T S) (+ m u t s)) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t))), 2596534#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t 1) (+ U T S)))), 2596521#(and (or (<= 1 t) (not (< 0 s))) (<= u 0) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t)))), 2596533#(and (or (< 0 u) (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (< 0 u) (<= 1 t) (not (< 0 s)))), 2596530#(and (or (< 0 u) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (<= t 0) (< 0 u))), 2596539#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ 2 m t) (+ U T S)) (< 1 u)))] [2022-03-15 21:49:00,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 21:49:00,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:00,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 21:49:00,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=724, Invalid=3698, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 21:49:00,889 INFO L87 Difference]: Start difference. First operand 28341 states and 104387 transitions. Second operand has 38 states, 37 states have (on average 2.4864864864864864) internal successors, (92), 37 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:02,061 INFO L93 Difference]: Finished difference Result 30772 states and 112854 transitions. [2022-03-15 21:49:02,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 21:49:02,062 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.4864864864864864) internal successors, (92), 37 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:49:02,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:02,147 INFO L225 Difference]: With dead ends: 30772 [2022-03-15 21:49:02,148 INFO L226 Difference]: Without dead ends: 30761 [2022-03-15 21:49:02,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3036 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1275, Invalid=6035, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 21:49:02,149 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 253 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:02,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 0 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:49:02,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30761 states. [2022-03-15 21:49:02,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30761 to 28623. [2022-03-15 21:49:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28623 states, 28622 states have (on average 3.6821675634127593) internal successors, (105391), 28622 states have internal predecessors, (105391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28623 states to 28623 states and 105391 transitions. [2022-03-15 21:49:02,824 INFO L78 Accepts]: Start accepts. Automaton has 28623 states and 105391 transitions. Word has length 27 [2022-03-15 21:49:02,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:02,824 INFO L470 AbstractCegarLoop]: Abstraction has 28623 states and 105391 transitions. [2022-03-15 21:49:02,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.4864864864864864) internal successors, (92), 37 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:02,824 INFO L276 IsEmpty]: Start isEmpty. Operand 28623 states and 105391 transitions. [2022-03-15 21:49:02,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:49:02,864 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:02,864 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:02,880 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:49:03,066 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:49:03,066 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:49:03,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:03,068 INFO L85 PathProgramCache]: Analyzing trace with hash -519386979, now seen corresponding path program 77 times [2022-03-15 21:49:03,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:03,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990330655] [2022-03-15 21:49:03,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:03,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:03,262 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:03,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990330655] [2022-03-15 21:49:03,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990330655] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:03,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386892781] [2022-03-15 21:49:03,275 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:49:03,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:03,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:03,291 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:49:03,307 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:49:03,327 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 21:49:03,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:03,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 21:49:03,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:03,817 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:03,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:05,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386892781] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:05,582 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:05,582 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2022-03-15 21:49:05,582 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1980327767] [2022-03-15 21:49:05,583 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:05,584 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:05,590 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 117 transitions. [2022-03-15 21:49:05,590 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:07,373 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [2684815#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 2684817#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u)))), 2684801#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t))), 2684807#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)))), 2684800#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 2684804#(and (or (< 0 u) (<= (+ 2 m) (+ U T S)) (<= 3 s) (< 0 t)) (or (< 0 u) (<= 3 s) (<= (+ U T S) (+ m u t s)) (< 0 t))), 2684810#(and (or (< 0 u) (<= (+ 3 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (<= t 0) (< 0 u))), 2684805#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 2684803#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m u t s)) (< 0 t)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (< 0 t))), 2684816#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 2684809#(and (or (< 0 u) (<= 3 s) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ 2 m) (+ U T S)) (<= 3 s)) (or (<= t 0) (< 0 u))), 2684808#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (<= t 0) (< 0 u))), 2684802#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)) (< 0 t)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (< 0 t))), 2684806#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 2684813#(and (or (<= (+ 2 m t) (+ U T S)) (< 0 u)) (or (< 0 u) (<= (+ U T S) (+ m u t s)))), 2684812#(and (or (< 0 u) (< 0 t)) (or (<= (+ 2 m t) (+ U T S)) (< 0 u)) (or (< 0 u) (<= (+ U T S) (+ m u t s)))), 2684814#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ 2 m t) (+ U T S)) (< 1 u))), 2684811#(and (or (< 0 u) (<= (+ 3 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 3 s)))] [2022-03-15 21:49:07,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:49:07,373 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:07,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:49:07,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=729, Invalid=3177, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 21:49:07,374 INFO L87 Difference]: Start difference. First operand 28623 states and 105391 transitions. Second operand has 35 states, 34 states have (on average 2.5) internal successors, (85), 34 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:49:09,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:09,219 INFO L93 Difference]: Finished difference Result 45433 states and 166854 transitions. [2022-03-15 21:49:09,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 21:49:09,220 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5) internal successors, (85), 34 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 27 [2022-03-15 21:49:09,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:09,372 INFO L225 Difference]: With dead ends: 45433 [2022-03-15 21:49:09,373 INFO L226 Difference]: Without dead ends: 45422 [2022-03-15 21:49:09,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3626 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1988, Invalid=8112, Unknown=0, NotChecked=0, Total=10100 [2022-03-15 21:49:09,374 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 317 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:09,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 0 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:49:09,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45422 states. [2022-03-15 21:49:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45422 to 28779. [2022-03-15 21:49:10,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28779 states, 28778 states have (on average 3.6799986100493434) internal successors, (105903), 28778 states have internal predecessors, (105903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:10,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28779 states to 28779 states and 105903 transitions. [2022-03-15 21:49:10,455 INFO L78 Accepts]: Start accepts. Automaton has 28779 states and 105903 transitions. Word has length 27 [2022-03-15 21:49:10,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:10,455 INFO L470 AbstractCegarLoop]: Abstraction has 28779 states and 105903 transitions. [2022-03-15 21:49:10,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5) internal successors, (85), 34 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:49:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 28779 states and 105903 transitions. [2022-03-15 21:49:10,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:49:10,495 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:10,495 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:10,511 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:49:10,697 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:49:10,697 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:49:10,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:10,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1839539931, now seen corresponding path program 78 times [2022-03-15 21:49:10,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:10,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006789090] [2022-03-15 21:49:10,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:10,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:10,941 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:10,941 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:10,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006789090] [2022-03-15 21:49:10,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006789090] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:10,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29387519] [2022-03-15 21:49:10,941 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:49:10,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:10,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:10,943 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:49:10,944 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:49:10,971 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 21:49:10,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:10,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:49:10,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:11,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:12,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29387519] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:12,609 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:12,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 39 [2022-03-15 21:49:12,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [784882867] [2022-03-15 21:49:12,609 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:12,610 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:12,617 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 109 transitions. [2022-03-15 21:49:12,617 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:14,791 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [2788093#(and (or (< 0 u) (<= 3 s) (<= (+ U T S) (+ 2 m u t))) (or (< 0 u) (<= 2 s)) (or (< 0 u) (<= (+ 2 m) (+ U T S)) (<= 3 s))), 2788098#(and (or (<= (+ m t) (+ U T S)) (< 0 s)) (<= 1 t) (or (<= (+ U T S 1) (+ m u t s)) (< 0 s)) (<= 0 s)), 2788090#(and (or (< 0 u) (<= (+ U T S) (+ m u t 1)) (<= 2 s) (< 0 t)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (< 0 t))), 2788085#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 2788095#(and (or (< 0 u) (<= (+ U T S) (+ m u t 1)) (<= 2 s)) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ m t 1) (+ U T S)) (<= 2 s))), 2788097#(and (or (< 0 u) (<= (+ m t) (+ U T S)) (< 0 s)) (or (< 0 u) (<= 1 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (< 0 s))), 2788086#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 2788092#(and (or (< 0 u) (<= 3 s) (<= (+ U T S) (+ 2 m u t))) (or (< 0 u) (<= 2 s)) (or (< 0 u) (<= (+ 2 m) (+ U T S)) (<= 3 s)) (or (<= t 0) (< 0 u))), 2788094#(and (or (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t 1)) (<= 2 s)) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ m t 1) (+ U T S)) (<= 2 s))), 2788082#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 2788083#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 2788007#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 2788089#(and (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 2 s) (< 0 t)) (or (< 0 u) (not (<= s 0)) (< 0 t)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (< 0 t))), 2788087#(and (or (< 0 u) (not (<= s 0))) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 2 s))), 2788088#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 2788084#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t))), 2788099#(and (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)) (< 0 s)) (or (<= 1 t) (not (< 0 u))) (or (<= (+ m t) (+ U T S)) (not (< 0 t)) (< 0 s)) (or (not (< 0 u)) (<= 0 s))), 2788091#(and (or (< 0 u) (<= (+ U T S) (+ m u t 1)) (<= 2 s)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (<= t 0) (< 0 u))), 2788096#(and (or (< 1 s) (<= (+ U T S) (+ m u t s))) (or (<= (+ m t) (+ U T S)) (< 0 s)) (<= u 0) (<= 1 t) (or (<= (+ m t 1) (+ U T S)) (< 1 s) (not (< 0 s))))] [2022-03-15 21:49:14,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:49:14,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:14,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:49:14,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=716, Invalid=2706, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 21:49:14,792 INFO L87 Difference]: Start difference. First operand 28779 states and 105903 transitions. Second operand has 36 states, 35 states have (on average 2.3714285714285714) internal successors, (83), 35 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:49:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:17,187 INFO L93 Difference]: Finished difference Result 50251 states and 184219 transitions. [2022-03-15 21:49:17,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 21:49:17,187 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.3714285714285714) internal successors, (83), 35 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 27 [2022-03-15 21:49:17,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:17,469 INFO L225 Difference]: With dead ends: 50251 [2022-03-15 21:49:17,469 INFO L226 Difference]: Without dead ends: 50240 [2022-03-15 21:49:17,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4758 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2850, Invalid=10032, Unknown=0, NotChecked=0, Total=12882 [2022-03-15 21:49:17,470 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 385 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:17,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 0 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:49:17,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50240 states. [2022-03-15 21:49:18,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50240 to 28815. [2022-03-15 21:49:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28815 states, 28814 states have (on average 3.6797737211077948) internal successors, (106029), 28814 states have internal predecessors, (106029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28815 states to 28815 states and 106029 transitions. [2022-03-15 21:49:18,533 INFO L78 Accepts]: Start accepts. Automaton has 28815 states and 106029 transitions. Word has length 27 [2022-03-15 21:49:18,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:18,534 INFO L470 AbstractCegarLoop]: Abstraction has 28815 states and 106029 transitions. [2022-03-15 21:49:18,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.3714285714285714) internal successors, (83), 35 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:49:18,534 INFO L276 IsEmpty]: Start isEmpty. Operand 28815 states and 106029 transitions. [2022-03-15 21:49:18,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:49:18,574 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:18,574 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:18,591 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:49:18,789 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:49:18,789 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:49:18,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:18,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1178173503, now seen corresponding path program 79 times [2022-03-15 21:49:18,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:18,792 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585975482] [2022-03-15 21:49:18,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:18,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:19,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:19,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585975482] [2022-03-15 21:49:19,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585975482] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:19,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239372062] [2022-03-15 21:49:19,017 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:49:19,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:19,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:19,018 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:49:19,019 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:49:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:19,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:49:19,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:19,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:21,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239372062] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:21,570 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:21,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2022-03-15 21:49:21,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [339623399] [2022-03-15 21:49:21,570 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:21,595 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:21,602 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 119 transitions. [2022-03-15 21:49:21,602 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:24,171 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [2896295#(and (or (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (<= s 0))) (or (< 0 u) (<= (+ m t) (+ U T S)) (not (<= s 0)))), 2896304#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t 1) (+ U T S)))), 2896302#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 2896308#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t))), 2896309#(and (or (<= 2 s) (< 0 t)) (<= (+ m t 1) (+ U T S)) (<= 1 s) (<= (+ U T S) (+ m u t s)) (or (<= (+ 2 m t) (+ U T S)) (< 0 t))), 2896299#(and (<= (+ m t 1) (+ U T S)) (<= u 0) (<= (+ U T S) (+ m u t s)) (or (<= (+ 2 m t) (+ U T S)) (< 0 t))), 2896294#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m t 1))) (or (< 0 u) (<= 1 s))), 2896289#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 2896290#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t))), 2896307#(and (or (< 0 u) (<= s 2) (< 0 t)) (or (<= t 0) (< 0 u) (<= (+ m t 1) (+ U T S)) (< 1 s) (not (< 0 s))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t)) (not (<= s 2))) (or (<= t 0) (< 0 u) (<= (+ m t) (+ U T S)) (< 0 s)) (or (<= (+ 2 m t) (+ U T S)) (<= s 1) (<= t 0) (< 0 u) (< 2 s))), 2896303#(and (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (<= s 1)) (not (< 0 t))) (or (<= s 1) (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (<= s 1)) (not (< 0 t))) (or (<= t 0) (< 0 u) (<= (+ m t) (+ U T S)) (< 0 s))), 2896291#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 2896301#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 2896300#(and (or (<= t 0) (<= (+ m t) (+ U T S)) (< 0 s)) (or (<= (+ U T S) (+ m t s)) (not (<= s 1)) (not (< 0 t))) (or (not (< 0 u)) (< 0 t)) (or (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (<= s 1)) (not (< 0 t))) (or (<= s 1) (< 0 t))), 2896306#(and (or (<= t 0) (<= (+ m t) (+ U T S)) (< 0 s)) (or (<= (+ 2 m t) (+ U T S)) (<= s 1) (<= t 0) (< 2 s)) (or (not (< 0 u)) (< 0 t)) (or (<= s 2) (< 0 t)) (or (<= t 0) (<= (+ m t 1) (+ U T S)) (< 1 s) (not (< 0 s))) (or (<= (+ U T S) (+ m t s)) (not (< 0 t)) (not (<= s 2)))), 2896292#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 2896293#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 2 s)) (or (< 0 u) (<= 1 s))), 2896298#(and (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t)) (not (<= s 0))) (or (< 0 u) (<= (+ m t) (+ U T S)) (not (< 0 t)) (not (<= s 0))) (or (< 0 u) (not (< 0 s)) (< 0 t))), 2896296#(and (or (< 0 u) (<= (+ U T S) (+ m u t s)) (not (<= s 0))) (or (< 0 u) (<= (+ m t) (+ U T S)) (not (<= s 0)))), 2896297#(and (or (not (< 0 s)) (< 0 t)) (or (not (< 0 u)) (< 0 t)) (or (<= (+ U T S) (+ m t s)) (not (< 0 t)) (not (<= s 0))) (or (<= (+ m t) (+ U T S)) (not (< 0 t)) (not (<= s 0)))), 2896305#(and (or (<= (+ m t 1) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s))))] [2022-03-15 21:49:24,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 21:49:24,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:24,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 21:49:24,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=656, Invalid=3250, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 21:49:24,172 INFO L87 Difference]: Start difference. First operand 28815 states and 106029 transitions. Second operand has 37 states, 36 states have (on average 2.5) internal successors, (90), 36 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:28,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:28,653 INFO L93 Difference]: Finished difference Result 51184 states and 187882 transitions. [2022-03-15 21:49:28,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-03-15 21:49:28,653 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5) internal successors, (90), 36 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have 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:49:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:28,842 INFO L225 Difference]: With dead ends: 51184 [2022-03-15 21:49:28,842 INFO L226 Difference]: Without dead ends: 51173 [2022-03-15 21:49:28,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7530 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=4132, Invalid=16460, Unknown=0, NotChecked=0, Total=20592 [2022-03-15 21:49:28,844 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 374 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:28,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 0 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:49:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51173 states. [2022-03-15 21:49:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51173 to 28999. [2022-03-15 21:49:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28999 states, 28998 states have (on average 3.6786330091730464) internal successors, (106673), 28998 states have internal predecessors, (106673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28999 states to 28999 states and 106673 transitions. [2022-03-15 21:49:30,046 INFO L78 Accepts]: Start accepts. Automaton has 28999 states and 106673 transitions. Word has length 27 [2022-03-15 21:49:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:30,046 INFO L470 AbstractCegarLoop]: Abstraction has 28999 states and 106673 transitions. [2022-03-15 21:49:30,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5) internal successors, (90), 36 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 28999 states and 106673 transitions. [2022-03-15 21:49:30,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:49:30,088 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:30,088 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:30,113 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:49:30,302 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:49:30,302 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:49:30,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:30,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1687029285, now seen corresponding path program 80 times [2022-03-15 21:49:30,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:30,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708017383] [2022-03-15 21:49:30,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:30,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:30,507 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:30,507 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:30,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708017383] [2022-03-15 21:49:30,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708017383] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:30,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996355832] [2022-03-15 21:49:30,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:49:30,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:30,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:30,511 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:49:30,512 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:49:30,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:49:30,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:30,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:49:30,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:31,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:32,820 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:32,820 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996355832] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:32,820 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:32,821 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 37 [2022-03-15 21:49:32,821 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [925720440] [2022-03-15 21:49:32,821 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:32,822 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:32,828 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 101 transitions. [2022-03-15 21:49:32,828 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:34,518 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [3005860#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t))), 3005855#(and (or (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m t s))) (or (< 0 u) (<= (+ m t) (+ U T S)))), 3005857#(and (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (< 0 u) (not (< 0 s)) (< 0 t)) (or (< 0 u) (<= (+ m t) (+ U T S)) (not (< 0 t)))), 3005852#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 3005863#(and (or (<= s 1) (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (< 0 u) (<= (+ m t) (+ U T S)) (not (< 0 t)))), 3005853#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 3005858#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 3005864#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t) (+ U T S)))), 3005849#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 3005865#(and (or (<= (+ m t 1) (+ U T S)) (not (< 0 s))) (<= (+ m t) (+ U T S)) (<= (+ U T S) (+ m u t s)) (<= 0 s)), 3005859#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 3005854#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 3005861#(and (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (< 0 u)) (< 0 t)) (or (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (< 0 t))) (or (<= (+ m t) (+ U T S)) (not (< 0 t))) (or (<= s 1) (< 0 t))), 3005850#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 3005851#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 3005862#(and (<= u 0) (or (<= (+ m t 1) (+ U T S)) (not (< 0 s))) (<= (+ m t) (+ U T S)) (<= (+ U T S) (+ m u t s))), 3005856#(and (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (< 0 s)) (< 0 t)) (or (not (< 0 u)) (< 0 t)) (or (<= (+ m t) (+ U T S)) (not (< 0 t))))] [2022-03-15 21:49:34,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:49:34,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:34,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:49:34,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=2538, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 21:49:34,519 INFO L87 Difference]: Start difference. First operand 28999 states and 106673 transitions. Second operand has 33 states, 32 states have (on average 2.40625) internal successors, (77), 32 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:49:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:36,366 INFO L93 Difference]: Finished difference Result 33458 states and 122477 transitions. [2022-03-15 21:49:36,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 21:49:36,366 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.40625) internal successors, (77), 32 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 27 [2022-03-15 21:49:36,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:36,462 INFO L225 Difference]: With dead ends: 33458 [2022-03-15 21:49:36,463 INFO L226 Difference]: Without dead ends: 33438 [2022-03-15 21:49:36,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2426 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1430, Invalid=6052, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 21:49:36,464 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 353 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:36,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 0 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:49:36,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33438 states. [2022-03-15 21:49:37,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33438 to 29053. [2022-03-15 21:49:37,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29053 states, 29052 states have (on average 3.6773027674514664) internal successors, (106833), 29052 states have internal predecessors, (106833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:37,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29053 states to 29053 states and 106833 transitions. [2022-03-15 21:49:37,345 INFO L78 Accepts]: Start accepts. Automaton has 29053 states and 106833 transitions. Word has length 27 [2022-03-15 21:49:37,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:37,345 INFO L470 AbstractCegarLoop]: Abstraction has 29053 states and 106833 transitions. [2022-03-15 21:49:37,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.40625) internal successors, (77), 32 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:49:37,345 INFO L276 IsEmpty]: Start isEmpty. Operand 29053 states and 106833 transitions. [2022-03-15 21:49:37,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:49:37,385 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:37,385 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:37,400 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:49:37,598 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:49:37,598 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:49:37,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:37,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1801761189, now seen corresponding path program 81 times [2022-03-15 21:49:37,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:37,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800537625] [2022-03-15 21:49:37,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:37,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:37,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:37,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800537625] [2022-03-15 21:49:37,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800537625] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:37,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68214916] [2022-03-15 21:49:37,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:49:37,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:37,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:37,922 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:49:37,927 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:49:37,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 21:49:37,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:37,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:49:37,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:38,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:42,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68214916] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:42,681 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:42,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 34 [2022-03-15 21:49:42,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [38634706] [2022-03-15 21:49:42,681 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:42,682 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:42,688 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 95 transitions. [2022-03-15 21:49:42,688 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:44,570 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [3097611#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 3097693#(and (or (<= (+ U T S) m) (< 1 u) (< 0 s) (< 0 t)) (or (< m (+ U T S 1)) (< 1 u) (< 0 s) (< 0 t))), 3097696#(and (or (<= 2 s) (< 1 u) (<= (+ U T S) (+ m t 1)) (<= (+ U T S) (+ m s))) (or (<= 1 s) (<= m (+ U T S)) (< 1 u)) (or (<= 2 s) (<= (+ m 1) (+ U T S)) (< 1 u) (<= s 0)) (or (<= 1 s) (< 1 u) (<= (+ U T S) (+ m s)))), 3097687#(and (or (not (< 0 u)) (<= (+ U T S 1) (+ m u t s))) (or (<= u 0) (<= 0 s)) (or (<= t 0) (<= (+ m t) (+ U T S)) (< 0 s)) (or (<= s 1) (<= (+ m s) (+ U T S))) (or (<= s 1) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (<= s 1)) (not (< 0 t))) (or (<= (+ m s) (+ U T S)) (not (< 0 u)))), 3097690#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 3097691#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (<= s 0)) (or (< 0 u) (<= 1 s) (<= m (+ U T S)))), 3097688#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 3097695#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 3097686#(and (or (not (< 0 u)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 s)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (not (< 0 s))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m t) (+ U T S)) (not (< 0 t)) (not (<= s 0))) (or (<= (+ m s) (+ U T S)) (not (< 0 u)))), 3097692#(and (or (not (< 0 u)) (<= (+ U T S 1) (+ m u t s))) (or (<= s 2) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (<= s 2)) (or (<= u 0) (<= 0 s)) (or (<= t 0) (<= (+ m t) (+ U T S)) (< 0 s)) (or (<= (+ 2 m t) (+ U T S)) (<= s 1) (<= t 0) (< 2 s)) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= t 0) (<= (+ m t 1) (+ U T S)) (< 1 s) (not (< 0 s))) (or (<= (+ m s) (+ U T S)) (not (< 0 u)))), 3097694#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m t 1)) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= 1 s) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (<= s 0)) (or (< 0 u) (<= 1 s) (<= m (+ U T S)))), 3097684#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 3097689#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 3097685#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (<= (+ m 1) (+ U S)) (not (< 0 t))))] [2022-03-15 21:49:44,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 21:49:44,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:44,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 21:49:44,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1889, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 21:49:44,571 INFO L87 Difference]: Start difference. First operand 29053 states and 106833 transitions. Second operand has 29 states, 28 states have (on average 2.5) internal successors, (70), 28 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:47,590 INFO L93 Difference]: Finished difference Result 49414 states and 175066 transitions. [2022-03-15 21:49:47,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 21:49:47,591 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5) internal successors, (70), 28 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:49:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:47,748 INFO L225 Difference]: With dead ends: 49414 [2022-03-15 21:49:47,748 INFO L226 Difference]: Without dead ends: 49399 [2022-03-15 21:49:47,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3494 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1905, Invalid=7601, Unknown=0, NotChecked=0, Total=9506 [2022-03-15 21:49:47,749 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 447 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:47,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [447 Valid, 0 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:49:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49399 states. [2022-03-15 21:49:48,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49399 to 29062. [2022-03-15 21:49:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29062 states, 29061 states have (on average 3.677196242386704) internal successors, (106863), 29061 states have internal predecessors, (106863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29062 states to 29062 states and 106863 transitions. [2022-03-15 21:49:48,901 INFO L78 Accepts]: Start accepts. Automaton has 29062 states and 106863 transitions. Word has length 27 [2022-03-15 21:49:48,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:48,901 INFO L470 AbstractCegarLoop]: Abstraction has 29062 states and 106863 transitions. [2022-03-15 21:49:48,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5) internal successors, (70), 28 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:48,901 INFO L276 IsEmpty]: Start isEmpty. Operand 29062 states and 106863 transitions. [2022-03-15 21:49:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:49:48,940 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:48,940 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:48,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2022-03-15 21:49:49,156 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:49:49,156 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:49:49,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:49,157 INFO L85 PathProgramCache]: Analyzing trace with hash -652920479, now seen corresponding path program 82 times [2022-03-15 21:49:49,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:49,159 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707513182] [2022-03-15 21:49:49,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:49,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:49,375 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:49,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707513182] [2022-03-15 21:49:49,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707513182] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:49,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534478692] [2022-03-15 21:49:49,375 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:49:49,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:49,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:49,376 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:49:49,377 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:49:49,400 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:49:49,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:49,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:49:49,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:50,044 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:50,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:52,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534478692] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:52,544 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:52,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2022-03-15 21:49:52,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1137908001] [2022-03-15 21:49:52,544 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:52,545 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:52,551 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 95 transitions. [2022-03-15 21:49:52,552 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:49:54,184 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [3205536#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 3205537#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 3205535#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 3205533#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 3205544#(and (or (<= 2 s) (not (< 0 u))) (or (<= s 1) (<= (+ m s) (+ U T S))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 3205538#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 3205534#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 3205532#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 3205541#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u)) (or (<= (+ m t) (+ U T S)) (< 1 u))), 3205543#(and (or (not (< 0 s)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (not (< 0 s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 3205539#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m t s))) (or (< 0 u) (<= (+ m t) (+ U T S)))), 3205542#(and (or (< 1 u) (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u) (not (< 0 t))) (or (not (< 0 u)) (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m t) (+ U T S)) (< 1 u) (not (< 0 t))) (or (<= (+ m t) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (<= (+ m s) (+ U T S)) (not (< 0 u)) (< 1 u))), 3205545#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 3205546#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 3205540#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t) (+ U T S))))] [2022-03-15 21:49:54,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:49:54,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:49:54,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:49:54,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=2780, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 21:49:54,185 INFO L87 Difference]: Start difference. First operand 29062 states and 106863 transitions. Second operand has 31 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:55,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:49:55,394 INFO L93 Difference]: Finished difference Result 33618 states and 123283 transitions. [2022-03-15 21:49:55,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 21:49:55,395 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:49:55,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:49:55,592 INFO L225 Difference]: With dead ends: 33618 [2022-03-15 21:49:55,592 INFO L226 Difference]: Without dead ends: 33607 [2022-03-15 21:49:55,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2420 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1144, Invalid=5828, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 21:49:55,592 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 321 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:49:55,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 0 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:49:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33607 states. [2022-03-15 21:49:56,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33607 to 29060. [2022-03-15 21:49:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29060 states, 29059 states have (on average 3.6772428507519184) internal successors, (106857), 29059 states have internal predecessors, (106857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29060 states to 29060 states and 106857 transitions. [2022-03-15 21:49:56,261 INFO L78 Accepts]: Start accepts. Automaton has 29060 states and 106857 transitions. Word has length 27 [2022-03-15 21:49:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:49:56,261 INFO L470 AbstractCegarLoop]: Abstraction has 29060 states and 106857 transitions. [2022-03-15 21:49:56,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:49:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 29060 states and 106857 transitions. [2022-03-15 21:49:56,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:49:56,301 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:49:56,301 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:49:56,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Forceful destruction successful, exit code 0 [2022-03-15 21:49:56,511 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:49:56,511 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:49:56,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:49:56,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1445583597, now seen corresponding path program 83 times [2022-03-15 21:49:56,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:49:56,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434103697] [2022-03-15 21:49:56,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:49:56,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:49:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:49:56,767 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:56,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:49:56,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434103697] [2022-03-15 21:49:56,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434103697] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:49:56,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697704803] [2022-03-15 21:49:56,767 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:49:56,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:49:56,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:49:56,770 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:49:56,770 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:49:56,798 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 21:49:56,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:49:56,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:49:56,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:49:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:57,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:49:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:49:59,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697704803] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:49:59,663 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:49:59,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2022-03-15 21:49:59,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1770850035] [2022-03-15 21:49:59,664 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:49:59,665 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:49:59,672 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 102 transitions. [2022-03-15 21:49:59,672 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:01,531 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [3297548#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 3297539#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 3297538#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 3297545#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t) (+ U T S)))), 3297540#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 3297544#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ m 1) (+ U T S)))), 3297552#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 3297536#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 3297550#(and (or (<= 2 s) (not (< 0 u))) (or (<= s 1) (<= (+ m s) (+ U T S))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 3297546#(and (or (<= (+ m s) (+ U T S)) (<= (+ m 1) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s)))), 3297551#(and (or (< 1 u) (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u) (not (< 0 t))) (or (not (< 0 u)) (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m t) (+ U T S)) (< 1 u) (not (< 0 t))) (or (<= (+ m t) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (<= (+ m s) (+ U T S)) (not (< 0 u)) (< 1 u))), 3297542#(and (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 3297547#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u)) (or (<= (+ m t) (+ U T S)) (< 1 u))), 3297541#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 3297543#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ m 1) (+ U T S))) (or (<= t 0) (< 0 u))), 3297537#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 3297549#(and (or (not (< 0 s)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (not (< 0 s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))))] [2022-03-15 21:50:01,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:50:01,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:01,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:50:01,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=2977, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 21:50:01,532 INFO L87 Difference]: Start difference. First operand 29060 states and 106857 transitions. Second operand has 33 states, 32 states have (on average 2.40625) internal successors, (77), 32 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:50:03,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:03,052 INFO L93 Difference]: Finished difference Result 32024 states and 116575 transitions. [2022-03-15 21:50:03,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 21:50:03,052 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.40625) internal successors, (77), 32 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 27 [2022-03-15 21:50:03,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:03,143 INFO L225 Difference]: With dead ends: 32024 [2022-03-15 21:50:03,143 INFO L226 Difference]: Without dead ends: 32013 [2022-03-15 21:50:03,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2965 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1365, Invalid=6825, Unknown=0, NotChecked=0, Total=8190 [2022-03-15 21:50:03,145 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 301 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:03,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 0 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:50:03,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32013 states. [2022-03-15 21:50:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32013 to 29058. [2022-03-15 21:50:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29058 states, 29057 states have (on average 3.677289465533262) internal successors, (106851), 29057 states have internal predecessors, (106851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29058 states to 29058 states and 106851 transitions. [2022-03-15 21:50:03,839 INFO L78 Accepts]: Start accepts. Automaton has 29058 states and 106851 transitions. Word has length 27 [2022-03-15 21:50:03,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:03,840 INFO L470 AbstractCegarLoop]: Abstraction has 29058 states and 106851 transitions. [2022-03-15 21:50:03,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.40625) internal successors, (77), 32 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:50:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 29058 states and 106851 transitions. [2022-03-15 21:50:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:50:03,881 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:03,881 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:03,896 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:50:04,087 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:50:04,088 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:50:04,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:04,089 INFO L85 PathProgramCache]: Analyzing trace with hash -664656095, now seen corresponding path program 84 times [2022-03-15 21:50:04,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:04,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784278312] [2022-03-15 21:50:04,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:04,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:04,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:04,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784278312] [2022-03-15 21:50:04,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784278312] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:04,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225332040] [2022-03-15 21:50:04,379 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:50:04,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:04,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:04,381 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:50:04,382 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:50:04,403 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 21:50:04,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:04,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:50:04,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:04,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:06,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225332040] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:06,108 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:06,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 37 [2022-03-15 21:50:06,109 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1439682544] [2022-03-15 21:50:06,109 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:06,110 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:06,116 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 105 transitions. [2022-03-15 21:50:06,116 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:08,433 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [3387950#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 3387956#(and (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= s 0) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0) (< 0 t))), 3387954#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 3387963#(and (or (<= 2 s) (not (< 0 u))) (or (<= s 1) (<= (+ m s) (+ U T S))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 3387958#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= s 0)) (or (<= t 0) (< 0 u))), 3387960#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 3387964#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S)))), 3387951#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 3387962#(and (or (not (< 0 s)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (not (< 0 s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 3387961#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S))) (or (<= t 0) (< 0 u))), 3387955#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 3387965#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 3387966#(and (or (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s)))), 3387959#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s)) (<= s 0) (< 0 t)) (or (<= (+ m 1) (+ U T S)) (< 1 u) (<= s 0) (< 0 t))), 3387953#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 3387952#(and (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 3387957#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S))))] [2022-03-15 21:50:08,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:50:08,433 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:08,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:50:08,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=2538, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 21:50:08,434 INFO L87 Difference]: Start difference. First operand 29058 states and 106851 transitions. Second operand has 33 states, 32 states have (on average 2.46875) internal successors, (79), 32 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:50:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:10,298 INFO L93 Difference]: Finished difference Result 32588 states and 117200 transitions. [2022-03-15 21:50:10,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 21:50:10,299 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 32 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:50:10,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:10,384 INFO L225 Difference]: With dead ends: 32588 [2022-03-15 21:50:10,384 INFO L226 Difference]: Without dead ends: 32573 [2022-03-15 21:50:10,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2630 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1471, Invalid=6011, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 21:50:10,385 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 375 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:10,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 0 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:50:10,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32573 states. [2022-03-15 21:50:10,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32573 to 29088. [2022-03-15 21:50:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29088 states, 29087 states have (on average 3.677003472341596) internal successors, (106953), 29087 states have internal predecessors, (106953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29088 states to 29088 states and 106953 transitions. [2022-03-15 21:50:11,119 INFO L78 Accepts]: Start accepts. Automaton has 29088 states and 106953 transitions. Word has length 27 [2022-03-15 21:50:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:11,119 INFO L470 AbstractCegarLoop]: Abstraction has 29088 states and 106953 transitions. [2022-03-15 21:50:11,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 32 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:50:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 29088 states and 106953 transitions. [2022-03-15 21:50:11,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:50:11,158 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:11,158 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:11,174 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:50:11,373 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:50:11,373 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:50:11,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:11,375 INFO L85 PathProgramCache]: Analyzing trace with hash -156540637, now seen corresponding path program 85 times [2022-03-15 21:50:11,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:11,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100995428] [2022-03-15 21:50:11,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:11,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:11,808 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:11,808 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:11,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100995428] [2022-03-15 21:50:11,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100995428] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:11,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120196312] [2022-03-15 21:50:11,809 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:50:11,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:11,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:11,810 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:50:11,811 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:50:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:11,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:50:11,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:12,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:17,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120196312] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:17,057 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:17,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2022-03-15 21:50:17,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [288731844] [2022-03-15 21:50:17,057 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:17,058 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:17,064 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 87 transitions. [2022-03-15 21:50:17,064 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:18,727 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [3478991#(and (or (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (< 1 u) (<= (+ U T S) (+ m s)) (< 0 t))), 3478988#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 3478994#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 3478989#(and (or (< 0 u) (<= m (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 3478986#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 3478987#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 3478996#(and (or (<= 2 s) (not (< 0 u))) (or (<= s 1) (<= (+ m s) (+ U T S))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 3478995#(and (or (not (< 0 s)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (not (< 0 s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 3478990#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 3478992#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 3478993#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t))))] [2022-03-15 21:50:18,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:50:18,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:18,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:50:18,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=1829, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 21:50:18,728 INFO L87 Difference]: Start difference. First operand 29088 states and 106953 transitions. Second operand has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 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:50:20,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:20,095 INFO L93 Difference]: Finished difference Result 34081 states and 121589 transitions. [2022-03-15 21:50:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 21:50:20,095 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 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 27 [2022-03-15 21:50:20,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:20,190 INFO L225 Difference]: With dead ends: 34081 [2022-03-15 21:50:20,190 INFO L226 Difference]: Without dead ends: 34066 [2022-03-15 21:50:20,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1717 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=971, Invalid=3999, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 21:50:20,191 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 202 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:20,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 0 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:50:20,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34066 states. [2022-03-15 21:50:20,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34066 to 29086. [2022-03-15 21:50:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29086 states, 29085 states have (on average 3.677050025786488) internal successors, (106947), 29085 states have internal predecessors, (106947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29086 states to 29086 states and 106947 transitions. [2022-03-15 21:50:20,886 INFO L78 Accepts]: Start accepts. Automaton has 29086 states and 106947 transitions. Word has length 27 [2022-03-15 21:50:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:20,887 INFO L470 AbstractCegarLoop]: Abstraction has 29086 states and 106947 transitions. [2022-03-15 21:50:20,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 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:50:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 29086 states and 106947 transitions. [2022-03-15 21:50:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:50:20,926 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:20,926 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:20,943 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:50:21,134 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:50:21,134 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:50:21,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:21,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1664957923, now seen corresponding path program 86 times [2022-03-15 21:50:21,135 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:21,135 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351256689] [2022-03-15 21:50:21,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:21,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:21,422 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:21,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351256689] [2022-03-15 21:50:21,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351256689] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:21,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006693934] [2022-03-15 21:50:21,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:50:21,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:21,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:21,424 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:50:21,424 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:50:21,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:50:21,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:21,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:50:21,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:22,216 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:22,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:25,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006693934] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:25,201 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:25,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 37 [2022-03-15 21:50:25,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1339910770] [2022-03-15 21:50:25,202 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:25,203 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:25,209 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 95 transitions. [2022-03-15 21:50:25,209 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:27,397 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [3571501#(and (or (<= (+ m t 1) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u))), 3571498#(and (or (< 0 u) (<= 1 s) (<= (+ m t) (+ U T S))) (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 3571494#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 3571493#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 3571496#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 3571500#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t 1) (+ U T S)))), 3571417#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 3571503#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 3571499#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t) (+ U T S)))), 3571497#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m t s))) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s))), 3571502#(and (or (< 1 u) (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u) (not (< 0 t))) (or (not (< 0 u)) (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (<= (+ m s) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (<= (+ m t 1) (+ U T S)) (< 1 u) (not (< 0 t)))), 3571495#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)))), 3571491#(and (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 3571492#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t))))] [2022-03-15 21:50:27,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 21:50:27,397 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:27,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 21:50:27,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=2136, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 21:50:27,398 INFO L87 Difference]: Start difference. First operand 29086 states and 106947 transitions. Second operand has 30 states, 29 states have (on average 2.413793103448276) internal successors, (70), 29 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:30,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:30,177 INFO L93 Difference]: Finished difference Result 44428 states and 163581 transitions. [2022-03-15 21:50:30,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 21:50:30,177 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.413793103448276) internal successors, (70), 29 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:50:30,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:30,325 INFO L225 Difference]: With dead ends: 44428 [2022-03-15 21:50:30,326 INFO L226 Difference]: Without dead ends: 44417 [2022-03-15 21:50:30,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3644 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2103, Invalid=9027, Unknown=0, NotChecked=0, Total=11130 [2022-03-15 21:50:30,327 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 295 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:30,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 0 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:50:30,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44417 states. [2022-03-15 21:50:31,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44417 to 29084. [2022-03-15 21:50:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29084 states, 29083 states have (on average 3.6770965856342195) internal successors, (106941), 29083 states have internal predecessors, (106941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29084 states to 29084 states and 106941 transitions. [2022-03-15 21:50:31,473 INFO L78 Accepts]: Start accepts. Automaton has 29084 states and 106941 transitions. Word has length 27 [2022-03-15 21:50:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:31,473 INFO L470 AbstractCegarLoop]: Abstraction has 29084 states and 106941 transitions. [2022-03-15 21:50:31,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.413793103448276) internal successors, (70), 29 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 29084 states and 106941 transitions. [2022-03-15 21:50:31,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:50:31,513 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:31,513 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:31,528 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:50:31,728 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:50:31,728 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:50:31,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:31,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1837346255, now seen corresponding path program 87 times [2022-03-15 21:50:31,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:31,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881196657] [2022-03-15 21:50:31,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:31,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:32,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:32,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881196657] [2022-03-15 21:50:32,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881196657] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:32,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776372150] [2022-03-15 21:50:32,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:50:32,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:32,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:32,036 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:50:32,037 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:50:32,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 21:50:32,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:32,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:50:32,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:32,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:35,068 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:35,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776372150] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:35,069 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:35,069 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 37 [2022-03-15 21:50:35,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1119740364] [2022-03-15 21:50:35,069 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:35,070 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:35,076 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 100 transitions. [2022-03-15 21:50:35,076 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:37,314 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [3674416#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 3674407#(and (or (< 0 u) (not (<= s 0))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= 2 s)) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)))), 3674415#(and (or (< 1 u) (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u) (not (< 0 t))) (or (not (< 0 u)) (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m t 1) (+ U T S)) (<= 2 s) (< 1 u) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (<= 2 s) (not (< 0 u)) (< 1 u)) (or (<= (+ m s) (+ U T S)) (not (< 0 u)) (< 1 u))), 3674414#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u)) (or (<= (+ m t 1) (+ U T S)) (<= 2 s) (< 1 u))), 3674403#(and (or (<= (+ m 1) (+ U S)) (not (< 0 t)) (not (<= s 0))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 3674404#(and (or (<= t 0) (<= (+ m 1) (+ U S)) (< 0 s)) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 s)) (not (<= s 1)) (not (< 0 t)) (<= (+ 2 m) (+ U S)))), 3674405#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 3674413#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t 1) (+ U T S)) (<= 2 s))), 3674408#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= 2 s)) (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= (+ U T S) (+ m u t 1)) (<= 2 s)) (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (<= t 0) (< 0 u))), 3674411#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= 2 s)) (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= (+ U T S) (+ m u t 1)) (<= 2 s)) (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= 2 s) (<= (+ m 1) (+ U T S)))), 3674329#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 3674410#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)) (< 0 t)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= 2 s) (< 0 t)) (or (< 0 u) (not (<= s 0)) (< 0 t))), 3674409#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 3674406#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 3674412#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= 1 s) (<= (+ m t) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))))] [2022-03-15 21:50:37,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:50:37,314 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:37,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:50:37,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=2233, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:50:37,315 INFO L87 Difference]: Start difference. First operand 29084 states and 106941 transitions. Second operand has 31 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:40,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:40,507 INFO L93 Difference]: Finished difference Result 44716 states and 164623 transitions. [2022-03-15 21:50:40,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-15 21:50:40,507 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:50:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:40,643 INFO L225 Difference]: With dead ends: 44716 [2022-03-15 21:50:40,643 INFO L226 Difference]: Without dead ends: 44705 [2022-03-15 21:50:40,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4002 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2255, Invalid=9517, Unknown=0, NotChecked=0, Total=11772 [2022-03-15 21:50:40,645 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 273 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:40,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 0 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:50:40,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44705 states. [2022-03-15 21:50:41,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44705 to 29082. [2022-03-15 21:50:41,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29082 states, 29081 states have (on average 3.6771431518861113) internal successors, (106935), 29081 states have internal predecessors, (106935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29082 states to 29082 states and 106935 transitions. [2022-03-15 21:50:41,514 INFO L78 Accepts]: Start accepts. Automaton has 29082 states and 106935 transitions. Word has length 27 [2022-03-15 21:50:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:41,514 INFO L470 AbstractCegarLoop]: Abstraction has 29082 states and 106935 transitions. [2022-03-15 21:50:41,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 29082 states and 106935 transitions. [2022-03-15 21:50:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:50:41,553 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:41,553 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:41,568 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:50:41,759 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:50:41,759 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:50:41,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:41,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1676693539, now seen corresponding path program 88 times [2022-03-15 21:50:41,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:41,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84142589] [2022-03-15 21:50:41,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:41,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:42,041 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:42,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84142589] [2022-03-15 21:50:42,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84142589] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:42,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602371516] [2022-03-15 21:50:42,042 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:50:42,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:42,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:42,043 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:50:42,044 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:50:42,072 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:50:42,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:42,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:50:42,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:42,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:45,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602371516] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:45,083 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:45,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2022-03-15 21:50:45,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [589401898] [2022-03-15 21:50:45,083 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:45,084 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:45,090 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 105 transitions. [2022-03-15 21:50:45,090 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:47,024 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [3777618#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ U T S) (+ m u s))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S))) (or (<= t 0) (< 0 u))), 3777612#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 3777610#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 3777613#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 3777621#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 3777616#(and (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= s 0)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ U T S) (+ m u t s)) (<= s 0)) (or (<= t 0) (< 0 u))), 3777620#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t 1) (+ U T S)))), 3777623#(and (or (< 1 u) (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u) (not (< 0 t))) (or (not (< 0 u)) (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (<= (+ m s) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (<= (+ m t 1) (+ U T S)) (< 1 u) (not (< 0 t)))), 3777609#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 3777615#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 3777622#(and (or (<= (+ m t 1) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u))), 3777608#(and (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 3777614#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 3777619#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= (+ 2 m) (+ U T S)))), 3777611#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 3777617#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ U T S) (+ m u t s)) (<= s 0) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= s 0) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0) (< 0 t)))] [2022-03-15 21:50:47,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:50:47,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:47,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:50:47,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=544, Invalid=2878, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 21:50:47,025 INFO L87 Difference]: Start difference. First operand 29082 states and 106935 transitions. Second operand has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 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:50:48,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:48,569 INFO L93 Difference]: Finished difference Result 31006 states and 113403 transitions. [2022-03-15 21:50:48,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 21:50:48,569 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 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 27 [2022-03-15 21:50:48,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:48,649 INFO L225 Difference]: With dead ends: 31006 [2022-03-15 21:50:48,650 INFO L226 Difference]: Without dead ends: 30995 [2022-03-15 21:50:48,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2653 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1228, Invalid=6082, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 21:50:48,650 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 188 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:48,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 0 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:50:48,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30995 states. [2022-03-15 21:50:49,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30995 to 29106. [2022-03-15 21:50:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29106 states, 29105 states have (on average 3.676997079539598) internal successors, (107019), 29105 states have internal predecessors, (107019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 107019 transitions. [2022-03-15 21:50:49,247 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 107019 transitions. Word has length 27 [2022-03-15 21:50:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:49,247 INFO L470 AbstractCegarLoop]: Abstraction has 29106 states and 107019 transitions. [2022-03-15 21:50:49,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 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:50:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 107019 transitions. [2022-03-15 21:50:49,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:50:49,286 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:49,286 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:49,304 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:50:49,501 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:50:49,501 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:50:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:49,502 INFO L85 PathProgramCache]: Analyzing trace with hash -69718627, now seen corresponding path program 89 times [2022-03-15 21:50:49,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:49,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556251420] [2022-03-15 21:50:49,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:49,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:49,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:49,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556251420] [2022-03-15 21:50:49,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556251420] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:49,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065186401] [2022-03-15 21:50:49,765 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:50:49,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:49,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:49,768 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:50:49,768 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:50:49,791 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 21:50:49,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:49,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 21:50:49,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:50,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:50:52,548 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:52,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065186401] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:50:52,549 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:50:52,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 42 [2022-03-15 21:50:52,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1232718805] [2022-03-15 21:50:52,549 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:50:52,550 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:50:52,557 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 115 transitions. [2022-03-15 21:50:52,557 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:50:55,131 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [3867105#(and (or (< 0 u) (< 0 s) (< 0 t)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (< 0 t))), 3867100#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 3867104#(and (or (< 0 u) (<= (+ s 1) 0) (<= (+ U T S) (+ m u t s)) (< 0 t)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ s 1) 0) (<= (+ m 1) (+ U T S)) (< 0 t))), 3867102#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 3867113#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ 3 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s)))), 3867099#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 3867097#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 3867103#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 3867106#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S)) (<= s 0) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= s 0) (< 0 t))), 3867112#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 3867109#(and (or (< 0 u) (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m s) (+ U T S)) (not (< 0 s)) (<= (+ 2 m) (+ U T S))) (or (<= t 0) (< 0 u))), 3867110#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ 3 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (<= t 0) (< 0 u))), 3867114#(and (or (<= (+ m s) (+ U T S)) (<= (+ 3 m) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s)))), 3867096#(and (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 3867111#(and (or (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S)) (< 1 u) (<= s 0) (< 0 t)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s)) (<= s 0) (< 0 t))), 3867107#(and (or (< 0 u) (<= (+ s 1) 0) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ s 1) 0) (<= (+ m 1) (+ U T S))) (or (<= t 0) (< 0 u))), 3867108#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (< 0 s)) (or (<= t 0) (< 0 u))), 3867101#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 3867098#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u)))] [2022-03-15 21:50:55,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:50:55,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:50:55,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:50:55,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=659, Invalid=3247, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 21:50:55,132 INFO L87 Difference]: Start difference. First operand 29106 states and 107019 transitions. Second operand has 36 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 35 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:50:56,990 INFO L93 Difference]: Finished difference Result 32347 states and 116431 transitions. [2022-03-15 21:50:56,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 21:50:56,990 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 35 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:50:56,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:50:57,080 INFO L225 Difference]: With dead ends: 32347 [2022-03-15 21:50:57,080 INFO L226 Difference]: Without dead ends: 32332 [2022-03-15 21:50:57,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3464 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1613, Invalid=7317, Unknown=0, NotChecked=0, Total=8930 [2022-03-15 21:50:57,080 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 381 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:50:57,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 0 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:50:57,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32332 states. [2022-03-15 21:50:57,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32332 to 29164. [2022-03-15 21:50:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29164 states, 29163 states have (on average 3.6761992936254844) internal successors, (107209), 29163 states have internal predecessors, (107209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29164 states to 29164 states and 107209 transitions. [2022-03-15 21:50:57,775 INFO L78 Accepts]: Start accepts. Automaton has 29164 states and 107209 transitions. Word has length 27 [2022-03-15 21:50:57,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:50:57,775 INFO L470 AbstractCegarLoop]: Abstraction has 29164 states and 107209 transitions. [2022-03-15 21:50:57,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 35 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:50:57,775 INFO L276 IsEmpty]: Start isEmpty. Operand 29164 states and 107209 transitions. [2022-03-15 21:50:57,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:50:57,815 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:50:57,815 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:50:57,832 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:50:58,031 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:50:58,032 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:50:58,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:50:58,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1397035233, now seen corresponding path program 90 times [2022-03-15 21:50:58,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:50:58,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342024131] [2022-03-15 21:50:58,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:50:58,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:50:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:50:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:58,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:50:58,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342024131] [2022-03-15 21:50:58,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342024131] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:50:58,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617237695] [2022-03-15 21:50:58,276 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:50:58,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:50:58,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:50:58,285 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:50:58,286 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:50:58,314 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 21:50:58,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:50:58,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:50:58,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:50:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:50:59,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:00,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617237695] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:00,462 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:00,462 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2022-03-15 21:51:00,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [192251977] [2022-03-15 21:51:00,462 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:00,463 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:00,469 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 97 transitions. [2022-03-15 21:51:00,469 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:02,291 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [3958056#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u s))) (or (<= t 0) (< 0 u))), 3958055#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 3958058#(and (or (<= (+ m s) (+ U T S)) (< 1 u) (<= (+ U T S 1) (+ m u t s)) (< 0 t)) (or (<= (+ m s) (+ U T S)) (<= (+ m 1) (+ U T S)) (< 1 u) (< 0 t)) (or (<= (+ U T S 1) (+ m u s)) (< 1 u) (< 0 t))), 3958051#(and (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 3958060#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 3958052#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 3958059#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S)) (< 0 t)) (or (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ U T S) (+ m u t s)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u s)) (< 0 t))), 3958057#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ U T S) (+ m u t s)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u s)) (< 0 t))), 3958053#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 3958050#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 3958049#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 3958048#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 3958054#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s))))] [2022-03-15 21:51:02,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:51:02,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:02,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:51:02,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=2050, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:51:02,292 INFO L87 Difference]: Start difference. First operand 29164 states and 107209 transitions. Second operand has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:03,706 INFO L93 Difference]: Finished difference Result 32272 states and 116225 transitions. [2022-03-15 21:51:03,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 21:51:03,707 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:51:03,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:03,802 INFO L225 Difference]: With dead ends: 32272 [2022-03-15 21:51:03,802 INFO L226 Difference]: Without dead ends: 32257 [2022-03-15 21:51:03,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1778 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1148, Invalid=4254, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 21:51:03,803 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 206 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:03,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 0 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:51:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32257 states. [2022-03-15 21:51:04,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32257 to 29170. [2022-03-15 21:51:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29170 states, 29169 states have (on average 3.6760602008982137) internal successors, (107227), 29169 states have internal predecessors, (107227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29170 states to 29170 states and 107227 transitions. [2022-03-15 21:51:04,491 INFO L78 Accepts]: Start accepts. Automaton has 29170 states and 107227 transitions. Word has length 27 [2022-03-15 21:51:04,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:04,492 INFO L470 AbstractCegarLoop]: Abstraction has 29170 states and 107227 transitions. [2022-03-15 21:51:04,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:04,492 INFO L276 IsEmpty]: Start isEmpty. Operand 29170 states and 107227 transitions. [2022-03-15 21:51:04,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:51:04,531 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:04,531 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:04,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Forceful destruction successful, exit code 0 [2022-03-15 21:51:04,747 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:51:04,747 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:04,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:04,747 INFO L85 PathProgramCache]: Analyzing trace with hash -362479069, now seen corresponding path program 91 times [2022-03-15 21:51:04,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:04,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720707808] [2022-03-15 21:51:04,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:04,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:04,964 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:04,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720707808] [2022-03-15 21:51:04,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720707808] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:04,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092930697] [2022-03-15 21:51:04,964 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:51:04,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:04,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:04,965 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:51:04,968 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:51:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:04,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:51:04,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:05,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:09,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092930697] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:09,912 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:09,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2022-03-15 21:51:09,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [842421767] [2022-03-15 21:51:09,912 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:09,913 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:09,918 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 83 transitions. [2022-03-15 21:51:09,919 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:11,263 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [4048916#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 4048918#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 4048915#(and (or (< 0 u) (<= m (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 4048914#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 4048913#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 4048919#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 4048920#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 4048912#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 4048917#(and (or (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (< 1 u) (<= (+ U T S) (+ m s)) (< 0 t)))] [2022-03-15 21:51:11,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:51:11,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:11,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:51:11,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=1664, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:51:11,263 INFO L87 Difference]: Start difference. First operand 29170 states and 107227 transitions. Second operand has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:12,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:12,324 INFO L93 Difference]: Finished difference Result 34229 states and 122068 transitions. [2022-03-15 21:51:12,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 21:51:12,324 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:51:12,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:12,418 INFO L225 Difference]: With dead ends: 34229 [2022-03-15 21:51:12,418 INFO L226 Difference]: Without dead ends: 34214 [2022-03-15 21:51:12,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1426 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=937, Invalid=3619, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 21:51:12,419 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:12,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:51:12,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34214 states. [2022-03-15 21:51:13,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34214 to 29160. [2022-03-15 21:51:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29160 states, 29159 states have (on average 3.6762920539113138) internal successors, (107197), 29159 states have internal predecessors, (107197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29160 states to 29160 states and 107197 transitions. [2022-03-15 21:51:13,244 INFO L78 Accepts]: Start accepts. Automaton has 29160 states and 107197 transitions. Word has length 27 [2022-03-15 21:51:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:13,245 INFO L470 AbstractCegarLoop]: Abstraction has 29160 states and 107197 transitions. [2022-03-15 21:51:13,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:13,245 INFO L276 IsEmpty]: Start isEmpty. Operand 29160 states and 107197 transitions. [2022-03-15 21:51:13,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:51:13,284 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:13,284 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:13,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2022-03-15 21:51:13,499 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:51:13,500 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:13,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:13,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1400490203, now seen corresponding path program 92 times [2022-03-15 21:51:13,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:13,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643959102] [2022-03-15 21:51:13,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:13,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:13,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:13,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643959102] [2022-03-15 21:51:13,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643959102] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:13,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157490652] [2022-03-15 21:51:13,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:51:13,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:13,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:13,694 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:51:13,695 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:51:13,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:51:13,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:13,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:51:13,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:14,363 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:14,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:15,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157490652] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:15,782 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:15,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 37 [2022-03-15 21:51:15,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [132806041] [2022-03-15 21:51:15,782 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:15,783 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:15,790 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 123 transitions. [2022-03-15 21:51:15,790 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:18,291 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [4141726#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t 1) (+ U T S)))), 4141728#(and (or (<= (+ m t 1) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s)))), 4141719#(and (or (not (< 0 s)) (<= 0 t)) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 s))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (not (< 0 u)) (<= 0 t))), 4141709#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 4141724#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t))), 4141711#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 4141727#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m t) (+ U T S)) (< 1 u))), 4141722#(and (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (< 0 u)) (< 0 t)) (or (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (< 0 t))) (or (<= (+ m t) (+ U T S)) (not (< 0 t))) (or (<= s 1) (< 0 t))), 4141725#(and (or (<= s 1) (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (< 0 t))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (< 0 u) (<= (+ m t) (+ U T S)) (not (< 0 t)))), 4141712#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 4141710#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 4141713#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 4141717#(and (or (< 0 u) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (< 0 u) (not (< 0 s)) (< 0 t)) (or (< 0 u) (<= (+ m t) (+ U T S)) (not (< 0 t)))), 4141716#(and (or (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (< 0 s)) (< 0 t)) (or (not (< 0 u)) (< 0 t)) (or (<= (+ m t) (+ U T S)) (not (< 0 t)))), 4141714#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 4141718#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t) (+ U T S)))), 4141721#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 4141715#(and (or (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m t s))) (or (< 0 u) (<= (+ m t) (+ U T S)))), 4141723#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 4141720#(and (or (<= (+ 2 m t) (+ U T S)) (<= s 1)) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 s)) (not (< 0 u))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= (+ U T S) (+ m u t s))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 s)) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (not (< 0 u)) (<= 0 t)) (or (<= s 1) (<= 0 t)))] [2022-03-15 21:51:18,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:51:18,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:18,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:51:18,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=2822, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 21:51:18,293 INFO L87 Difference]: Start difference. First operand 29160 states and 107197 transitions. Second operand has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 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:51:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:20,014 INFO L93 Difference]: Finished difference Result 40702 states and 149830 transitions. [2022-03-15 21:51:20,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 21:51:20,015 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 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 27 [2022-03-15 21:51:20,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:20,129 INFO L225 Difference]: With dead ends: 40702 [2022-03-15 21:51:20,129 INFO L226 Difference]: Without dead ends: 40691 [2022-03-15 21:51:20,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2729 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1582, Invalid=6790, Unknown=0, NotChecked=0, Total=8372 [2022-03-15 21:51:20,130 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 383 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:20,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 0 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:51:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40691 states. [2022-03-15 21:51:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40691 to 30074. [2022-03-15 21:51:20,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30074 states, 30073 states have (on average 3.6870614837229407) internal successors, (110881), 30073 states have internal predecessors, (110881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30074 states to 30074 states and 110881 transitions. [2022-03-15 21:51:21,037 INFO L78 Accepts]: Start accepts. Automaton has 30074 states and 110881 transitions. Word has length 27 [2022-03-15 21:51:21,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:21,037 INFO L470 AbstractCegarLoop]: Abstraction has 30074 states and 110881 transitions. [2022-03-15 21:51:21,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 35 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:51:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 30074 states and 110881 transitions. [2022-03-15 21:51:21,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:51:21,079 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:21,079 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:21,096 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:51:21,291 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:51:21,292 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:21,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:21,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1306998761, now seen corresponding path program 93 times [2022-03-15 21:51:21,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:21,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028944925] [2022-03-15 21:51:21,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:21,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:21,542 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:21,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028944925] [2022-03-15 21:51:21,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028944925] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:21,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381174057] [2022-03-15 21:51:21,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:51:21,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:21,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:21,544 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:51:21,545 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:51:21,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 21:51:21,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:21,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:51:21,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:22,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:23,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381174057] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:23,137 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:23,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 38 [2022-03-15 21:51:23,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [191821991] [2022-03-15 21:51:23,138 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:23,246 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:23,253 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 121 transitions. [2022-03-15 21:51:23,253 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:25,510 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [4242852#(and (or (< 0 u) (<= (+ 2 m) (+ U T S)) (<= 3 s) (< 0 t)) (or (< 0 u) (<= 2 s) (< 0 t)) (or (< 0 u) (<= 3 s) (<= (+ U T S) (+ 2 m u t)) (< 0 t))), 4242845#(and (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 2 s) (< 0 t)) (or (< 0 u) (not (<= s 0)) (< 0 t)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (< 0 t))), 4242842#(and (or (not (< 0 s)) (<= 0 t)) (or (<= 1 s) (<= (+ U T S) (+ m u t)) (not (< 0 u))) (or (<= (+ m t 1) (+ U T S)) (<= 1 s) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (<= 1 s) (not (< 0 u))) (or (<= 1 s) (<= (+ U T S) (+ m u t)) (not (< 0 t))) (or (not (< 0 u)) (<= 0 s)) (or (not (< 0 u)) (<= 0 t))), 4242846#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 4242853#(and (or (< 0 u) (<= (+ 2 m) (+ U T S)) (<= 3 s) (< 0 t)) (or (< 0 u) (< 1 t) (<= 2 s) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (<= 1 s) (< 1 t)) (or (< 0 u) (<= 3 s) (<= (+ U T S) (+ 2 m u t)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t 1)) (< 1 t) (<= 2 s))), 4242854#(and (or (< 0 u) (<= (+ U T S) (+ m u t 1)) (< 1 t) (<= 2 s) (not (< 0 t))) (or (< 0 u) (<= 1 s) (< 1 t) (not (< 0 t))) (or (< 0 u) (< 1 t) (<= 2 s) (<= (+ 2 m) (+ U T S)) (not (< 0 t)))), 4242766#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 4242841#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 4242856#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 s)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 4242844#(and (or (<= (+ m 1) (+ U S)) (not (< 0 t)) (not (<= s 0))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ U S) (+ m u s)) (not (< 0 t)) (not (<= s 0))) (or (not (< 0 u)) (<= 0 s))), 4242850#(and (or (<= t 0) (<= (+ m 1) (+ U S)) (< 0 s)) (or (<= s 1) (= T t)) (or (<= (+ U S) (+ m u s)) (not (<= s 1)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (<= u 0) (<= 0 s)) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (not (< 0 s)) (not (<= s 1)) (not (< 0 t)) (<= (+ 2 m) (+ U S)))), 4242847#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 4242849#(and (or (< 0 u) (<= (+ U T S) (+ m u t 1)) (<= 2 s)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (<= t 0) (< 0 u))), 4242855#(and (or (< 0 u) (< 2 t) (<= 1 s) (<= t 1) (<= (+ U T S) (+ m u t))) (or (< 0 u) (< 2 t) (<= t 1) (<= 0 s)) (or (< 0 u) (< 2 t) (<= 1 s) (<= (+ 2 m) (+ U T S)) (<= t 1))), 4242857#(and (<= 1 s) (or (<= (+ m t 1) (+ U T S)) (<= 2 s)) (or (<= 2 s) (<= (+ U T S) (+ m u t)))), 4242848#(and (or (< 0 u) (not (<= s 0))) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 2 s))), 4242843#(and (or (<= (+ 2 m t) (+ U T S)) (<= 2 s) (not (< 0 s)) (not (< 0 t))) (or (<= u 0) (<= (+ U T S) (+ m u t)) (< 0 s)) (or (<= (+ m t 1) (+ U T S)) (<= u 0) (< 0 s)) (or (<= u 0) (<= 0 s)) (or (<= (+ 2 m t) (+ U T S)) (<= 2 s) (not (< 0 s)) (not (< 0 u))) (or (<= (+ U T S) (+ m u t 1)) (<= 2 s) (not (< 0 u))) (or (<= (+ U T S) (+ m u t 1)) (<= 2 s) (not (< 0 t))) (or (<= t 0) (<= (+ U T S) (+ m u t)) (< 0 s)) (or (<= t 0) (<= (+ m t 1) (+ U T S)) (< 0 s)) (or (not (< 0 u)) (<= 0 t)) (or (<= s 1) (<= 0 t))), 4242851#(and (or (< 0 u) (<= (+ U T S) (+ m u t 1)) (<= 2 s) (< 0 t)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (< 0 t)))] [2022-03-15 21:51:25,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 21:51:25,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:25,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 21:51:25,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2528, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 21:51:25,511 INFO L87 Difference]: Start difference. First operand 30074 states and 110881 transitions. Second operand has 34 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 33 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:51:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:30,217 INFO L93 Difference]: Finished difference Result 53333 states and 192793 transitions. [2022-03-15 21:51:30,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-15 21:51:30,218 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 33 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 27 [2022-03-15 21:51:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:30,410 INFO L225 Difference]: With dead ends: 53333 [2022-03-15 21:51:30,410 INFO L226 Difference]: Without dead ends: 53322 [2022-03-15 21:51:30,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 38 SyntacticMatches, 15 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6917 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=4223, Invalid=13333, Unknown=0, NotChecked=0, Total=17556 [2022-03-15 21:51:30,412 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 504 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 386 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:30,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [504 Valid, 0 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [386 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:51:30,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53322 states. [2022-03-15 21:51:31,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53322 to 37655. [2022-03-15 21:51:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37655 states, 37654 states have (on average 3.6875763531098955) internal successors, (138852), 37654 states have internal predecessors, (138852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37655 states to 37655 states and 138852 transitions. [2022-03-15 21:51:31,583 INFO L78 Accepts]: Start accepts. Automaton has 37655 states and 138852 transitions. Word has length 27 [2022-03-15 21:51:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:31,584 INFO L470 AbstractCegarLoop]: Abstraction has 37655 states and 138852 transitions. [2022-03-15 21:51:31,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 33 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:51:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 37655 states and 138852 transitions. [2022-03-15 21:51:31,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:51:31,641 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:31,641 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:31,657 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:51:31,855 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:51:31,855 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:31,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:31,856 INFO L85 PathProgramCache]: Analyzing trace with hash -922558427, now seen corresponding path program 94 times [2022-03-15 21:51:31,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:31,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784696016] [2022-03-15 21:51:31,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:31,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:32,108 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:32,108 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:32,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784696016] [2022-03-15 21:51:32,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784696016] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:32,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274384234] [2022-03-15 21:51:32,108 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:51:32,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:32,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:32,111 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:51:32,112 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:51:32,132 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:51:32,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:32,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:51:32,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:33,055 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:33,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:37,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274384234] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:37,161 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:37,161 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-03-15 21:51:37,161 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1286417874] [2022-03-15 21:51:37,161 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:37,163 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:37,169 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 109 transitions. [2022-03-15 21:51:37,169 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:39,160 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [4371854#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 4371860#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m t s))) (or (< 0 u) (<= m (+ U T S)))), 4371848#(and (or (not (< 0 s)) (<= (+ m s 1) (+ U T S))) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (not (< 0 u)) (<= 0 t))), 4371851#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 4371858#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t))), 4371850#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 4371852#(and (or (not (< 0 u)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 s)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (not (< 0 s))) (or (<= (+ m t) (+ U T S)) (not (< 0 t))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m s) (+ U T S)) (not (< 0 u)))), 4371849#(and (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 s)) (not (< 0 u))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= u 0) (<= 0 s)) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= (+ U T S) (+ m u t s))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 s)) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 u))) (or (<= s 1) (<= (+ m s 1) (+ U T S))) (or (not (< 0 u)) (<= 0 t))), 4371855#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 4371856#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 4371861#(and (or (<= (+ m s) (+ U T S)) (<= (+ m 1) (+ U T S)) (< 1 u)) (or (<= (+ U T S) (+ m t s)) (< 1 u)) (or (<= m (+ U T S)) (< 1 u))), 4371862#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 4371859#(and (or (<= 1 s) (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (<= 1 s) (< 1 u) (< 0 t))), 4371857#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= m (+ U T S)))), 4371853#(and (or (not (< 0 u)) (<= (+ U T S 1) (+ m u t s))) (or (<= s 1) (<= (+ m s) (+ U T S))) (or (<= s 1) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (< 0 t))) (or (<= (+ m t) (+ U T S)) (not (< 0 t))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m s) (+ U T S)) (not (< 0 u))))] [2022-03-15 21:51:39,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 21:51:39,161 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:39,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 21:51:39,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=2377, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 21:51:39,161 INFO L87 Difference]: Start difference. First operand 37655 states and 138852 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:41,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:41,377 INFO L93 Difference]: Finished difference Result 57207 states and 205831 transitions. [2022-03-15 21:51:41,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 21:51:41,378 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:51:41,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:41,576 INFO L225 Difference]: With dead ends: 57207 [2022-03-15 21:51:41,576 INFO L226 Difference]: Without dead ends: 57192 [2022-03-15 21:51:41,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3715 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1690, Invalid=8210, Unknown=0, NotChecked=0, Total=9900 [2022-03-15 21:51:41,577 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 381 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:41,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 0 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:51:41,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57192 states. [2022-03-15 21:51:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57192 to 37669. [2022-03-15 21:51:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37669 states, 37668 states have (on average 3.687373898269088) internal successors, (138896), 37668 states have internal predecessors, (138896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37669 states to 37669 states and 138896 transitions. [2022-03-15 21:51:42,870 INFO L78 Accepts]: Start accepts. Automaton has 37669 states and 138896 transitions. Word has length 27 [2022-03-15 21:51:42,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:42,870 INFO L470 AbstractCegarLoop]: Abstraction has 37669 states and 138896 transitions. [2022-03-15 21:51:42,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 37669 states and 138896 transitions. [2022-03-15 21:51:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:51:42,926 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:42,926 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:42,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2022-03-15 21:51:43,139 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:51:43,139 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:43,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash 917727201, now seen corresponding path program 95 times [2022-03-15 21:51:43,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:43,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770272511] [2022-03-15 21:51:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:43,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:43,355 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:43,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:43,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770272511] [2022-03-15 21:51:43,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770272511] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:43,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878216734] [2022-03-15 21:51:43,355 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:51:43,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:43,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:43,356 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:51:43,357 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:51:43,379 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 21:51:43,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:43,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:51:43,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:44,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:46,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878216734] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:46,889 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:46,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2022-03-15 21:51:46,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [901272552] [2022-03-15 21:51:46,889 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:46,890 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:46,896 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 109 transitions. [2022-03-15 21:51:46,896 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:49,064 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [4504698#(and (or (not (< 0 s)) (<= (+ m s 1) (+ U T S))) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (not (< 0 u)) (<= 0 t))), 4504699#(and (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 s)) (not (< 0 u))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= u 0) (<= 0 s)) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= (+ U T S) (+ m u t s))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 s)) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 u))) (or (<= s 1) (<= (+ m s 1) (+ U T S))) (or (not (< 0 u)) (<= 0 t))), 4504704#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t))), 4504712#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 4504703#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 4504706#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)))), 4504708#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t) (+ U T S)))), 4504710#(and (or (< 1 u) (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u) (not (< 0 t))) (or (not (< 0 u)) (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m t) (+ U T S)) (< 1 u) (not (< 0 t))) (or (<= (+ m t) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (<= (+ m s) (+ U T S)) (not (< 0 u)) (< 1 u))), 4504711#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 4504709#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u)) (or (<= (+ m t) (+ U T S)) (< 1 u))), 4504702#(and (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 4504705#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 4504701#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 4504700#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 4504707#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m t s))) (or (< 0 u) (<= (+ m t) (+ U T S))))] [2022-03-15 21:51:49,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:51:49,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:49,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:51:49,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=2671, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 21:51:49,064 INFO L87 Difference]: Start difference. First operand 37669 states and 138896 transitions. Second operand has 31 states, 30 states have (on average 2.5) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:51,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:51:51,087 INFO L93 Difference]: Finished difference Result 51991 states and 192654 transitions. [2022-03-15 21:51:51,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 21:51:51,088 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.5) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:51:51,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:51:51,379 INFO L225 Difference]: With dead ends: 51991 [2022-03-15 21:51:51,380 INFO L226 Difference]: Without dead ends: 51980 [2022-03-15 21:51:51,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3357 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1573, Invalid=7933, Unknown=0, NotChecked=0, Total=9506 [2022-03-15 21:51:51,380 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 292 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:51:51,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 0 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:51:51,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51980 states. [2022-03-15 21:51:52,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51980 to 37669. [2022-03-15 21:51:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37669 states, 37668 states have (on average 3.687453541467559) internal successors, (138899), 37668 states have internal predecessors, (138899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:52,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37669 states to 37669 states and 138899 transitions. [2022-03-15 21:51:52,458 INFO L78 Accepts]: Start accepts. Automaton has 37669 states and 138899 transitions. Word has length 27 [2022-03-15 21:51:52,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:51:52,458 INFO L470 AbstractCegarLoop]: Abstraction has 37669 states and 138899 transitions. [2022-03-15 21:51:52,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.5) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:51:52,458 INFO L276 IsEmpty]: Start isEmpty. Operand 37669 states and 138899 transitions. [2022-03-15 21:51:52,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:51:52,513 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:51:52,513 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:51:52,528 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:51:52,718 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:51:52,718 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:51:52,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:51:52,719 INFO L85 PathProgramCache]: Analyzing trace with hash 125064083, now seen corresponding path program 96 times [2022-03-15 21:51:52,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:51:52,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117231942] [2022-03-15 21:51:52,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:51:52,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:51:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:51:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:52,975 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:51:52,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117231942] [2022-03-15 21:51:52,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117231942] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:51:52,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438391962] [2022-03-15 21:51:52,975 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:51:52,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:51:52,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:51:52,977 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:51:52,978 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:51:53,000 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-03-15 21:51:53,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:51:53,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:51:53,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:51:53,759 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:53,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:51:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:51:55,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438391962] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:51:55,413 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:51:55,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 37 [2022-03-15 21:51:55,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1091845238] [2022-03-15 21:51:55,413 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:51:55,414 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:51:55,422 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 116 transitions. [2022-03-15 21:51:55,422 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:51:58,330 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [4632323#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 4632325#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)))), 4632326#(and (or (<= (+ m 1) (+ U S)) (not (< 0 t)) (not (<= s 0))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 4632331#(and (or (<= 2 s) (<= (+ m 1) (+ U T S)) (< 1 u) (<= s 0)) (or (<= (+ U T S 1) (+ m u s)) (<= 2 s) (<= (+ U T S) (+ m u t)) (< 1 u) (<= s 0))), 4632329#(and (or (< 0 u) (<= 1 s) (<= (+ m t) (+ U T S))) (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0)) (or (< 0 u) (<= (+ U T S) (+ m u t)) (<= (+ U T S) (+ m u t s)))), 4632322#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 4632333#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 4632245#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 4632334#(and (or (<= (+ U T S 1) (+ m u t)) (< 1 u) (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m 1) (+ U T S)) (not (< 0 u)) (< 1 u) (<= s 0)) (or (<= (+ m 1) (+ U T S)) (< 1 u) (not (< 0 t))) (or (<= (+ U T S 1) (+ m u t)) (not (< 0 u)) (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= 1 s) (<= (+ m t) (+ U T S)) (< 1 u) (not (< 0 t))) (or (<= 1 s) (<= (+ m t) (+ U T S)) (not (< 0 u)) (< 1 u))), 4632321#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 4632324#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)) (< 0 t)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (< 0 t))), 4632319#(and (or (not (< 0 s)) (<= 0 t)) (or (<= 1 s) (<= (+ U T S) (+ m u t)) (not (< 0 u))) (or (<= (+ m t 1) (+ U T S)) (<= 1 s) (not (< 0 t))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S))) (or (<= (+ m t 1) (+ U T S)) (<= (+ 2 m) (+ U T S)) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (not (< 0 u)) (<= 0 t))), 4632327#(and (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= 2 s) (<= s 0)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (<= s 0)) (or (<= t 0) (< 0 u))), 4632320#(and (or (<= (+ 2 m t) (+ U T S)) (<= 2 s) (not (< 0 s)) (not (< 0 t))) (or (<= u 0) (<= (+ U T S) (+ m u t)) (< 0 s)) (or (<= (+ m t 1) (+ U T S)) (not (< 0 u)) (< 0 s)) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 s)) (not (< 0 u)) (<= (+ 3 m) (+ U T S))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= u 0) (<= 0 s)) (or (<= s 1) (<= (+ U T S) (+ m u t s))) (or (<= s 1) (<= (+ 3 m) (+ U T S))) (or (<= (+ U T S) (+ m u t 1)) (<= 2 s) (not (< 0 u))) (or (<= t 0) (<= (+ m t 1) (+ U T S)) (< 0 s)) (or (not (< 0 u)) (<= 0 t)) (or (<= s 1) (<= 0 t))), 4632328#(and (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= (+ U T S) (+ m u t 1)) (<= 2 s) (<= s 0)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (<= s 0))), 4632332#(and (or (<= (+ U T S 1) (+ m u t)) (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m 1) (+ U T S)) (< 1 u) (<= s 0)) (or (<= 1 s) (<= (+ m t) (+ U T S)) (< 1 u))), 4632330#(and (or (<= t 0) (<= (+ m 1) (+ U S)) (< 0 s)) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 s)) (not (<= s 1)) (not (< 0 t)) (<= (+ 2 m) (+ U S))))] [2022-03-15 21:51:58,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:51:58,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:51:58,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:51:58,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=2471, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 21:51:58,331 INFO L87 Difference]: Start difference. First operand 37669 states and 138899 transitions. Second operand has 33 states, 32 states have (on average 2.53125) internal successors, (81), 32 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:52:03,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:03,385 INFO L93 Difference]: Finished difference Result 62649 states and 229110 transitions. [2022-03-15 21:52:03,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-03-15 21:52:03,385 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.53125) internal successors, (81), 32 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 27 [2022-03-15 21:52:03,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:03,613 INFO L225 Difference]: With dead ends: 62649 [2022-03-15 21:52:03,614 INFO L226 Difference]: Without dead ends: 62634 [2022-03-15 21:52:03,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6828 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=3723, Invalid=16017, Unknown=0, NotChecked=0, Total=19740 [2022-03-15 21:52:03,615 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 395 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:03,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 0 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:52:03,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62634 states. [2022-03-15 21:52:04,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62634 to 37689. [2022-03-15 21:52:04,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37689 states, 37688 states have (on average 3.6870887285077476) internal successors, (138959), 37688 states have internal predecessors, (138959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37689 states to 37689 states and 138959 transitions. [2022-03-15 21:52:05,290 INFO L78 Accepts]: Start accepts. Automaton has 37689 states and 138959 transitions. Word has length 27 [2022-03-15 21:52:05,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:05,290 INFO L470 AbstractCegarLoop]: Abstraction has 37689 states and 138959 transitions. [2022-03-15 21:52:05,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.53125) internal successors, (81), 32 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:52:05,290 INFO L276 IsEmpty]: Start isEmpty. Operand 37689 states and 138959 transitions. [2022-03-15 21:52:05,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:52:05,350 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:05,351 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:05,366 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:52:05,563 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:52:05,563 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:05,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:05,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1414107043, now seen corresponding path program 97 times [2022-03-15 21:52:05,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:05,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94963556] [2022-03-15 21:52:05,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:05,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:05,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:05,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94963556] [2022-03-15 21:52:05,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94963556] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:05,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289107669] [2022-03-15 21:52:05,921 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:52:05,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:05,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:05,922 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:52:05,923 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:52:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:05,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:52:05,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:06,869 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:06,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:10,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289107669] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:10,849 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:10,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2022-03-15 21:52:10,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2104467444] [2022-03-15 21:52:10,850 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:10,851 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:10,856 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 101 transitions. [2022-03-15 21:52:10,857 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:13,316 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [4770730#(and (or (not (< 0 s)) (<= 0 t)) (or (<= 1 s) (<= (+ U T S) (+ m u t)) (not (< 0 u))) (or (<= (+ m t 1) (+ U T S)) (<= 1 s) (not (< 0 t))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S))) (or (<= (+ m t 1) (+ U T S)) (<= (+ 2 m) (+ U T S)) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (not (< 0 u)) (<= 0 t))), 4770732#(and (or (<= (+ m 1) (+ U S)) (not (< 0 t)) (not (<= s 0))) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 4770728#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 4770662#(or (and (<= (+ U T S) m) (<= m (+ U T S)) (<= s 0)) (< 0 u) (<= 2 s) (and (<= 1 s) (<= (+ U T S) (+ m 1)) (<= (+ m 1) (+ U T S))) (< 0 t)), 4770731#(and (or (<= (+ 2 m t) (+ U T S)) (<= 2 s) (not (< 0 s)) (not (< 0 t))) (or (<= u 0) (<= (+ U T S) (+ m u t)) (< 0 s)) (or (<= (+ m t 1) (+ U T S)) (not (< 0 u)) (< 0 s)) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 s)) (not (< 0 u)) (<= (+ 3 m) (+ U T S))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= u 0) (<= 0 s)) (or (<= s 1) (<= (+ U T S) (+ m u t s))) (or (<= s 1) (<= (+ 3 m) (+ U T S))) (or (<= (+ U T S) (+ m u t 1)) (<= 2 s) (not (< 0 u))) (or (<= t 0) (<= (+ m t 1) (+ U T S)) (< 0 s)) (or (not (< 0 u)) (<= 0 t)) (or (<= s 1) (<= 0 t))), 4770726#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 4770725#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 4770733#(and (or (<= t 0) (<= (+ m 1) (+ U S)) (< 0 s)) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (not (< 0 s)) (not (<= s 1)) (not (< 0 t)) (<= (+ 2 m) (+ U S)))), 4770729#(and (or (<= 1 s) (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (<= 1 s) (< 1 u) (< 0 t))), 4770734#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 4770727#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t)))] [2022-03-15 21:52:13,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:52:13,316 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:13,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:52:13,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=1588, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 21:52:13,316 INFO L87 Difference]: Start difference. First operand 37689 states and 138959 transitions. Second operand has 25 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 24 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:16,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:16,011 INFO L93 Difference]: Finished difference Result 66888 states and 236757 transitions. [2022-03-15 21:52:16,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 21:52:16,011 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 24 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:52:16,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:16,217 INFO L225 Difference]: With dead ends: 66888 [2022-03-15 21:52:16,217 INFO L226 Difference]: Without dead ends: 66873 [2022-03-15 21:52:16,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 40 SyntacticMatches, 14 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3254 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1775, Invalid=6597, Unknown=0, NotChecked=0, Total=8372 [2022-03-15 21:52:16,218 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 296 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:16,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 0 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:52:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66873 states. [2022-03-15 21:52:17,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66873 to 37713. [2022-03-15 21:52:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37713 states, 37712 states have (on average 3.6866514637250742) internal successors, (139031), 37712 states have internal predecessors, (139031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:17,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37713 states to 37713 states and 139031 transitions. [2022-03-15 21:52:17,769 INFO L78 Accepts]: Start accepts. Automaton has 37713 states and 139031 transitions. Word has length 27 [2022-03-15 21:52:17,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:17,769 INFO L470 AbstractCegarLoop]: Abstraction has 37713 states and 139031 transitions. [2022-03-15 21:52:17,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 24 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:17,769 INFO L276 IsEmpty]: Start isEmpty. Operand 37713 states and 139031 transitions. [2022-03-15 21:52:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:52:17,864 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:17,864 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:17,882 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:52:18,079 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:52:18,079 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:18,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:18,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1571434405, now seen corresponding path program 98 times [2022-03-15 21:52:18,082 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:18,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239342924] [2022-03-15 21:52:18,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:18,318 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:18,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239342924] [2022-03-15 21:52:18,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239342924] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:18,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381153181] [2022-03-15 21:52:18,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:52:18,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:18,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:18,320 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:52:18,321 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:52:18,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:52:18,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:18,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:52:18,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:19,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:22,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381153181] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:22,530 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:22,530 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 34 [2022-03-15 21:52:22,530 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [643566430] [2022-03-15 21:52:22,530 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:22,531 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:22,538 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 123 transitions. [2022-03-15 21:52:22,538 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:24,872 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [4913335#(and (or (not (< 0 s)) (<= 0 t)) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (not (< 0 s)) (<= (+ m 1) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 0 t))), 4913339#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 4913349#(and (or (<= (+ U T S) (+ m t s)) (< 1 u) (<= (+ U T S) (+ m s))) (or (<= (+ m 1) (+ U T S)) (< 1 u)) (or (<= 1 s) (< 1 u))), 4913346#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 4913344#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 4913342#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 4913345#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 4913336#(and (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= s 1) (<= (+ 2 m) (+ U T S))) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m 1) (+ U T S)) (not (< 0 u))) (or (<= s 1) (<= (+ U T S) (+ m u t s))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 u))) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 0 t)) (or (<= s 1) (<= 0 t))), 4913347#(and (or (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (< 1 u) (<= (+ U T S) (+ m s)) (< 0 t))), 4913348#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= 1 s))), 4913343#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 4913337#(and (or (not (< 0 s)) (<= (+ m s 1) (+ U T S))) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (not (< 0 u)) (<= 0 t))), 4913340#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 4913341#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 4913338#(and (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 s)) (not (< 0 u))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= u 0) (<= 0 s)) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= (+ U T S) (+ m u t s))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 s)) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 u))) (or (<= s 1) (<= (+ m s 1) (+ U T S))) (or (not (< 0 u)) (<= 0 t)))] [2022-03-15 21:52:24,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 21:52:24,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:24,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 21:52:24,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=2008, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 21:52:24,873 INFO L87 Difference]: Start difference. First operand 37713 states and 139031 transitions. Second operand has 30 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 29 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:52:27,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:27,165 INFO L93 Difference]: Finished difference Result 53723 states and 193040 transitions. [2022-03-15 21:52:27,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 21:52:27,166 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 29 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:52:27,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:27,338 INFO L225 Difference]: With dead ends: 53723 [2022-03-15 21:52:27,338 INFO L226 Difference]: Without dead ends: 53708 [2022-03-15 21:52:27,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3167 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1748, Invalid=6994, Unknown=0, NotChecked=0, Total=8742 [2022-03-15 21:52:27,339 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 349 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:27,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 0 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:52:27,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53708 states. [2022-03-15 21:52:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53708 to 37789. [2022-03-15 21:52:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37789 states, 37788 states have (on average 3.6859585053456123) internal successors, (139285), 37788 states have internal predecessors, (139285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37789 states to 37789 states and 139285 transitions. [2022-03-15 21:52:28,711 INFO L78 Accepts]: Start accepts. Automaton has 37789 states and 139285 transitions. Word has length 27 [2022-03-15 21:52:28,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:28,711 INFO L470 AbstractCegarLoop]: Abstraction has 37789 states and 139285 transitions. [2022-03-15 21:52:28,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 29 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:52:28,711 INFO L276 IsEmpty]: Start isEmpty. Operand 37789 states and 139285 transitions. [2022-03-15 21:52:28,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:52:28,772 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:28,772 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:28,790 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:52:28,987 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:52:28,987 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:28,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:28,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1715170459, now seen corresponding path program 99 times [2022-03-15 21:52:28,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:28,989 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714680540] [2022-03-15 21:52:28,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:28,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:29,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:29,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714680540] [2022-03-15 21:52:29,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714680540] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:29,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777084615] [2022-03-15 21:52:29,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:52:29,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:29,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:29,341 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:52:29,342 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:52:29,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 21:52:29,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:29,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:52:29,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:30,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:31,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777084615] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:31,882 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:31,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 37 [2022-03-15 21:52:31,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1389549035] [2022-03-15 21:52:31,883 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:31,884 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:31,891 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 123 transitions. [2022-03-15 21:52:31,891 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:34,551 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [5042936#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 5042943#(and (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 s)) (not (< 0 u))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= u 0) (<= 0 s)) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= (+ U T S) (+ m u t s))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 s)) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 u))) (or (<= s 1) (<= (+ m s 1) (+ U T S))) (or (not (< 0 u)) (<= 0 t))), 5042935#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 5042940#(and (or (< 0 u) (not (<= s 0))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= 2 s)) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)))), 5042945#(and (or (< 0 u) (<= (+ U T S) (+ m u s))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (<= 1 s)) (or (<= t 0) (< 0 u))), 5042933#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 5042938#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)) (< 0 t)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= 2 s) (< 0 t)) (or (< 0 u) (not (<= s 0)) (< 0 t))), 5042937#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 5042941#(and (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= 2 s)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= 2 s)) (or (<= t 0) (< 0 u))), 5042947#(and (or (<= 1 s) (< 1 u) (< 0 t)) (or (<= (+ U T S 1) (+ m u s)) (< 1 u) (< 0 t)) (or (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S)) (< 1 u) (< 0 t))), 5042934#(and (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 5042944#(and (or (<= (+ m s) (+ U T S)) (<= 2 s) (< 1 u) (< 0 t)) (or (<= (+ U T S 1) (+ m u s)) (<= 2 s) (< 1 u) (< 0 t))), 5042858#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 5042939#(and (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= 2 s) (< 0 t)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= 2 s) (< 0 t))), 5042942#(and (or (not (< 0 s)) (<= (+ m s 1) (+ U T S))) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (not (< 0 u)) (<= 0 t))), 5042932#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 5042946#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S)) (< 0 t)) (or (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u s)) (< 0 t)))] [2022-03-15 21:52:34,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:52:34,552 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:34,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:52:34,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=2371, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 21:52:34,552 INFO L87 Difference]: Start difference. First operand 37789 states and 139285 transitions. Second operand has 33 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:37,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:37,428 INFO L93 Difference]: Finished difference Result 55765 states and 201595 transitions. [2022-03-15 21:52:37,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-15 21:52:37,428 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have 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:52:37,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:37,607 INFO L225 Difference]: With dead ends: 55765 [2022-03-15 21:52:37,608 INFO L226 Difference]: Without dead ends: 55735 [2022-03-15 21:52:37,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 44 SyntacticMatches, 12 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4971 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2644, Invalid=10928, Unknown=0, NotChecked=0, Total=13572 [2022-03-15 21:52:37,609 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 441 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:37,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 0 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:52:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55735 states. [2022-03-15 21:52:38,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55735 to 37870. [2022-03-15 21:52:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37870 states, 37869 states have (on average 3.6855475454857536) internal successors, (139568), 37869 states have internal predecessors, (139568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37870 states to 37870 states and 139568 transitions. [2022-03-15 21:52:38,788 INFO L78 Accepts]: Start accepts. Automaton has 37870 states and 139568 transitions. Word has length 27 [2022-03-15 21:52:38,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:38,789 INFO L470 AbstractCegarLoop]: Abstraction has 37870 states and 139568 transitions. [2022-03-15 21:52:38,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 37870 states and 139568 transitions. [2022-03-15 21:52:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:52:38,843 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:38,843 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:38,859 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:52:39,063 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:52:39,063 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:39,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:39,063 INFO L85 PathProgramCache]: Analyzing trace with hash 691176545, now seen corresponding path program 100 times [2022-03-15 21:52:39,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:39,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455886982] [2022-03-15 21:52:39,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:39,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:39,331 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:39,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455886982] [2022-03-15 21:52:39,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455886982] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:39,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776905456] [2022-03-15 21:52:39,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:52:39,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:39,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:39,332 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:52:39,526 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:52:39,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:52:39,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:39,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:52:39,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:40,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:41,420 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:41,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776905456] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:41,421 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:41,421 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2022-03-15 21:52:41,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [460574335] [2022-03-15 21:52:41,421 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:41,422 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:41,429 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 121 transitions. [2022-03-15 21:52:41,429 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:42,962 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [5174793#(and (or (<= (+ 2 m t) (+ U T S)) (< 0 u)) (or (< 0 u) (<= (+ U T S) (+ m u t s)))), 5174784#(and (or (< 0 u) (<= (+ 2 m) (+ U T S)) (<= 3 s) (< 0 t)) (or (< 0 u) (<= 3 s) (<= (+ U T S) (+ m u t s)) (< 0 t))), 5174788#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (<= t 0) (< 0 u))), 5174789#(and (or (< 0 u) (<= 3 s) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ 2 m) (+ U T S)) (<= 3 s)) (or (<= t 0) (< 0 u))), 5174779#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 5174782#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)) (< 0 t)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (< 0 t))), 5174787#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)))), 5174783#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m u t s)) (< 0 t)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (< 0 t))), 5174781#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t))), 5174794#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ 2 m t) (+ U T S)) (< 1 u))), 5174792#(and (or (< 0 u) (< 0 t)) (or (<= (+ 2 m t) (+ U T S)) (< 0 u)) (or (< 0 u) (<= (+ U T S) (+ m u t s)))), 5174778#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 5174786#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 5174790#(and (or (< 0 u) (<= (+ 3 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (<= t 0) (< 0 u))), 5174795#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u)))), 5174785#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 5174780#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 5174791#(and (or (< 0 u) (<= (+ 3 m) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 3 s)))] [2022-03-15 21:52:42,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:52:42,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:42,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:52:42,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=3169, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 21:52:42,963 INFO L87 Difference]: Start difference. First operand 37870 states and 139568 transitions. Second operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 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:52:45,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:45,316 INFO L93 Difference]: Finished difference Result 56242 states and 207429 transitions. [2022-03-15 21:52:45,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 21:52:45,316 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 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 27 [2022-03-15 21:52:45,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:45,500 INFO L225 Difference]: With dead ends: 56242 [2022-03-15 21:52:45,500 INFO L226 Difference]: Without dead ends: 56231 [2022-03-15 21:52:45,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 40 SyntacticMatches, 9 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3930 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2098, Invalid=8408, Unknown=0, NotChecked=0, Total=10506 [2022-03-15 21:52:45,501 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 318 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:45,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 0 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:52:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56231 states. [2022-03-15 21:52:46,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56231 to 38082. [2022-03-15 21:52:46,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38082 states, 38081 states have (on average 3.684199469551745) internal successors, (140298), 38081 states have internal predecessors, (140298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:46,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38082 states to 38082 states and 140298 transitions. [2022-03-15 21:52:46,756 INFO L78 Accepts]: Start accepts. Automaton has 38082 states and 140298 transitions. Word has length 27 [2022-03-15 21:52:46,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:46,756 INFO L470 AbstractCegarLoop]: Abstraction has 38082 states and 140298 transitions. [2022-03-15 21:52:46,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 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:52:46,756 INFO L276 IsEmpty]: Start isEmpty. Operand 38082 states and 140298 transitions. [2022-03-15 21:52:46,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:52:46,811 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:46,811 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:46,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Forceful destruction successful, exit code 0 [2022-03-15 21:52:47,026 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:52:47,026 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:47,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:47,026 INFO L85 PathProgramCache]: Analyzing trace with hash 787604503, now seen corresponding path program 101 times [2022-03-15 21:52:47,027 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:47,027 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337013357] [2022-03-15 21:52:47,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:47,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:47,432 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:47,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337013357] [2022-03-15 21:52:47,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337013357] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:47,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79766504] [2022-03-15 21:52:47,433 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:52:47,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:47,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:47,434 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:52:47,435 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:52:47,462 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 21:52:47,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:47,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:52:47,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:48,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:49,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79766504] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:49,285 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:49,285 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2022-03-15 21:52:49,285 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [231106554] [2022-03-15 21:52:49,285 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:49,286 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:49,293 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 123 transitions. [2022-03-15 21:52:49,293 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:51,021 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [5307502#(and (or (<= s 1) (not (<= u 0)) (not (<= t 0))) (or (<= t 0) (not (<= u 0)) (<= (+ U T S) (+ m u t s))) (or (<= (+ 2 m t) (+ U T S)) (<= t 0) (not (<= u 0)))), 5307492#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 5307493#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (<= t 0) (< 0 u))), 5307501#(and (or (<= t 0) (not (<= u 0)) (<= (+ U T S) (+ m u t s))) (or (<= t 0) (<= (+ m t 1) (+ U T S)) (not (<= u 0))) (or (not (<= u 0)) (not (<= t 0)) (<= s 0))), 5307487#(and (or (< 0 u) (<= (+ 2 m) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (< 0 t))), 5307495#(and (<= (+ m t 1) (+ U T S)) (<= 1 s) (<= (+ U T S 1) (+ m u t s))), 5307498#(and (or (< 0 u) (< 1 t) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (< 0 u) (< 1 t) (<= (+ U T S) (+ m u t s)) (not (< 0 t)))), 5307496#(and (<= (+ 2 m t) (+ U T S)) (<= 2 s) (<= (+ U T S 1) (+ m u t s))), 5307481#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 5307499#(and (or (< 0 u) (< 1 t) (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (< 0 u) (< 1 t) (<= (+ 3 m) (+ U T S)) (not (< 0 t)))), 5307491#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 5307484#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 5307483#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 5307486#(and (or (< 0 u) (<= (+ U T S) (+ m u t s)) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t))), 5307490#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 5307494#(and (or (< 0 u) (not (< 1 s)) (< 1 t) (<= (+ 3 m) (+ U T S))) (or (< 0 u) (< 1 t) (<= (+ U T S) (+ m u t s)) (not (< 0 t))) (or (< 0 u) (< 1 t) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (< 0 u) (not (< 1 s)) (< 1 t) (<= (+ U T S) (+ m u t s)))), 5307497#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u)))), 5307500#(and (or (< 0 u) (< 2 t) (<= t 1) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (< 2 t) (<= t 1) (<= (+ 3 m) (+ U T S)))), 5307482#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 5307488#(and (or (< 0 u) (< 1 t) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (< 1 t) (<= (+ U T S) (+ m u t s)))), 5307485#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 5307489#(and (or (< 0 u) (< 1 t) (not (< 0 s)) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (< 1 t) (not (< 0 s)) (<= (+ 2 m) (+ U T S))) (or (< 0 u) (< 1 t) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (< 0 u) (< 1 t) (<= (+ U T S) (+ m u t s)) (not (< 0 t))))] [2022-03-15 21:52:51,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 21:52:51,021 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:51,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 21:52:51,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=730, Invalid=3430, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 21:52:51,021 INFO L87 Difference]: Start difference. First operand 38082 states and 140298 transitions. Second operand has 38 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 37 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:52:52,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:52:52,544 INFO L93 Difference]: Finished difference Result 42174 states and 154434 transitions. [2022-03-15 21:52:52,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 21:52:52,544 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 37 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 27 [2022-03-15 21:52:52,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:52:52,659 INFO L225 Difference]: With dead ends: 42174 [2022-03-15 21:52:52,659 INFO L226 Difference]: Without dead ends: 42163 [2022-03-15 21:52:52,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3423 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2034, Invalid=7866, Unknown=0, NotChecked=0, Total=9900 [2022-03-15 21:52:52,660 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 388 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:52:52,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 0 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:52:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42163 states. [2022-03-15 21:52:53,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42163 to 39106. [2022-03-15 21:52:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39106 states, 39105 states have (on average 3.6831607211354047) internal successors, (144030), 39105 states have internal predecessors, (144030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:52:53,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39106 states to 39106 states and 144030 transitions. [2022-03-15 21:52:53,798 INFO L78 Accepts]: Start accepts. Automaton has 39106 states and 144030 transitions. Word has length 27 [2022-03-15 21:52:53,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:52:53,798 INFO L470 AbstractCegarLoop]: Abstraction has 39106 states and 144030 transitions. [2022-03-15 21:52:53,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 37 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:52:53,798 INFO L276 IsEmpty]: Start isEmpty. Operand 39106 states and 144030 transitions. [2022-03-15 21:52:53,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:52:53,862 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:52:53,862 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:52:53,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Ended with exit code 0 [2022-03-15 21:52:54,075 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:52:54,075 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:52:54,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:52:54,076 INFO L85 PathProgramCache]: Analyzing trace with hash 53628563, now seen corresponding path program 102 times [2022-03-15 21:52:54,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:52:54,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825028089] [2022-03-15 21:52:54,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:52:54,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:52:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:52:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:54,421 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:52:54,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825028089] [2022-03-15 21:52:54,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825028089] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:52:54,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543243530] [2022-03-15 21:52:54,422 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:52:54,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:52:54,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:52:54,423 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:52:54,423 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:52:54,445 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 21:52:54,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:52:54,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:52:54,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:52:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:55,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:52:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:52:56,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543243530] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:52:56,894 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:52:56,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 37 [2022-03-15 21:52:56,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [677039058] [2022-03-15 21:52:56,894 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:52:56,895 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:52:56,902 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 111 transitions. [2022-03-15 21:52:56,902 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:52:58,970 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [5428165#(and (or (<= 2 s) (<= (+ m 1) (+ U T S)) (< 1 u) (<= s 0)) (or (<= (+ U T S 1) (+ m u s)) (<= 2 s) (<= (+ U T S) (+ m u t)) (< 1 u) (<= s 0))), 5428155#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 5428158#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)) (< 0 t)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (< 0 t))), 5428159#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)))), 5428160#(and (or (<= (+ m 1) (+ U S)) (not (< 0 t)) (not (<= s 0))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 5428163#(and (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= (+ U T S) (+ m u t 1)) (<= 2 s) (<= s 0)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (<= s 0))), 5428167#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 5428166#(and (or (<= (+ U T S 1) (+ m u t)) (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m 1) (+ U T S)) (< 1 u) (<= s 0)) (or (<= 1 s) (<= (+ m t) (+ U T S)) (< 1 u))), 5428162#(and (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= 2 s) (<= s 0)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (<= s 0)) (or (<= t 0) (< 0 u))), 5428164#(and (or (< 0 u) (<= 1 s) (<= (+ m t) (+ U T S))) (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0)) (or (< 0 u) (<= (+ U T S) (+ m u t)) (<= (+ U T S) (+ m u t s)))), 5428157#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 5428154#(and (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ m t 1) (+ U T S)) (<= 1 s) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ 2 m) (+ U T S)) (not (< 0 u)) (<= s 0)) (or (not (< 0 u)) (<= 0 t))), 5428080#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 5428161#(and (or (<= t 0) (<= (+ m 1) (+ U S)) (< 0 s)) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 s)) (not (<= s 1)) (not (< 0 t)) (<= (+ 2 m) (+ U S)))), 5428168#(and (or (<= (+ U T S 1) (+ m u t)) (< 1 u) (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m 1) (+ U T S)) (not (< 0 u)) (< 1 u) (<= s 0)) (or (<= (+ m 1) (+ U T S)) (< 1 u) (not (< 0 t))) (or (<= (+ U T S 1) (+ m u t)) (not (< 0 u)) (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= 1 s) (<= (+ m t) (+ U T S)) (< 1 u) (not (< 0 t))) (or (<= 1 s) (<= (+ m t) (+ U T S)) (not (< 0 u)) (< 1 u))), 5428156#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1))))] [2022-03-15 21:52:58,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 21:52:58,970 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:52:58,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 21:52:58,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=2359, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 21:52:58,970 INFO L87 Difference]: Start difference. First operand 39106 states and 144030 transitions. Second operand has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 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:53:04,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:04,420 INFO L93 Difference]: Finished difference Result 67248 states and 242037 transitions. [2022-03-15 21:53:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-15 21:53:04,420 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 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 27 [2022-03-15 21:53:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:04,648 INFO L225 Difference]: With dead ends: 67248 [2022-03-15 21:53:04,648 INFO L226 Difference]: Without dead ends: 67233 [2022-03-15 21:53:04,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7427 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4091, Invalid=16789, Unknown=0, NotChecked=0, Total=20880 [2022-03-15 21:53:04,649 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 404 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:04,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 0 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:53:04,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67233 states. [2022-03-15 21:53:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67233 to 39098. [2022-03-15 21:53:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39098 states, 39097 states have (on average 3.683198199350334) internal successors, (144002), 39097 states have internal predecessors, (144002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:06,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39098 states to 39098 states and 144002 transitions. [2022-03-15 21:53:06,249 INFO L78 Accepts]: Start accepts. Automaton has 39098 states and 144002 transitions. Word has length 27 [2022-03-15 21:53:06,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:06,249 INFO L470 AbstractCegarLoop]: Abstraction has 39098 states and 144002 transitions. [2022-03-15 21:53:06,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 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:53:06,249 INFO L276 IsEmpty]: Start isEmpty. Operand 39098 states and 144002 transitions. [2022-03-15 21:53:06,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:53:06,306 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:06,306 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:06,324 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:53:06,520 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:53:06,521 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:53:06,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:06,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1342671523, now seen corresponding path program 103 times [2022-03-15 21:53:06,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:06,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024530120] [2022-03-15 21:53:06,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:06,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:06,854 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:06,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:06,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024530120] [2022-03-15 21:53:06,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024530120] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:06,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073058527] [2022-03-15 21:53:06,854 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:53:06,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:06,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:06,856 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:53:06,856 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:53:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:06,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:53:06,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:07,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:11,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073058527] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:11,207 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:11,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2022-03-15 21:53:11,207 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2139336300] [2022-03-15 21:53:11,207 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:11,208 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:11,214 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 96 transitions. [2022-03-15 21:53:11,214 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:13,133 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [5573988#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 5573992#(and (or (<= (+ m 1) (+ U S)) (not (< 0 t)) (not (<= s 0))) (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 5573994#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 5573923#(or (and (<= (+ U T S) m) (<= m (+ U T S)) (<= s 0)) (< 0 u) (<= 2 s) (and (<= 1 s) (<= (+ U T S) (+ m 1)) (<= (+ m 1) (+ U T S))) (< 0 t)), 5573993#(and (or (<= t 0) (<= (+ m 1) (+ U S)) (< 0 s)) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (not (< 0 s)) (not (<= s 1)) (not (< 0 t)) (<= (+ 2 m) (+ U S)))), 5573989#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)) (< 0 t))), 5573991#(and (or (<= 1 s) (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (<= 1 s) (< 1 u) (< 0 t))), 5573990#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 5573987#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 5573986#(and (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ m t 1) (+ U T S)) (<= 1 s) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ 2 m) (+ U T S)) (not (< 0 u)) (<= s 0)) (or (not (< 0 u)) (<= 0 t)))] [2022-03-15 21:53:13,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:53:13,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:13,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:53:13,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=1520, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 21:53:13,134 INFO L87 Difference]: Start difference. First operand 39098 states and 144002 transitions. Second operand has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 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:53:16,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:16,397 INFO L93 Difference]: Finished difference Result 71424 states and 249520 transitions. [2022-03-15 21:53:16,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-15 21:53:16,397 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:53:16,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:16,626 INFO L225 Difference]: With dead ends: 71424 [2022-03-15 21:53:16,626 INFO L226 Difference]: Without dead ends: 71409 [2022-03-15 21:53:16,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 42 SyntacticMatches, 11 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3329 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1866, Invalid=7254, Unknown=0, NotChecked=0, Total=9120 [2022-03-15 21:53:16,627 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 270 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:16,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 0 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:53:16,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71409 states. [2022-03-15 21:53:17,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71409 to 39102. [2022-03-15 21:53:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39102 states, 39101 states have (on average 3.683128308738907) internal successors, (144014), 39101 states have internal predecessors, (144014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39102 states to 39102 states and 144014 transitions. [2022-03-15 21:53:18,213 INFO L78 Accepts]: Start accepts. Automaton has 39102 states and 144014 transitions. Word has length 27 [2022-03-15 21:53:18,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:18,213 INFO L470 AbstractCegarLoop]: Abstraction has 39102 states and 144014 transitions. [2022-03-15 21:53:18,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 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:53:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 39102 states and 144014 transitions. [2022-03-15 21:53:18,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:53:18,270 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:18,270 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:18,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Ended with exit code 0 [2022-03-15 21:53:18,485 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:53:18,485 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:53:18,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:18,486 INFO L85 PathProgramCache]: Analyzing trace with hash 32390021, now seen corresponding path program 104 times [2022-03-15 21:53:18,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:18,487 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973074105] [2022-03-15 21:53:18,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:18,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:18,669 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:18,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973074105] [2022-03-15 21:53:18,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973074105] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:18,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144325078] [2022-03-15 21:53:18,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:53:18,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:18,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:18,671 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:53:18,671 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:53:18,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:53:18,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:18,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:53:18,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:19,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:20,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144325078] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:20,803 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:20,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 37 [2022-03-15 21:53:20,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [732663999] [2022-03-15 21:53:20,804 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:20,805 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:20,814 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 123 transitions. [2022-03-15 21:53:20,814 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:23,211 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [5723936#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t 1) (+ U T S)))), 5723927#(and (or (< 0 u) (< 0 t)) (or (< 0 u) (<= 1 s) (<= (+ U T S) (+ m t s))) (or (< 0 u) (<= 1 s) (<= (+ m t) (+ U T S)))), 5723939#(and (or (<= t 0) (<= (+ m t) (+ U T S)) (< 0 s)) (or (<= (+ U T S) (+ m t s)) (<= 3 s) (not (< 0 t))) (or (<= (+ 2 m t) (+ U T S)) (<= s 1) (<= t 0) (<= 3 s)) (or (not (< 0 u)) (< 0 t)) (or (<= s 2) (< 0 t)) (or (<= t 0) (<= (+ m t 1) (+ U T S)) (< 1 s) (not (< 0 s)))), 5723934#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 5723925#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)))), 5723932#(and (or (<= (+ m t 1) (+ U T S)) (<= 2 s) (not (< 0 s)) (not (< 0 t))) (or (<= 2 s) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (<= t 0) (<= (+ m t) (+ U T S)) (< 0 s)) (or (not (< 0 u)) (< 0 t)) (or (<= s 1) (< 0 t))), 5723935#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (< 0 u) (<= (+ m t 1) (+ U T S)) (<= 2 s) (not (< 0 s)) (not (< 0 t))) (or (<= s 1) (< 0 u) (< 0 t)) (or (<= t 0) (< 0 u) (<= (+ m t) (+ U T S)) (< 0 s))), 5723922#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 5723938#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u)))), 5723937#(and (or (<= (+ m t 1) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s)))), 5723941#(and (or (<= 2 s) (< 0 t)) (<= (+ m t 1) (+ U T S)) (<= 1 s) (<= (+ U T S) (+ m u t s)) (or (<= (+ 2 m t) (+ U T S)) (< 0 t))), 5723848#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 5723924#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 5723933#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 5723928#(and (or (< 0 u) (<= 1 s) (<= (+ m t) (+ U T S))) (or (< 0 u) (<= 1 s) (<= (+ U T S) (+ m u t s)))), 5723926#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m t s))) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s))), 5723929#(and (or (<= 1 s) (<= (+ U T S) (+ m t s)) (not (< 0 t))) (or (not (< 0 s)) (< 0 t)) (or (not (< 0 u)) (< 0 t)) (or (<= 1 s) (<= (+ m t) (+ U T S)) (not (< 0 t)))), 5723930#(and (or (< 0 u) (<= 1 s) (<= (+ m t) (+ U T S)) (not (< 0 t))) (or (< 0 u) (not (< 0 s)) (< 0 t)) (or (< 0 u) (<= 1 s) (<= (+ U T S) (+ m t s)) (not (< 0 t)))), 5723931#(and (<= (+ m t 1) (+ U T S)) (<= u 0) (<= (+ U T S) (+ m u t s)) (or (<= (+ 2 m t) (+ U T S)) (< 0 t))), 5723923#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 5723940#(and (or (< 0 u) (<= s 2) (< 0 t)) (or (<= t 0) (< 0 u) (<= (+ m t 1) (+ U T S)) (< 1 s) (not (< 0 s))) (or (<= (+ 2 m t) (+ U T S)) (<= s 1) (<= t 0) (< 0 u) (<= 3 s)) (or (< 0 u) (<= (+ U T S) (+ m t s)) (<= 3 s) (not (< 0 t))) (or (<= t 0) (< 0 u) (<= (+ m t) (+ U T S)) (< 0 s)))] [2022-03-15 21:53:23,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 21:53:23,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:23,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 21:53:23,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=621, Invalid=2801, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 21:53:23,212 INFO L87 Difference]: Start difference. First operand 39102 states and 144014 transitions. Second operand has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:26,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:26,434 INFO L93 Difference]: Finished difference Result 60486 states and 221731 transitions. [2022-03-15 21:53:26,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 21:53:26,434 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:53:26,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:26,636 INFO L225 Difference]: With dead ends: 60486 [2022-03-15 21:53:26,637 INFO L226 Difference]: Without dead ends: 60464 [2022-03-15 21:53:26,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4535 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2510, Invalid=10372, Unknown=0, NotChecked=0, Total=12882 [2022-03-15 21:53:26,638 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 357 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:26,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 0 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:53:26,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60464 states. [2022-03-15 21:53:27,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60464 to 39110. [2022-03-15 21:53:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39110 states, 39109 states have (on average 3.68344882252167) internal successors, (144056), 39109 states have internal predecessors, (144056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39110 states to 39110 states and 144056 transitions. [2022-03-15 21:53:28,071 INFO L78 Accepts]: Start accepts. Automaton has 39110 states and 144056 transitions. Word has length 27 [2022-03-15 21:53:28,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:28,072 INFO L470 AbstractCegarLoop]: Abstraction has 39110 states and 144056 transitions. [2022-03-15 21:53:28,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:28,072 INFO L276 IsEmpty]: Start isEmpty. Operand 39110 states and 144056 transitions. [2022-03-15 21:53:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:53:28,130 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:28,130 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:28,146 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:53:28,343 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:53:28,343 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:53:28,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:28,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1282642583, now seen corresponding path program 105 times [2022-03-15 21:53:28,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:28,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012654955] [2022-03-15 21:53:28,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:28,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:28,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:28,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012654955] [2022-03-15 21:53:28,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012654955] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:28,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863928473] [2022-03-15 21:53:28,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:53:28,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:28,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:28,554 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:53:28,555 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:53:28,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 21:53:28,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:28,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:53:28,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:29,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:33,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863928473] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:33,021 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:33,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 34 [2022-03-15 21:53:33,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1117116427] [2022-03-15 21:53:33,021 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:33,022 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:33,029 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 99 transitions. [2022-03-15 21:53:33,029 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:35,124 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [5862960#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 s) (< 0 t))), 5862950#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 5862954#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 5862951#(and (or (not (< 0 u)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 s)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (not (< 0 s))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m t) (+ U T S)) (not (< 0 t)) (not (<= s 0))) (or (<= (+ m s) (+ U T S)) (not (< 0 u)))), 5862961#(and (or (<= (+ U T S) m) (< 1 u) (< 0 s) (< 0 t)) (or (< m (+ U T S 1)) (< 1 u) (< 0 t))), 5862962#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m t 1)) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0)) (or (< 0 u) (<= 1 s) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= m (+ U T S)))), 5862958#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0)) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= m (+ U T S)))), 5862957#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (< m (+ U T S 1)))), 5862955#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 5862956#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 5862963#(and (or (<= 2 s) (< 1 u) (<= (+ U T S) (+ m t 1)) (<= (+ U T S) (+ m s))) (or (<= (+ m 1) (+ U T S)) (< 1 u) (<= s 0)) (or (<= m (+ U T S)) (< 1 u)) (or (<= 1 s) (< 1 u) (<= (+ U T S) (+ m s)))), 5862953#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 5862952#(and (or (not (< 0 u)) (<= (+ U T S 1) (+ m u t s))) (or (<= u 0) (<= 0 s)) (or (<= t 0) (<= (+ m t) (+ U T S)) (< 0 s)) (or (<= s 1) (<= (+ m s) (+ U T S))) (or (<= s 1) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 s)) (not (<= s 1)) (not (< 0 t))) (or (<= (+ m s) (+ U T S)) (not (< 0 u)))), 5862959#(and (or (not (< 0 u)) (<= (+ U T S 1) (+ m u t s))) (or (<= s 2) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (<= s 2)) (or (<= u 0) (<= 0 s)) (or (<= t 0) (<= (+ m t) (+ U T S)) (< 0 s)) (or (<= (+ 2 m t) (+ U T S)) (<= s 1) (<= t 0) (< 2 s)) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= t 0) (<= (+ m t 1) (+ U T S)) (< 1 s) (not (< 0 s))) (or (<= (+ m s) (+ U T S)) (not (< 0 u))))] [2022-03-15 21:53:35,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 21:53:35,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:35,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 21:53:35,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=1968, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:53:35,125 INFO L87 Difference]: Start difference. First operand 39110 states and 144056 transitions. Second operand has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:37,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:37,313 INFO L93 Difference]: Finished difference Result 50627 states and 182150 transitions. [2022-03-15 21:53:37,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 21:53:37,313 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:53:37,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:37,557 INFO L225 Difference]: With dead ends: 50627 [2022-03-15 21:53:37,558 INFO L226 Difference]: Without dead ends: 50612 [2022-03-15 21:53:37,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3190 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1801, Invalid=7319, Unknown=0, NotChecked=0, Total=9120 [2022-03-15 21:53:37,558 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 403 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:37,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 0 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:53:37,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50612 states. [2022-03-15 21:53:38,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50612 to 39106. [2022-03-15 21:53:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39106 states, 39105 states have (on average 3.6835187316199973) internal successors, (144044), 39105 states have internal predecessors, (144044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39106 states to 39106 states and 144044 transitions. [2022-03-15 21:53:38,743 INFO L78 Accepts]: Start accepts. Automaton has 39106 states and 144044 transitions. Word has length 27 [2022-03-15 21:53:38,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:38,744 INFO L470 AbstractCegarLoop]: Abstraction has 39106 states and 144044 transitions. [2022-03-15 21:53:38,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 39106 states and 144044 transitions. [2022-03-15 21:53:38,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:53:38,801 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:38,801 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:38,817 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:53:39,015 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:53:39,015 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:53:39,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:39,017 INFO L85 PathProgramCache]: Analyzing trace with hash 557643045, now seen corresponding path program 106 times [2022-03-15 21:53:39,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:39,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869062858] [2022-03-15 21:53:39,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:39,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:39,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:39,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869062858] [2022-03-15 21:53:39,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869062858] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:39,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310704279] [2022-03-15 21:53:39,231 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:53:39,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:39,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:39,232 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:53:39,233 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:53:39,254 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:53:39,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:39,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:53:39,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:39,871 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:39,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:42,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310704279] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:42,291 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:42,291 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2022-03-15 21:53:42,291 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1542753677] [2022-03-15 21:53:42,291 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:42,292 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:42,298 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 99 transitions. [2022-03-15 21:53:42,298 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:44,186 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [5992103#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u)) (or (<= (+ m t) (+ U T S)) (< 1 u))), 5992105#(and (or (not (< 0 s)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (not (< 0 s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 5992099#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 5992104#(and (or (< 1 u) (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u) (not (< 0 t))) (or (not (< 0 u)) (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m t) (+ U T S)) (< 1 u) (not (< 0 t))) (or (<= (+ m t) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (<= (+ m s) (+ U T S)) (not (< 0 u)) (< 1 u))), 5992100#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= 1 s))), 5992106#(and (or (<= 2 s) (not (< 0 u))) (or (<= s 1) (<= (+ m s) (+ U T S))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 5992097#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 5992102#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t) (+ U T S)))), 5992098#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 5992101#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m t s))) (or (< 0 u) (<= (+ m t) (+ U T S)))), 5992108#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 5992096#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 5992107#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 5992094#(and (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 5992095#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u)))] [2022-03-15 21:53:44,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:53:44,186 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:44,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:53:44,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=2783, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 21:53:44,187 INFO L87 Difference]: Start difference. First operand 39106 states and 144044 transitions. Second operand has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 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:53:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:45,776 INFO L93 Difference]: Finished difference Result 44930 states and 164891 transitions. [2022-03-15 21:53:45,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 21:53:45,776 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 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 27 [2022-03-15 21:53:45,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:45,914 INFO L225 Difference]: With dead ends: 44930 [2022-03-15 21:53:45,914 INFO L226 Difference]: Without dead ends: 44919 [2022-03-15 21:53:45,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2435 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1062, Invalid=5580, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 21:53:45,915 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 218 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:45,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 0 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:53:45,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44919 states. [2022-03-15 21:53:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44919 to 39106. [2022-03-15 21:53:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39106 states, 39105 states have (on average 3.6834675872650555) internal successors, (144042), 39105 states have internal predecessors, (144042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39106 states to 39106 states and 144042 transitions. [2022-03-15 21:53:47,319 INFO L78 Accepts]: Start accepts. Automaton has 39106 states and 144042 transitions. Word has length 27 [2022-03-15 21:53:47,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:47,319 INFO L470 AbstractCegarLoop]: Abstraction has 39106 states and 144042 transitions. [2022-03-15 21:53:47,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 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:53:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 39106 states and 144042 transitions. [2022-03-15 21:53:47,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:53:47,381 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:47,382 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:47,398 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:53:47,595 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:53:47,595 INFO L402 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:53:47,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:47,596 INFO L85 PathProgramCache]: Analyzing trace with hash -235020073, now seen corresponding path program 107 times [2022-03-15 21:53:47,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:47,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088226976] [2022-03-15 21:53:47,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:47,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:47,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:47,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088226976] [2022-03-15 21:53:47,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088226976] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:47,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215507807] [2022-03-15 21:53:47,844 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:53:47,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:47,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:47,845 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:53:47,846 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:53:47,868 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 21:53:47,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:47,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:53:47,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:48,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:51,281 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:51,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215507807] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:51,281 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:51,281 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2022-03-15 21:53:51,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [687588058] [2022-03-15 21:53:51,282 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:51,283 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:51,289 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 106 transitions. [2022-03-15 21:53:51,289 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:53:53,201 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [6115509#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u)) (or (<= (+ m t) (+ U T S)) (< 1 u))), 6115507#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t) (+ U T S)))), 6115502#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6115498#(and (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 6115514#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 6115499#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 6115501#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 6115503#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6115511#(and (or (not (< 0 s)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (not (< 0 s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 6115512#(and (or (<= 2 s) (not (< 0 u))) (or (<= s 1) (<= (+ m s) (+ U T S))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 6115513#(and (or (< 1 u) (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u) (not (< 0 t))) (or (not (< 0 u)) (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m t) (+ U T S)) (< 1 u) (not (< 0 t))) (or (<= (+ m t) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (<= (+ m s) (+ U T S)) (not (< 0 u)) (< 1 u))), 6115508#(and (or (<= (+ m s) (+ U T S)) (<= (+ m 1) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s)))), 6115506#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ m 1) (+ U T S)))), 6115500#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 6115505#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ m 1) (+ U T S))) (or (<= t 0) (< 0 u))), 6115510#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 6115504#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S))))] [2022-03-15 21:53:53,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:53:53,201 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:53:53,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:53:53,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=2981, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 21:53:53,202 INFO L87 Difference]: Start difference. First operand 39106 states and 144042 transitions. Second operand has 33 states, 32 states have (on average 2.4375) internal successors, (78), 32 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:53:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:53:54,772 INFO L93 Difference]: Finished difference Result 42649 states and 155530 transitions. [2022-03-15 21:53:54,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 21:53:54,772 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.4375) internal successors, (78), 32 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 27 [2022-03-15 21:53:54,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:53:54,925 INFO L225 Difference]: With dead ends: 42649 [2022-03-15 21:53:54,925 INFO L226 Difference]: Without dead ends: 42638 [2022-03-15 21:53:54,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2919 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1276, Invalid=6556, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 21:53:54,926 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 256 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:53:54,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 0 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:53:54,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42638 states. [2022-03-15 21:53:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42638 to 39104. [2022-03-15 21:53:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39104 states, 39103 states have (on average 3.683502544561798) internal successors, (144036), 39103 states have internal predecessors, (144036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:53:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39104 states to 39104 states and 144036 transitions. [2022-03-15 21:53:55,964 INFO L78 Accepts]: Start accepts. Automaton has 39104 states and 144036 transitions. Word has length 27 [2022-03-15 21:53:55,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:53:55,964 INFO L470 AbstractCegarLoop]: Abstraction has 39104 states and 144036 transitions. [2022-03-15 21:53:55,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.4375) internal successors, (78), 32 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:53:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 39104 states and 144036 transitions. [2022-03-15 21:53:56,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:53:56,171 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:53:56,171 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:53:56,194 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:53:56,387 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:53:56,387 INFO L402 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:53:56,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:53:56,388 INFO L85 PathProgramCache]: Analyzing trace with hash 545907429, now seen corresponding path program 108 times [2022-03-15 21:53:56,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:53:56,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776968832] [2022-03-15 21:53:56,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:53:56,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:53:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:53:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:56,660 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:53:56,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776968832] [2022-03-15 21:53:56,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776968832] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:53:56,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359764245] [2022-03-15 21:53:56,660 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:53:56,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:53:56,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:53:56,661 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:53:56,662 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:53:56,689 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 21:53:56,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:53:56,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:53:56,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:53:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:57,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:53:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:53:58,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359764245] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:53:58,464 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:53:58,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 37 [2022-03-15 21:53:58,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [594357947] [2022-03-15 21:53:58,464 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:53:58,465 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:53:58,471 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 109 transitions. [2022-03-15 21:53:58,471 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:00,261 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [6236627#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 6236630#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6236629#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6236641#(and (or (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s)))), 6236637#(and (or (not (< 0 s)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (not (< 0 s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 6236628#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 6236639#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S)))), 6236634#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 6236640#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 6236635#(and (or (< 1 u) (<= (+ U T S 1) (+ m u t s)) (<= s 0) (< 0 t)) (or (<= (+ m 1) (+ U T S)) (< 1 u) (<= s 0) (< 0 t))), 6236633#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= s 0)) (or (<= t 0) (< 0 u))), 6236631#(and (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= s 0) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0) (< 0 t))), 6236625#(and (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 6236638#(and (or (<= 2 s) (not (< 0 u))) (or (<= s 1) (<= (+ m s) (+ U T S))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 6236632#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 6236636#(and (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S))) (or (<= t 0) (< 0 u))), 6236626#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u)))] [2022-03-15 21:54:00,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:54:00,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:00,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:54:00,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=2529, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 21:54:00,262 INFO L87 Difference]: Start difference. First operand 39104 states and 144036 transitions. Second operand has 33 states, 32 states have (on average 2.5) internal successors, (80), 32 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:01,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:01,582 INFO L93 Difference]: Finished difference Result 43188 states and 155946 transitions. [2022-03-15 21:54:01,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 21:54:01,582 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.5) internal successors, (80), 32 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:54:01,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:01,807 INFO L225 Difference]: With dead ends: 43188 [2022-03-15 21:54:01,808 INFO L226 Difference]: Without dead ends: 43173 [2022-03-15 21:54:01,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2602 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1403, Invalid=5737, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 21:54:01,808 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 352 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:01,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 0 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:54:01,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43173 states. [2022-03-15 21:54:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43173 to 39114. [2022-03-15 21:54:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39114 states, 39113 states have (on average 3.6834300616163422) internal successors, (144070), 39113 states have internal predecessors, (144070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39114 states to 39114 states and 144070 transitions. [2022-03-15 21:54:02,930 INFO L78 Accepts]: Start accepts. Automaton has 39114 states and 144070 transitions. Word has length 27 [2022-03-15 21:54:02,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:02,930 INFO L470 AbstractCegarLoop]: Abstraction has 39114 states and 144070 transitions. [2022-03-15 21:54:02,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.5) internal successors, (80), 32 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 39114 states and 144070 transitions. [2022-03-15 21:54:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:54:02,988 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:02,988 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:03,006 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:54:03,207 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:54:03,207 INFO L402 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:54:03,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:03,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1054022887, now seen corresponding path program 109 times [2022-03-15 21:54:03,209 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:03,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756134274] [2022-03-15 21:54:03,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:03,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:03,487 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:03,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756134274] [2022-03-15 21:54:03,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756134274] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:03,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346945516] [2022-03-15 21:54:03,487 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:54:03,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:03,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:03,488 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:54:03,489 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:54:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:03,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:54:03,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:04,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:08,113 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:08,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346945516] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:08,113 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:08,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2022-03-15 21:54:08,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2026990163] [2022-03-15 21:54:08,113 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:08,114 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:08,120 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 91 transitions. [2022-03-15 21:54:08,120 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:09,615 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [6358309#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 6358318#(and (or (not (< 0 s)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (not (< 0 s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 6358315#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 6358310#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 6358317#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 6358314#(and (or (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (< 1 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6358312#(and (or (< 0 u) (<= m (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6358319#(and (or (<= 2 s) (not (< 0 u))) (or (<= s 1) (<= (+ m s) (+ U T S))) (or (<= (+ 2 m t) (+ U T S)) (not (< 0 t))) (or (<= s 1) (<= (+ U T S 1) (+ m u t s))) (or (not (< 0 t)) (<= (+ U T S 1) (+ m u t s)))), 6358316#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 6358311#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6358313#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s))))] [2022-03-15 21:54:09,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:54:09,615 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:09,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:54:09,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1836, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 21:54:09,616 INFO L87 Difference]: Start difference. First operand 39114 states and 144070 transitions. Second operand has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 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:54:10,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:10,780 INFO L93 Difference]: Finished difference Result 45360 states and 162424 transitions. [2022-03-15 21:54:10,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 21:54:10,780 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:54:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:10,917 INFO L225 Difference]: With dead ends: 45360 [2022-03-15 21:54:10,918 INFO L226 Difference]: Without dead ends: 45345 [2022-03-15 21:54:10,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1753 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=888, Invalid=3804, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 21:54:10,918 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 207 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:10,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 0 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:54:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45345 states. [2022-03-15 21:54:11,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45345 to 39114. [2022-03-15 21:54:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39114 states, 39113 states have (on average 3.6834300616163422) internal successors, (144070), 39113 states have internal predecessors, (144070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:11,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39114 states to 39114 states and 144070 transitions. [2022-03-15 21:54:11,934 INFO L78 Accepts]: Start accepts. Automaton has 39114 states and 144070 transitions. Word has length 27 [2022-03-15 21:54:11,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:11,934 INFO L470 AbstractCegarLoop]: Abstraction has 39114 states and 144070 transitions. [2022-03-15 21:54:11,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 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:54:11,934 INFO L276 IsEmpty]: Start isEmpty. Operand 39114 states and 144070 transitions. [2022-03-15 21:54:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:54:11,993 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:11,993 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:12,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Ended with exit code 0 [2022-03-15 21:54:12,207 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:54:12,207 INFO L402 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:54:12,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:12,208 INFO L85 PathProgramCache]: Analyzing trace with hash -454394399, now seen corresponding path program 110 times [2022-03-15 21:54:12,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:12,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554680641] [2022-03-15 21:54:12,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:12,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:12,547 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:12,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554680641] [2022-03-15 21:54:12,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554680641] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:12,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458205611] [2022-03-15 21:54:12,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:54:12,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:12,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:12,548 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:54:12,549 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:54:12,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:54:12,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:12,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:54:12,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:13,104 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:13,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:15,504 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:15,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458205611] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:15,504 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:15,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 37 [2022-03-15 21:54:15,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [481332872] [2022-03-15 21:54:15,505 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:15,506 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:15,533 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 99 transitions. [2022-03-15 21:54:15,533 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:16,924 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [6482154#(and (or (<= (+ m t 1) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u))), 6482150#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ U T S) (+ m t s))) (or (< 0 u) (<= (+ U T S) (+ m t s)) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= 1 s))), 6482152#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t) (+ U T S)))), 6482156#(and (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 6482153#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= (+ m t 1) (+ U T S)))), 6482148#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 6482151#(and (or (< 0 u) (<= 1 s) (not (<= t 0))) (or (< 0 u) (<= (+ m s) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m t s))) (or (< 0 u) (<= (+ m t) (+ U T S)))), 6482146#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 6482149#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6482155#(and (or (< 1 u) (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u) (not (< 0 t))) (or (not (< 0 u)) (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m t 1) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (<= (+ m s) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (<= (+ m t 1) (+ U T S)) (< 1 u) (not (< 0 t)))), 6482157#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 6482145#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 6482158#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 6482147#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S))))] [2022-03-15 21:54:16,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 21:54:16,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:16,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 21:54:16,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=2247, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:54:16,925 INFO L87 Difference]: Start difference. First operand 39114 states and 144070 transitions. Second operand has 30 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:18,196 INFO L93 Difference]: Finished difference Result 44619 states and 163895 transitions. [2022-03-15 21:54:18,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 21:54:18,196 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:54:18,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:18,328 INFO L225 Difference]: With dead ends: 44619 [2022-03-15 21:54:18,328 INFO L226 Difference]: Without dead ends: 44608 [2022-03-15 21:54:18,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1777 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1041, Invalid=4659, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 21:54:18,329 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 262 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:18,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 0 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:54:18,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44608 states. [2022-03-15 21:54:19,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44608 to 39112. [2022-03-15 21:54:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39112 states, 39111 states have (on average 3.683465009843778) internal successors, (144064), 39111 states have internal predecessors, (144064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39112 states to 39112 states and 144064 transitions. [2022-03-15 21:54:19,472 INFO L78 Accepts]: Start accepts. Automaton has 39112 states and 144064 transitions. Word has length 27 [2022-03-15 21:54:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:19,472 INFO L470 AbstractCegarLoop]: Abstraction has 39112 states and 144064 transitions. [2022-03-15 21:54:19,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 39112 states and 144064 transitions. [2022-03-15 21:54:19,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:54:19,530 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:19,530 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:19,547 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:54:19,745 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:54:19,746 INFO L402 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:54:19,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:19,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1247057517, now seen corresponding path program 111 times [2022-03-15 21:54:19,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:19,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302916352] [2022-03-15 21:54:19,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:19,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:19,974 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:19,974 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302916352] [2022-03-15 21:54:19,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302916352] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:19,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402743567] [2022-03-15 21:54:19,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:54:19,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:19,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:19,976 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:54:19,976 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:54:19,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 21:54:19,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:19,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 21:54:19,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:20,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:22,502 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402743567] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:22,502 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:22,502 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 37 [2022-03-15 21:54:22,502 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [895390101] [2022-03-15 21:54:22,502 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:22,503 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:22,509 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 104 transitions. [2022-03-15 21:54:22,510 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:24,205 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [6605250#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= (+ U T S) (+ m u t s)))), 6605246#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u s))) (or (<= t 0) (< 0 u))), 6605255#(and (or (not (< 0 t)) (<= (+ m s 1) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 1 s)) (<= (+ m s 1) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 1 s)))), 6605244#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 6605251#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ m t s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s)))), 6605243#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 6605254#(and (or (<= (+ m t s) (+ U T S)) (< 1 u)) (or (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (< 1 u)) (or (<= 1 s) (< 1 u))), 6605249#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (< 0 t)) (or (< 0 u) (not (<= s 0)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6605256#(and (or (< 1 u) (not (< 0 t)) (<= (+ U T S 1) (+ m u t s))) (or (<= 1 s) (not (< 0 u)) (< 1 u)) (or (not (< 0 u)) (< 1 u) (<= (+ U T S 1) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (<= (+ m t s) (+ U T S)) (< 1 u) (not (< 0 t)))), 6605253#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ m t s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m u t s))) (or (< 0 u) (<= 1 s))), 6605248#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6605257#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 t)) (<= (+ m s 1) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t))), 6605247#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 6605245#(and (or (< 0 u) (<= (+ m s) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (not (<= s 0)))), 6605252#(and (or (not (< 0 t)) (<= (+ m s 1) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ m s 1) (+ U S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))))] [2022-03-15 21:54:24,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 21:54:24,205 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:24,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 21:54:24,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=2289, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 21:54:24,206 INFO L87 Difference]: Start difference. First operand 39112 states and 144064 transitions. Second operand has 31 states, 30 states have (on average 2.5) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:25,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:25,570 INFO L93 Difference]: Finished difference Result 43315 states and 158510 transitions. [2022-03-15 21:54:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 21:54:25,570 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.5) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:54:25,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:25,705 INFO L225 Difference]: With dead ends: 43315 [2022-03-15 21:54:25,705 INFO L226 Difference]: Without dead ends: 43253 [2022-03-15 21:54:25,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1813 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1154, Invalid=4396, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 21:54:25,706 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 312 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:25,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 0 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:54:25,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43253 states. [2022-03-15 21:54:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43253 to 39383. [2022-03-15 21:54:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39383 states, 39382 states have (on average 3.674978416535473) internal successors, (144728), 39382 states have internal predecessors, (144728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:26,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39383 states to 39383 states and 144728 transitions. [2022-03-15 21:54:26,756 INFO L78 Accepts]: Start accepts. Automaton has 39383 states and 144728 transitions. Word has length 27 [2022-03-15 21:54:26,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:26,756 INFO L470 AbstractCegarLoop]: Abstraction has 39383 states and 144728 transitions. [2022-03-15 21:54:26,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.5) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:26,756 INFO L276 IsEmpty]: Start isEmpty. Operand 39383 states and 144728 transitions. [2022-03-15 21:54:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:54:26,816 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:26,816 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:26,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Ended with exit code 0 [2022-03-15 21:54:27,031 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:54:27,031 INFO L402 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:54:27,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:27,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1284528723, now seen corresponding path program 112 times [2022-03-15 21:54:27,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:27,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524885012] [2022-03-15 21:54:27,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:27,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:27,282 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:27,282 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:27,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524885012] [2022-03-15 21:54:27,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524885012] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:27,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430615669] [2022-03-15 21:54:27,282 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:54:27,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:27,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:27,283 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:54:27,284 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:54:27,304 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:54:27,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:27,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:54:27,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:28,121 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:28,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:29,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430615669] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:29,295 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:29,295 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2022-03-15 21:54:29,295 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1782826792] [2022-03-15 21:54:29,295 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:29,296 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:29,302 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 101 transitions. [2022-03-15 21:54:29,302 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:31,333 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [6727588#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 6727580#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 6727583#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ U T S) (+ m u t s)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u s)) (< 0 t))), 6727578#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 6727586#(and (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 6727577#(and (<= t 0) (<= u 0) (<= (+ U T S) (+ m u s)) (or (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S))) (or (<= (+ m s) (+ U T S)) (<= (+ U T S) (+ m u t s)))), 6727587#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 6727584#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ U T S) (+ m u t s)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u s)) (< 0 t))), 6727581#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6727582#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6727579#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 6727585#(and (or (<= (+ U T S) (+ m u s)) (not (< 0 s)) (<= (+ 2 m) (+ U T S))) (or (<= (+ U T S) (+ m u s)) (<= (+ U T S) (+ m u t s))) (or (<= (+ m s) (+ U T S)) (<= (+ 2 m) (+ U T S))) (or (<= (+ m s) (+ U T S)) (<= (+ U T S) (+ m u t s))) (or (<= (+ U T S) (+ m u s)) (<= (+ m 1) (+ U T S)))), 6727589#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S))))] [2022-03-15 21:54:31,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:54:31,333 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:31,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:54:31,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=2243, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 21:54:31,334 INFO L87 Difference]: Start difference. First operand 39383 states and 144728 transitions. Second operand has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 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:54:32,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:32,718 INFO L93 Difference]: Finished difference Result 41987 states and 153254 transitions. [2022-03-15 21:54:32,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 21:54:32,718 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 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 27 [2022-03-15 21:54:32,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:32,832 INFO L225 Difference]: With dead ends: 41987 [2022-03-15 21:54:32,833 INFO L226 Difference]: Without dead ends: 41972 [2022-03-15 21:54:32,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1067, Invalid=4189, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 21:54:32,833 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 290 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:32,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 0 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:54:32,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41972 states. [2022-03-15 21:54:33,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41972 to 39391. [2022-03-15 21:54:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39391 states, 39390 states have (on average 3.674841330286875) internal successors, (144752), 39390 states have internal predecessors, (144752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39391 states to 39391 states and 144752 transitions. [2022-03-15 21:54:33,794 INFO L78 Accepts]: Start accepts. Automaton has 39391 states and 144752 transitions. Word has length 27 [2022-03-15 21:54:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:33,794 INFO L470 AbstractCegarLoop]: Abstraction has 39391 states and 144752 transitions. [2022-03-15 21:54:33,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 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:54:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 39391 states and 144752 transitions. [2022-03-15 21:54:33,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:54:33,856 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:33,857 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:33,873 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:54:34,072 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:54:34,073 INFO L402 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:54:34,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:34,073 INFO L85 PathProgramCache]: Analyzing trace with hash 848084455, now seen corresponding path program 113 times [2022-03-15 21:54:34,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:34,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656689643] [2022-03-15 21:54:34,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:34,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:34,323 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:34,323 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656689643] [2022-03-15 21:54:34,323 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656689643] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:34,323 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733674362] [2022-03-15 21:54:34,323 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:54:34,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:34,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:34,324 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:54:34,325 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:54:34,348 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 21:54:34,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:34,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:54:34,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:35,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:38,547 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:38,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733674362] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:38,547 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:38,547 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2022-03-15 21:54:38,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1306682276] [2022-03-15 21:54:38,547 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:38,548 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:38,554 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 87 transitions. [2022-03-15 21:54:38,554 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:39,490 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [6848596#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 6848593#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 6848600#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 6848597#(and (or (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (< 1 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6848594#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6848595#(and (or (< 0 u) (<= m (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6848598#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 6848592#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 6848599#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t))))] [2022-03-15 21:54:39,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:54:39,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:39,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:54:39,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=1680, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:54:39,491 INFO L87 Difference]: Start difference. First operand 39391 states and 144752 transitions. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 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:54:40,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:40,503 INFO L93 Difference]: Finished difference Result 45516 states and 162726 transitions. [2022-03-15 21:54:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 21:54:40,503 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:54:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:40,726 INFO L225 Difference]: With dead ends: 45516 [2022-03-15 21:54:40,726 INFO L226 Difference]: Without dead ends: 45501 [2022-03-15 21:54:40,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=810, Invalid=3350, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 21:54:40,727 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 166 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:40,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 0 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:54:40,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45501 states. [2022-03-15 21:54:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45501 to 39387. [2022-03-15 21:54:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39387 states, 39386 states have (on average 3.6749098664500077) internal successors, (144740), 39386 states have internal predecessors, (144740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39387 states to 39387 states and 144740 transitions. [2022-03-15 21:54:41,714 INFO L78 Accepts]: Start accepts. Automaton has 39387 states and 144740 transitions. Word has length 27 [2022-03-15 21:54:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:41,714 INFO L470 AbstractCegarLoop]: Abstraction has 39387 states and 144740 transitions. [2022-03-15 21:54:41,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 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:54:41,714 INFO L276 IsEmpty]: Start isEmpty. Operand 39387 states and 144740 transitions. [2022-03-15 21:54:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:54:41,770 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:41,770 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:41,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Forceful destruction successful, exit code 0 [2022-03-15 21:54:41,982 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:54:41,982 INFO L402 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:54:41,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:41,984 INFO L85 PathProgramCache]: Analyzing trace with hash -327094619, now seen corresponding path program 114 times [2022-03-15 21:54:41,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:41,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343556579] [2022-03-15 21:54:41,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:41,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:42,353 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:42,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343556579] [2022-03-15 21:54:42,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343556579] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:42,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752568353] [2022-03-15 21:54:42,354 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:54:42,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:42,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:42,355 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:54:42,356 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:54:42,377 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 21:54:42,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:54:42,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:54:42,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:43,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:47,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752568353] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:47,394 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:47,394 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 34 [2022-03-15 21:54:47,394 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [882513788] [2022-03-15 21:54:47,394 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:47,396 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:47,403 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 123 transitions. [2022-03-15 21:54:47,403 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:54:50,219 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [6973130#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 6973134#(and (or (<= (+ m 1) (+ U T S)) (< 1 u) (< 0 t)) (or (<= 1 s) (< 1 u)) (or (< 1 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6973126#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 6973122#(and (or (<= 0 s) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= s 1) (<= (+ 2 m) (+ U T S)) (< 0 t)) (or (not (<= t 0)) (<= (+ m 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= s 1) (<= (+ U T S) (+ m u t s)) (< 0 t)) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (<= t 0)) (not (< 0 u))) (or (not (< 0 u)) (<= 0 t)) (or (<= s 1) (<= 0 t))), 6973121#(and (or (not (< 0 s)) (<= 0 t)) (or (not (< 0 s)) (not (<= t 0)) (<= (+ U T S) (+ m u t s))) (or (<= 0 s) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (not (< 0 s)) (not (<= t 0)) (<= (+ m 1) (+ U T S))) (or (not (<= t 0)) (<= (+ m 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (not (< 0 u)) (<= 0 t))), 6973132#(and (or (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (< 1 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6973128#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 6973133#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6973129#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 6973131#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 6973123#(and (or (<= 0 s) (not (< 0 t))) (or (not (<= t 0)) (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= s 1) (<= u 0) (<= (+ 3 m) (+ U T S)) (< 0 t)) (or (<= s 2) (<= (+ U T S) (+ m u t s)) (< 0 t)) (or (<= s 2) (<= (+ 3 m) (+ U T S)) (< 0 t)) (or (not (<= t 0)) (<= (+ m 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= s 2) (<= 0 t)) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (<= t 0)) (not (< 0 u))) (or (not (< 0 u)) (<= 0 t))), 6973124#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 6973125#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 6973127#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s))))] [2022-03-15 21:54:50,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 21:54:50,219 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:54:50,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 21:54:50,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=1915, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:54:50,220 INFO L87 Difference]: Start difference. First operand 39387 states and 144740 transitions. Second operand has 29 states, 28 states have (on average 2.75) internal successors, (77), 28 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:54:52,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:54:52,525 INFO L93 Difference]: Finished difference Result 53134 states and 189573 transitions. [2022-03-15 21:54:52,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 21:54:52,525 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.75) internal successors, (77), 28 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 27 [2022-03-15 21:54:52,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:54:52,684 INFO L225 Difference]: With dead ends: 53134 [2022-03-15 21:54:52,684 INFO L226 Difference]: Without dead ends: 53119 [2022-03-15 21:54:52,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2972 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1740, Invalid=6092, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 21:54:52,685 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 369 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:54:52,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 0 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:54:52,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53119 states. [2022-03-15 21:54:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53119 to 39811. [2022-03-15 21:54:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39811 states, 39810 states have (on average 3.6744034162270784) internal successors, (146278), 39810 states have internal predecessors, (146278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:54:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39811 states to 39811 states and 146278 transitions. [2022-03-15 21:54:53,849 INFO L78 Accepts]: Start accepts. Automaton has 39811 states and 146278 transitions. Word has length 27 [2022-03-15 21:54:53,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:54:53,849 INFO L470 AbstractCegarLoop]: Abstraction has 39811 states and 146278 transitions. [2022-03-15 21:54:53,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.75) internal successors, (77), 28 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:54:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 39811 states and 146278 transitions. [2022-03-15 21:54:53,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:54:53,913 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:54:53,914 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:54:53,932 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:54:54,127 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:54:54,127 INFO L402 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:54:54,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:54:54,128 INFO L85 PathProgramCache]: Analyzing trace with hash 693003429, now seen corresponding path program 115 times [2022-03-15 21:54:54,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:54:54,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431825748] [2022-03-15 21:54:54,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:54:54,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:54:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:54,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:54:54,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431825748] [2022-03-15 21:54:54,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431825748] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:54:54,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149050751] [2022-03-15 21:54:54,459 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:54:54,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:54:54,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:54:54,460 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:54:54,460 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:54:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:54:54,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:54:54,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:54:55,588 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:55,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:54:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:54:58,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149050751] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:54:58,384 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:54:58,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 40 [2022-03-15 21:54:58,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [627641887] [2022-03-15 21:54:58,384 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:54:58,385 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:54:58,392 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 120 transitions. [2022-03-15 21:54:58,392 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:55:00,969 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [7106169#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 7106178#(and (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 7106172#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 7106175#(and (or (<= 2 t) (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 t)) (or (<= 2 t) (< 0 u) (<= (+ U T S) (+ m s 1))) (or (< 0 u) (<= 0 s))), 7106176#(and (or (< 1 u) (<= 0 s)) (or (<= 2 t) (<= (+ U T S) (+ m s 1)) (< 1 u)) (or (<= 2 t) (<= (+ m 1) (+ U T S)) (< 1 u)) (or (<= 1 t) (< 1 u))), 7106177#(and (or (not (< 0 u)) (< 1 u) (<= 0 s)) (or (<= 1 t) (<= (+ m 1) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (<= (+ U T S) (+ m s 1)) (<= 1 t) (not (< 0 u)) (< 1 u)) (or (not (< 0 u)) (< 1 u) (<= 0 t))), 7106179#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 7106171#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 7106167#(and (or (not (< 0 s)) (<= 0 t)) (or (not (< 0 s)) (not (<= t 0)) (<= (+ U T S) (+ m u t s))) (or (<= u 0) (<= 0 s)) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (<= t 0))) (or (not (<= t 0)) (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= 1 s) (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (<= (+ m s 1) (+ U T S)) (not (<= t 0)) (not (< 0 u))) (or (<= 1 s) (<= (+ U T S) (+ m u s)) (not (< 0 t))) (or (not (< 0 u)) (<= 0 t))), 7106173#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 7106168#(and (or (not (< 1 s)) (not (<= t 0)) (<= (+ 3 m) (+ U T S))) (or (<= 2 s) (<= (+ m s 1) (+ U T S)) (not (< 0 t))) (or (not (< 1 s)) (not (<= t 0)) (<= (+ U T S) (+ m u t s))) (or (<= (+ U T S) (+ m u s)) (<= 2 s) (not (< 0 t))) (or (<= u 0) (<= 0 s)) (or (not (< 1 s)) (<= 0 t)) (or (not (<= t 0)) (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= (+ m s 1) (+ U T S)) (not (<= t 0)) (not (< 0 u)) (<= (+ 3 m) (+ U T S))) (or (not (< 0 u)) (<= 0 t))), 7106170#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 7106174#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= 1 s)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 7106180#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t))))] [2022-03-15 21:55:00,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 21:55:00,969 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:55:00,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 21:55:00,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=2588, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 21:55:00,970 INFO L87 Difference]: Start difference. First operand 39811 states and 146278 transitions. Second operand has 29 states, 28 states have (on average 2.75) internal successors, (77), 28 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:55:03,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:55:03,629 INFO L93 Difference]: Finished difference Result 51342 states and 182333 transitions. [2022-03-15 21:55:03,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 21:55:03,629 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.75) internal successors, (77), 28 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 27 [2022-03-15 21:55:03,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:55:03,885 INFO L225 Difference]: With dead ends: 51342 [2022-03-15 21:55:03,885 INFO L226 Difference]: Without dead ends: 51327 [2022-03-15 21:55:03,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 42 SyntacticMatches, 11 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3590 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1618, Invalid=7888, Unknown=0, NotChecked=0, Total=9506 [2022-03-15 21:55:03,886 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 299 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:55:03,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 0 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:55:03,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51327 states. [2022-03-15 21:55:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51327 to 39883. [2022-03-15 21:55:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39883 states, 39882 states have (on average 3.6738378215736422) internal successors, (146520), 39882 states have internal predecessors, (146520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39883 states to 39883 states and 146520 transitions. [2022-03-15 21:55:05,095 INFO L78 Accepts]: Start accepts. Automaton has 39883 states and 146520 transitions. Word has length 27 [2022-03-15 21:55:05,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:55:05,095 INFO L470 AbstractCegarLoop]: Abstraction has 39883 states and 146520 transitions. [2022-03-15 21:55:05,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.75) internal successors, (77), 28 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:55:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 39883 states and 146520 transitions. [2022-03-15 21:55:05,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:55:05,154 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:55:05,154 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:55:05,171 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:55:05,372 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:55:05,372 INFO L402 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:55:05,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:55:05,373 INFO L85 PathProgramCache]: Analyzing trace with hash 681267813, now seen corresponding path program 116 times [2022-03-15 21:55:05,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:55:05,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417697435] [2022-03-15 21:55:05,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:55:05,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:55:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:55:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:05,659 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:55:05,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417697435] [2022-03-15 21:55:05,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417697435] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:55:05,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871419853] [2022-03-15 21:55:05,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:55:05,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:55:05,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:55:05,660 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:55:05,661 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:55:05,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:55:05,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:55:05,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:55:05,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:55:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:06,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:55:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:07,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871419853] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:55:07,611 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:55:07,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 37 [2022-03-15 21:55:07,612 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1576044761] [2022-03-15 21:55:07,612 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:55:07,613 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:55:07,620 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 123 transitions. [2022-03-15 21:55:07,620 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:55:09,387 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [7237572#(and (or (not (< 0 t)) (<= (+ m s 1) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ m s 1) (+ U S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 7237581#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= 3 s)) (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= 3 s)) (or (< 0 u) (<= 1 s)) (or (<= t 0) (< 0 u))), 7237568#(and (or (not (< 0 s)) (<= 0 t)) (or (<= 2 s) (<= (+ m s 1) (+ U T S)) (not (<= t 0)) (not (< 0 u))) (or (<= 2 s) (not (< 0 s)) (<= (+ m s 1) (+ U T S)) (not (<= t 0))) (or (<= 2 s) (not (<= t 0)) (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= 2 s) (not (< 0 s)) (not (<= t 0)) (<= (+ U T S) (+ m u t s))) (or (<= u 0) (<= 0 s) (< 0 t)) (or (not (< 0 u)) (<= 0 t))), 7237573#(and (or (not (< 0 t)) (<= (+ m s 1) (+ U S))) (or (<= s 1) (<= (+ m s 1) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 u)) (<= 0 s))), 7237578#(and (or (< 0 u) (not (<= s 0))) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= 2 s)) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)))), 7237570#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 7237576#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)) (< 0 t)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= 2 s) (< 0 t)) (or (< 0 u) (not (<= s 0)) (< 0 t))), 7237580#(and (or (<= (+ m s) (+ U T S)) (<= 2 s) (< 1 u) (< 0 t)) (or (<= (+ U T S 1) (+ m u s)) (<= 2 s) (< 1 u) (< 0 t))), 7237574#(and (or (<= 1 s) (not (< 0 t))) (or (not (< 0 t)) (<= (+ m s 1) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t))), 7237575#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 7237571#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 7237579#(and (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= 2 s)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= 2 s)) (or (<= t 0) (< 0 u))), 7237569#(and (or (<= s 1) (<= 3 s) (<= (+ U T S) (+ m u t s)) (< 0 t)) (or (<= (+ m s 1) (+ U T S)) (<= 3 s) (not (<= t 0)) (not (< 0 u))) (or (<= s 1) (<= (+ m s 1) (+ U T S)) (<= 3 s) (< 0 t)) (or (<= u 0) (<= 0 s) (< 0 t)) (or (<= 3 s) (not (<= t 0)) (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (not (< 0 u)) (<= 0 t)) (or (<= s 1) (<= 0 t))), 7237494#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 7237582#(and (or (< 0 u) (<= (+ m s) (+ U T S)) (<= 1 t) (<= 3 s)) (or (< 0 u) (<= 1 s) (<= 1 t)) (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= 1 t) (<= 3 s))), 7237583#(and (or (<= 1 s) (<= 1 t) (< 1 u)) (or (<= (+ U T S 1) (+ m u s)) (<= 1 t) (<= 3 s) (< 1 u)) (or (<= (+ m s) (+ U T S)) (<= 1 t) (<= 3 s) (< 1 u))), 7237577#(and (or (< 0 u) (<= (+ U T S) (+ m u s)) (<= 2 s) (< 0 t)) (or (< 0 u) (<= (+ m s) (+ U T S)) (<= 2 s) (< 0 t)))] [2022-03-15 21:55:09,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 21:55:09,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:55:09,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 21:55:09,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=610, Invalid=2360, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 21:55:09,388 INFO L87 Difference]: Start difference. First operand 39883 states and 146520 transitions. Second operand has 33 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:13,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:55:13,064 INFO L93 Difference]: Finished difference Result 65393 states and 231957 transitions. [2022-03-15 21:55:13,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-03-15 21:55:13,064 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have 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:55:13,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:55:13,284 INFO L225 Difference]: With dead ends: 65393 [2022-03-15 21:55:13,284 INFO L226 Difference]: Without dead ends: 65363 [2022-03-15 21:55:13,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5514 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2963, Invalid=12043, Unknown=0, NotChecked=0, Total=15006 [2022-03-15 21:55:13,285 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 348 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:55:13,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 0 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:55:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65363 states. [2022-03-15 21:55:14,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65363 to 40037. [2022-03-15 21:55:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40037 states, 40036 states have (on average 3.6731441702467778) internal successors, (147058), 40036 states have internal predecessors, (147058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40037 states to 40037 states and 147058 transitions. [2022-03-15 21:55:14,817 INFO L78 Accepts]: Start accepts. Automaton has 40037 states and 147058 transitions. Word has length 27 [2022-03-15 21:55:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:55:14,817 INFO L470 AbstractCegarLoop]: Abstraction has 40037 states and 147058 transitions. [2022-03-15 21:55:14,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 40037 states and 147058 transitions. [2022-03-15 21:55:14,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:55:14,879 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:55:14,879 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:55:14,896 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:55:15,095 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:55:15,095 INFO L402 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:55:15,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:55:15,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1207093213, now seen corresponding path program 117 times [2022-03-15 21:55:15,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:55:15,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478433467] [2022-03-15 21:55:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:55:15,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:55:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:55:15,440 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:15,441 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:55:15,441 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478433467] [2022-03-15 21:55:15,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478433467] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:55:15,441 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955373761] [2022-03-15 21:55:15,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:55:15,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:55:15,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:55:15,442 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:55:15,443 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:55:15,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 21:55:15,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:55:15,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:55:15,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:55:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:16,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:55:19,554 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:19,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955373761] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:55:19,554 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:55:19,554 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2022-03-15 21:55:19,554 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1495014372] [2022-03-15 21:55:19,554 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:55:19,555 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:55:19,562 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 118 transitions. [2022-03-15 21:55:19,562 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:55:22,069 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [7383379#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 7383382#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 7383384#(and (or (<= (+ U T S) m) (< 1 u) (< 0 s) (< 0 t)) (or (< m (+ U T S 1)) (< 1 u) (< 0 s) (< 0 t))), 7383305#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 7383381#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 7383390#(and (or (<= 2 t) (<= (+ m 1) (+ U T S))) (or (<= 1 s) (< 0 t)) (or (<= (+ U T S) (+ m u s)) (< 0 t)) (<= 0 s) (or (<= 2 t) (<= (+ U T S) (+ m u s 1)))), 7383383#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 7383387#(and (or (<= 2 s) (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= t 0) (<= (+ m 1) (+ U T S)) (< 0 s)) (or (<= s 1) (<= (+ U T S) (+ m u s)) (< 0 t)) (or (<= u 0) (<= 0 s)) (or (<= (+ U T S) (+ m u 1)) (<= 2 s) (not (< 0 u))) (or (<= u 0) (<= (+ m 1) (+ U T S)) (< 0 s)) (or (<= t 0) (<= (+ U T S) (+ m u)) (< 0 s)) (or (<= (+ U T S) (+ m u 1)) (<= 2 s) (not (< 0 t))) (or (<= u 0) (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (< 0 t)) (or (<= u 0) (<= (+ U T S) (+ m u)) (< 0 s)) (or (<= s 1) (<= (+ 3 m) (+ U T S)) (< 0 t)) (or (not (< 0 u)) (<= 0 t)) (or (<= s 1) (<= 0 t))), 7383385#(and (or (<= 1 t) (<= (+ m 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U T S) (+ m u s)) (<= 1 t) (not (< 0 u))) (or (not (< 0 u)) (<= 0 t))), 7383378#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 7383389#(and (or (< 0 u) (< 1 t) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m s 1)) (< 1 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 7383386#(and (or (not (< 0 s)) (<= 0 t)) (or (<= 1 s) (<= (+ U T S) (+ m u)) (not (< 0 u))) (or (<= u 0) (<= 0 s)) (or (<= 1 s) (<= (+ U T S) (+ m u)) (not (< 0 t))) (or (<= u 0) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (<= 1 s) (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (<= s 0) (< 0 t)) (or (<= (+ U T S) (+ m u s)) (<= s 0) (< 0 t)) (or (not (< 0 u)) (<= 0 t))), 7383388#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 7383380#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (<= (+ m 1) (+ U S)) (not (< 0 t))))] [2022-03-15 21:55:22,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:55:22,070 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:55:22,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:55:22,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=1786, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 21:55:22,070 INFO L87 Difference]: Start difference. First operand 40037 states and 147058 transitions. Second operand has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:25,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:55:25,002 INFO L93 Difference]: Finished difference Result 71306 states and 245966 transitions. [2022-03-15 21:55:25,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 21:55:25,003 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:55:25,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:55:25,348 INFO L225 Difference]: With dead ends: 71306 [2022-03-15 21:55:25,348 INFO L226 Difference]: Without dead ends: 71291 [2022-03-15 21:55:25,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3924 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2063, Invalid=7837, Unknown=0, NotChecked=0, Total=9900 [2022-03-15 21:55:25,349 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 369 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:55:25,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 0 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:55:25,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71291 states. [2022-03-15 21:55:26,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71291 to 40518. [2022-03-15 21:55:26,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40518 states, 40517 states have (on average 3.6726312412073945) internal successors, (148804), 40517 states have internal predecessors, (148804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:26,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40518 states to 40518 states and 148804 transitions. [2022-03-15 21:55:26,827 INFO L78 Accepts]: Start accepts. Automaton has 40518 states and 148804 transitions. Word has length 27 [2022-03-15 21:55:26,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:55:26,843 INFO L470 AbstractCegarLoop]: Abstraction has 40518 states and 148804 transitions. [2022-03-15 21:55:26,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 40518 states and 148804 transitions. [2022-03-15 21:55:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:55:26,912 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:55:26,912 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:55:26,928 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:55:27,128 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:55:27,128 INFO L402 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:55:27,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:55:27,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1189383271, now seen corresponding path program 118 times [2022-03-15 21:55:27,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:55:27,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553842542] [2022-03-15 21:55:27,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:55:27,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:55:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:55:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:27,422 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:55:27,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553842542] [2022-03-15 21:55:27,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553842542] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:55:27,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858478728] [2022-03-15 21:55:27,422 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:55:27,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:55:27,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:55:27,423 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:55:27,424 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:55:27,442 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:55:27,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:55:27,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 21:55:27,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:55:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:28,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:55:31,248 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:31,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858478728] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:55:31,248 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:55:31,248 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2022-03-15 21:55:31,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [912493688] [2022-03-15 21:55:31,248 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:55:31,249 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:55:31,256 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 105 transitions. [2022-03-15 21:55:31,256 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:55:33,693 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [7536038#(and (or (not (< 0 s)) (<= 0 t)) (or (not (< 0 s)) (not (<= t 0)) (<= (+ U T S) (+ m u t s))) (or (<= u 0) (<= 0 s)) (or (not (<= t 0)) (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= u 0) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (<= 1 s) (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (<= s 0) (< 0 t)) (or (<= 1 s) (<= (+ U T S) (+ m u s)) (not (< 0 t))) (or (not (< 0 u)) (<= 0 t))), 7536035#(and (or (< m (+ U T S 1)) (< 1 u) (< 0 t)) (or (<= (+ U T S) m) (< 1 u) (<= (+ U T S) (+ m s)) (< 0 t))), 7536030#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 7536034#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 7536040#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 7536032#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 7536036#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 7536031#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 7536039#(and (or (<= 2 s) (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= t 0) (<= (+ m 1) (+ U T S)) (< 0 s)) (or (<= (+ U T S) (+ m u s)) (<= 2 s) (not (< 0 t))) (or (<= u 0) (<= 0 s)) (or (not (<= t 0)) (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= u 0) (<= (+ m 1) (+ U T S)) (< 0 s)) (or (<= u 0) (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (< 0 t)) (or (<= s 1) (<= (+ U T S) (+ m u t s)) (< 0 t)) (or (<= s 1) (<= (+ 3 m) (+ U T S)) (< 0 t)) (or (not (< 0 u)) (<= 0 t)) (or (<= s 1) (<= 0 t))), 7536037#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 7536033#(and (or (< 0 u) (<= m (+ U T S)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0) (< 0 t)))] [2022-03-15 21:55:33,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 21:55:33,693 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:55:33,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 21:55:33,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=1855, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 21:55:33,694 INFO L87 Difference]: Start difference. First operand 40518 states and 148804 transitions. Second operand has 25 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 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:55:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:55:35,563 INFO L93 Difference]: Finished difference Result 47372 states and 169092 transitions. [2022-03-15 21:55:35,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 21:55:35,563 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 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 27 [2022-03-15 21:55:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:55:35,700 INFO L225 Difference]: With dead ends: 47372 [2022-03-15 21:55:35,700 INFO L226 Difference]: Without dead ends: 47357 [2022-03-15 21:55:35,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2286 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1069, Invalid=4783, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 21:55:35,701 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 241 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:55:35,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 0 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:55:35,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47357 states. [2022-03-15 21:55:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47357 to 40524. [2022-03-15 21:55:36,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40524 states, 40523 states have (on average 3.672531648693335) internal successors, (148822), 40523 states have internal predecessors, (148822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40524 states to 40524 states and 148822 transitions. [2022-03-15 21:55:36,813 INFO L78 Accepts]: Start accepts. Automaton has 40524 states and 148822 transitions. Word has length 27 [2022-03-15 21:55:36,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:55:36,813 INFO L470 AbstractCegarLoop]: Abstraction has 40524 states and 148822 transitions. [2022-03-15 21:55:36,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 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:55:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 40524 states and 148822 transitions. [2022-03-15 21:55:36,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:55:36,873 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:55:36,873 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:55:36,890 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:55:37,087 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:55:37,087 INFO L402 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:55:37,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:55:37,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1311915017, now seen corresponding path program 119 times [2022-03-15 21:55:37,089 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:55:37,089 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209781713] [2022-03-15 21:55:37,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:55:37,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:55:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:55:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:37,329 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:55:37,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209781713] [2022-03-15 21:55:37,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209781713] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:55:37,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090151623] [2022-03-15 21:55:37,330 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:55:37,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:55:37,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:55:37,331 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:55:37,331 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:55:37,358 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 21:55:37,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:55:37,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:55:37,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:55:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:38,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:55:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:40,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090151623] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:55:40,632 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:55:40,632 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-03-15 21:55:40,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [25757539] [2022-03-15 21:55:40,633 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:55:40,634 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:55:40,640 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 106 transitions. [2022-03-15 21:55:40,640 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:55:42,625 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [7664717#(and (or (<= 1 s) (< m (+ U T S 1))) (or (<= (+ U T S) (+ m 1)) (<= (+ U T S) (+ m u s)) (<= 2 s)) (or (< m (+ U T S)) (<= 2 s) (not (< 0 s))) (<= 0 s) (or (<= (+ U T S) m) (<= 1 s) (<= (+ U T S) (+ m u s)))), 7664718#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 7664720#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 s) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 s) (< 0 t))), 7664723#(and (or (<= (+ U T S) m) (<= 1 s) (< 1 u)) (or (<= 1 s) (< m (+ U T S 1)) (< 1 u))), 7664714#(and (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 7664722#(and (or (<= 1 s) (< m (+ U T S 1))) (or (< m (+ U T S)) (<= 2 s) (not (< 0 s))) (or (<= (+ U T S) (+ m 1)) (<= (+ U T S 1) (+ m u s)) (<= 2 s)) (or (<= (+ U T S) m) (<= 1 s) (<= (+ U T S 1) (+ m u s))) (<= 0 s)), 7664712#(and (or (not (< 0 s)) (<= 0 t)) (or (<= 1 s) (<= (+ U T S) (+ m u s)) (not (< 0 u))) (or (<= u 0) (<= 0 s)) (or (<= 1 s) (<= (+ m 1) (+ U T S)) (not (< 0 u))) (or (<= 1 s) (<= (+ m 1) (+ U T S)) (not (< 0 t))) (or (<= 1 s) (<= (+ U T S) (+ m u s)) (not (< 0 t))) (or (not (< 0 u)) (<= 0 t))), 7664721#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 7664719#(and (or (<= 1 s) (not (< 0 t))) (or (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t))), 7664715#(and (or (not (< 0 s)) (<= (+ 3 m) (+ U T S)) (not (< 0 t))) (or (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= 0 s) (not (< 0 t))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= 1 T)) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 t)))), 7664716#(and (or (<= 1 s) (< m (+ U T S 1))) (or (<= 2 s) (<= (+ U T S) (+ m s))) (or (< m (+ U T S)) (<= 2 s) (not (< 0 s)))), 7664713#(and (or (<= 2 s) (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 t))) (or (<= t 0) (<= (+ m 1) (+ U T S)) (< 0 s)) (or (<= (+ U T S) (+ m u s)) (<= 2 s) (not (< 0 t))) (or (<= u 0) (<= 0 s)) (or (<= u 0) (<= (+ m 1) (+ U T S)) (< 0 s)) (or (<= (+ U T S) (+ m u s)) (<= 2 s) (not (< 0 u))) (or (not (< 0 u)) (<= 0 t)) (or (<= s 1) (<= 0 t)) (or (<= 2 s) (not (< 0 s)) (<= (+ 2 m) (+ U T S)) (not (< 0 u)))), 7664711#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u)))] [2022-03-15 21:55:42,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:55:42,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:55:42,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:55:42,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=1896, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 21:55:42,626 INFO L87 Difference]: Start difference. First operand 40524 states and 148822 transitions. Second operand has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 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:55:44,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:55:44,418 INFO L93 Difference]: Finished difference Result 57449 states and 206131 transitions. [2022-03-15 21:55:44,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 21:55:44,419 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 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 27 [2022-03-15 21:55:44,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:55:44,604 INFO L225 Difference]: With dead ends: 57449 [2022-03-15 21:55:44,604 INFO L226 Difference]: Without dead ends: 57434 [2022-03-15 21:55:44,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 42 SyntacticMatches, 11 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2552 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1621, Invalid=5861, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 21:55:44,605 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 301 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:55:44,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 0 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:55:44,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57434 states. [2022-03-15 21:55:45,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57434 to 40540. [2022-03-15 21:55:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40540 states, 40539 states have (on average 3.6721182071585385) internal successors, (148864), 40539 states have internal predecessors, (148864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40540 states to 40540 states and 148864 transitions. [2022-03-15 21:55:45,968 INFO L78 Accepts]: Start accepts. Automaton has 40540 states and 148864 transitions. Word has length 27 [2022-03-15 21:55:45,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:55:45,968 INFO L470 AbstractCegarLoop]: Abstraction has 40540 states and 148864 transitions. [2022-03-15 21:55:45,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 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:55:45,969 INFO L276 IsEmpty]: Start isEmpty. Operand 40540 states and 148864 transitions. [2022-03-15 21:55:46,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:55:46,027 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:55:46,028 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:55:46,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Ended with exit code 0 [2022-03-15 21:55:46,243 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:55:46,243 INFO L402 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:55:46,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:55:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1754684069, now seen corresponding path program 120 times [2022-03-15 21:55:46,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:55:46,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380130095] [2022-03-15 21:55:46,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:55:46,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:55:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:55:46,534 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:46,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:55:46,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380130095] [2022-03-15 21:55:46,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380130095] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:55:46,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704985249] [2022-03-15 21:55:46,534 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:55:46,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:55:46,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:55:46,535 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:55:46,536 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:55:46,558 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 21:55:46,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:55:46,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 21:55:46,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:55:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:47,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:55:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:55:50,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704985249] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:55:50,891 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:55:50,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 34 [2022-03-15 21:55:50,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2058194810] [2022-03-15 21:55:50,891 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:55:50,892 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:55:50,900 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 110 transitions. [2022-03-15 21:55:50,901 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:55:53,321 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [7803530#(and (or (<= 1 s) (<= (+ U T S) (+ m s 1)) (not (< 0 u)) (< 1 u)) (or (not (< 0 u)) (< 1 u) (<= 0 s)) (or (<= (+ U T S) (+ m s 1)) (<= 1 t) (not (< 0 u)) (< 1 u)) (or (<= 1 s) (<= (+ m s 1) (+ U T S)) (not (< 0 u)) (< 1 u)) (or (not (< 0 u)) (< 1 u) (<= 0 t)) (or (<= 1 t) (<= (+ 2 m) (+ U T S)) (<= (+ m s 1) (+ U T S)) (not (< 0 u)) (< 1 u))), 7803524#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 7803523#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 7803448#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 7803532#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 7803522#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 7803521#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 7803527#(and (or (<= 2 t) (< 0 u) (<= (+ U T S) (+ m 1)) (not (<= s 0))) (or (<= 2 t) (< 0 u) (<= (+ m 1) (+ U T S)) (not (<= s 0))) (or (< 0 u) (<= 1 t)) (or (< 0 u) (<= 0 s))), 7803529#(and (or (< 1 u) (<= 0 s)) (or (<= 2 t) (<= (+ 2 m) (+ U T S)) (<= (+ m s 1) (+ U T S)) (< 1 u)) (or (<= 1 s) (<= (+ U T S) (+ m s 1)) (< 1 u)) (or (<= 2 t) (<= (+ U T S) (+ m s 1)) (< 1 u)) (or (<= 1 s) (<= (+ m s 1) (+ U T S)) (< 1 u)) (or (<= 1 t) (< 1 u))), 7803526#(and (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 1 t) (<= 2 s)) (or (< 0 u) (<= 1 t) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 1 s))), 7803528#(and (or (<= 2 t) (< 0 u) (<= (+ 2 m) (+ U T S)) (<= (+ m s 1) (+ U T S))) (or (< 0 u) (<= 1 t)) (or (< 0 u) (<= 1 s) (<= (+ U T S) (+ m s 1))) (or (<= 2 t) (< 0 u) (<= (+ U T S) (+ m s 1))) (or (< 0 u) (<= 1 s) (<= (+ m s 1) (+ U T S))) (or (< 0 u) (<= 0 s))), 7803531#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 7803525#(and (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 2 s)) (or (< 0 u) (<= 1 s)))] [2022-03-15 21:55:53,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 21:55:53,321 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:55:53,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 21:55:53,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=1781, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 21:55:53,322 INFO L87 Difference]: Start difference. First operand 40540 states and 148864 transitions. Second operand has 28 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 27 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:55:57,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:55:57,594 INFO L93 Difference]: Finished difference Result 82112 states and 288094 transitions. [2022-03-15 21:55:57,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-03-15 21:55:57,595 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 27 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 27 [2022-03-15 21:55:57,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:55:57,861 INFO L225 Difference]: With dead ends: 82112 [2022-03-15 21:55:57,861 INFO L226 Difference]: Without dead ends: 82095 [2022-03-15 21:55:57,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5789 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3345, Invalid=12155, Unknown=0, NotChecked=0, Total=15500 [2022-03-15 21:55:57,862 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 439 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:55:57,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [439 Valid, 0 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 21:55:57,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82095 states. [2022-03-15 21:55:59,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82095 to 40574. [2022-03-15 21:55:59,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40574 states, 40573 states have (on average 3.671604268848742) internal successors, (148968), 40573 states have internal predecessors, (148968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:55:59,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40574 states to 40574 states and 148968 transitions. [2022-03-15 21:55:59,507 INFO L78 Accepts]: Start accepts. Automaton has 40574 states and 148968 transitions. Word has length 27 [2022-03-15 21:55:59,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:55:59,507 INFO L470 AbstractCegarLoop]: Abstraction has 40574 states and 148968 transitions. [2022-03-15 21:55:59,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 27 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:55:59,507 INFO L276 IsEmpty]: Start isEmpty. Operand 40574 states and 148968 transitions. [2022-03-15 21:55:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:55:59,569 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:55:59,569 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:55:59,584 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:55:59,780 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:55:59,781 INFO L402 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:55:59,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:55:59,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1485764223, now seen corresponding path program 121 times [2022-03-15 21:55:59,782 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:55:59,782 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231795481] [2022-03-15 21:55:59,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:55:59,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:55:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:00,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:00,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231795481] [2022-03-15 21:56:00,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231795481] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:56:00,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70403402] [2022-03-15 21:56:00,087 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:56:00,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:00,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:56:00,088 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:56:00,089 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:56:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:00,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:56:00,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:56:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:00,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:56:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:02,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70403402] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:56:02,794 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:56:02,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 42 [2022-03-15 21:56:02,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1252591575] [2022-03-15 21:56:02,794 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:02,795 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:02,802 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 120 transitions. [2022-03-15 21:56:02,802 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:04,642 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [7967161#(and (or (< 0 u) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= s 0)) (or (< 0 u) (<= (+ 2 m) (+ U T S)) (<= s 0))), 7967155#(and (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= s 0) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0) (< 0 t))), 7967154#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 7967148#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 7967151#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)) (< 0 t))), 7967149#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u) (<= (+ U T S) (+ m s)))), 7967152#(and (or (< 0 u) (<= (+ U T S) (+ m s))) (or (< 0 u) (<= (+ m 1) (+ U T S)))), 7967163#(and (or (<= s 1) (<= 1 t)) (or (<= s 1) (<= (+ U T S) (+ m u t s))) (or (<= s 1) (<= (+ 3 m) (+ U T S)))), 7967150#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 7967160#(and (or (<= s 1) (< 0 u) (<= (+ U T S) (+ m u t s))) (or (<= s 1) (< 0 u) (<= (+ 2 m) (+ U T S)))), 7967162#(and (<= u 0) (or (<= s 1) (<= 1 t)) (or (<= s 1) (<= (+ U T S) (+ m u t s))) (or (<= s 1) (<= (+ 3 m) (+ U T S)))), 7967158#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= 1 s) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 7967147#(and (or (not (< 0 u)) (<= (+ U T S) (+ m u t s)) (<= s 0)) (or (not (< 0 u)) (<= 0 t) (<= s 0)) (or (<= (+ 2 m) (+ U T S)) (not (< 0 u)) (<= s 0))), 7967157#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 7967153#(and (or (< 0 u) (<= (+ m 1) (+ U T S)) (<= s 0)) (or (< 0 u) (<= (+ U T S) (+ m u t s)) (<= s 0)) (or (<= t 0) (< 0 u))), 7967159#(and (or (<= s 1) (< 0 u) (<= (+ U T S) (+ m u t s))) (or (<= s 1) (< 0 u) (<= (+ 2 m) (+ U T S))) (or (<= t 0) (< 0 u))), 7967156#(and (or (not (< 0 u)) (<= 1 T)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 u))) (or (= (+ (* (- 1) t) T) 0) (not (< 0 s))) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t))))] [2022-03-15 21:56:04,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 21:56:04,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:04,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 21:56:04,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=3077, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 21:56:04,643 INFO L87 Difference]: Start difference. First operand 40574 states and 148968 transitions. Second operand has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 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:56:06,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:06,478 INFO L93 Difference]: Finished difference Result 46607 states and 165976 transitions. [2022-03-15 21:56:06,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 21:56:06,479 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 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 27 [2022-03-15 21:56:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:06,616 INFO L225 Difference]: With dead ends: 46607 [2022-03-15 21:56:06,616 INFO L226 Difference]: Without dead ends: 46596 [2022-03-15 21:56:06,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 40 SyntacticMatches, 10 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1519, Invalid=6853, Unknown=0, NotChecked=0, Total=8372 [2022-03-15 21:56:06,617 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 340 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:06,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 0 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:56:06,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46596 states. [2022-03-15 21:56:07,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46596 to 40570. [2022-03-15 21:56:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40570 states, 40569 states have (on average 3.6717690847691586) internal successors, (148960), 40569 states have internal predecessors, (148960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40570 states to 40570 states and 148960 transitions. [2022-03-15 21:56:07,741 INFO L78 Accepts]: Start accepts. Automaton has 40570 states and 148960 transitions. Word has length 27 [2022-03-15 21:56:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:07,741 INFO L470 AbstractCegarLoop]: Abstraction has 40570 states and 148960 transitions. [2022-03-15 21:56:07,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 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:56:07,742 INFO L276 IsEmpty]: Start isEmpty. Operand 40570 states and 148960 transitions. [2022-03-15 21:56:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:56:07,804 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:07,804 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:56:07,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Ended with exit code 0 [2022-03-15 21:56:08,019 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:56:08,020 INFO L402 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:56:08,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:08,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1431467969, now seen corresponding path program 122 times [2022-03-15 21:56:08,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:08,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280265934] [2022-03-15 21:56:08,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:08,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:08,423 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:08,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280265934] [2022-03-15 21:56:08,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280265934] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:56:08,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577977271] [2022-03-15 21:56:08,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:56:08,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:08,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:56:08,425 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:56:08,425 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:56:08,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:56:08,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:56:08,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 21:56:08,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:56:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:09,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:56:12,166 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:12,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577977271] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:56:12,166 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:56:12,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 36 [2022-03-15 21:56:12,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [407946095] [2022-03-15 21:56:12,166 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:12,167 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:12,174 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 106 transitions. [2022-03-15 21:56:12,174 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:14,372 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [8095177#(and (or (<= 1 t) (<= (+ U T S) (+ 2 m u))) (or (<= (+ U T S) (+ 2 m u)) (<= (+ U T S) (+ m u t s))) (<= (+ m 1) (+ U T S)) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S))) (<= 0 s) (or (<= (+ U T S) (+ m u 1)) (<= (+ U T S) (+ m u t s)) (< 0 s))), 8095171#(and (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)))), 8095169#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 8095172#(and (or (< 0 u) (<= 2 s) (<= (+ U T S) (+ m s)) (< 0 t)) (or (< 0 u) (<= (+ m 1) (+ U T S)) (< 0 t))), 8095093#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 8095178#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 8095175#(and (or (<= s 1) (= T t)) (or (not (< 0 s)) (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 8095168#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 8095176#(and (<= u 0) (or (<= 1 t) (<= (+ U T S) (+ 2 m u))) (or (<= (+ U T S) (+ 2 m u)) (<= (+ U T S) (+ m u t s))) (<= (+ m 1) (+ U T S)) (or (not (< 0 s)) (<= (+ 2 m) (+ U T S))) (<= 0 s) (or (<= (+ U T S) (+ m u 1)) (<= (+ U T S) (+ m u t s)) (< 0 s))), 8095167#(and (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s))) (or (<= (+ m 1) (+ U S)) (not (< 0 t)))), 8095170#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 8095174#(and (or (<= 1 s) (<= (+ U T S) (+ m u s)) (not (< 0 u))) (or (not (< 0 u)) (<= (+ U T S) (+ m u t s))) (or (<= u 0) (<= 0 s)) (or (<= (+ 2 m) (+ U T S)) (<= (+ m s 1) (+ U T S)) (not (< 0 u))) (or (not (< 0 u)) (<= 0 t))), 8095173#(and (or (< 0 u) (<= 1 s) (<= (+ U T S) (+ m t))) (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 1 t)) (or (< 0 u) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= 0 s)))] [2022-03-15 21:56:14,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 21:56:14,372 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:14,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 21:56:14,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=2003, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 21:56:14,373 INFO L87 Difference]: Start difference. First operand 40570 states and 148960 transitions. Second operand has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:18,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:18,502 INFO L93 Difference]: Finished difference Result 70679 states and 247787 transitions. [2022-03-15 21:56:18,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-03-15 21:56:18,503 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:56:18,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:18,733 INFO L225 Difference]: With dead ends: 70679 [2022-03-15 21:56:18,733 INFO L226 Difference]: Without dead ends: 70668 [2022-03-15 21:56:18,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5305 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2851, Invalid=11669, Unknown=0, NotChecked=0, Total=14520 [2022-03-15 21:56:18,734 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 490 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:18,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [490 Valid, 0 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:56:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70668 states. [2022-03-15 21:56:20,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70668 to 40580. [2022-03-15 21:56:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40580 states, 40579 states have (on average 3.6718006850834177) internal successors, (148998), 40579 states have internal predecessors, (148998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40580 states to 40580 states and 148998 transitions. [2022-03-15 21:56:20,234 INFO L78 Accepts]: Start accepts. Automaton has 40580 states and 148998 transitions. Word has length 27 [2022-03-15 21:56:20,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:56:20,234 INFO L470 AbstractCegarLoop]: Abstraction has 40580 states and 148998 transitions. [2022-03-15 21:56:20,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:56:20,234 INFO L276 IsEmpty]: Start isEmpty. Operand 40580 states and 148998 transitions. [2022-03-15 21:56:20,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:56:20,294 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:56:20,294 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:56:20,310 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:56:20,507 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:56:20,507 INFO L402 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:56:20,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:56:20,508 INFO L85 PathProgramCache]: Analyzing trace with hash -250744029, now seen corresponding path program 123 times [2022-03-15 21:56:20,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:56:20,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456434384] [2022-03-15 21:56:20,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:56:20,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:56:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:56:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:21,139 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:56:21,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456434384] [2022-03-15 21:56:21,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456434384] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:56:21,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312003010] [2022-03-15 21:56:21,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:56:21,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:56:21,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:56:21,140 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:56:21,141 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:56:21,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 21:56:21,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:56:21,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 21:56:21,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:56:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:22,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:56:25,232 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:56:25,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312003010] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:56:25,232 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:56:25,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2022-03-15 21:56:25,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [5634585] [2022-03-15 21:56:25,232 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:56:25,233 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:56:25,240 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 104 transitions. [2022-03-15 21:56:25,241 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:56:26,970 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [8247354#(and (or (< 0 u) (< m (+ U T S 1))) (or (<= (+ U T S) m) (< 0 u))), 8247356#(and (or (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 2 s) (< 0 t)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (< 0 t))), 8247361#(and (or (<= (+ U T S) (+ m u 1)) (<= 2 s) (< 0 t)) (or (<= 2 s) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (<= 1 s) (< 0 t)) (or (<= 2 t) (<= 0 s)) (or (<= 2 t) (<= 1 s) (<= (+ m 1) (+ U T S))) (or (<= 2 t) (<= 1 s) (<= (+ U T S) (+ m u 1)))), 8247357#(and (or (<= (+ U T S) m) (< 0 u) (<= 1 s)) (or (< 0 u) (<= 1 s) (< m (+ U T S 1)))), 8247355#(and (or (<= 1 s) (<= (+ U T S) (+ m u)) (not (< 0 u))) (or (<= u 0) (<= 0 s)) (or (<= (+ U T S) (+ m u s)) (<= 1 t) (<= 2 s) (not (< 0 u))) (or (<= u 0) (<= 1 s) (<= (+ m 1) (+ U T S))) (or (<= 1 t) (<= 2 s) (<= (+ 2 m) (+ U T S)) (not (< 0 u)) (<= s 0)) (or (not (< 0 u)) (<= 0 t))), 8247358#(and (or (<= (+ U T S) m) (< 1 u) (< 0 s) (< 0 t)) (or (< m (+ U T S 1)) (< 1 u) (< 0 s) (< 0 t))), 8247278#(or (< 0 u) (and (<= (+ U T S) m) (< m (+ U T S 1))) (< 0 s) (< 0 t)), 8247351#(and (or (<= (+ m 1) (+ U S)) (not (< 0 t)) (not (<= s 0))) (or (not (< 0 u)) (<= 1 T)) (or (not (< 0 u)) (= T t)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (not (< 0 s)) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 u)) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 s)))), 8247360#(and (or (not (< 0 s)) (<= 1 T)) (or (not (< 0 t)) (<= (+ 2 m) (+ U S))) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (not (< 0 s)) (= T t)) (or (<= 1 s) (not (< 0 u))) (or (<= (+ 2 m s) (+ U T S)) (not (< 0 t)))), 8247359#(and (or (< 0 u) (<= 1 s) (< 0 t)) (or (< 0 u) (<= 1 s) (< 1 t) (<= (+ m 1) (+ U T S))) (or (< 0 u) (<= (+ U T S) (+ m 1)) (<= 2 s) (< 0 t)) (or (< 0 u) (<= 1 s) (<= (+ U T S) (+ m 1)) (< 1 t)) (or (< 0 u) (<= 2 s) (<= (+ m 1) (+ U T S)) (< 0 t)) (or (< 0 u) (< 1 t) (<= 0 s))), 8247353#(and (or (< 0 u) (< m (+ U T S 1)) (< 0 t)) (or (<= (+ U T S) m) (< 0 u) (< 0 t))), 8247352#(and (or (<= t 0) (<= (+ m 1) (+ U S)) (< 0 s)) (or (<= s 1) (= T t)) (or (not (< 0 u)) (<= 1 T)) (or (<= s 1) (<= (+ U S) (+ m u s))) (or (not (< 0 u)) (= T t)) (or (<= u 0) (<= 0 s)) (or (<= (+ U S) (+ m u s)) (not (< 0 t))) (or (<= s 1) (<= (+ 2 m s) (+ U T S))) (or (not (< 0 s)) (not (<= s 1)) (not (< 0 t)) (<= (+ 2 m) (+ U S))))] [2022-03-15 21:56:26,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 21:56:26,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:56:26,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 21:56:26,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=1615, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:56:26,971 INFO L87 Difference]: Start difference. First operand 40580 states and 148998 transitions. Second operand has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 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:56:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:56:31,289 INFO L93 Difference]: Finished difference Result 92317 states and 315166 transitions. [2022-03-15 21:56:31,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-03-15 21:56:31,290 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 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 27 [2022-03-15 21:56:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:56:31,602 INFO L225 Difference]: With dead ends: 92317 [2022-03-15 21:56:31,603 INFO L226 Difference]: Without dead ends: 92302 [2022-03-15 21:56:31,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5533 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3158, Invalid=11122, Unknown=0, NotChecked=0, Total=14280 [2022-03-15 21:56:31,603 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 328 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:56:31,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 0 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:56:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92302 states. Received shutdown request... [2022-03-15 21:56:32,051 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 21:56:32,067 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:56:32,073 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:56:32,073 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:56:32,267 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:56:32,268 WARN L594 AbstractCegarLoop]: Verification canceled: while executing MinimizeSevpa. [2022-03-15 21:56:32,269 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 21:56:32,269 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 21:56:32,269 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 21:56:32,270 INFO L732 BasicCegarLoop]: Path program histogram: [123, 1, 1, 1] [2022-03-15 21:56:32,272 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 21:56:32,272 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 21:56:32,273 INFO L202 PluginConnector]: Adding new model threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 09:56:32 BasicIcfg [2022-03-15 21:56:32,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 21:56:32,273 INFO L158 Benchmark]: Toolchain (without parser) took 846176.42ms. Allocated memory was 187.7MB in the beginning and 7.0GB in the end (delta: 6.9GB). Free memory was 148.1MB in the beginning and 5.9GB in the end (delta: -5.8GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-03-15 21:56:32,273 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 187.7MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 21:56:32,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.03ms. Allocated memory is still 187.7MB. Free memory was 148.1MB in the beginning and 146.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:56:32,273 INFO L158 Benchmark]: Boogie Preprocessor took 9.87ms. Allocated memory is still 187.7MB. Free memory was 146.5MB in the beginning and 145.6MB in the end (delta: 937.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:56:32,273 INFO L158 Benchmark]: RCFGBuilder took 249.19ms. Allocated memory is still 187.7MB. Free memory was 145.5MB in the beginning and 135.2MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-15 21:56:32,273 INFO L158 Benchmark]: TraceAbstraction took 845896.60ms. Allocated memory was 187.7MB in the beginning and 7.0GB in the end (delta: 6.9GB). Free memory was 134.7MB in the beginning and 5.9GB in the end (delta: -5.8GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-03-15 21:56:32,274 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.10ms. Allocated memory is still 187.7MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.03ms. Allocated memory is still 187.7MB. Free memory was 148.1MB in the beginning and 146.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 9.87ms. Allocated memory is still 187.7MB. Free memory was 146.5MB in the beginning and 145.6MB in the end (delta: 937.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 249.19ms. Allocated memory is still 187.7MB. Free memory was 145.5MB in the beginning and 135.2MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 845896.60ms. Allocated memory was 187.7MB in the beginning and 7.0GB in the end (delta: 6.9GB). Free memory was 134.7MB in the beginning and 5.9GB in the end (delta: -5.8GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 40 PlacesBefore, 28 PlacesAfterwards, 33 TransitionsBefore, 21 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 442 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 220, positive: 182, positive conditional: 0, positive unconditional: 182, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 75, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 220, positive: 119, positive conditional: 0, positive unconditional: 119, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 75, unknown conditional: 0, unknown unconditional: 75] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - 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: 78]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 47 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 845.8s, OverallIterations: 126, TraceHistogramMax: 4, PathProgramHistogramMax: 123, EmptinessCheckTime: 4.2s, AutomataDifference: 222.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34724 SdHoareTripleChecker+Valid, 40.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34724 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 35.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10237 mSDsCounter, 24747 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78304 IncrementalHoareTripleChecker+Invalid, 103051 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24747 mSolverCounterUnsat, 45 mSDtfsCounter, 78304 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15901 GetRequests, 5377 SyntacticMatches, 818 SemanticMatches, 9706 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317528 ImplicationChecksByTransitivity, 292.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40580occurred in iteration=125, InterpolantAutomatonStates: 5526, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 74.5s AutomataMinimizationTime, 126 MinimizatonAttempts, 1010021 StatesRemovedByMinimization, 123 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 310.5s InterpolantComputationTime, 6312 NumberOfCodeBlocks, 6308 NumberOfCodeBlocksAsserted, 556 NumberOfCheckSat, 9052 ConstructedInterpolants, 0 QuantifiedInterpolants, 495752 SizeOfPredicates, 408 NumberOfNonLiveVariables, 7618 ConjunctsInSsa, 2674 ConjunctsInUnsatCore, 372 InterpolantComputations, 4 PerfectInterpolantSequences, 314/7898 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