/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/unroll-cond-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:46:54,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:46:54,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:46:54,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:46:54,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:46:54,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:46:54,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:46:54,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:46:54,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:46:54,165 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:46:54,166 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:46:54,167 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:46:54,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:46:54,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:46:54,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:46:54,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:46:54,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:46:54,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:46:54,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:46:54,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:46:54,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:46:54,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:46:54,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:46:54,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:46:54,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:46:54,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:46:54,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:46:54,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:46:54,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:46:54,180 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:46:54,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:46:54,181 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:46:54,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:46:54,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:46:54,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:46:54,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:46:54,184 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:46:54,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:46:54,184 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:46:54,185 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:46:54,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:46:54,193 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 20:46:54,211 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:46:54,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:46:54,213 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:46:54,213 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:46:54,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:46:54,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:46:54,213 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:46:54,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:46:54,213 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:46:54,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:46:54,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:46:54,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:46:54,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:46:54,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:46:54,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:46:54,215 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:46:54,215 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:46:54,215 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:46:54,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:46:54,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:46:54,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:46:54,215 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:46:54,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:46:54,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:46:54,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:46:54,215 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:46:54,215 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:46:54,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:46:54,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:46:54,217 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:46:54,217 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:46:54,217 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:46:54,217 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 20:46:54,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:46:54,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:46:54,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:46:54,408 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 20:46:54,409 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 20:46:54,409 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-cond-2.wvr.bpl [2022-03-15 20:46:54,413 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-cond-2.wvr.bpl' [2022-03-15 20:46:54,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:46:54,440 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 20:46:54,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:46:54,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:46:54,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:46:54,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:46:54" (1/1) ... [2022-03-15 20:46:54,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:46:54" (1/1) ... [2022-03-15 20:46:54,458 INFO L137 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 20:46:54,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:46:54,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:46:54,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:46:54,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:46:54,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:46:54" (1/1) ... [2022-03-15 20:46:54,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:46:54" (1/1) ... [2022-03-15 20:46:54,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:46:54" (1/1) ... [2022-03-15 20:46:54,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:46:54" (1/1) ... [2022-03-15 20:46:54,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:46:54" (1/1) ... [2022-03-15 20:46:54,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:46:54" (1/1) ... [2022-03-15 20:46:54,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:46:54" (1/1) ... [2022-03-15 20:46:54,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:46:54,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:46:54,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:46:54,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:46:54,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:46:54" (1/1) ... [2022-03-15 20:46:54,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:46:54,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:46:54,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 20:46:54,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 20:46:54,534 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 20:46:54,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 20:46:54,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 20:46:54,534 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 20:46:54,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 20:46:54,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 20:46:54,534 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 20:46:54,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:46:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:46:54,535 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 20:46:54,571 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:46:54,572 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:46:54,638 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:46:54,657 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:46:54,657 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 20:46:54,657 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread1EXIT is neither atomic block end nor error location. [2022-03-15 20:46:54,658 INFO L202 PluginConnector]: Adding new model unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:46:54 BoogieIcfgContainer [2022-03-15 20:46:54,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:46:54,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:46:54,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:46:54,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:46:54,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:46:54" (1/2) ... [2022-03-15 20:46:54,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a33fc8c and model type unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:46:54, skipping insertion in model container [2022-03-15 20:46:54,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:46:54" (2/2) ... [2022-03-15 20:46:54,664 INFO L111 eAbstractionObserver]: Analyzing ICFG unroll-cond-2.wvr.bpl [2022-03-15 20:46:54,667 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:46:54,667 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:46:54,667 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 20:46:54,667 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:46:54,683 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 20:46:54,714 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:46:54,719 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:46:54,719 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 20:46:54,725 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:46:54,731 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 16 transitions, 48 flow [2022-03-15 20:46:54,733 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 16 transitions, 48 flow [2022-03-15 20:46:54,734 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 21 places, 16 transitions, 48 flow [2022-03-15 20:46:54,748 INFO L129 PetriNetUnfolder]: 2/14 cut-off events. [2022-03-15 20:46:54,748 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 20:46:54,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 14 events. 2/14 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 9. Up to 2 conditions per place. [2022-03-15 20:46:54,750 INFO L116 LiptonReduction]: Number of co-enabled transitions 22 [2022-03-15 20:46:54,797 INFO L131 LiptonReduction]: Checked pairs total: 22 [2022-03-15 20:46:54,797 INFO L133 LiptonReduction]: Total number of compositions: 4 [2022-03-15 20:46:54,802 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 13 transitions, 42 flow [2022-03-15 20:46:54,817 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:54,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:54,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-03-15 20:46:54,822 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:46:54,822 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:46:54,823 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:46:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:46:54,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1075715295, now seen corresponding path program 1 times [2022-03-15 20:46:54,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:46:54,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826278667] [2022-03-15 20:46:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:46:54,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:46:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:55,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:46:55,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826278667] [2022-03-15 20:46:55,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826278667] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:46:55,018 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:46:55,018 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:46:55,019 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1670356931] [2022-03-15 20:46:55,020 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:46:55,045 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:46:55,064 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 14 transitions. [2022-03-15 20:46:55,065 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:46:55,207 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [53#(or (< i1 n) (= x2 x1)), 54#(and (or (< i1 n) (= x2 x1)) (or (< i1 n) (<= n i2)))] [2022-03-15 20:46:55,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 20:46:55,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:46:55,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 20:46:55,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:46:55,224 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:55,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:46:55,270 INFO L93 Difference]: Finished difference Result 27 states and 44 transitions. [2022-03-15 20:46:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:46:55,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-03-15 20:46:55,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:46:55,278 INFO L225 Difference]: With dead ends: 27 [2022-03-15 20:46:55,278 INFO L226 Difference]: Without dead ends: 16 [2022-03-15 20:46:55,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:46:55,285 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 16 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:46:55,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 1 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:46:55,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-03-15 20:46:55,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-03-15 20:46:55,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:55,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 26 transitions. [2022-03-15 20:46:55,315 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 26 transitions. Word has length 8 [2022-03-15 20:46:55,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:46:55,315 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 26 transitions. [2022-03-15 20:46:55,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 26 transitions. [2022-03-15 20:46:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:46:55,316 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:46:55,316 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:46:55,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:46:55,316 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:46:55,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:46:55,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1670052526, now seen corresponding path program 1 times [2022-03-15 20:46:55,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:46:55,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047638294] [2022-03-15 20:46:55,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:46:55,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:46:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:55,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:55,364 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:46:55,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047638294] [2022-03-15 20:46:55,365 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047638294] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:46:55,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484945244] [2022-03-15 20:46:55,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:46:55,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:55,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:46:55,384 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:46:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:55,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:46:55,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 20:46:55,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:46:55,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-03-15 20:46:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:55,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:46:55,724 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:46:55,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 25 [2022-03-15 20:46:55,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:55,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484945244] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:46:55,769 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:46:55,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-03-15 20:46:55,769 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1890670432] [2022-03-15 20:46:55,769 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:46:55,770 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:46:55,776 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2022-03-15 20:46:55,776 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:46:55,934 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [171#(or (< i1 n) (= x2 x1)), 172#(and (or (< i1 n) (<= (+ i2 1) n)) (or (< i1 n) (= x1 (select f x2)))), 173#(or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n))), 174#(and (or (= (select f x1) (select f x2)) (< (+ i1 1) n) (not (< i1 n))) (or (< (+ i1 1) n) (not (< i1 n)) (<= (+ i2 1) n)))] [2022-03-15 20:46:55,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:46:55,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:46:55,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:46:55,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:46:55,936 INFO L87 Difference]: Start difference. First operand 15 states and 26 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:46:56,221 INFO L93 Difference]: Finished difference Result 53 states and 100 transitions. [2022-03-15 20:46:56,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:46:56,222 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-03-15 20:46:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:46:56,222 INFO L225 Difference]: With dead ends: 53 [2022-03-15 20:46:56,223 INFO L226 Difference]: Without dead ends: 47 [2022-03-15 20:46:56,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:46:56,224 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:46:56,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 1 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:46:56,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-03-15 20:46:56,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 23. [2022-03-15 20:46:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 44 transitions. [2022-03-15 20:46:56,228 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 44 transitions. Word has length 9 [2022-03-15 20:46:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:46:56,228 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 44 transitions. [2022-03-15 20:46:56,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 44 transitions. [2022-03-15 20:46:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:46:56,229 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:46:56,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:46:56,249 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 20:46:56,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:56,450 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:46:56,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:46:56,451 INFO L85 PathProgramCache]: Analyzing trace with hash 225497458, now seen corresponding path program 1 times [2022-03-15 20:46:56,451 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:46:56,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571113838] [2022-03-15 20:46:56,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:46:56,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:46:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:56,489 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 20:46:56,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:46:56,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571113838] [2022-03-15 20:46:56,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571113838] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:46:56,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645488223] [2022-03-15 20:46:56,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:46:56,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:56,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:46:56,501 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:46:56,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 20:46:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:56,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 20:46:56,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:46:56,550 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 20:46:56,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:46:56,567 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 20:46:56,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645488223] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:46:56,567 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:46:56,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-03-15 20:46:56,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1069887386] [2022-03-15 20:46:56,567 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:46:56,568 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:46:56,569 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 26 transitions. [2022-03-15 20:46:56,569 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:46:56,652 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [350#(< i1 n), 353#(or (<= n (+ i2 1)) (< (+ i1 1) n) (<= n i1)), 351#(or (< (+ i1 1) n) (<= n i1)), 352#(or (< i1 n) (<= n (+ i2 1)))] [2022-03-15 20:46:56,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:46:56,653 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:46:56,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:46:56,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:46:56,654 INFO L87 Difference]: Start difference. First operand 23 states and 44 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:56,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:46:56,777 INFO L93 Difference]: Finished difference Result 40 states and 71 transitions. [2022-03-15 20:46:56,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:46:56,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 20:46:56,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:46:56,779 INFO L225 Difference]: With dead ends: 40 [2022-03-15 20:46:56,779 INFO L226 Difference]: Without dead ends: 37 [2022-03-15 20:46:56,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:46:56,782 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:46:56,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 1 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:46:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-03-15 20:46:56,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2022-03-15 20:46:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 48 transitions. [2022-03-15 20:46:56,795 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 48 transitions. Word has length 10 [2022-03-15 20:46:56,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:46:56,795 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 48 transitions. [2022-03-15 20:46:56,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:56,795 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 48 transitions. [2022-03-15 20:46:56,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:46:56,796 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:46:56,796 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:46:56,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 20:46:57,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-03-15 20:46:57,012 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:46:57,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:46:57,013 INFO L85 PathProgramCache]: Analyzing trace with hash 889509057, now seen corresponding path program 2 times [2022-03-15 20:46:57,014 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:46:57,014 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664352825] [2022-03-15 20:46:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:46:57,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:46:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:57,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:46:57,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664352825] [2022-03-15 20:46:57,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664352825] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:46:57,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894962284] [2022-03-15 20:46:57,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:46:57,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:57,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:46:57,059 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:46:57,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 20:46:57,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:46:57,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:46:57,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 20:46:57,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:46:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:57,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:46:57,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:57,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894962284] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:46:57,137 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:46:57,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-03-15 20:46:57,137 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [791248536] [2022-03-15 20:46:57,137 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:46:57,138 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:46:57,139 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2022-03-15 20:46:57,139 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:46:57,225 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [516#(< i1 n), 519#(or (< (+ 2 i1) n) (<= n (+ i1 1))), 518#(or (< (+ i1 1) n) (<= n i1)), 521#(or (< (+ i2 1) n) (< (+ 2 i1) n) (<= n (+ i1 1))), 517#(or (< i1 n) (< (+ i2 1) n)), 520#(or (< (+ i1 1) n) (<= n i1) (< (+ i2 1) n))] [2022-03-15 20:46:57,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:46:57,225 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:46:57,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:46:57,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:46:57,227 INFO L87 Difference]: Start difference. First operand 24 states and 48 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:46:57,325 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2022-03-15 20:46:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:46:57,326 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 20:46:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:46:57,326 INFO L225 Difference]: With dead ends: 36 [2022-03-15 20:46:57,326 INFO L226 Difference]: Without dead ends: 36 [2022-03-15 20:46:57,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:46:57,330 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:46:57,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 1 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:46:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-15 20:46:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2022-03-15 20:46:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 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 20:46:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 55 transitions. [2022-03-15 20:46:57,343 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 55 transitions. Word has length 10 [2022-03-15 20:46:57,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:46:57,344 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 55 transitions. [2022-03-15 20:46:57,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:57,344 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 55 transitions. [2022-03-15 20:46:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:46:57,344 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:46:57,344 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:46:57,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 20:46:57,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:57,561 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:46:57,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:46:57,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1798453695, now seen corresponding path program 2 times [2022-03-15 20:46:57,562 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:46:57,562 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425800245] [2022-03-15 20:46:57,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:46:57,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:46:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:46:57,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:57,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:46:57,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425800245] [2022-03-15 20:46:57,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425800245] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:46:57,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526699594] [2022-03-15 20:46:57,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:46:57,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:46:57,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:46:57,629 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:46:57,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 20:46:57,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:46:57,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:46:57,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 20:46:57,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:46:57,802 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:46:57,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 50 [2022-03-15 20:46:57,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:57,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:46:57,968 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:46:57,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 31 treesize of output 106 [2022-03-15 20:46:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:46:58,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526699594] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:46:58,166 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:46:58,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-03-15 20:46:58,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1839097360] [2022-03-15 20:46:58,166 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:46:58,167 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:46:58,168 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 33 transitions. [2022-03-15 20:46:58,168 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:46:58,539 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [709#(and (<= n (+ 2 i2)) (or (= (select f (select f x2)) x1) (not (< (+ i2 1) n)))), 708#(and (or (= (select f (select f x2)) (select f (select f x1))) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (<= n (+ 2 i2)) (not (< (+ i1 1) n)) (< (+ 2 i1) n))), 700#(or (< i1 n) (= x2 x1)), 706#(or (= (select f (select f x1)) x2) (< (+ 2 i1) n) (<= n (+ i1 1))), 702#(or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n))), 701#(and (or (< i1 n) (= x2 x1)) (or (< i1 n) (<= n i2))), 705#(and (or (= (select f (select f x2)) (select f x1)) (< (+ i1 1) n) (not (< i1 n))) (or (<= n (+ 2 i2)) (< (+ i1 1) n) (not (< i1 n)))), 704#(and (or (<= n (+ 2 i2)) (< i1 n)) (or (< i1 n) (= (select f (select f x2)) x1))), 707#(and (or (<= n i2) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (= (select f (select f x1)) x2) (not (< (+ i1 1) n)) (< (+ 2 i1) n))), 703#(and (or (<= n i2) (< (+ i1 1) n) (not (< i1 n))) (or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n))))] [2022-03-15 20:46:58,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 20:46:58,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:46:58,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 20:46:58,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:46:58,540 INFO L87 Difference]: Start difference. First operand 28 states and 55 transitions. Second operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:46:59,968 INFO L93 Difference]: Finished difference Result 84 states and 164 transitions. [2022-03-15 20:46:59,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 20:46:59,969 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:46:59,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:46:59,969 INFO L225 Difference]: With dead ends: 84 [2022-03-15 20:46:59,969 INFO L226 Difference]: Without dead ends: 69 [2022-03-15 20:46:59,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=485, Invalid=2485, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 20:46:59,970 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 79 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:46:59,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 1 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:46:59,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-03-15 20:46:59,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 36. [2022-03-15 20:46:59,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 76 transitions. [2022-03-15 20:46:59,973 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 76 transitions. Word has length 11 [2022-03-15 20:46:59,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:46:59,974 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 76 transitions. [2022-03-15 20:46:59,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:46:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 76 transitions. [2022-03-15 20:46:59,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:46:59,974 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:46:59,974 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:46:59,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 20:47:00,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:00,175 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:00,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:00,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1329652726, now seen corresponding path program 3 times [2022-03-15 20:47:00,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:00,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365137411] [2022-03-15 20:47:00,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:00,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:00,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:00,210 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:00,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365137411] [2022-03-15 20:47:00,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365137411] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:47:00,211 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:47:00,211 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:47:00,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1297292394] [2022-03-15 20:47:00,211 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:00,212 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:00,214 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 29 transitions. [2022-03-15 20:47:00,214 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:00,283 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [928#(or (<= n i1) (< (+ i2 1) n)), 926#(< (+ i2 1) n), 927#(or (<= (+ n 1) i1) (< (+ i2 1) n))] [2022-03-15 20:47:00,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:47:00,284 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:00,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:47:00,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:47:00,284 INFO L87 Difference]: Start difference. First operand 36 states and 76 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:00,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:00,330 INFO L93 Difference]: Finished difference Result 39 states and 77 transitions. [2022-03-15 20:47:00,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:47:00,330 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:47:00,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:00,331 INFO L225 Difference]: With dead ends: 39 [2022-03-15 20:47:00,331 INFO L226 Difference]: Without dead ends: 36 [2022-03-15 20:47:00,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:47:00,331 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 20 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:00,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 1 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:47:00,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-15 20:47:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-03-15 20:47:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 35 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2022-03-15 20:47:00,334 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 11 [2022-03-15 20:47:00,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:00,334 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 74 transitions. [2022-03-15 20:47:00,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 74 transitions. [2022-03-15 20:47:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:47:00,335 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:00,335 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:00,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 20:47:00,335 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:00,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:00,335 INFO L85 PathProgramCache]: Analyzing trace with hash -979510510, now seen corresponding path program 3 times [2022-03-15 20:47:00,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:00,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229754643] [2022-03-15 20:47:00,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:00,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:00,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:00,393 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:00,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229754643] [2022-03-15 20:47:00,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229754643] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:00,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171185052] [2022-03-15 20:47:00,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:47:00,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:00,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:00,394 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:47:00,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 20:47:00,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 20:47:00,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:00,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 20:47:00,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:00,553 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:00,553 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 50 [2022-03-15 20:47:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:00,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:00,772 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:00,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 35 treesize of output 150 [2022-03-15 20:47:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:01,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171185052] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:01,748 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:01,748 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-03-15 20:47:01,749 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1568348195] [2022-03-15 20:47:01,749 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:01,749 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:01,751 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 40 transitions. [2022-03-15 20:47:01,751 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:02,299 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [1134#(and (or (<= (+ 3 i2) n) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (not (< (+ i1 1) n)) (< (+ 2 i1) n) (= (select f (select f x1)) (select f (select f (select f x2)))))), 1138#(and (or (not (< (+ i2 1) n)) (= x1 (select f (select f (select f x2))))) (or (<= (+ 3 i2) n) (not (< (+ i2 1) n)))), 1130#(and (or (= (select f x1) (select f x2)) (< (+ i1 1) n) (not (< i1 n))) (or (< (+ i1 1) n) (not (< i1 n)) (<= (+ i2 1) n))), 1132#(and (or (< i1 n) (<= (+ 3 i2) n)) (or (< i1 n) (= x1 (select f (select f (select f x2)))))), 1137#(and (or (<= (+ 3 i2) n) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (= (select f (select f (select f x1))) (select f (select f (select f x2)))) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 1135#(or (<= n (+ 2 i1)) (< (+ 3 i1) n) (= (select f (select f (select f x1))) x2)), 1136#(and (or (not (< (+ 2 i1) n)) (< (+ 3 i1) n) (<= (+ i2 1) n)) (or (= (select f (select f (select f x1))) (select f x2)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 1133#(and (or (= (select f x1) (select f (select f (select f x2)))) (< (+ i1 1) n) (not (< i1 n))) (or (<= (+ 3 i2) n) (< (+ i1 1) n) (not (< i1 n)))), 1127#(or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n))), 1128#(or (= (select f (select f x1)) x2) (< (+ 2 i1) n) (<= n (+ i1 1))), 1126#(or (< i1 n) (= x2 x1)), 1129#(and (or (< i1 n) (<= (+ i2 1) n)) (or (< i1 n) (= x1 (select f x2)))), 1131#(and (or (not (< (+ i1 1) n)) (< (+ 2 i1) n) (<= (+ i2 1) n)) (or (not (< (+ i1 1) n)) (< (+ 2 i1) n) (= (select f (select f x1)) (select f x2))))] [2022-03-15 20:47:02,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 20:47:02,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:02,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 20:47:02,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:47:02,301 INFO L87 Difference]: Start difference. First operand 36 states and 74 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 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 20:47:04,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:04,409 INFO L93 Difference]: Finished difference Result 122 states and 231 transitions. [2022-03-15 20:47:04,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 20:47:04,410 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 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 12 [2022-03-15 20:47:04,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:04,410 INFO L225 Difference]: With dead ends: 122 [2022-03-15 20:47:04,410 INFO L226 Difference]: Without dead ends: 110 [2022-03-15 20:47:04,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=580, Invalid=4250, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 20:47:04,412 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 144 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:04,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 1 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:47:04,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-03-15 20:47:04,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 52. [2022-03-15 20:47:04,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.215686274509804) internal successors, (113), 51 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:04,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 113 transitions. [2022-03-15 20:47:04,416 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 113 transitions. Word has length 12 [2022-03-15 20:47:04,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:04,416 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 113 transitions. [2022-03-15 20:47:04,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 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 20:47:04,416 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 113 transitions. [2022-03-15 20:47:04,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:47:04,417 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:04,417 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:04,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 20:47:04,632 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 20:47:04,632 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:04,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:04,632 INFO L85 PathProgramCache]: Analyzing trace with hash -306578034, now seen corresponding path program 4 times [2022-03-15 20:47:04,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:04,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588160869] [2022-03-15 20:47:04,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:04,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:04,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:04,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588160869] [2022-03-15 20:47:04,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588160869] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:04,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545224268] [2022-03-15 20:47:04,706 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:47:04,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:04,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:04,716 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:47:04,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 20:47:04,759 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:47:04,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:04,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:47:04,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:04,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:04,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545224268] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:04,811 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:04,811 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-03-15 20:47:04,811 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1541499538] [2022-03-15 20:47:04,811 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:04,812 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:04,832 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 51 transitions. [2022-03-15 20:47:04,832 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:05,095 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [1534#(or (<= n (+ 3 i2)) (< (+ 2 i1) n) (<= n (+ i1 1))), 1527#(or (<= n (+ i2 1)) (< (+ i1 1) n) (<= n i1)), 1531#(or (<= n (+ i2 1)) (< (+ 2 i1) n) (<= n (+ i1 1))), 1525#(or (< i1 n) (<= n (+ i2 1))), 1524#(< i1 n), 1533#(or (<= n (+ i2 1)) (<= n (+ 2 i1)) (< (+ 3 i1) n)), 1535#(or (<= n (+ 3 i2)) (<= n (+ 2 i1)) (< (+ 3 i1) n)), 1530#(or (< (+ 2 i1) n) (<= n (+ i1 1))), 1532#(or (<= n (+ 2 i1)) (< (+ 3 i1) n)), 1526#(or (< (+ i1 1) n) (<= n i1)), 1528#(or (<= n (+ 3 i2)) (< i1 n)), 1529#(or (<= n (+ 3 i2)) (< (+ i1 1) n) (<= n i1))] [2022-03-15 20:47:05,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:47:05,095 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:05,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:47:05,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:47:05,096 INFO L87 Difference]: Start difference. First operand 52 states and 113 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:05,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:05,934 INFO L93 Difference]: Finished difference Result 164 states and 355 transitions. [2022-03-15 20:47:05,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 20:47:05,935 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:47:05,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:05,935 INFO L225 Difference]: With dead ends: 164 [2022-03-15 20:47:05,935 INFO L226 Difference]: Without dead ends: 151 [2022-03-15 20:47:05,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1075, Invalid=2707, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 20:47:05,937 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 89 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:05,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 1 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:47:05,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-03-15 20:47:05,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 70. [2022-03-15 20:47:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.608695652173913) internal successors, (180), 69 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 180 transitions. [2022-03-15 20:47:05,941 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 180 transitions. Word has length 13 [2022-03-15 20:47:05,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:05,942 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 180 transitions. [2022-03-15 20:47:05,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:05,942 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 180 transitions. [2022-03-15 20:47:05,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:47:05,942 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:05,942 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:05,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 20:47:06,155 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 20:47:06,156 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:06,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:06,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1197054945, now seen corresponding path program 5 times [2022-03-15 20:47:06,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:06,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023904831] [2022-03-15 20:47:06,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:06,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:06,203 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:06,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023904831] [2022-03-15 20:47:06,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023904831] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:06,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345604420] [2022-03-15 20:47:06,203 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:47:06,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:06,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:06,205 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:47:06,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 20:47:06,226 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 20:47:06,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:06,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:47:06,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:06,253 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:06,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:06,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345604420] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:06,277 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:06,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-03-15 20:47:06,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [661161362] [2022-03-15 20:47:06,278 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:06,278 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:06,280 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2022-03-15 20:47:06,280 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:06,620 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [2007#(or (< (+ i1 1) n) (<= n i1) (< (+ i2 1) n)), 2014#(or (<= n (+ i2 1)) (<= (+ i2 4) n)), 2008#(or (< (+ i2 1) n) (< (+ 2 i1) n) (<= n (+ i1 1))), 2009#(or (<= n (+ 2 i1)) (< (+ 3 i1) n)), 2018#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (<= (+ i2 4) n)), 2016#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (< (+ i2 1) n)), 2017#(or (<= (+ i2 4) n) (<= n (+ 2 i1)) (< (+ 3 i1) n)), 2015#(or (<= n (+ 2 i1)) (< (+ i2 1) n) (< (+ 3 i1) n)), 2012#(or (<= (+ i2 4) n) (< (+ i1 1) n) (<= n i1)), 2006#(or (< i1 n) (< (+ i2 1) n)), 2003#(< i1 n), 2010#(or (< (+ i1 4) n) (<= n (+ 3 i1))), 2011#(or (< i1 n) (<= (+ i2 4) n)), 2004#(or (< (+ i1 1) n) (<= n i1)), 2013#(or (<= (+ i2 4) n) (< (+ 2 i1) n) (<= n (+ i1 1))), 2005#(or (< (+ 2 i1) n) (<= n (+ i1 1)))] [2022-03-15 20:47:06,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 20:47:06,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:06,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 20:47:06,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:47:06,621 INFO L87 Difference]: Start difference. First operand 70 states and 180 transitions. Second operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:07,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:07,391 INFO L93 Difference]: Finished difference Result 180 states and 461 transitions. [2022-03-15 20:47:07,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 20:47:07,392 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 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 13 [2022-03-15 20:47:07,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:07,392 INFO L225 Difference]: With dead ends: 180 [2022-03-15 20:47:07,393 INFO L226 Difference]: Without dead ends: 178 [2022-03-15 20:47:07,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=742, Invalid=3040, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 20:47:07,394 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 121 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:07,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 1 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:47:07,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-03-15 20:47:07,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 138. [2022-03-15 20:47:07,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.883211678832117) internal successors, (395), 137 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 395 transitions. [2022-03-15 20:47:07,400 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 395 transitions. Word has length 13 [2022-03-15 20:47:07,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:07,400 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 395 transitions. [2022-03-15 20:47:07,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 395 transitions. [2022-03-15 20:47:07,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:47:07,401 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:07,401 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:07,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 20:47:07,602 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 20:47:07,602 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:07,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:07,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1539479073, now seen corresponding path program 6 times [2022-03-15 20:47:07,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:07,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922828605] [2022-03-15 20:47:07,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:07,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:07,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:07,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922828605] [2022-03-15 20:47:07,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922828605] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:07,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759920863] [2022-03-15 20:47:07,719 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:47:07,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:07,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:07,734 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:47:07,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 20:47:07,773 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:47:07,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:07,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 20:47:07,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:07,975 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:07,976 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 112 [2022-03-15 20:47:08,097 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:08,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:08,400 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:08,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 16 new quantified variables, introduced 36 case distinctions, treesize of input 47 treesize of output 330 [2022-03-15 20:47:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:16,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759920863] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:16,129 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:16,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 20:47:16,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [294853770] [2022-03-15 20:47:16,130 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:16,130 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:16,133 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 60 transitions. [2022-03-15 20:47:16,133 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:17,031 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [2668#(and (or (< i1 n) (<= n (+ i2 4))) (or (< i1 n) (= (select f (select f (select f (select f x2)))) x1))), 2656#(or (< i1 n) (= x2 x1)), 2675#(and (or (< (+ i1 4) n) (<= n (+ i2 4)) (not (< (+ 3 i1) n))) (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (= (select f (select f (select f (select f x1)))) (select f (select f (select f (select f x2))))))), 2654#(and (<= n (+ 2 i2)) (or (= (select f (select f x2)) x1) (not (< (+ i2 1) n)))), 2663#(or (<= n (+ 2 i1)) (< (+ 3 i1) n) (= (select f (select f (select f x1))) x2)), 2673#(and (or (< (+ i1 4) n) (= (select f (select f (select f (select f x1)))) (select f (select f x2))) (not (< (+ 3 i1) n))) (or (<= n (+ 2 i2)) (< (+ i1 4) n) (not (< (+ 3 i1) n)))), 2674#(and (or (= (select f (select f (select f (select f x2)))) (select f (select f (select f x1)))) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (<= n (+ i2 4)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 2657#(and (or (< i1 n) (= x2 x1)) (or (< i1 n) (<= n i2))), 2660#(and (or (<= n (+ 2 i2)) (< i1 n)) (or (< i1 n) (= (select f (select f x2)) x1))), 2667#(and (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (= (select f (select f (select f (select f x1)))) x2)) (or (< (+ i1 4) n) (<= n i2) (not (< (+ 3 i1) n)))), 2672#(and (or (= (select f (select f x2)) (select f (select f (select f x1)))) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (<= n (+ 2 i2)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 2665#(and (or (<= n i2) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (= (select f (select f x1)) x2) (not (< (+ i1 1) n)) (< (+ 2 i1) n))), 2670#(and (or (= (select f (select f x2)) (select f (select f x1))) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (<= n (+ 2 i2)) (not (< (+ i1 1) n)) (< (+ 2 i1) n))), 2659#(and (or (<= n i2) (< (+ i1 1) n) (not (< i1 n))) (or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n)))), 2661#(and (or (= (select f (select f x2)) (select f x1)) (< (+ i1 1) n) (not (< i1 n))) (or (<= n (+ 2 i2)) (< (+ i1 1) n) (not (< i1 n)))), 2655#(and (<= n (+ i2 4)) (or (= (select f (select f (select f (select f x2)))) x1) (not (< (+ 3 i2) n)))), 2669#(and (or (<= n (+ i2 4)) (< (+ i1 1) n) (not (< i1 n))) (or (< (+ i1 1) n) (not (< i1 n)) (= (select f (select f (select f (select f x2)))) (select f x1)))), 2658#(or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n))), 2671#(and (or (<= n (+ i2 4)) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (= (select f (select f (select f (select f x2)))) (select f (select f x1))) (not (< (+ i1 1) n)) (< (+ 2 i1) n))), 2662#(or (= (select f (select f x1)) x2) (< (+ 2 i1) n) (<= n (+ i1 1))), 2664#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (= (select f (select f (select f (select f x1)))) x2)), 2666#(and (or (not (< (+ 2 i1) n)) (< (+ 3 i1) n) (= (select f (select f (select f x1))) x2)) (or (<= n i2) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)))] [2022-03-15 20:47:17,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 20:47:17,032 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:17,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 20:47:17,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2174, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 20:47:17,033 INFO L87 Difference]: Start difference. First operand 138 states and 395 transitions. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:21,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:21,700 INFO L93 Difference]: Finished difference Result 463 states and 1155 transitions. [2022-03-15 20:47:21,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-15 20:47:21,700 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 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 14 [2022-03-15 20:47:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:21,702 INFO L225 Difference]: With dead ends: 463 [2022-03-15 20:47:21,702 INFO L226 Difference]: Without dead ends: 427 [2022-03-15 20:47:21,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3019 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1536, Invalid=10020, Unknown=0, NotChecked=0, Total=11556 [2022-03-15 20:47:21,704 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 224 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:21,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 1 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:47:21,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-03-15 20:47:21,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 185. [2022-03-15 20:47:21,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 2.9130434782608696) internal successors, (536), 184 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 536 transitions. [2022-03-15 20:47:21,712 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 536 transitions. Word has length 14 [2022-03-15 20:47:21,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:21,712 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 536 transitions. [2022-03-15 20:47:21,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 536 transitions. [2022-03-15 20:47:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:47:21,713 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:21,713 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:21,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 20:47:21,922 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 20:47:21,923 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:21,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:21,924 INFO L85 PathProgramCache]: Analyzing trace with hash 440882418, now seen corresponding path program 7 times [2022-03-15 20:47:21,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:21,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731538104] [2022-03-15 20:47:21,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:21,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:21,970 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:21,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731538104] [2022-03-15 20:47:21,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731538104] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:21,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387282317] [2022-03-15 20:47:21,970 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:47:21,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:21,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:21,974 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:47:21,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 20:47:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:21,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:47:21,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:22,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:22,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387282317] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:22,043 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:22,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-03-15 20:47:22,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1515909904] [2022-03-15 20:47:22,044 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:22,044 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:22,046 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2022-03-15 20:47:22,046 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:22,297 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [3726#(or (<= n (+ i2 1)) (<= (+ i2 1) i1)), 3720#(or (< (+ i1 4) n) (<= n (+ 3 i1))), 3721#(or (<= (+ 5 i2) n) (<= n (+ i2 1))), 3717#(or (< (+ i1 1) n) (<= n i1)), 3718#(or (< (+ 2 i1) n) (<= n (+ i1 1))), 3723#(or (<= n (+ i2 1)) (<= (+ 3 i2) i1)), 3719#(or (<= n (+ 2 i1)) (< (+ 3 i1) n)), 3725#(or (<= n (+ i1 4)) (< (+ 5 i1) n)), 3716#(< i1 n), 3724#(or (<= n (+ i2 1)) (<= (+ 2 i2) i1)), 3722#(or (<= (+ i2 4) i1) (<= n (+ i2 1)))] [2022-03-15 20:47:22,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:47:22,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:22,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:47:22,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:47:22,298 INFO L87 Difference]: Start difference. First operand 185 states and 536 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:47:23,515 INFO L93 Difference]: Finished difference Result 440 states and 1046 transitions. [2022-03-15 20:47:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 20:47:23,516 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 20:47:23,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:47:23,517 INFO L225 Difference]: With dead ends: 440 [2022-03-15 20:47:23,518 INFO L226 Difference]: Without dead ends: 440 [2022-03-15 20:47:23,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=982, Invalid=3710, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 20:47:23,519 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 178 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:47:23,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 1 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:47:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-03-15 20:47:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 213. [2022-03-15 20:47:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.858490566037736) internal successors, (606), 212 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 606 transitions. [2022-03-15 20:47:23,532 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 606 transitions. Word has length 14 [2022-03-15 20:47:23,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:47:23,532 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 606 transitions. [2022-03-15 20:47:23,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:47:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 606 transitions. [2022-03-15 20:47:23,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:47:23,550 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:47:23,550 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:47:23,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 20:47:23,750 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 20:47:23,751 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:47:23,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:47:23,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1362292754, now seen corresponding path program 8 times [2022-03-15 20:47:23,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:47:23,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673715606] [2022-03-15 20:47:23,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:47:23,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:47:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:47:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:23,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:47:23,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673715606] [2022-03-15 20:47:23,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673715606] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:47:23,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238001332] [2022-03-15 20:47:23,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:47:23,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:47:23,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:47:23,877 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:47:23,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 20:47:23,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:47:23,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:47:23,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 20:47:23,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:47:24,119 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:24,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 112 [2022-03-15 20:47:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:24,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:47:24,691 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:47:24,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 51 treesize of output 406 [2022-03-15 20:47:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:47:57,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238001332] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:47:57,625 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:47:57,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 20:47:57,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1268185218] [2022-03-15 20:47:57,625 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:47:57,627 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:47:57,632 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 69 transitions. [2022-03-15 20:47:57,632 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:47:59,072 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [4815#(and (or (<= (+ 5 i2) n) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (not (< (+ i1 1) n)) (= (select f (select f x1)) (select f (select f (select f (select f (select f x2)))))) (< (+ 2 i1) n))), 4802#(and (or (= (select f x1) (select f x2)) (< (+ i1 1) n) (not (< i1 n))) (or (< (+ i1 1) n) (not (< i1 n)) (<= (+ i2 1) n))), 4804#(or (<= n (+ 2 i1)) (< (+ 3 i1) n) (= (select f (select f (select f x1))) x2)), 4801#(and (or (< i1 n) (<= (+ i2 1) n)) (or (< i1 n) (= x1 (select f x2)))), 4823#(and (or (= (select f (select f (select f (select f (select f x2))))) x1) (not (< (+ 3 i2) n))) (or (<= (+ 5 i2) n) (not (< (+ 3 i2) n)))), 4812#(and (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (<= (+ 3 i2) n)) (or (< (+ i1 4) n) (= (select f (select f (select f (select f x1)))) (select f (select f (select f x2)))) (not (< (+ 3 i1) n)))), 4800#(or (= (select f (select f x1)) x2) (< (+ 2 i1) n) (<= n (+ i1 1))), 4811#(and (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (= (select f (select f (select f (select f x1)))) (select f x2))) (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (<= (+ i2 1) n))), 4821#(and (or (<= (+ 5 i2) n) (not (< (+ i1 4) n)) (< (+ 5 i1) n)) (or (not (< (+ i1 4) n)) (= (select f (select f (select f (select f (select f x1))))) (select f (select f (select f (select f (select f x2)))))) (< (+ 5 i1) n))), 4807#(and (or (= (select f x1) (select f (select f (select f x2)))) (< (+ i1 1) n) (not (< i1 n))) (or (<= (+ 3 i2) n) (< (+ i1 1) n) (not (< i1 n)))), 4813#(and (or (= (select f (select f (select f (select f (select f x2))))) x1) (< i1 n)) (or (<= (+ 5 i2) n) (< i1 n))), 4817#(and (or (<= (+ 5 i2) n) (< (+ i1 4) n) (not (< (+ 3 i1) n))) (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (= (select f (select f (select f (select f x1)))) (select f (select f (select f (select f (select f x2)))))))), 4818#(or (<= n (+ i1 4)) (= (select f (select f (select f (select f (select f x1))))) x2) (< (+ 5 i1) n)), 4820#(and (or (not (< (+ i1 4) n)) (<= (+ 3 i2) n) (< (+ 5 i1) n)) (or (not (< (+ i1 4) n)) (= (select f (select f (select f (select f (select f x1))))) (select f (select f (select f x2)))) (< (+ 5 i1) n))), 4803#(and (or (not (< (+ i1 1) n)) (< (+ 2 i1) n) (<= (+ i2 1) n)) (or (not (< (+ i1 1) n)) (< (+ 2 i1) n) (= (select f (select f x1)) (select f x2)))), 4814#(and (or (<= (+ 5 i2) n) (< (+ i1 1) n) (not (< i1 n))) (or (= (select f x1) (select f (select f (select f (select f (select f x2)))))) (< (+ i1 1) n) (not (< i1 n)))), 4822#(and (or (not (< (+ i2 1) n)) (= x1 (select f (select f (select f x2))))) (or (<= (+ 3 i2) n) (not (< (+ i2 1) n)))), 4809#(and (or (<= (+ 3 i2) n) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (= (select f (select f (select f x1))) (select f (select f (select f x2)))) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 4810#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (= (select f (select f (select f (select f x1)))) x2)), 4816#(and (or (= (select f (select f (select f x1))) (select f (select f (select f (select f (select f x2)))))) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (<= (+ 5 i2) n) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 4798#(or (< i1 n) (= x2 x1)), 4806#(and (or (< i1 n) (<= (+ 3 i2) n)) (or (< i1 n) (= x1 (select f (select f (select f x2)))))), 4819#(and (or (not (< (+ i1 4) n)) (<= (+ i2 1) n) (< (+ 5 i1) n)) (or (not (< (+ i1 4) n)) (= (select f (select f (select f (select f (select f x1))))) (select f x2)) (< (+ 5 i1) n))), 4808#(and (or (<= (+ 3 i2) n) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (not (< (+ i1 1) n)) (< (+ 2 i1) n) (= (select f (select f x1)) (select f (select f (select f x2)))))), 4805#(and (or (not (< (+ 2 i1) n)) (< (+ 3 i1) n) (<= (+ i2 1) n)) (or (= (select f (select f (select f x1))) (select f x2)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 4799#(or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n)))] [2022-03-15 20:47:59,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 20:47:59,073 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:47:59,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 20:47:59,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2592, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 20:47:59,074 INFO L87 Difference]: Start difference. First operand 213 states and 606 transitions. Second operand has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:48:06,975 INFO L93 Difference]: Finished difference Result 437 states and 1001 transitions. [2022-03-15 20:48:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-03-15 20:48:06,976 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 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 15 [2022-03-15 20:48:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:48:06,977 INFO L225 Difference]: With dead ends: 437 [2022-03-15 20:48:06,977 INFO L226 Difference]: Without dead ends: 422 [2022-03-15 20:48:06,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4425 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1631, Invalid=15661, Unknown=0, NotChecked=0, Total=17292 [2022-03-15 20:48:06,981 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 321 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:48:06,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 1 Invalid, 2373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 2122 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:48:06,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-03-15 20:48:06,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 220. [2022-03-15 20:48:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 2.8858447488584473) internal successors, (632), 219 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 632 transitions. [2022-03-15 20:48:06,988 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 632 transitions. Word has length 15 [2022-03-15 20:48:06,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:48:06,988 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 632 transitions. [2022-03-15 20:48:06,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:06,988 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 632 transitions. [2022-03-15 20:48:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:48:06,989 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:48:06,989 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:48:07,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 20:48:07,203 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 20:48:07,204 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:48:07,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:48:07,204 INFO L85 PathProgramCache]: Analyzing trace with hash 13720957, now seen corresponding path program 9 times [2022-03-15 20:48:07,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:48:07,205 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375085071] [2022-03-15 20:48:07,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:48:07,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:48:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:48:07,263 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:07,263 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:48:07,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375085071] [2022-03-15 20:48:07,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375085071] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:48:07,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248651128] [2022-03-15 20:48:07,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:48:07,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:48:07,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:48:07,264 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:48:07,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 20:48:07,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 20:48:07,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:48:07,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:48:07,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:48:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:07,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:48:07,369 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:07,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248651128] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:48:07,369 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:48:07,373 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-15 20:48:07,373 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [892084154] [2022-03-15 20:48:07,373 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:48:07,374 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:48:07,376 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 61 transitions. [2022-03-15 20:48:07,376 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:48:07,732 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [5962#(or (< (+ 3 i2) n) (<= (+ n 1) i1) (<= n (+ i2 1))), 5959#(or (<= (+ n 1) i1) (< (+ i2 1) n)), 5965#(or (< (+ 3 i2) n) (<= n (+ i2 1)) (<= n i1)), 5968#(or (< (+ 3 i2) n) (<= n (+ i2 1)) (<= n (+ 2 i1))), 5963#(or (<= n i1) (< (+ i2 1) n)), 5958#(or (< (+ i2 1) n) (<= (+ 2 n) i1)), 5964#(or (< (+ i2 1) n) (<= n (+ i1 1))), 5967#(or (<= n (+ 2 i1)) (< (+ i2 1) n)), 5966#(or (< (+ 3 i2) n) (<= n (+ i2 1)) (<= n (+ i1 1))), 5961#(or (< (+ 3 i2) n) (<= n (+ i2 1)) (<= (+ 2 n) i1)), 5960#(or (< (+ 3 i2) n) (<= n (+ i2 1))), 5957#(< (+ i2 1) n)] [2022-03-15 20:48:07,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 20:48:07,732 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:48:07,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 20:48:07,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2022-03-15 20:48:07,733 INFO L87 Difference]: Start difference. First operand 220 states and 632 transitions. Second operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:48:07,992 INFO L93 Difference]: Finished difference Result 296 states and 771 transitions. [2022-03-15 20:48:07,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 20:48:07,992 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 20:48:07,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:48:07,994 INFO L225 Difference]: With dead ends: 296 [2022-03-15 20:48:07,994 INFO L226 Difference]: Without dead ends: 280 [2022-03-15 20:48:07,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=476, Invalid=1416, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:48:07,995 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 76 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:48:07,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 1 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:48:07,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-03-15 20:48:07,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2022-03-15 20:48:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 2.832618025751073) internal successors, (660), 233 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 660 transitions. [2022-03-15 20:48:07,999 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 660 transitions. Word has length 15 [2022-03-15 20:48:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:48:08,000 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 660 transitions. [2022-03-15 20:48:08,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 660 transitions. [2022-03-15 20:48:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:48:08,000 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:48:08,000 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:48:08,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 20:48:08,201 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 20:48:08,201 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:48:08,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:48:08,201 INFO L85 PathProgramCache]: Analyzing trace with hash 712074290, now seen corresponding path program 10 times [2022-03-15 20:48:08,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:48:08,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611566285] [2022-03-15 20:48:08,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:48:08,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:48:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:48:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:08,269 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:48:08,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611566285] [2022-03-15 20:48:08,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611566285] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:48:08,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731725676] [2022-03-15 20:48:08,269 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:48:08,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:48:08,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:48:08,273 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:48:08,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 20:48:08,309 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:48:08,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:48:08,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:48:08,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:48:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:08,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:48:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:08,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731725676] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:48:08,370 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:48:08,370 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 11 [2022-03-15 20:48:08,370 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006054764] [2022-03-15 20:48:08,370 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:48:08,371 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:48:08,375 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 84 transitions. [2022-03-15 20:48:08,375 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:48:08,925 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [6883#(or (<= n (+ 2 i1)) (< (+ 3 i1) n)), 6894#(or (<= n (+ 5 i2)) (<= n (+ i1 4)) (< (+ 5 i1) n)), 6885#(or (<= n (+ 3 i2)) (<= n (+ 2 i1)) (< (+ 3 i1) n)), 6879#(or (<= n (+ 5 i2)) (< (+ i1 1) n) (<= n i1)), 6891#(or (<= n (+ i2 1)) (<= n (+ i1 4)) (< (+ 5 i1) n)), 6890#(or (<= n (+ i1 4)) (< (+ 5 i1) n)), 6881#(or (<= n (+ 3 i2)) (< (+ 2 i1) n) (<= n (+ i1 1))), 6872#(or (< (+ i1 1) n) (<= n i1)), 6876#(or (< i1 n) (<= n (+ 5 i2))), 6880#(or (<= n (+ i2 1)) (< (+ 2 i1) n) (<= n (+ i1 1))), 6871#(< i1 n), 6887#(or (< (+ i1 4) n) (<= n (+ 3 i1))), 6873#(or (< (+ 2 i1) n) (<= n (+ i1 1))), 6886#(or (<= n (+ 5 i2)) (<= n (+ 2 i1)) (< (+ 3 i1) n)), 6875#(or (<= n (+ 3 i2)) (< i1 n)), 6889#(or (< (+ i1 4) n) (<= n (+ 3 i2)) (<= n (+ 3 i1))), 6882#(or (<= n (+ 5 i2)) (< (+ 2 i1) n) (<= n (+ i1 1))), 6893#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (<= n (+ 5 i2))), 6884#(or (<= n (+ i2 1)) (<= n (+ 2 i1)) (< (+ 3 i1) n)), 6892#(or (<= n (+ 3 i2)) (<= n (+ i1 4)) (< (+ 5 i1) n)), 6888#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (<= n (+ i2 1))), 6874#(or (< i1 n) (<= n (+ i2 1))), 6878#(or (<= n (+ 3 i2)) (< (+ i1 1) n) (<= n i1)), 6877#(or (<= n (+ i2 1)) (< (+ i1 1) n) (<= n i1))] [2022-03-15 20:48:08,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 20:48:08,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:48:08,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 20:48:08,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1049, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:48:08,927 INFO L87 Difference]: Start difference. First operand 234 states and 660 transitions. Second operand has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:12,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:48:12,277 INFO L93 Difference]: Finished difference Result 852 states and 2327 transitions. [2022-03-15 20:48:12,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2022-03-15 20:48:12,278 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 20:48:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:48:12,281 INFO L225 Difference]: With dead ends: 852 [2022-03-15 20:48:12,281 INFO L226 Difference]: Without dead ends: 821 [2022-03-15 20:48:12,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12270 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=8741, Invalid=21361, Unknown=0, NotChecked=0, Total=30102 [2022-03-15 20:48:12,284 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 136 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:48:12,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 1 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:48:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2022-03-15 20:48:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 339. [2022-03-15 20:48:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 2.9822485207100593) internal successors, (1008), 338 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 1008 transitions. [2022-03-15 20:48:12,299 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 1008 transitions. Word has length 16 [2022-03-15 20:48:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:48:12,299 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 1008 transitions. [2022-03-15 20:48:12,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 1008 transitions. [2022-03-15 20:48:12,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:48:12,300 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:48:12,300 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:48:12,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 20:48:12,516 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 20:48:12,517 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:48:12,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:48:12,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1122906175, now seen corresponding path program 11 times [2022-03-15 20:48:12,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:48:12,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217859788] [2022-03-15 20:48:12,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:48:12,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:48:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:48:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:12,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:48:12,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217859788] [2022-03-15 20:48:12,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217859788] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:48:12,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535661827] [2022-03-15 20:48:12,588 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:48:12,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:48:12,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:48:12,590 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:48:12,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 20:48:12,615 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:48:12,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:48:12,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:48:12,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:48:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:12,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:48:12,676 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:12,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535661827] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:48:12,677 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:48:12,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 11 [2022-03-15 20:48:12,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2082127657] [2022-03-15 20:48:12,677 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:48:12,678 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:48:12,681 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 78 transitions. [2022-03-15 20:48:12,681 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:48:13,366 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [8828#(or (<= n (+ 5 i1)) (< (+ 6 i1) n)), 8814#(or (<= (+ i2 4) n) (< (+ i1 1) n) (<= n i1)), 8807#(or (< (+ i1 4) n) (<= n (+ 3 i1))), 8825#(or (<= (+ i2 4) n) (<= n (+ i1 4)) (< (+ 5 i1) n)), 8803#(< i1 n), 8826#(or (<= (+ 6 i2) n) (<= n (+ i1 4)) (< (+ 5 i1) n)), 8815#(or (<= (+ i2 4) n) (< (+ 2 i1) n) (<= n (+ i1 1))), 8827#(or (<= n (+ i2 1)) (<= (+ i2 4) n)), 8816#(or (<= (+ i2 4) n) (<= n (+ 2 i1)) (< (+ 3 i1) n)), 8817#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (<= (+ i2 4) n)), 8832#(or (<= n (+ 5 i1)) (< (+ 6 i1) n) (<= (+ 6 i2) n)), 8821#(or (<= (+ 6 i2) n) (<= n (+ 2 i1)) (< (+ 3 i1) n)), 8829#(or (<= n (+ 5 i1)) (< (+ 6 i1) n) (< (+ i2 1) n)), 8830#(or (<= n (+ 5 i1)) (< (+ 6 i1) n) (<= (+ i2 4) n)), 8811#(or (<= n (+ 2 i1)) (< (+ i2 1) n) (< (+ 3 i1) n)), 8813#(or (< i1 n) (<= (+ i2 4) n)), 8809#(or (< (+ i1 1) n) (<= n i1) (< (+ i2 1) n)), 8806#(or (<= n (+ 2 i1)) (< (+ 3 i1) n)), 8819#(or (<= (+ 6 i2) n) (< (+ i1 1) n) (<= n i1)), 8823#(or (<= n (+ i1 4)) (< (+ 5 i1) n)), 8818#(or (< i1 n) (<= (+ 6 i2) n)), 8808#(or (< i1 n) (< (+ i2 1) n)), 8804#(or (< (+ i1 1) n) (<= n i1)), 8812#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (< (+ i2 1) n)), 8810#(or (< (+ i2 1) n) (< (+ 2 i1) n) (<= n (+ i1 1))), 8831#(or (<= n (+ 3 i2)) (<= (+ 6 i2) n)), 8822#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (<= (+ 6 i2) n)), 8805#(or (< (+ 2 i1) n) (<= n (+ i1 1))), 8820#(or (<= (+ 6 i2) n) (< (+ 2 i1) n) (<= n (+ i1 1))), 8824#(or (<= n (+ i1 4)) (< (+ i2 1) n) (< (+ 5 i1) n))] [2022-03-15 20:48:13,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 20:48:13,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:48:13,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 20:48:13,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=1440, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:48:13,367 INFO L87 Difference]: Start difference. First operand 339 states and 1008 transitions. Second operand has 41 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 40 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 20:48:15,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:48:15,290 INFO L93 Difference]: Finished difference Result 750 states and 2019 transitions. [2022-03-15 20:48:15,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-03-15 20:48:15,290 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 40 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 16 [2022-03-15 20:48:15,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:48:15,293 INFO L225 Difference]: With dead ends: 750 [2022-03-15 20:48:15,293 INFO L226 Difference]: Without dead ends: 746 [2022-03-15 20:48:15,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4142 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2444, Invalid=11128, Unknown=0, NotChecked=0, Total=13572 [2022-03-15 20:48:15,297 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 173 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:48:15,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 1 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:48:15,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-03-15 20:48:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 521. [2022-03-15 20:48:15,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 3.128846153846154) internal successors, (1627), 520 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:48:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1627 transitions. [2022-03-15 20:48:15,308 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 1627 transitions. Word has length 16 [2022-03-15 20:48:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:48:15,308 INFO L470 AbstractCegarLoop]: Abstraction has 521 states and 1627 transitions. [2022-03-15 20:48:15,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 40 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 20:48:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 1627 transitions. [2022-03-15 20:48:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:48:15,309 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:48:15,309 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:48:15,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 20:48:15,523 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 20:48:15,523 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:48:15,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:48:15,524 INFO L85 PathProgramCache]: Analyzing trace with hash -456876353, now seen corresponding path program 12 times [2022-03-15 20:48:15,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:48:15,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229340191] [2022-03-15 20:48:15,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:48:15,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:48:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:48:15,617 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:15,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:48:15,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229340191] [2022-03-15 20:48:15,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229340191] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:48:15,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54218248] [2022-03-15 20:48:15,617 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:48:15,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:48:15,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:48:15,619 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:48:15,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 20:48:15,652 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 20:48:15,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:48:15,655 WARN L261 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-15 20:48:15,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:48:15,939 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:48:15,939 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 13 new quantified variables, introduced 21 case distinctions, treesize of input 58 treesize of output 206 [2022-03-15 20:48:16,884 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:16,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:48:17,443 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:48:17,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 24 new quantified variables, introduced 78 case distinctions, treesize of input 63 treesize of output 682 [2022-03-15 20:48:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:48:49,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54218248] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:48:49,667 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:48:49,667 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-03-15 20:48:49,667 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1479115098] [2022-03-15 20:48:49,668 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:48:49,669 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:48:49,673 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 95 transitions. [2022-03-15 20:48:49,673 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:48:51,744 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 38 new interpolants: [10944#(and (or (= (select f (select f (select f (select f (select f (select f x2)))))) x1) (not (< (+ 5 i2) n))) (<= n (+ 6 i2))), 10933#(and (or (<= n i2) (< (+ 6 i1) n) (not (< (+ 5 i1) n))) (or (= x2 (select f (select f (select f (select f (select f (select f x1))))))) (< (+ 6 i1) n) (not (< (+ 5 i1) n)))), 10924#(and (or (= (select f x1) (select f (select f (select f (select f (select f (select f x2))))))) (< (+ i1 1) n) (not (< i1 n))) (or (< (+ i1 1) n) (not (< i1 n)) (<= n (+ 6 i2)))), 10938#(and (or (= (select f (select f (select f (select f x2)))) (select f (select f (select f (select f (select f x1)))))) (not (< (+ i1 4) n)) (< (+ 5 i1) n)) (or (<= n (+ i2 4)) (not (< (+ i1 4) n)) (< (+ 5 i1) n))), 10917#(and (or (<= n (+ i2 4)) (< (+ i1 1) n) (not (< i1 n))) (or (< (+ i1 1) n) (not (< i1 n)) (= (select f (select f (select f (select f x2)))) (select f x1)))), 10925#(and (or (= (select f (select f x1)) (select f (select f (select f (select f (select f (select f x2))))))) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (not (< (+ i1 1) n)) (< (+ 2 i1) n) (<= n (+ 6 i2)))), 10934#(and (or (< (+ i1 4) n) (= (select f (select f (select f (select f x1)))) (select f (select f x2))) (not (< (+ 3 i1) n))) (or (<= n (+ 2 i2)) (< (+ i1 4) n) (not (< (+ 3 i1) n)))), 10926#(and (or (<= n (+ 6 i2)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (= (select f (select f (select f x1))) (select f (select f (select f (select f (select f (select f x2))))))) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 10915#(and (or (= (select f (select f x2)) (select f (select f x1))) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (<= n (+ 2 i2)) (not (< (+ i1 1) n)) (< (+ 2 i1) n))), 10939#(and (or (<= n (+ i2 4)) (< (+ 6 i1) n) (not (< (+ 5 i1) n))) (or (< (+ 6 i1) n) (not (< (+ 5 i1) n)) (= (select f (select f (select f (select f x2)))) (select f (select f (select f (select f (select f (select f x1))))))))), 10919#(or (<= n (+ 2 i1)) (< (+ 3 i1) n) (= (select f (select f (select f x1))) x2)), 10916#(and (or (< i1 n) (<= n (+ i2 4))) (or (< i1 n) (= (select f (select f (select f (select f x2)))) x1))), 10930#(and (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (= (select f (select f (select f (select f x1)))) x2)) (or (< (+ i1 4) n) (<= n i2) (not (< (+ 3 i1) n)))), 10914#(and (or (= (select f (select f x2)) (select f x1)) (< (+ i1 1) n) (not (< i1 n))) (or (<= n (+ 2 i2)) (< (+ i1 1) n) (not (< i1 n)))), 10937#(and (or (< (+ i1 4) n) (<= n (+ i2 4)) (not (< (+ 3 i1) n))) (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (= (select f (select f (select f (select f x1)))) (select f (select f (select f (select f x2))))))), 10909#(or (= (select f (select f x1)) x2) (< (+ 2 i1) n) (<= n (+ i1 1))), 10908#(or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n))), 10911#(and (or (<= n i2) (< (+ i1 1) n) (not (< i1 n))) (or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n)))), 10943#(and (<= n (+ i2 4)) (or (= (select f (select f (select f (select f x2)))) x1) (not (< (+ 3 i2) n)))), 10920#(and (or (not (< (+ 2 i1) n)) (< (+ 3 i1) n) (= (select f (select f (select f x1))) x2)) (or (<= n i2) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 10942#(and (or (< (+ 6 i1) n) (not (< (+ 5 i1) n)) (<= n (+ 6 i2))) (or (< (+ 6 i1) n) (= (select f (select f (select f (select f (select f (select f x2)))))) (select f (select f (select f (select f (select f (select f x1))))))) (not (< (+ 5 i1) n)))), 10907#(or (< i1 n) (= x2 x1)), 10940#(and (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (<= n (+ 6 i2))) (or (< (+ i1 4) n) (= (select f (select f (select f (select f x1)))) (select f (select f (select f (select f (select f (select f x2))))))) (not (< (+ 3 i1) n)))), 10928#(or (<= n (+ i1 4)) (= (select f (select f (select f (select f (select f x1))))) x2) (< (+ 5 i1) n)), 10941#(and (or (not (< (+ i1 4) n)) (= (select f (select f (select f (select f (select f (select f x2)))))) (select f (select f (select f (select f (select f x1)))))) (< (+ 5 i1) n)) (or (not (< (+ i1 4) n)) (<= n (+ 6 i2)) (< (+ 5 i1) n))), 10929#(and (<= n (+ 2 i2)) (or (= (select f (select f x2)) x1) (not (< (+ i2 1) n)))), 10923#(and (or (< i1 n) (= (select f (select f (select f (select f (select f (select f x2)))))) x1)) (or (< i1 n) (<= n (+ 6 i2)))), 10912#(and (or (<= n i2) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (= (select f (select f x1)) x2) (not (< (+ i1 1) n)) (< (+ 2 i1) n))), 10931#(and (or (not (< (+ i1 4) n)) (= (select f (select f (select f (select f (select f x1))))) x2) (< (+ 5 i1) n)) (or (<= n i2) (not (< (+ i1 4) n)) (< (+ 5 i1) n))), 10913#(and (or (<= n (+ 2 i2)) (< i1 n)) (or (< i1 n) (= (select f (select f x2)) x1))), 10936#(and (or (= (select f (select f x2)) (select f (select f (select f (select f (select f (select f x1))))))) (< (+ 6 i1) n) (not (< (+ 5 i1) n))) (or (<= n (+ 2 i2)) (< (+ 6 i1) n) (not (< (+ 5 i1) n)))), 10918#(and (or (<= n (+ i2 4)) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (= (select f (select f (select f (select f x2)))) (select f (select f x1))) (not (< (+ i1 1) n)) (< (+ 2 i1) n))), 10927#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (= (select f (select f (select f (select f x1)))) x2)), 10935#(and (or (<= n (+ 2 i2)) (not (< (+ i1 4) n)) (< (+ 5 i1) n)) (or (not (< (+ i1 4) n)) (= (select f (select f x2)) (select f (select f (select f (select f (select f x1)))))) (< (+ 5 i1) n))), 10910#(and (or (< i1 n) (= x2 x1)) (or (< i1 n) (<= n i2))), 10922#(and (or (= (select f (select f (select f (select f x2)))) (select f (select f (select f x1)))) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (<= n (+ i2 4)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 10932#(or (<= n (+ 5 i1)) (= x2 (select f (select f (select f (select f (select f (select f x1))))))) (< (+ 6 i1) n)), 10921#(and (or (= (select f (select f x2)) (select f (select f (select f x1)))) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (<= n (+ 2 i2)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)))] [2022-03-15 20:48:51,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 20:48:51,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:48:51,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 20:48:51,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=5130, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 20:48:51,750 INFO L87 Difference]: Start difference. First operand 521 states and 1627 transitions. Second operand has 52 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 51 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:49:04,754 INFO L93 Difference]: Finished difference Result 1422 states and 3916 transitions. [2022-03-15 20:49:04,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-03-15 20:49:04,754 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 51 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:49:04,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:49:04,759 INFO L225 Difference]: With dead ends: 1422 [2022-03-15 20:49:04,759 INFO L226 Difference]: Without dead ends: 1372 [2022-03-15 20:49:04,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7799 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=3422, Invalid=25648, Unknown=0, NotChecked=0, Total=29070 [2022-03-15 20:49:04,761 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 494 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 3012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:49:04,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 1 Invalid, 3012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:49:04,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-03-15 20:49:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 684. [2022-03-15 20:49:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 3.0658857979502194) internal successors, (2094), 683 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 2094 transitions. [2022-03-15 20:49:04,778 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 2094 transitions. Word has length 17 [2022-03-15 20:49:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:49:04,778 INFO L470 AbstractCegarLoop]: Abstraction has 684 states and 2094 transitions. [2022-03-15 20:49:04,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 51 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 2094 transitions. [2022-03-15 20:49:04,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:49:04,779 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:49:04,779 INFO L514 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:49:04,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 20:49:04,996 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 20:49:04,996 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:49:04,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:49:04,997 INFO L85 PathProgramCache]: Analyzing trace with hash -910628982, now seen corresponding path program 13 times [2022-03-15 20:49:04,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:49:04,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61896912] [2022-03-15 20:49:04,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:49:04,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:49:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:49:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:49:05,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:49:05,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61896912] [2022-03-15 20:49:05,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61896912] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:49:05,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234277132] [2022-03-15 20:49:05,051 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:49:05,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:49:05,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:49:05,052 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:49:05,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 20:49:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:49:05,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:49:05,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:49:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:49:05,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:49:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 20:49:05,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234277132] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:49:05,157 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:49:05,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-03-15 20:49:05,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [912460053] [2022-03-15 20:49:05,158 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:49:05,158 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:49:05,162 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 87 transitions. [2022-03-15 20:49:05,162 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:49:05,738 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [14052#(or (<= n (+ 3 i2)) (<= (+ 5 i2) i1)), 14041#(or (<= n (+ i2 1)) (<= (+ 3 i2) i1)), 14039#(or (<= n (+ 3 i2)) (<= (+ 7 i2) n)), 14057#(or (<= n (+ 3 i2)) (<= (+ 2 i2) i1)), 14054#(or (<= n (+ i2 1)) (<= (+ i2 1) i1)), 14045#(or (< (+ 2 i1) n) (<= n (+ i1 1))), 14046#(or (<= n (+ 2 i1)) (< (+ 3 i1) n)), 14050#(or (<= n (+ 6 i1)) (< (+ 7 i1) n)), 14037#(or (<= (+ 5 i2) n) (<= n (+ i2 1))), 14038#(or (<= (+ i2 4) i1) (<= n (+ i2 1))), 14053#(or (<= n (+ 3 i2)) (<= (+ i2 4) i1)), 14055#(or (<= n (+ 3 i2)) (<= (+ 3 i2) i1)), 14051#(or (<= i2 (+ i1 4)) (<= n i1)), 14042#(or (<= n (+ i2 1)) (<= (+ 2 i2) i1)), 14048#(or (<= n (+ i1 4)) (< (+ 5 i1) n)), 14056#(or (<= n (+ i2 1)) (<= i2 i1)), 14047#(or (< (+ i1 4) n) (<= n (+ 3 i1))), 14049#(or (<= n (+ 5 i1)) (< (+ 6 i1) n)), 14040#(or (<= n (+ 3 i2)) (<= (+ 6 i2) i1)), 14043#(< i1 n), 14044#(or (< (+ i1 1) n) (<= n i1))] [2022-03-15 20:49:05,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 20:49:05,739 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:49:05,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 20:49:05,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:49:05,739 INFO L87 Difference]: Start difference. First operand 684 states and 2094 transitions. Second operand has 31 states, 31 states have (on average 2.2903225806451615) 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 20:49:09,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:49:09,285 INFO L93 Difference]: Finished difference Result 1422 states and 3770 transitions. [2022-03-15 20:49:09,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-15 20:49:09,286 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.2903225806451615) 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 17 [2022-03-15 20:49:09,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:49:09,290 INFO L225 Difference]: With dead ends: 1422 [2022-03-15 20:49:09,290 INFO L226 Difference]: Without dead ends: 1422 [2022-03-15 20:49:09,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3304 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2491, Invalid=9499, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 20:49:09,293 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 336 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:49:09,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 1 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:49:09,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2022-03-15 20:49:09,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 714. [2022-03-15 20:49:09,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 713 states have (on average 2.9915848527349227) internal successors, (2133), 713 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:49:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 2133 transitions. [2022-03-15 20:49:09,309 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 2133 transitions. Word has length 17 [2022-03-15 20:49:09,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:49:09,309 INFO L470 AbstractCegarLoop]: Abstraction has 714 states and 2133 transitions. [2022-03-15 20:49:09,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.2903225806451615) 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 20:49:09,309 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 2133 transitions. [2022-03-15 20:49:09,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:49:09,311 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:49:09,311 INFO L514 BasicCegarLoop]: trace histogram [7, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:49:09,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 20:49:09,529 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 20:49:09,529 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:49:09,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:49:09,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1960359378, now seen corresponding path program 14 times [2022-03-15 20:49:09,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:49:09,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706347538] [2022-03-15 20:49:09,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:49:09,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:49:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:49:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:09,675 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:49:09,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706347538] [2022-03-15 20:49:09,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706347538] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:49:09,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349009435] [2022-03-15 20:49:09,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:49:09,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:49:09,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:49:09,676 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:49:09,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 20:49:09,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:49:09,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:49:09,706 WARN L261 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-15 20:49:09,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:49:10,040 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:49:10,040 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 13 new quantified variables, introduced 21 case distinctions, treesize of input 60 treesize of output 206 [2022-03-15 20:49:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:49:10,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:49:11,636 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:49:11,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 26 new quantified variables, introduced 91 case distinctions, treesize of input 67 treesize of output 790 [2022-03-15 20:55:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:08,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349009435] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:55:08,276 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:55:08,276 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-03-15 20:55:08,276 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [38748468] [2022-03-15 20:55:08,276 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:55:08,278 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:55:08,283 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 106 transitions. [2022-03-15 20:55:08,284 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:55:11,101 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [17223#(and (or (not (< (+ i1 4) n)) (<= (+ 3 i2) n) (< (+ 5 i1) n)) (or (not (< (+ i1 4) n)) (= (select f (select f (select f (select f (select f x1))))) (select f (select f (select f x2)))) (< (+ 5 i1) n))), 17225#(and (or (= (select f (select f (select f x1))) (select f (select f (select f (select f (select f x2)))))) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (<= (+ 5 i2) n) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 17211#(and (or (< i1 n) (<= (+ 7 i2) n)) (or (< i1 n) (= x1 (select f (select f (select f (select f (select f (select f (select f x2)))))))))), 17210#(and (or (= (select f (select f (select f (select f (select f x2))))) x1) (< i1 n)) (or (<= (+ 5 i2) n) (< i1 n))), 17218#(and (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (= (select f (select f (select f (select f x1)))) (select f x2))) (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (<= (+ i2 1) n))), 17214#(and (or (<= (+ 5 i2) n) (< (+ i1 1) n) (not (< i1 n))) (or (= (select f x1) (select f (select f (select f (select f (select f x2)))))) (< (+ i1 1) n) (not (< i1 n)))), 17215#(and (or (= (select f x1) (select f (select f (select f (select f (select f (select f (select f x2)))))))) (< (+ i1 1) n) (not (< i1 n))) (or (<= (+ 7 i2) n) (< (+ i1 1) n) (not (< i1 n)))), 17217#(and (or (not (< (+ 2 i1) n)) (< (+ 3 i1) n) (<= (+ i2 1) n)) (or (= (select f (select f (select f x1))) (select f x2)) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 17238#(and (or (= (select f (select f (select f (select f (select f x2))))) x1) (not (< (+ 3 i2) n))) (or (<= (+ 5 i2) n) (not (< (+ 3 i2) n)))), 17233#(and (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (= (select f (select f (select f (select f x1)))) (select f (select f (select f (select f (select f (select f (select f x2))))))))) (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (<= (+ 7 i2) n))), 17236#(and (or (not (< (+ 6 i1) n)) (= (select f (select f (select f (select f (select f x2))))) (select f (select f (select f (select f (select f (select f (select f x1)))))))) (< (+ 7 i1) n)) (or (<= (+ 5 i2) n) (not (< (+ 6 i1) n)) (< (+ 7 i1) n))), 17232#(and (or (<= (+ 7 i2) n) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (= (select f (select f (select f x1))) (select f (select f (select f (select f (select f (select f (select f x2)))))))) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 17216#(and (or (not (< (+ i1 1) n)) (< (+ 2 i1) n) (<= (+ i2 1) n)) (or (not (< (+ i1 1) n)) (< (+ 2 i1) n) (= (select f (select f x1)) (select f x2)))), 17222#(and (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (<= (+ 3 i2) n)) (or (< (+ i1 4) n) (= (select f (select f (select f (select f x1)))) (select f (select f (select f x2)))) (not (< (+ 3 i1) n)))), 17228#(and (or (< (+ 6 i1) n) (not (< (+ 5 i1) n)) (<= (+ i2 1) n)) (or (< (+ 6 i1) n) (= (select f (select f (select f (select f (select f (select f x1)))))) (select f x2)) (not (< (+ 5 i1) n)))), 17237#(and (or (not (< (+ i2 1) n)) (= x1 (select f (select f (select f x2))))) (or (<= (+ 3 i2) n) (not (< (+ i2 1) n)))), 17227#(and (or (<= (+ 5 i2) n) (not (< (+ i1 4) n)) (< (+ 5 i1) n)) (or (not (< (+ i1 4) n)) (= (select f (select f (select f (select f (select f x1))))) (select f (select f (select f (select f (select f x2)))))) (< (+ 5 i1) n))), 17204#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (= (select f (select f (select f (select f x1)))) x2)), 17230#(and (or (<= (+ 5 i2) n) (< (+ 6 i1) n) (not (< (+ 5 i1) n))) (or (= (select f (select f (select f (select f (select f x2))))) (select f (select f (select f (select f (select f (select f x1))))))) (< (+ 6 i1) n) (not (< (+ 5 i1) n)))), 17234#(and (or (not (< (+ 6 i1) n)) (= (select f x2) (select f (select f (select f (select f (select f (select f (select f x1)))))))) (< (+ 7 i1) n)) (or (not (< (+ 6 i1) n)) (<= (+ i2 1) n) (< (+ 7 i1) n))), 17201#(or (= (select f x1) x2) (< (+ i1 1) n) (not (< i1 n))), 17242#(and (or (not (< (+ 6 i1) n)) (= (select f (select f (select f (select f (select f (select f (select f x2))))))) (select f (select f (select f (select f (select f (select f (select f x1)))))))) (< (+ 7 i1) n)) (or (not (< (+ 6 i1) n)) (<= (+ 7 i2) n) (< (+ 7 i1) n))), 17213#(and (or (= (select f x1) (select f (select f (select f x2)))) (< (+ i1 1) n) (not (< i1 n))) (or (<= (+ 3 i2) n) (< (+ i1 1) n) (not (< i1 n)))), 17209#(and (or (< i1 n) (<= (+ 3 i2) n)) (or (< i1 n) (= x1 (select f (select f (select f x2)))))), 17241#(and (or (<= (+ 7 i2) n) (< (+ 6 i1) n) (not (< (+ 5 i1) n))) (or (= (select f (select f (select f (select f (select f (select f (select f x2))))))) (select f (select f (select f (select f (select f (select f x1))))))) (< (+ 6 i1) n) (not (< (+ 5 i1) n)))), 17240#(and (or (not (< (+ i1 4) n)) (<= (+ 7 i2) n) (< (+ 5 i1) n)) (or (not (< (+ i1 4) n)) (= (select f (select f (select f (select f (select f x1))))) (select f (select f (select f (select f (select f (select f (select f x2)))))))) (< (+ 5 i1) n))), 17205#(or (<= n (+ i1 4)) (= (select f (select f (select f (select f (select f x1))))) x2) (< (+ 5 i1) n)), 17206#(or (<= n (+ 5 i1)) (= x2 (select f (select f (select f (select f (select f (select f x1))))))) (< (+ 6 i1) n)), 17229#(and (or (< (+ 6 i1) n) (not (< (+ 5 i1) n)) (= (select f (select f (select f x2))) (select f (select f (select f (select f (select f (select f x1)))))))) (or (< (+ 6 i1) n) (<= (+ 3 i2) n) (not (< (+ 5 i1) n)))), 17219#(and (or (not (< (+ i1 4) n)) (<= (+ i2 1) n) (< (+ 5 i1) n)) (or (not (< (+ i1 4) n)) (= (select f (select f (select f (select f (select f x1))))) (select f x2)) (< (+ 5 i1) n))), 17226#(and (or (<= (+ 5 i2) n) (< (+ i1 4) n) (not (< (+ 3 i1) n))) (or (< (+ i1 4) n) (not (< (+ 3 i1) n)) (= (select f (select f (select f (select f x1)))) (select f (select f (select f (select f (select f x2)))))))), 17200#(or (< i1 n) (= x2 x1)), 17202#(or (= (select f (select f x1)) x2) (< (+ 2 i1) n) (<= n (+ i1 1))), 17208#(and (or (< i1 n) (<= (+ i2 1) n)) (or (< i1 n) (= x1 (select f x2)))), 17212#(and (or (= (select f x1) (select f x2)) (< (+ i1 1) n) (not (< i1 n))) (or (< (+ i1 1) n) (not (< i1 n)) (<= (+ i2 1) n))), 17220#(and (or (<= (+ 3 i2) n) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (not (< (+ i1 1) n)) (< (+ 2 i1) n) (= (select f (select f x1)) (select f (select f (select f x2)))))), 17207#(or (<= n (+ 6 i1)) (= x2 (select f (select f (select f (select f (select f (select f (select f x1)))))))) (< (+ 7 i1) n)), 17203#(or (<= n (+ 2 i1)) (< (+ 3 i1) n) (= (select f (select f (select f x1))) x2)), 17221#(and (or (<= (+ 3 i2) n) (not (< (+ 2 i1) n)) (< (+ 3 i1) n)) (or (= (select f (select f (select f x1))) (select f (select f (select f x2)))) (not (< (+ 2 i1) n)) (< (+ 3 i1) n))), 17231#(and (or (= (select f (select f x1)) (select f (select f (select f (select f (select f (select f (select f x2)))))))) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (<= (+ 7 i2) n) (not (< (+ i1 1) n)) (< (+ 2 i1) n))), 17224#(and (or (<= (+ 5 i2) n) (not (< (+ i1 1) n)) (< (+ 2 i1) n)) (or (not (< (+ i1 1) n)) (= (select f (select f x1)) (select f (select f (select f (select f (select f x2)))))) (< (+ 2 i1) n))), 17239#(and (or (= x1 (select f (select f (select f (select f (select f (select f (select f x2)))))))) (not (< (+ 5 i2) n))) (or (<= (+ 7 i2) n) (not (< (+ 5 i2) n)))), 17235#(and (or (not (< (+ 6 i1) n)) (<= (+ 3 i2) n) (< (+ 7 i1) n)) (or (not (< (+ 6 i1) n)) (= (select f (select f (select f x2))) (select f (select f (select f (select f (select f (select f (select f x1)))))))) (< (+ 7 i1) n)))] [2022-03-15 20:55:11,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-15 20:55:11,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:55:11,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-15 20:55:11,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=5918, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 20:55:11,102 INFO L87 Difference]: Start difference. First operand 714 states and 2133 transitions. Second operand has 57 states, 56 states have (on average 1.875) internal successors, (105), 56 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:27,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:55:27,868 INFO L93 Difference]: Finished difference Result 1101 states and 2808 transitions. [2022-03-15 20:55:27,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2022-03-15 20:55:27,868 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.875) internal successors, (105), 56 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:55:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:55:27,881 INFO L225 Difference]: With dead ends: 1101 [2022-03-15 20:55:27,881 INFO L226 Difference]: Without dead ends: 1080 [2022-03-15 20:55:27,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10657 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=3626, Invalid=37786, Unknown=0, NotChecked=0, Total=41412 [2022-03-15 20:55:27,885 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 634 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 4617 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 5096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 4617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:55:27,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [634 Valid, 1 Invalid, 5096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 4617 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 20:55:27,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2022-03-15 20:55:27,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 695. [2022-03-15 20:55:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 3.031700288184438) internal successors, (2104), 694 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 2104 transitions. [2022-03-15 20:55:27,913 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 2104 transitions. Word has length 18 [2022-03-15 20:55:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:55:27,913 INFO L470 AbstractCegarLoop]: Abstraction has 695 states and 2104 transitions. [2022-03-15 20:55:27,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.875) internal successors, (105), 56 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:27,913 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 2104 transitions. [2022-03-15 20:55:27,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:55:27,914 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:55:27,914 INFO L514 BasicCegarLoop]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:55:27,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 20:55:28,127 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 20:55:28,128 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:55:28,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:55:28,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1290000765, now seen corresponding path program 15 times [2022-03-15 20:55:28,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:55:28,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829333424] [2022-03-15 20:55:28,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:55:28,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:55:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:55:28,198 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:28,198 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:55:28,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829333424] [2022-03-15 20:55:28,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829333424] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:55:28,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612242497] [2022-03-15 20:55:28,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:55:28,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:28,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:55:28,200 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:55:28,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 20:55:28,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 20:55:28,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:55:28,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 20:55:28,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:55:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:28,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:55:28,318 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:28,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612242497] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:55:28,318 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:55:28,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 16 [2022-03-15 20:55:28,318 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [427333982] [2022-03-15 20:55:28,318 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:55:28,319 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:55:28,324 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 96 transitions. [2022-03-15 20:55:28,324 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:55:29,031 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [20114#(or (< (+ 3 i2) n) (<= n (+ i2 1)) (<= n (+ i1 1))), 20124#(or (<= n (+ i1 4)) (< (+ i2 1) n)), 20108#(or (<= n (+ 2 i1)) (< (+ i2 1) n)), 20118#(or (<= n (+ 3 i2)) (< (+ 5 i2) n) (<= (+ 2 n) i1)), 20107#(or (< (+ i2 1) n) (<= n (+ i1 1))), 20115#(or (< (+ 3 i2) n) (<= n (+ i2 1)) (<= n (+ 2 i1))), 20113#(or (< (+ 3 i2) n) (<= n (+ i2 1)) (<= n i1)), 20111#(or (< (+ 3 i2) n) (<= n (+ i2 1)) (<= (+ 2 n) i1)), 20123#(or (<= n (+ 3 i2)) (<= n (+ 3 i1)) (< (+ 5 i2) n)), 20106#(or (<= n i1) (< (+ i2 1) n)), 20109#(or (<= n (+ 3 i1)) (< (+ i2 1) n)), 20121#(or (<= n (+ 3 i2)) (< (+ 5 i2) n) (<= n (+ i1 1))), 20112#(or (< (+ 3 i2) n) (<= (+ n 1) i1) (<= n (+ i2 1))), 20126#(or (<= n (+ 3 i2)) (< (+ 5 i2) n) (<= n (+ i1 4))), 20125#(or (< (+ 3 i2) n) (<= n (+ i2 1)) (<= n (+ i1 4))), 20120#(or (<= n (+ 3 i2)) (< (+ 5 i2) n) (<= n i1)), 20117#(or (<= n (+ 3 i2)) (< (+ 5 i2) n)), 20103#(< (+ i2 1) n), 20116#(or (< (+ 3 i2) n) (<= n (+ 3 i1)) (<= n (+ i2 1))), 20122#(or (<= n (+ 3 i2)) (<= n (+ 2 i1)) (< (+ 5 i2) n)), 20104#(or (< (+ i2 1) n) (<= (+ 2 n) i1)), 20105#(or (<= (+ n 1) i1) (< (+ i2 1) n)), 20119#(or (<= n (+ 3 i2)) (<= (+ n 1) i1) (< (+ 5 i2) n)), 20110#(or (< (+ 3 i2) n) (<= n (+ i2 1)))] [2022-03-15 20:55:29,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 20:55:29,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:55:29,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 20:55:29,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=1324, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 20:55:29,032 INFO L87 Difference]: Start difference. First operand 695 states and 2104 transitions. Second operand has 37 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 36 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 20:55:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:55:29,783 INFO L93 Difference]: Finished difference Result 892 states and 2505 transitions. [2022-03-15 20:55:29,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 20:55:29,783 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 36 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 18 [2022-03-15 20:55:29,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:55:29,786 INFO L225 Difference]: With dead ends: 892 [2022-03-15 20:55:29,786 INFO L226 Difference]: Without dead ends: 856 [2022-03-15 20:55:29,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1605 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1609, Invalid=5033, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 20:55:29,787 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 99 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:55:29,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 1 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:55:29,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-03-15 20:55:29,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 746. [2022-03-15 20:55:29,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 2.9610738255033557) internal successors, (2206), 745 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:29,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 2206 transitions. [2022-03-15 20:55:29,799 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 2206 transitions. Word has length 18 [2022-03-15 20:55:29,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:55:29,799 INFO L470 AbstractCegarLoop]: Abstraction has 746 states and 2206 transitions. [2022-03-15 20:55:29,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 36 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 20:55:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 2206 transitions. [2022-03-15 20:55:29,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:55:29,800 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:55:29,800 INFO L514 BasicCegarLoop]: trace histogram [7, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:55:29,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 20:55:30,015 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 20:55:30,016 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:55:30,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:55:30,016 INFO L85 PathProgramCache]: Analyzing trace with hash 635075278, now seen corresponding path program 16 times [2022-03-15 20:55:30,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:55:30,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938487291] [2022-03-15 20:55:30,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:55:30,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:55:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:55:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:30,066 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:55:30,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938487291] [2022-03-15 20:55:30,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938487291] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:55:30,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447914249] [2022-03-15 20:55:30,066 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:55:30,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:30,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:55:30,067 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:55:30,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 20:55:30,089 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:55:30,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:55:30,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:55:30,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:55:30,125 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:30,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:55:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:30,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447914249] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:55:30,157 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:55:30,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 14 [2022-03-15 20:55:30,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [368253454] [2022-03-15 20:55:30,157 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:55:30,158 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:55:30,165 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 125 transitions. [2022-03-15 20:55:30,165 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:55:31,204 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [22716#(< i1 n), 22732#(or (<= n (+ 5 i2)) (< (+ i1 1) n) (<= n i1)), 22726#(or (<= n (+ 3 i2)) (< i1 n)), 22721#(or (< i1 n) (<= n (+ i2 1))), 22748#(or (<= n (+ 5 i1)) (< (+ 6 i1) n) (<= n (+ 5 i2))), 22737#(or (< (+ i1 1) n) (<= n (+ 7 i2)) (<= n i1)), 22720#(or (< (+ i1 4) n) (<= n (+ 3 i1))), 22727#(or (<= n (+ 3 i2)) (< (+ i1 1) n) (<= n i1)), 22752#(or (<= n (+ 5 i2)) (<= n (+ 6 i1)) (< (+ 7 i1) n)), 22722#(or (<= n (+ i2 1)) (< (+ i1 1) n) (<= n i1)), 22747#(or (<= n (+ 5 i1)) (<= n (+ 3 i2)) (< (+ 6 i1) n)), 22753#(or (<= n (+ 7 i2)) (<= n (+ i1 4)) (< (+ 5 i1) n)), 22717#(or (< (+ i1 1) n) (<= n i1)), 22735#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (<= n (+ 5 i2))), 22754#(or (<= n (+ 5 i1)) (< (+ 6 i1) n) (<= n (+ 7 i2))), 22728#(or (<= n (+ 3 i2)) (< (+ 2 i1) n) (<= n (+ i1 1))), 22738#(or (<= n (+ 7 i2)) (< (+ 2 i1) n) (<= n (+ i1 1))), 22750#(or (<= n (+ i2 1)) (<= n (+ 6 i1)) (< (+ 7 i1) n)), 22743#(or (<= n (+ 3 i2)) (<= n (+ i1 4)) (< (+ 5 i1) n)), 22746#(or (<= n (+ 5 i1)) (<= n (+ i2 1)) (< (+ 6 i1) n)), 22745#(or (<= n (+ 5 i1)) (< (+ 6 i1) n)), 22729#(or (<= n (+ 3 i2)) (<= n (+ 2 i1)) (< (+ 3 i1) n)), 22749#(or (<= n (+ 6 i1)) (< (+ 7 i1) n)), 22719#(or (<= n (+ 2 i1)) (< (+ 3 i1) n)), 22736#(or (< i1 n) (<= n (+ 7 i2))), 22723#(or (<= n (+ i2 1)) (< (+ 2 i1) n) (<= n (+ i1 1))), 22733#(or (<= n (+ 5 i2)) (< (+ 2 i1) n) (<= n (+ i1 1))), 22739#(or (<= n (+ 2 i1)) (<= n (+ 7 i2)) (< (+ 3 i1) n)), 22724#(or (<= n (+ i2 1)) (<= n (+ 2 i1)) (< (+ 3 i1) n)), 22741#(or (<= n (+ i1 4)) (< (+ 5 i1) n)), 22740#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (<= n (+ 7 i2))), 22718#(or (< (+ 2 i1) n) (<= n (+ i1 1))), 22734#(or (<= n (+ 5 i2)) (<= n (+ 2 i1)) (< (+ 3 i1) n)), 22744#(or (<= n (+ 5 i2)) (<= n (+ i1 4)) (< (+ 5 i1) n)), 22730#(or (< (+ i1 4) n) (<= n (+ 3 i2)) (<= n (+ 3 i1))), 22742#(or (<= n (+ i2 1)) (<= n (+ i1 4)) (< (+ 5 i1) n)), 22731#(or (< i1 n) (<= n (+ 5 i2))), 22725#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (<= n (+ i2 1))), 22755#(or (<= n (+ 6 i1)) (<= n (+ 7 i2)) (< (+ 7 i1) n)), 22751#(or (<= n (+ 3 i2)) (<= n (+ 6 i1)) (< (+ 7 i1) n))] [2022-03-15 20:55:31,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 20:55:31,205 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:55:31,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 20:55:31,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=2571, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 20:55:31,215 INFO L87 Difference]: Start difference. First operand 746 states and 2206 transitions. Second operand has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 53 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:50,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:55:50,415 INFO L93 Difference]: Finished difference Result 3282 states and 9715 transitions. [2022-03-15 20:55:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 452 states. [2022-03-15 20:55:50,416 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 53 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 20:55:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:55:50,426 INFO L225 Difference]: With dead ends: 3282 [2022-03-15 20:55:50,426 INFO L226 Difference]: Without dead ends: 3219 [2022-03-15 20:55:50,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 489 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126809 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=75455, Invalid=165135, Unknown=0, NotChecked=0, Total=240590 [2022-03-15 20:55:50,435 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 251 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 1904 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1904 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:55:50,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 1 Invalid, 2636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1904 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:55:50,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3219 states. [2022-03-15 20:55:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3219 to 1313. [2022-03-15 20:55:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 1312 states have (on average 3.0746951219512195) internal successors, (4034), 1312 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 4034 transitions. [2022-03-15 20:55:50,467 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 4034 transitions. Word has length 19 [2022-03-15 20:55:50,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:55:50,467 INFO L470 AbstractCegarLoop]: Abstraction has 1313 states and 4034 transitions. [2022-03-15 20:55:50,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 53 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 4034 transitions. [2022-03-15 20:55:50,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:55:50,469 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:55:50,469 INFO L514 BasicCegarLoop]: trace histogram [8, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:55:50,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 20:55:50,679 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 20:55:50,679 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:55:50,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:55:50,680 INFO L85 PathProgramCache]: Analyzing trace with hash -414744289, now seen corresponding path program 17 times [2022-03-15 20:55:50,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:55:50,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716264246] [2022-03-15 20:55:50,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:55:50,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:55:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:55:50,757 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:50,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:55:50,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716264246] [2022-03-15 20:55:50,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716264246] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:55:50,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168700917] [2022-03-15 20:55:50,758 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:55:50,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:50,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:55:50,763 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:55:50,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 20:55:50,792 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 20:55:50,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:55:50,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 20:55:50,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:55:50,841 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:50,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:55:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:50,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168700917] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:55:50,894 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:55:50,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 14 [2022-03-15 20:55:50,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [774708899] [2022-03-15 20:55:50,894 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:55:50,896 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:55:50,902 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 117 transitions. [2022-03-15 20:55:50,902 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:55:52,213 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 48 new interpolants: [29670#(or (< (+ i2 1) n) (< (+ 2 i1) n) (<= n (+ i1 1))), 29659#(< i1 n), 29678#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (<= (+ i2 4) n)), 29674#(or (< i1 n) (<= (+ i2 4) n)), 29669#(or (< (+ i1 1) n) (<= n i1) (< (+ i2 1) n)), 29679#(or (<= (+ i2 4) n) (<= n (+ i1 4)) (< (+ 5 i1) n)), 29668#(or (< i1 n) (< (+ i2 1) n)), 29701#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (<= (+ i2 8) n)), 29681#(or (<= n (+ 5 i1)) (< (+ 6 i1) n) (<= (+ i2 4) n)), 29667#(or (<= n (+ 3 i2)) (<= (+ 6 i2) n)), 29687#(or (<= (+ 6 i2) n) (<= n (+ i1 4)) (< (+ 5 i1) n)), 29706#(or (<= n (+ 5 i2)) (<= (+ i2 8) n)), 29686#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (<= (+ 6 i2) n)), 29680#(or (<= n (+ 5 i1)) (< (+ 6 i1) n) (< (+ i2 1) n)), 29696#(or (<= (+ 6 i2) n) (< (+ i1 8) n) (<= n (+ 7 i1))), 29662#(or (<= n (+ 2 i1)) (< (+ 3 i1) n)), 29693#(or (< (+ i1 8) n) (<= n (+ 7 i1))), 29700#(or (<= n (+ 2 i1)) (<= (+ i2 8) n) (< (+ 3 i1) n)), 29699#(or (< (+ 2 i1) n) (<= (+ i2 8) n) (<= n (+ i1 1))), 29682#(or (< i1 n) (<= (+ 6 i2) n)), 29690#(or (<= n (+ 6 i1)) (< (+ i2 1) n) (< (+ 7 i1) n)), 29666#(or (<= n (+ i2 1)) (<= (+ i2 4) n)), 29672#(or (< (+ i1 4) n) (<= n (+ 3 i1)) (< (+ i2 1) n)), 29665#(or (<= n (+ 5 i1)) (< (+ 6 i1) n)), 29660#(or (< (+ i1 1) n) (<= n i1)), 29683#(or (<= (+ 6 i2) n) (< (+ i1 1) n) (<= n i1)), 29704#(or (<= n (+ 6 i1)) (<= (+ i2 8) n) (< (+ 7 i1) n)), 29689#(or (<= n (+ 6 i1)) (< (+ 7 i1) n)), 29673#(or (<= n (+ i1 4)) (< (+ i2 1) n) (< (+ 5 i1) n)), 29671#(or (<= n (+ 2 i1)) (< (+ i2 1) n) (< (+ 3 i1) n)), 29697#(or (< i1 n) (<= (+ i2 8) n)), 29677#(or (<= (+ i2 4) n) (<= n (+ 2 i1)) (< (+ 3 i1) n)), 29688#(or (<= n (+ 5 i1)) (< (+ 6 i1) n) (<= (+ 6 i2) n)), 29675#(or (<= (+ i2 4) n) (< (+ i1 1) n) (<= n i1)), 29676#(or (<= (+ i2 4) n) (< (+ 2 i1) n) (<= n (+ i1 1))), 29705#(or (< (+ i1 8) n) (<= n (+ 7 i1)) (<= (+ i2 8) n)), 29663#(or (< (+ i1 4) n) (<= n (+ 3 i1))), 29692#(or (<= (+ 6 i2) n) (<= n (+ 6 i1)) (< (+ 7 i1) n)), 29703#(or (<= n (+ 5 i1)) (< (+ 6 i1) n) (<= (+ i2 8) n)), 29698#(or (< (+ i1 1) n) (<= n i1) (<= (+ i2 8) n)), 29661#(or (< (+ 2 i1) n) (<= n (+ i1 1))), 29702#(or (<= n (+ i1 4)) (<= (+ i2 8) n) (< (+ 5 i1) n)), 29695#(or (<= (+ i2 4) n) (< (+ i1 8) n) (<= n (+ 7 i1))), 29685#(or (<= (+ 6 i2) n) (<= n (+ 2 i1)) (< (+ 3 i1) n)), 29691#(or (<= (+ i2 4) n) (<= n (+ 6 i1)) (< (+ 7 i1) n)), 29684#(or (<= (+ 6 i2) n) (< (+ 2 i1) n) (<= n (+ i1 1))), 29664#(or (<= n (+ i1 4)) (< (+ 5 i1) n)), 29694#(or (< (+ i1 8) n) (<= n (+ 7 i1)) (< (+ i2 1) n))] [2022-03-15 20:55:52,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 20:55:52,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:55:52,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 20:55:52,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=3340, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 20:55:52,214 INFO L87 Difference]: Start difference. First operand 1313 states and 4034 transitions. Second operand has 62 states, 62 states have (on average 1.8709677419354838) internal successors, (116), 61 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:55,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:55:55,768 INFO L93 Difference]: Finished difference Result 2295 states and 6553 transitions. [2022-03-15 20:55:55,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2022-03-15 20:55:55,768 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.8709677419354838) internal successors, (116), 61 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 20:55:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:55:55,776 INFO L225 Difference]: With dead ends: 2295 [2022-03-15 20:55:55,777 INFO L226 Difference]: Without dead ends: 2289 [2022-03-15 20:55:55,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11725 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5880, Invalid=28902, Unknown=0, NotChecked=0, Total=34782 [2022-03-15 20:55:55,781 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 268 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:55:55,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 1 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:55:55,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2022-03-15 20:55:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1735. [2022-03-15 20:55:55,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1734 states have (on average 3.168973471741638) internal successors, (5495), 1734 states have internal predecessors, (5495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 5495 transitions. [2022-03-15 20:55:55,833 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 5495 transitions. Word has length 19 [2022-03-15 20:55:55,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:55:55,833 INFO L470 AbstractCegarLoop]: Abstraction has 1735 states and 5495 transitions. [2022-03-15 20:55:55,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.8709677419354838) internal successors, (116), 61 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:55:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 5495 transitions. [2022-03-15 20:55:55,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:55:55,835 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:55:55,835 INFO L514 BasicCegarLoop]: trace histogram [8, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:55:55,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 20:55:56,051 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 20:55:56,051 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 20:55:56,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:55:56,052 INFO L85 PathProgramCache]: Analyzing trace with hash 21305633, now seen corresponding path program 18 times [2022-03-15 20:55:56,053 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:55:56,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665375678] [2022-03-15 20:55:56,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:55:56,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:55:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:55:56,239 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:55:56,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:55:56,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665375678] [2022-03-15 20:55:56,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665375678] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:55:56,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123928384] [2022-03-15 20:55:56,240 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:55:56,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:55:56,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:55:56,241 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:55:56,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 20:55:56,303 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 20:55:56,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:55:56,303 WARN L261 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:55:56,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:55:56,709 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:55:56,710 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 17 new quantified variables, introduced 36 case distinctions, treesize of input 70 treesize of output 332 [2022-03-15 20:56:01,692 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:56:01,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:56:03,102 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:56:03,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 32 new quantified variables, introduced 136 case distinctions, treesize of input 79 treesize of output 1162 Received shutdown request... [2022-03-15 21:01:11,600 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 21:01:11,601 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2022-03-15 21:01:11,619 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:01:11,635 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:01:11,636 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:01:11,816 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:01:11,816 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 4ms.. [2022-03-15 21:01:11,818 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 21:01:11,818 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 21:01:11,823 INFO L732 BasicCegarLoop]: Path program histogram: [18, 3, 1] [2022-03-15 21:01:11,824 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 21:01:11,824 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 21:01:11,829 INFO L202 PluginConnector]: Adding new model unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 09:01:11 BasicIcfg [2022-03-15 21:01:11,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 21:01:11,829 INFO L158 Benchmark]: Toolchain (without parser) took 857389.28ms. Allocated memory was 190.8MB in the beginning and 1.0GB in the end (delta: 827.3MB). Free memory was 155.9MB in the beginning and 687.1MB in the end (delta: -531.2MB). Peak memory consumption was 653.6MB. Max. memory is 8.0GB. [2022-03-15 21:01:11,829 INFO L158 Benchmark]: Boogie PL CUP Parser took 3.36ms. Allocated memory is still 190.8MB. Free memory was 157.2MB in the beginning and 157.0MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 21:01:11,829 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.75ms. Allocated memory is still 190.8MB. Free memory was 155.9MB in the beginning and 154.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 21:01:11,830 INFO L158 Benchmark]: Boogie Preprocessor took 10.38ms. Allocated memory is still 190.8MB. Free memory was 154.3MB in the beginning and 153.5MB in the end (delta: 807.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 21:01:11,830 INFO L158 Benchmark]: RCFGBuilder took 187.31ms. Allocated memory is still 190.8MB. Free memory was 153.4MB in the beginning and 143.4MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-15 21:01:11,832 INFO L158 Benchmark]: TraceAbstraction took 857169.27ms. Allocated memory was 190.8MB in the beginning and 1.0GB in the end (delta: 827.3MB). Free memory was 143.0MB in the beginning and 687.1MB in the end (delta: -544.2MB). Peak memory consumption was 638.9MB. Max. memory is 8.0GB. [2022-03-15 21:01:11,833 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 3.36ms. Allocated memory is still 190.8MB. Free memory was 157.2MB in the beginning and 157.0MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.75ms. Allocated memory is still 190.8MB. Free memory was 155.9MB in the beginning and 154.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 10.38ms. Allocated memory is still 190.8MB. Free memory was 154.3MB in the beginning and 153.5MB in the end (delta: 807.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 187.31ms. Allocated memory is still 190.8MB. Free memory was 153.4MB in the beginning and 143.4MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 857169.27ms. Allocated memory was 190.8MB in the beginning and 1.0GB in the end (delta: 827.3MB). Free memory was 143.0MB in the beginning and 687.1MB in the end (delta: -544.2MB). Peak memory consumption was 638.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 21 PlacesBefore, 18 PlacesAfterwards, 16 TransitionsBefore, 13 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 22 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 22, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 4ms.. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 4ms.. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 4ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 22 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 857.1s, OverallIterations: 22, TraceHistogramMax: 8, PathProgramHistogramMax: 18, EmptinessCheckTime: 0.0s, AutomataDifference: 82.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3746 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3746 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3436 mSDsCounter, 5429 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18202 IncrementalHoareTripleChecker+Invalid, 23631 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5429 mSolverCounterUnsat, 21 mSDtfsCounter, 18202 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2678 GetRequests, 494 SyntacticMatches, 16 SemanticMatches, 2168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191465 ImplicationChecksByTransitivity, 81.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1735occurred in iteration=21, InterpolantAutomatonStates: 1754, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 6033 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 438.9s InterpolantComputationTime, 571 NumberOfCodeBlocks, 571 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 788 ConstructedInterpolants, 0 QuantifiedInterpolants, 6912 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1171 ConjunctsInSsa, 301 ConjunctsInUnsatCore, 59 InterpolantComputations, 2 PerfectInterpolantSequences, 461/1092 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