/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/parallel-sum-1-dsl.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:18:54,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:18:54,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:18:54,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:18:54,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:18:54,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:18:54,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:18:54,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:18:54,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:18:54,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:18:54,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:18:54,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:18:54,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:18:54,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:18:54,608 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:18:54,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:18:54,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:18:54,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:18:54,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:18:54,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:18:54,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:18:54,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:18:54,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:18:54,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:18:54,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:18:54,623 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:18:54,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:18:54,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:18:54,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:18:54,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:18:54,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:18:54,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:18:54,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:18:54,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:18:54,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:18:54,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:18:54,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:18:54,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:18:54,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:18:54,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:18:54,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:18:54,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 21:18:54,655 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:18:54,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:18:54,656 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:18:54,656 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:18:54,656 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:18:54,656 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:18:54,657 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:18:54,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:18:54,657 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:18:54,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:18:54,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:18:54,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:18:54,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:18:54,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:18:54,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:18:54,658 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:18:54,658 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:18:54,658 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:18:54,658 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:18:54,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:18:54,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:18:54,659 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:18:54,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:18:54,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:18:54,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:18:54,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:18:54,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:18:54,660 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:18:54,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:18:54,660 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:18:54,660 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:18:54,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:18:54,660 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 21:18:54,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:18:54,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:18:54,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:18:54,867 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:18:54,868 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:18:54,869 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/parallel-sum-1-dsl.wvr.bpl [2022-03-15 21:18:54,869 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/parallel-sum-1-dsl.wvr.bpl' [2022-03-15 21:18:54,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:18:54,897 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:18:54,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:18:54,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:18:54,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:18:54,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:18:54" (1/1) ... [2022-03-15 21:18:54,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:18:54" (1/1) ... [2022-03-15 21:18:54,916 INFO L137 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:18:54,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:18:54,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:18:54,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:18:54,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:18:54,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:18:54" (1/1) ... [2022-03-15 21:18:54,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:18:54" (1/1) ... [2022-03-15 21:18:54,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:18:54" (1/1) ... [2022-03-15 21:18:54,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:18:54" (1/1) ... [2022-03-15 21:18:54,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:18:54" (1/1) ... [2022-03-15 21:18:54,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:18:54" (1/1) ... [2022-03-15 21:18:54,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:18:54" (1/1) ... [2022-03-15 21:18:54,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:18:54,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:18:54,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:18:54,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:18:54,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:18:54" (1/1) ... [2022-03-15 21:18:54,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:18:54,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:18:54,966 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 21:18:54,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 21:18:54,996 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:18:54,996 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:18:54,996 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:18:54,996 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:18:54,996 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:18:54,996 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:18:54,996 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:18:54,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:18:54,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:18:54,996 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:18:54,996 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:18:54,997 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:18:54,997 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2022-03-15 21:18:54,997 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 21:18:54,997 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 21:18:54,997 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2022-03-15 21:18:54,997 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-03-15 21:18:54,997 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-03-15 21:18:54,997 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2022-03-15 21:18:54,997 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-03-15 21:18:54,997 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-03-15 21:18:54,998 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 21:18:55,037 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:18:55,038 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:18:55,116 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:18:55,142 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:18:55,142 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 21:18:55,143 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread2EXIT is neither atomic block end nor error location. [2022-03-15 21:18:55,144 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread3EXIT is neither atomic block end nor error location. [2022-03-15 21:18:55,144 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread5EXIT is neither atomic block end nor error location. [2022-03-15 21:18:55,144 WARN L329 CfgBuilder]: Unexpected successor node of atomic block begin: thread6EXIT is neither atomic block end nor error location. [2022-03-15 21:18:55,146 INFO L202 PluginConnector]: Adding new model parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:18:55 BoogieIcfgContainer [2022-03-15 21:18:55,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:18:55,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:18:55,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:18:55,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:18:55,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:18:54" (1/2) ... [2022-03-15 21:18:55,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17360f46 and model type parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:18:55, skipping insertion in model container [2022-03-15 21:18:55,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:18:55" (2/2) ... [2022-03-15 21:18:55,165 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-sum-1-dsl.wvr.bpl [2022-03-15 21:18:55,168 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:18:55,168 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:18:55,168 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:18:55,168 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:18:55,241 INFO L148 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2022-03-15 21:18:55,283 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:18:55,288 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 21:18:55,303 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-03-15 21:18:55,313 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:18:55,319 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 48 transitions, 168 flow [2022-03-15 21:18:55,321 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 48 transitions, 168 flow [2022-03-15 21:18:55,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 48 transitions, 168 flow [2022-03-15 21:18:55,343 INFO L129 PetriNetUnfolder]: 8/36 cut-off events. [2022-03-15 21:18:55,343 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-03-15 21:18:55,347 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 36 events. 8/36 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 59 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 47. Up to 3 conditions per place. [2022-03-15 21:18:55,348 INFO L116 LiptonReduction]: Number of co-enabled transitions 520 [2022-03-15 21:18:55,386 INFO L131 LiptonReduction]: Checked pairs total: 1932 [2022-03-15 21:18:55,386 INFO L133 LiptonReduction]: Total number of compositions: 3 [2022-03-15 21:18:55,394 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 46 transitions, 164 flow [2022-03-15 21:18:55,445 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 402 states, 401 states have (on average 3.892768079800499) internal successors, (1561), 401 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:18:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 402 states, 401 states have (on average 3.892768079800499) internal successors, (1561), 401 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:18:55,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:18:55,458 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:18:55,459 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:18:55,459 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err8INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:18:55,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:18:55,462 INFO L85 PathProgramCache]: Analyzing trace with hash -9565270, now seen corresponding path program 1 times [2022-03-15 21:18:55,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:18:55,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935370361] [2022-03-15 21:18:55,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:18:55,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:18:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:18:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:18:55,674 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:18:55,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935370361] [2022-03-15 21:18:55,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935370361] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:18:55,675 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:18:55,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:18:55,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [171855684] [2022-03-15 21:18:55,677 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:18:55,680 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:18:55,715 INFO L252 McrAutomatonBuilder]: Finished intersection with 171 states and 391 transitions. [2022-03-15 21:18:55,715 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:18:58,133 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [870#(and (< s_2 1) (<= 0 s_2))] [2022-03-15 21:18:58,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 21:18:58,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:18:58,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 21:18:58,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:18:58,150 INFO L87 Difference]: Start difference. First operand has 402 states, 401 states have (on average 3.892768079800499) internal successors, (1561), 401 states have internal predecessors, (1561), 0 states have call successors, (0), 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 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:18:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:18:58,294 INFO L93 Difference]: Finished difference Result 1412 states and 5666 transitions. [2022-03-15 21:18:58,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 21:18:58,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 21:18:58,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:18:58,314 INFO L225 Difference]: With dead ends: 1412 [2022-03-15 21:18:58,314 INFO L226 Difference]: Without dead ends: 1391 [2022-03-15 21:18:58,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 143 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 21:18:58,317 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 72 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:18:58,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 14 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:18:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2022-03-15 21:18:58,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 544. [2022-03-15 21:18:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 3.858195211786372) internal successors, (2095), 543 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:18:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 2095 transitions. [2022-03-15 21:18:58,380 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 2095 transitions. Word has length 21 [2022-03-15 21:18:58,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:18:58,381 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 2095 transitions. [2022-03-15 21:18:58,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:18:58,381 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 2095 transitions. [2022-03-15 21:18:58,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:18:58,385 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:18:58,385 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:18:58,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:18:58,385 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err8INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:18:58,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:18:58,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1482803192, now seen corresponding path program 1 times [2022-03-15 21:18:58,387 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:18:58,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23548360] [2022-03-15 21:18:58,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:18:58,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:18:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:18:58,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:18:58,410 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:18:58,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23548360] [2022-03-15 21:18:58,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23548360] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:18:58,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:18:58,411 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:18:58,411 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [267498177] [2022-03-15 21:18:58,411 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:18:58,413 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:18:58,455 INFO L252 McrAutomatonBuilder]: Finished intersection with 210 states and 488 transitions. [2022-03-15 21:18:58,456 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:18:59,380 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [3376#(< i_3 n_1), 3377#(or (< (+ i_3 1) n_1) (not (< i_3 n_1)))] [2022-03-15 21:18:59,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 21:18:59,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:18:59,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 21:18:59,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:18:59,382 INFO L87 Difference]: Start difference. First operand 544 states and 2095 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:18:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:18:59,443 INFO L93 Difference]: Finished difference Result 544 states and 1996 transitions. [2022-03-15 21:18:59,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:18:59,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 21:18:59,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:18:59,447 INFO L225 Difference]: With dead ends: 544 [2022-03-15 21:18:59,447 INFO L226 Difference]: Without dead ends: 528 [2022-03-15 21:18:59,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 157 SyntacticMatches, 29 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 21:18:59,448 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:18:59,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 27 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:18:59,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-03-15 21:18:59,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2022-03-15 21:18:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 3.681214421252372) internal successors, (1940), 527 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:18:59,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1940 transitions. [2022-03-15 21:18:59,464 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1940 transitions. Word has length 23 [2022-03-15 21:18:59,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:18:59,464 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 1940 transitions. [2022-03-15 21:18:59,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:18:59,465 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1940 transitions. [2022-03-15 21:18:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:18:59,466 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:18:59,466 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:18:59,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 21:18:59,466 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err8INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:18:59,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:18:59,467 INFO L85 PathProgramCache]: Analyzing trace with hash 629982566, now seen corresponding path program 2 times [2022-03-15 21:18:59,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:18:59,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425261343] [2022-03-15 21:18:59,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:18:59,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:18:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:18:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:18:59,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:18:59,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425261343] [2022-03-15 21:18:59,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425261343] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:18:59,518 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:18:59,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 21:18:59,518 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [491523875] [2022-03-15 21:18:59,519 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:18:59,520 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:18:59,567 INFO L252 McrAutomatonBuilder]: Finished intersection with 210 states and 488 transitions. [2022-03-15 21:18:59,567 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:19:00,960 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [4985#(or (< i_7 n_1) (< i_3 n_1)), 4992#(or (< i_7 n_1) (<= n_1 0)), 4983#(< i_3 n_1), 4990#(or (<= n_1 i_3) (< 0 n_1)), 4986#(or (<= n_1 i_3) (< i_7 n_1)), 4991#(<= 0 i_3), 4988#(< 0 n_1), 4987#(<= n_1 0), 4989#(or (< 0 n_1) (< i_3 n_1)), 4984#(< i_7 n_1)] [2022-03-15 21:19:00,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 21:19:00,960 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:19:00,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 21:19:00,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:19:00,961 INFO L87 Difference]: Start difference. First operand 528 states and 1940 transitions. Second operand has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:01,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:19:01,379 INFO L93 Difference]: Finished difference Result 1246 states and 4446 transitions. [2022-03-15 21:19:01,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 21:19:01,380 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 21:19:01,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:19:01,387 INFO L225 Difference]: With dead ends: 1246 [2022-03-15 21:19:01,387 INFO L226 Difference]: Without dead ends: 1230 [2022-03-15 21:19:01,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2022-03-15 21:19:01,388 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 280 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:19:01,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 154 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:19:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2022-03-15 21:19:01,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 588. [2022-03-15 21:19:01,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 587 states have (on average 3.6524701873935266) internal successors, (2144), 587 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 2144 transitions. [2022-03-15 21:19:01,405 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 2144 transitions. Word has length 23 [2022-03-15 21:19:01,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:19:01,405 INFO L470 AbstractCegarLoop]: Abstraction has 588 states and 2144 transitions. [2022-03-15 21:19:01,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 2144 transitions. [2022-03-15 21:19:01,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:19:01,407 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:19:01,407 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:19:01,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 21:19:01,407 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err8INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:19:01,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:19:01,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1106490287, now seen corresponding path program 1 times [2022-03-15 21:19:01,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:19:01,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105510537] [2022-03-15 21:19:01,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:19:01,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:19:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:19:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:01,427 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:19:01,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105510537] [2022-03-15 21:19:01,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105510537] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:19:01,427 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:19:01,427 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:19:01,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [766748551] [2022-03-15 21:19:01,427 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:19:01,429 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:19:01,443 INFO L252 McrAutomatonBuilder]: Finished intersection with 210 states and 488 transitions. [2022-03-15 21:19:01,444 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:19:02,395 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:19:02,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:19:02,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:19:02,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:19:02,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:19:02,396 INFO L87 Difference]: Start difference. First operand 588 states and 2144 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:02,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:19:02,436 INFO L93 Difference]: Finished difference Result 548 states and 1913 transitions. [2022-03-15 21:19:02,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:19:02,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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 23 [2022-03-15 21:19:02,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:19:02,438 INFO L225 Difference]: With dead ends: 548 [2022-03-15 21:19:02,438 INFO L226 Difference]: Without dead ends: 496 [2022-03-15 21:19:02,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 153 SyntacticMatches, 35 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:19:02,439 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:19:02,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 16 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:19:02,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-03-15 21:19:02,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 442. [2022-03-15 21:19:02,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.6122448979591835) internal successors, (1593), 441 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1593 transitions. [2022-03-15 21:19:02,449 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1593 transitions. Word has length 23 [2022-03-15 21:19:02,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:19:02,449 INFO L470 AbstractCegarLoop]: Abstraction has 442 states and 1593 transitions. [2022-03-15 21:19:02,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:02,449 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1593 transitions. [2022-03-15 21:19:02,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:19:02,450 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:19:02,450 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:19:02,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 21:19:02,450 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err8INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:19:02,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:19:02,451 INFO L85 PathProgramCache]: Analyzing trace with hash 824770409, now seen corresponding path program 1 times [2022-03-15 21:19:02,451 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:19:02,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987464984] [2022-03-15 21:19:02,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:19:02,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:19:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:19:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:02,491 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:19:02,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987464984] [2022-03-15 21:19:02,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987464984] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:19:02,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333883306] [2022-03-15 21:19:02,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:19:02,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:19:02,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:19:02,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:19:02,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 21:19:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:19:02,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 21:19:02,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:19:02,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:02,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:19:02,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:02,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333883306] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:19:02,647 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:19:02,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-03-15 21:19:02,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [995165612] [2022-03-15 21:19:02,647 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:19:02,648 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:19:02,665 INFO L252 McrAutomatonBuilder]: Finished intersection with 236 states and 570 transitions. [2022-03-15 21:19:02,665 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:19:04,669 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [9022#(<= i_3 0), 9020#(or (not (< 0 n_1)) (< 1 n_1)), 9014#(< i_7 n_1), 9016#(<= 1 n_1), 9018#(or (< (+ i_7 1) n_1) (not (< i_7 n_1))), 9017#(or (< i_7 n_1) (< 0 n_1)), 9021#(or (not (< 0 n_1)) (< i_3 n_1) (< 1 n_1)), 9015#(or (< i_7 n_1) (< i_3 n_1)), 9019#(or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< i_3 n_1))] [2022-03-15 21:19:04,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 21:19:04,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:19:04,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 21:19:04,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-03-15 21:19:04,671 INFO L87 Difference]: Start difference. First operand 442 states and 1593 transitions. Second operand has 14 states, 14 states have (on average 8.071428571428571) internal successors, (113), 14 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:19:05,102 INFO L93 Difference]: Finished difference Result 730 states and 2484 transitions. [2022-03-15 21:19:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 21:19:05,103 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.071428571428571) internal successors, (113), 14 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 21:19:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:19:05,106 INFO L225 Difference]: With dead ends: 730 [2022-03-15 21:19:05,106 INFO L226 Difference]: Without dead ends: 642 [2022-03-15 21:19:05,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 216 SyntacticMatches, 33 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2022-03-15 21:19:05,106 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 248 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:19:05,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 142 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:19:05,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-03-15 21:19:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 545. [2022-03-15 21:19:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 3.5533088235294117) internal successors, (1933), 544 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 1933 transitions. [2022-03-15 21:19:05,119 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 1933 transitions. Word has length 23 [2022-03-15 21:19:05,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:19:05,120 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 1933 transitions. [2022-03-15 21:19:05,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.071428571428571) internal successors, (113), 14 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:05,120 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 1933 transitions. [2022-03-15 21:19:05,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:19:05,121 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:19:05,122 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:19:05,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 21:19:05,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:19:05,335 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err8INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:19:05,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:19:05,335 INFO L85 PathProgramCache]: Analyzing trace with hash -732314267, now seen corresponding path program 1 times [2022-03-15 21:19:05,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:19:05,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504024630] [2022-03-15 21:19:05,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:19:05,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:19:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:19:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:05,507 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:19:05,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504024630] [2022-03-15 21:19:05,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504024630] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:19:05,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285373518] [2022-03-15 21:19:05,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:19:05,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:19:05,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:19:05,508 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:19:05,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 21:19:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:19:05,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:19:05,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:19:05,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:19:05,761 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-03-15 21:19:05,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:05,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:19:05,916 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:19:05,916 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 15 treesize of output 20 [2022-03-15 21:19:05,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:19:05,931 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2022-03-15 21:19:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:05,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285373518] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:19:05,963 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:19:05,963 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-03-15 21:19:05,963 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1160730866] [2022-03-15 21:19:05,964 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:19:05,965 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:19:05,989 INFO L252 McrAutomatonBuilder]: Finished intersection with 290 states and 711 transitions. [2022-03-15 21:19:05,989 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:19:10,042 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [11024#(and (<= (+ t_8 s_6) (+ t_5 s_2)) (<= (+ t_5 s_2) (+ t_8 s_6))), 11023#(and (<= (select X_0 1) s_2) (< s_2 (+ 1 (select X_0 1)))), 11026#(and (<= (select X_0 1) (+ t_5 s_2)) (< (+ t_5 s_2) (+ 1 (select X_0 1)))), 11002#(and (<= (+ t_8 s_6) (+ s_2 (select X_0 (+ i_3 1)))) (<= (+ s_2 (select X_0 (+ i_3 1))) (+ t_8 s_6))), 11030#(and (<= (+ (select X_0 (+ i_7 1)) s_6) (+ s_2 (select X_0 (+ i_3 1)))) (<= (+ s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) s_6))), 11032#(and (<= 0 i_3) (<= s_2 0) (< i_3 1) (<= 0 s_2)), 11029#(and (<= (+ t_8 s_6) (+ (select X_0 i_7) s_2)) (= (+ i_3 1) i_7) (<= (+ s_2 (select X_0 (+ i_3 1))) (+ t_8 s_6))), 11033#(and (<= (+ t_8 s_6) (select X_0 1)) (<= (select X_0 1) (+ t_8 s_6))), 11028#(and (<= (select X_0 i_7) s_6) (= i_7 1) (<= s_6 (select X_0 i_7))), 11025#(and (<= (+ (select X_0 (+ i_7 1)) s_6) (+ t_5 s_2)) (< (+ t_5 s_2) (+ (select X_0 (+ i_7 1)) s_6 1))), 11022#(and (<= (+ (select X_0 (+ i_7 1)) s_6) s_2) (< s_2 (+ (select X_0 (+ i_7 1)) s_6 1))), 11031#(and (<= (+ s_2 (select X_0 (+ i_3 1))) (select X_0 1)) (<= (select X_0 1) (+ s_2 (select X_0 (+ i_3 1))))), 11034#(and (<= 0 s_6) (= (select X_0 i_7) t_8) (= i_7 1) (<= (+ t_8 s_6) (select X_0 i_7))), 11027#(and (<= (select X_0 1) s_6) (<= s_6 (select X_0 1))), 11021#(and (<= (+ t_8 s_6) s_2) (< s_2 (+ t_8 s_6 1)))] [2022-03-15 21:19:10,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:19:10,042 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:19:10,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:19:10,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:19:10,043 INFO L87 Difference]: Start difference. First operand 545 states and 1933 transitions. Second operand has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 24 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:19:12,469 INFO L93 Difference]: Finished difference Result 2108 states and 7818 transitions. [2022-03-15 21:19:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 21:19:12,470 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 24 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:19:12,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:19:12,480 INFO L225 Difference]: With dead ends: 2108 [2022-03-15 21:19:12,480 INFO L226 Difference]: Without dead ends: 2013 [2022-03-15 21:19:12,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 260 SyntacticMatches, 35 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 21:19:12,481 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 525 mSDsluCounter, 2133 mSDsCounter, 0 mSdLazyCounter, 4296 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 4417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 4296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:19:12,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [525 Valid, 222 Invalid, 4417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 4296 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 21:19:12,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2022-03-15 21:19:12,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 683. [2022-03-15 21:19:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 682 states have (on average 3.5469208211143695) internal successors, (2419), 682 states have internal predecessors, (2419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 2419 transitions. [2022-03-15 21:19:12,508 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 2419 transitions. Word has length 25 [2022-03-15 21:19:12,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:19:12,509 INFO L470 AbstractCegarLoop]: Abstraction has 683 states and 2419 transitions. [2022-03-15 21:19:12,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 24 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 2419 transitions. [2022-03-15 21:19:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:19:12,510 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:19:12,510 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:19:12,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 21:19:12,723 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,SelfDestructingSolverStorable5 [2022-03-15 21:19:12,723 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err8INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:19:12,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:19:12,724 INFO L85 PathProgramCache]: Analyzing trace with hash 788108836, now seen corresponding path program 1 times [2022-03-15 21:19:12,726 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:19:12,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972855835] [2022-03-15 21:19:12,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:19:12,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:19:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:19:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:12,861 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:19:12,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972855835] [2022-03-15 21:19:12,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972855835] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:19:12,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392660501] [2022-03-15 21:19:12,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:19:12,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:19:12,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:19:12,862 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:19:12,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 21:19:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:19:12,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:19:12,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:19:13,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:19:13,104 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-03-15 21:19:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:13,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:19:13,249 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:19:13,249 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 15 treesize of output 20 [2022-03-15 21:19:13,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:19:13,259 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2022-03-15 21:19:13,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:13,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392660501] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:19:13,286 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:19:13,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-03-15 21:19:13,286 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [947025459] [2022-03-15 21:19:13,286 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:19:13,288 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:19:13,315 INFO L252 McrAutomatonBuilder]: Finished intersection with 326 states and 829 transitions. [2022-03-15 21:19:13,315 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:19:17,415 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [14732#(and (<= (+ s_2 (select X_0 (+ i_3 1))) (select X_0 1)) (<= (select X_0 1) (+ s_2 (select X_0 (+ i_3 1))))), 14733#(and (<= 0 i_3) (<= i_3 0) (<= s_2 0) (<= 0 s_2)), 14731#(and (<= (select X_0 1) (+ t_4 s_2)) (< (+ t_4 s_2) (+ 1 (select X_0 1)))), 14726#(and (<= (+ t_4 s_2) (+ t_8 s_6)) (<= (+ t_8 s_6) (+ t_4 s_2))), 14722#(and (<= (+ t_8 s_6) s_2) (< s_2 (+ t_8 s_6 1))), 14728#(and (<= (select X_0 1) s_2) (< s_2 (+ 1 (select X_0 1)))), 14703#(and (<= (+ t_8 s_6) (+ s_2 (select X_0 (+ i_3 1)))) (<= (+ s_2 (select X_0 (+ i_3 1))) (+ t_8 s_6))), 14725#(and (<= (+ (select X_0 (+ i_7 1)) s_6) s_2) (< s_2 (+ (select X_0 (+ i_7 1)) s_6 1))), 14729#(and (<= (+ (select X_0 (+ i_7 1)) s_6) (+ t_4 s_2)) (< (+ t_4 s_2) (+ (select X_0 (+ i_7 1)) s_6 1))), 14734#(and (<= (+ t_8 s_6) (select X_0 1)) (<= (select X_0 1) (+ t_8 s_6))), 14735#(and (<= 0 s_6) (= (select X_0 i_7) t_8) (= i_7 1) (<= (+ t_8 s_6) (select X_0 i_7))), 14730#(and (<= (+ (select X_0 (+ i_7 1)) s_6) (+ s_2 (select X_0 (+ i_3 1)))) (<= (+ s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) s_6))), 14724#(and (<= (select X_0 i_7) s_6) (= i_7 1) (<= s_6 (select X_0 i_7))), 14723#(and (<= (select X_0 1) s_6) (<= s_6 (select X_0 1))), 14727#(and (<= (+ t_8 s_6) (+ (select X_0 i_7) s_2)) (= (+ i_3 1) i_7) (<= (+ s_2 (select X_0 (+ i_3 1))) (+ t_8 s_6)))] [2022-03-15 21:19:17,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:19:17,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:19:17,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:19:17,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:19:17,416 INFO L87 Difference]: Start difference. First operand 683 states and 2419 transitions. Second operand has 24 states, 23 states have (on average 6.260869565217392) internal successors, (144), 24 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:19,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:19:19,612 INFO L93 Difference]: Finished difference Result 2361 states and 8717 transitions. [2022-03-15 21:19:19,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 21:19:19,613 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.260869565217392) internal successors, (144), 24 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:19:19,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:19:19,623 INFO L225 Difference]: With dead ends: 2361 [2022-03-15 21:19:19,623 INFO L226 Difference]: Without dead ends: 2268 [2022-03-15 21:19:19,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 304 SyntacticMatches, 27 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 21:19:19,627 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 474 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 4338 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 4463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 4338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:19:19,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [474 Valid, 233 Invalid, 4463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 4338 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 21:19:19,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2022-03-15 21:19:19,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 742. [2022-03-15 21:19:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 3.5681511470985154) internal successors, (2644), 741 states have internal predecessors, (2644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2644 transitions. [2022-03-15 21:19:19,652 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 2644 transitions. Word has length 25 [2022-03-15 21:19:19,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:19:19,653 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 2644 transitions. [2022-03-15 21:19:19,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.260869565217392) internal successors, (144), 24 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:19,653 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 2644 transitions. [2022-03-15 21:19:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:19:19,656 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:19:19,656 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:19:19,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 21:19:19,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:19:19,872 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err8INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:19:19,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:19:19,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1939155274, now seen corresponding path program 2 times [2022-03-15 21:19:19,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:19:19,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561222308] [2022-03-15 21:19:19,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:19:19,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:19:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:19:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:19:19,911 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:19:19,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561222308] [2022-03-15 21:19:19,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561222308] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:19:19,911 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:19:19,911 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 21:19:19,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1581760042] [2022-03-15 21:19:19,912 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:19:19,913 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:19:19,936 INFO L252 McrAutomatonBuilder]: Finished intersection with 288 states and 708 transitions. [2022-03-15 21:19:19,936 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:19:21,644 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [18654#(<= i_3 0), 18651#(< 0 n_1), 18644#(or (< (+ i_7 1) n_1) (not (< i_7 n_1))), 18655#(or (< i_7 n_1) (< 0 n_1)), 18641#(< i_7 n_1), 18645#(or (<= n_1 (+ i_7 1)) (< (+ 2 i_7) n_1)), 18646#(or (<= n_1 i_7) (< i_3 n_1)), 18653#(or (<= n_1 0) (< i_3 n_1)), 18642#(< i_3 n_1), 18649#(or (<= n_1 1) (< 2 n_1)), 18650#(or (<= n_1 1) (< 2 n_1) (< i_3 n_1)), 18647#(or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< i_3 n_1)), 18652#(<= n_1 0), 18643#(or (< i_7 n_1) (< i_3 n_1)), 18648#(or (<= n_1 (+ i_7 1)) (< (+ 2 i_7) n_1) (< i_3 n_1))] [2022-03-15 21:19:21,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 21:19:21,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:19:21,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 21:19:21,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-03-15 21:19:21,645 INFO L87 Difference]: Start difference. First operand 742 states and 2644 transitions. Second operand has 20 states, 20 states have (on average 7.15) internal successors, (143), 20 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:22,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:19:22,574 INFO L93 Difference]: Finished difference Result 1933 states and 7159 transitions. [2022-03-15 21:19:22,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 21:19:22,575 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.15) internal successors, (143), 20 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:19:22,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:19:22,583 INFO L225 Difference]: With dead ends: 1933 [2022-03-15 21:19:22,583 INFO L226 Difference]: Without dead ends: 1889 [2022-03-15 21:19:22,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 241 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=399, Invalid=1407, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 21:19:22,584 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 546 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:19:22,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [546 Valid, 521 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:19:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2022-03-15 21:19:22,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1073. [2022-03-15 21:19:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 1072 states have (on average 3.9132462686567164) internal successors, (4195), 1072 states have internal predecessors, (4195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:22,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 4195 transitions. [2022-03-15 21:19:22,612 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 4195 transitions. Word has length 25 [2022-03-15 21:19:22,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:19:22,612 INFO L470 AbstractCegarLoop]: Abstraction has 1073 states and 4195 transitions. [2022-03-15 21:19:22,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.15) internal successors, (143), 20 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 4195 transitions. [2022-03-15 21:19:22,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:19:22,614 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:19:22,615 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:19:22,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 21:19:22,615 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err8INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:19:22,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:19:22,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1391743789, now seen corresponding path program 1 times [2022-03-15 21:19:22,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:19:22,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364469004] [2022-03-15 21:19:22,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:19:22,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:19:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:19:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:22,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:19:22,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364469004] [2022-03-15 21:19:22,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364469004] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:19:22,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852028995] [2022-03-15 21:19:22,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:19:22,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:19:22,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:19:22,719 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:19:22,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 21:19:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:19:22,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:19:22,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:19:22,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:19:22,906 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 21:19:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:23,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:19:23,088 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:19:23,089 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 15 treesize of output 20 [2022-03-15 21:19:23,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:19:23,095 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2022-03-15 21:19:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:23,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852028995] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:19:23,116 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:19:23,116 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-03-15 21:19:23,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [409714866] [2022-03-15 21:19:23,117 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:19:23,118 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:19:23,139 INFO L252 McrAutomatonBuilder]: Finished intersection with 258 states and 609 transitions. [2022-03-15 21:19:23,144 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:19:25,808 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [22946#(and (<= (+ (select X_0 (+ i_7 1)) s_6) (+ t_5 s_2)) (= (select X_0 (+ i_7 1)) t_5) (<= (+ t_5 s_2) (+ (select X_0 (+ i_7 1)) s_6))), 22947#(and (= t_5 (select X_0 1)) (<= (+ t_5 s_2) (select X_0 1)) (<= (select X_0 1) (+ t_5 s_2))), 22945#(and (<= (+ t_5 s_2) (select X_0 1)) (<= (select X_0 1) (+ t_5 s_2))), 22950#(and (< i_7 2) (<= 1 i_7) (<= 0 s_6) (= (select X_0 i_7) t_9) (<= s_6 0)), 22943#(and (< s_6 (+ s_2 (select X_0 (+ i_3 1)) 1)) (<= (+ s_2 (select X_0 (+ i_3 1))) s_6)), 22948#(and (<= 0 i_3) (<= i_3 0) (<= s_2 0) (<= 0 s_2)), 22940#(and (<= (+ t_5 s_2) s_6) (< s_6 (+ t_5 s_2 1))), 22941#(and (<= (+ (select X_0 (+ i_7 1)) s_6) s_2) (<= s_2 (+ (select X_0 (+ i_7 1)) s_6))), 22905#(and (<= (+ t_5 s_2) (+ t_9 s_6)) (<= (+ t_9 s_6) (+ t_5 s_2))), 22944#(and (<= (+ (select X_0 (+ i_7 1)) s_6) (+ t_5 s_2)) (<= (+ t_5 s_2) (+ (select X_0 (+ i_7 1)) s_6))), 22942#(and (<= s_2 (select X_0 1)) (<= (select X_0 1) s_2)), 22949#(and (< s_6 (+ 1 (select X_0 1))) (<= (select X_0 1) s_6))] [2022-03-15 21:19:25,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 21:19:25,808 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:19:25,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 21:19:25,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2022-03-15 21:19:25,810 INFO L87 Difference]: Start difference. First operand 1073 states and 4195 transitions. Second operand has 20 states, 19 states have (on average 6.2105263157894735) internal successors, (118), 20 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:27,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:19:27,148 INFO L93 Difference]: Finished difference Result 2914 states and 11515 transitions. [2022-03-15 21:19:27,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 21:19:27,149 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.2105263157894735) internal successors, (118), 20 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:19:27,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:19:27,181 INFO L225 Difference]: With dead ends: 2914 [2022-03-15 21:19:27,181 INFO L226 Difference]: Without dead ends: 2819 [2022-03-15 21:19:27,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 236 SyntacticMatches, 29 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=1615, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 21:19:27,187 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 250 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 3737 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 3800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:19:27,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 217 Invalid, 3800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3737 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 21:19:27,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2022-03-15 21:19:27,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 1185. [2022-03-15 21:19:27,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1184 states have (on average 3.8657094594594597) internal successors, (4577), 1184 states have internal predecessors, (4577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 4577 transitions. [2022-03-15 21:19:27,286 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 4577 transitions. Word has length 25 [2022-03-15 21:19:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:19:27,286 INFO L470 AbstractCegarLoop]: Abstraction has 1185 states and 4577 transitions. [2022-03-15 21:19:27,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.2105263157894735) internal successors, (118), 20 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:27,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 4577 transitions. [2022-03-15 21:19:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 21:19:27,289 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:19:27,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:19:27,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 21:19:27,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:19:27,489 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err8INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:19:27,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:19:27,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1011897236, now seen corresponding path program 1 times [2022-03-15 21:19:27,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:19:27,491 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936753257] [2022-03-15 21:19:27,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:19:27,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:19:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:19:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:27,612 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:19:27,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936753257] [2022-03-15 21:19:27,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936753257] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:19:27,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152397320] [2022-03-15 21:19:27,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:19:27,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:19:27,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:19:27,613 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:19:27,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 21:19:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:19:27,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 21:19:27,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:19:27,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:19:27,779 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 21:19:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:27,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:19:27,952 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:19:27,953 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 15 treesize of output 20 [2022-03-15 21:19:27,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:19:27,964 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2022-03-15 21:19:27,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:27,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152397320] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:19:27,993 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:19:27,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-15 21:19:27,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [795862122] [2022-03-15 21:19:27,993 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:19:27,995 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:19:28,032 INFO L252 McrAutomatonBuilder]: Finished intersection with 290 states and 711 transitions. [2022-03-15 21:19:28,032 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:19:31,273 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [28433#(and (<= (+ (select X_0 (+ i_7 1)) s_6) s_2) (<= s_2 (+ (select X_0 (+ i_7 1)) s_6))), 28438#(and (<= s_2 (select X_0 1)) (<= (select X_0 1) s_2)), 28440#(and (<= (+ t_4 s_2) (select X_0 1)) (< i_3 2) (<= 1 i_3) (<= (select X_0 1) (+ t_4 s_2))), 28442#(and (<= 0 i_3) (<= i_3 0) (<= s_2 0) (<= 0 s_2)), 28436#(and (<= (+ t_4 s_2) (+ (select X_0 (+ i_7 1)) s_6)) (= (select X_0 (+ i_7 1)) t_4) (< i_3 (+ 2 i_7)) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ t_4 s_2)) (<= (+ i_7 1) i_3)), 28434#(and (<= (+ (select X_0 (+ i_7 1)) s_6) s_2) (<= s_2 (+ (select X_0 (+ i_7 1)) s_6)) (< i_3 (+ 2 i_7)) (<= (+ i_7 1) i_3)), 28443#(and (< s_6 (+ 1 (select X_0 1))) (<= (select X_0 1) s_6)), 28435#(and (<= (+ t_4 s_2) (+ (select X_0 (+ i_7 1)) s_6)) (< i_3 (+ 2 i_7)) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ t_4 s_2)) (<= (+ i_7 1) i_3)), 28439#(and (<= s_2 (select X_0 1)) (< i_3 2) (<= 1 i_3) (<= (select X_0 1) s_2)), 28444#(and (<= 1 i_7) (<= 0 s_6) (= (select X_0 i_7) t_9) (<= i_7 1) (<= s_6 0)), 28441#(and (<= (+ t_4 s_2) (select X_0 1)) (< i_3 2) (<= 1 i_3) (= t_4 (select X_0 1)) (<= (select X_0 1) (+ t_4 s_2))), 28431#(and (< s_6 (+ t_4 s_2 1)) (<= (+ t_4 s_2) s_6)), 28432#(and (<= (+ t_4 s_2) (+ t_9 s_6)) (< i_3 (+ i_7 1)) (<= i_7 i_3) (<= (+ t_9 s_6) (+ t_4 s_2))), 28437#(and (< s_6 (+ s_2 (select X_0 (+ i_3 1)) 1)) (<= (+ s_2 (select X_0 (+ i_3 1))) s_6))] [2022-03-15 21:19:31,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:19:31,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:19:31,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:19:31,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:19:31,274 INFO L87 Difference]: Start difference. First operand 1185 states and 4577 transitions. Second operand has 23 states, 22 states have (on average 6.181818181818182) internal successors, (136), 23 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:33,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:19:33,499 INFO L93 Difference]: Finished difference Result 4587 states and 17761 transitions. [2022-03-15 21:19:33,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 21:19:33,500 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.181818181818182) internal successors, (136), 23 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 21:19:33,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:19:33,518 INFO L225 Difference]: With dead ends: 4587 [2022-03-15 21:19:33,518 INFO L226 Difference]: Without dead ends: 4250 [2022-03-15 21:19:33,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 265 SyntacticMatches, 29 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=335, Invalid=4087, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 21:19:33,520 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 582 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 5393 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 5529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 5393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 21:19:33,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [582 Valid, 355 Invalid, 5529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 5393 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 21:19:33,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4250 states. [2022-03-15 21:19:33,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4250 to 1198. [2022-03-15 21:19:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1197 states have (on average 4.0208855472013365) internal successors, (4813), 1197 states have internal predecessors, (4813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 4813 transitions. [2022-03-15 21:19:33,610 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 4813 transitions. Word has length 25 [2022-03-15 21:19:33,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:19:33,610 INFO L470 AbstractCegarLoop]: Abstraction has 1198 states and 4813 transitions. [2022-03-15 21:19:33,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.181818181818182) internal successors, (136), 23 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 4813 transitions. [2022-03-15 21:19:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:19:33,614 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:19:33,614 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:19:33,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 21:19:33,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 21:19:33,830 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err8INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:19:33,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:19:33,831 INFO L85 PathProgramCache]: Analyzing trace with hash 978943495, now seen corresponding path program 2 times [2022-03-15 21:19:33,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:19:33,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653694632] [2022-03-15 21:19:33,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:19:33,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:19:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:19:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:33,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:19:33,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653694632] [2022-03-15 21:19:33,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653694632] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:19:33,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808825515] [2022-03-15 21:19:33,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:19:33,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:19:33,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:19:33,871 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:19:33,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 21:19:33,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:19:33,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:19:33,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:19:33,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:19:33,960 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:33,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:19:33,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:33,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808825515] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:19:33,984 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:19:33,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 21:19:33,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1487025483] [2022-03-15 21:19:33,984 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:19:33,986 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:19:34,019 INFO L252 McrAutomatonBuilder]: Finished intersection with 326 states and 793 transitions. [2022-03-15 21:19:34,019 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:19:36,025 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [35688#(<= i_7 1), 35686#(or (<= n_1 (+ i_3 1)) (<= n_1 0) (< 1 n_1)), 35675#(or (<= n_1 i_3) (< i_7 n_1)), 35683#(or (not (< 0 n_1)) (< 1 n_1)), 35680#(or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< i_3 n_1)), 35676#(or (< i_7 n_1) (<= n_1 (+ i_3 1))), 35677#(<= n_1 1), 35684#(or (not (< 0 n_1)) (< i_3 n_1) (< 1 n_1)), 35682#(or (< (+ i_7 1) n_1) (<= n_1 (+ i_3 1)) (not (< i_7 n_1))), 35674#(or (< i_7 n_1) (< i_3 n_1)), 35673#(< i_7 n_1), 35681#(or (<= n_1 i_3) (< (+ i_7 1) n_1) (not (< i_7 n_1))), 35672#(< i_3 n_1), 35687#(<= 0 i_3), 35685#(or (<= n_1 i_3) (not (< 0 n_1)) (< 1 n_1)), 35678#(or (< i_7 n_1) (<= n_1 1)), 35679#(or (< (+ i_7 1) n_1) (not (< i_7 n_1)))] [2022-03-15 21:19:36,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 21:19:36,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:19:36,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 21:19:36,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:19:36,026 INFO L87 Difference]: Start difference. First operand 1198 states and 4813 transitions. Second operand has 24 states, 24 states have (on average 6.708333333333333) internal successors, (161), 24 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:38,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:19:38,020 INFO L93 Difference]: Finished difference Result 4085 states and 15699 transitions. [2022-03-15 21:19:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-15 21:19:38,020 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 6.708333333333333) internal successors, (161), 24 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:19:38,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:19:38,032 INFO L225 Difference]: With dead ends: 4085 [2022-03-15 21:19:38,032 INFO L226 Difference]: Without dead ends: 3826 [2022-03-15 21:19:38,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 302 SyntacticMatches, 34 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2342 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1538, Invalid=5602, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 21:19:38,034 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 859 mSDsluCounter, 1676 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:19:38,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [859 Valid, 668 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2121 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:19:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3826 states. [2022-03-15 21:19:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3826 to 1670. [2022-03-15 21:19:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1669 states have (on average 4.2174955062911925) internal successors, (7039), 1669 states have internal predecessors, (7039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:38,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 7039 transitions. [2022-03-15 21:19:38,085 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 7039 transitions. Word has length 27 [2022-03-15 21:19:38,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:19:38,085 INFO L470 AbstractCegarLoop]: Abstraction has 1670 states and 7039 transitions. [2022-03-15 21:19:38,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.708333333333333) internal successors, (161), 24 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:38,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 7039 transitions. [2022-03-15 21:19:38,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 21:19:38,089 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:19:38,089 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:19:38,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 21:19:38,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:19:38,303 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err8INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:19:38,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:19:38,303 INFO L85 PathProgramCache]: Analyzing trace with hash 65454500, now seen corresponding path program 3 times [2022-03-15 21:19:38,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:19:38,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071846019] [2022-03-15 21:19:38,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:19:38,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:19:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:19:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:38,352 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:19:38,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071846019] [2022-03-15 21:19:38,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071846019] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:19:38,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499618119] [2022-03-15 21:19:38,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:19:38,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:19:38,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:19:38,355 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:19:38,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 21:19:38,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:19:38,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:19:38,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:19:38,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:19:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:38,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:19:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:38,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499618119] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:19:38,487 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:19:38,487 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 21:19:38,487 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1225926774] [2022-03-15 21:19:38,487 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:19:38,489 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:19:38,552 INFO L252 McrAutomatonBuilder]: Finished intersection with 354 states and 883 transitions. [2022-03-15 21:19:38,553 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:19:42,118 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [43410#(or (<= n_1 (+ i_7 1)) (< (+ 2 i_7) n_1) (<= (+ 2 i_3) n_1)), 43413#(or (<= n_1 1) (<= (+ 2 i_3) n_1) (< 2 n_1)), 43414#(<= i_3 0), 43407#(or (<= n_1 1) (< 2 n_1)), 43409#(or (<= n_1 (+ i_7 1)) (< (+ 2 i_7) n_1) (< i_3 n_1)), 43404#(or (< i_7 n_1) (<= (+ 2 i_3) n_1)), 43412#(or (<= n_1 1) (< 2 n_1) (< i_3 n_1)), 43415#(<= 1 i_7), 43408#(<= 2 n_1), 43402#(or (< (+ i_7 1) n_1) (not (< i_7 n_1))), 43400#(< i_7 n_1), 43411#(or (<= 2 n_1) (< i_7 n_1)), 43403#(or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< i_3 n_1)), 43401#(or (< i_7 n_1) (< i_3 n_1)), 43406#(or (<= n_1 (+ i_7 1)) (< (+ 2 i_7) n_1)), 43405#(or (< (+ i_7 1) n_1) (<= (+ 2 i_3) n_1) (not (< i_7 n_1)))] [2022-03-15 21:19:42,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:19:42,118 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:19:42,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:19:42,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2022-03-15 21:19:42,119 INFO L87 Difference]: Start difference. First operand 1670 states and 7039 transitions. Second operand has 23 states, 23 states have (on average 6.739130434782608) internal successors, (155), 23 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:43,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:19:43,139 INFO L93 Difference]: Finished difference Result 4418 states and 17412 transitions. [2022-03-15 21:19:43,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 21:19:43,140 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.739130434782608) internal successors, (155), 23 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 21:19:43,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:19:43,153 INFO L225 Difference]: With dead ends: 4418 [2022-03-15 21:19:43,153 INFO L226 Difference]: Without dead ends: 4131 [2022-03-15 21:19:43,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 316 SyntacticMatches, 46 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=868, Invalid=2914, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 21:19:43,155 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 689 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 21:19:43,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [689 Valid, 641 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 21:19:43,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4131 states. [2022-03-15 21:19:43,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4131 to 2169. [2022-03-15 21:19:43,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 4.197878228782288) internal successors, (9101), 2168 states have internal predecessors, (9101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 9101 transitions. [2022-03-15 21:19:43,239 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 9101 transitions. Word has length 27 [2022-03-15 21:19:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:19:43,239 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 9101 transitions. [2022-03-15 21:19:43,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.739130434782608) internal successors, (155), 23 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:19:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 9101 transitions. [2022-03-15 21:19:43,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:19:43,244 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:19:43,244 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:19:43,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 21:19:43,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:19:43,460 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err8INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:19:43,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:19:43,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1164417402, now seen corresponding path program 4 times [2022-03-15 21:19:43,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:19:43,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025419759] [2022-03-15 21:19:43,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:19:43,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:19:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:19:43,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:43,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:19:43,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025419759] [2022-03-15 21:19:43,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025419759] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:19:43,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055645772] [2022-03-15 21:19:43,719 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:19:43,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:19:43,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:19:43,720 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:19:43,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 21:19:43,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:19:43,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:19:43,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 21:19:43,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:19:44,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:19:44,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:19:44,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:19:44,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-03-15 21:19:44,158 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:44,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:19:44,373 INFO L353 Elim1Store]: treesize reduction 36, result has 50.7 percent of original size [2022-03-15 21:19:44,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 25 treesize of output 46 [2022-03-15 21:19:44,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:19:44,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:19:44,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:19:44,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:19:44,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2022-03-15 21:19:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:19:44,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055645772] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:19:44,483 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:19:44,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 28 [2022-03-15 21:19:44,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [289070348] [2022-03-15 21:19:44,483 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:19:44,485 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:19:44,532 INFO L252 McrAutomatonBuilder]: Finished intersection with 398 states and 985 transitions. [2022-03-15 21:19:44,532 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:19:57,302 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 47 new interpolants: [52471#(and (or (not (< 1 n_1)) (<= (+ (select X_0 2) (select X_0 1)) s_2) (< 2 n_1) (< i_3 n_1)) (or (< s_2 (+ (select X_0 2) 1 (select X_0 1))) (not (< 1 n_1)) (< 2 n_1) (< i_3 n_1))), 52479#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ s_2 (select X_0 (+ i_3 1)))) (< (+ i_3 1) n_1) (not (< i_3 n_1))) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< (+ s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)) (< (+ i_3 1) n_1) (not (< i_3 n_1)))), 52485#(and (<= 0 i_3) (<= s_2 0) (< i_3 1) (<= 0 s_2)), 52482#(and (or (< (+ t_5 s_2 (select X_0 (+ i_3 1))) (+ (select X_0 2) 1 (select X_0 1))) (not (< 1 n_1)) (< (+ i_3 1) n_1) (< 2 n_1) (not (< i_3 n_1))) (or (<= (+ (select X_0 2) (select X_0 1)) (+ t_5 s_2 (select X_0 (+ i_3 1)))) (not (< 1 n_1)) (< (+ i_3 1) n_1) (< 2 n_1) (not (< i_3 n_1)))), 52481#(and (or (<= (+ (select X_0 2) (select X_0 1)) (+ s_2 (select X_0 (+ i_3 1)))) (not (< 1 n_1)) (< (+ i_3 1) n_1) (< 2 n_1) (not (< i_3 n_1))) (or (not (< 1 n_1)) (< (+ s_2 (select X_0 (+ i_3 1))) (+ (select X_0 2) 1 (select X_0 1))) (< (+ i_3 1) n_1) (< 2 n_1) (not (< i_3 n_1)))), 52483#(and (or (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1)))) (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1)) (or (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)))) (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1))), 52475#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1))))) (or (< (+ i_7 1) n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ (select X_0 (+ i_7 1)) s_6)) (not (< i_7 n_1)))), 52461#(and (or (< i_7 n_1) (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6)) (<= s_6 (+ (select X_0 i_7) (select X_0 1))) (or (< i_7 n_1) (= i_7 n_1))), 52476#(and (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ s_2 (select X_0 (+ i_3 1)))) (not (< i_7 n_1)) (< (+ i_3 1) n_1) (not (< i_3 n_1))) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< (+ i_3 1) n_1) (< (+ s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) t_8 s_6 1)) (not (< i_3 n_1)))), 52454#(and (or (< i_7 n_1) (< (+ i_3 1) n_1) (<= (+ t_8 s_6) (+ t_5 s_2 (select X_0 (+ i_3 1)))) (not (< i_3 n_1))) (or (<= n_1 i_3) (< i_7 n_1) (<= (+ 2 i_3) n_1) (<= (+ t_5 s_2 (select X_0 (+ i_3 1))) (+ t_8 s_6)))), 52469#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< i_3 n_1) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ t_5 s_2))) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< i_3 n_1) (< (+ t_5 s_2) (+ (select X_0 (+ i_7 1)) t_8 s_6 1)))), 52487#(and (<= 0 s_6) (= (select X_0 i_7) t_8) (= i_7 1) (<= (+ t_8 s_6) (select X_0 i_7))), 52457#(and (<= s_6 (+ (select X_0 n_1) (select X_0 1))) (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6)), 52442#(and (or (< i_7 n_1) (<= (+ t_8 s_6) s_2)) (or (< i_7 n_1) (< s_2 (+ t_8 s_6 1)))), 52464#(and (or (not (< 1 n_1)) (<= (+ (select X_0 2) (select X_0 1)) s_2) (< 2 n_1)) (or (< s_2 (+ (select X_0 2) 1 (select X_0 1))) (not (< 1 n_1)) (< 2 n_1))), 52455#(and (or (< i_7 n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ t_8 s_6))) (or (< i_7 n_1) (<= (+ t_8 s_6) (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1)))))), 52477#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< (+ i_3 1) n_1) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ t_5 s_2 (select X_0 (+ i_3 1)))) (not (< i_3 n_1))) (or (< (+ i_7 1) n_1) (< (+ t_5 s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) t_8 s_6 1)) (not (< i_7 n_1)) (< (+ i_3 1) n_1) (not (< i_3 n_1)))), 52451#(and (or (< i_7 n_1) (<= s_6 (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1))))) (or (< i_7 n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6))), 52472#(and (or (not (< 1 n_1)) (< (+ t_5 s_2) (+ (select X_0 2) 1 (select X_0 1))) (< 2 n_1) (< i_3 n_1)) (or (<= (+ (select X_0 2) (select X_0 1)) (+ t_5 s_2)) (not (< 1 n_1)) (< 2 n_1) (< i_3 n_1))), 52456#(and (or (< i_7 n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ t_8 s_6))) (or (< i_7 n_1) (<= (+ t_8 s_6) (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1))))) (or (< i_7 n_1) (= i_7 n_1))), 52441#(and (or (< i_7 n_1) (<= s_6 s_2)) (or (< i_7 n_1) (< s_2 (+ s_6 1)))), 52448#(and (or (<= (+ t_8 s_6) (+ t_5 s_2)) (< i_7 n_1) (< i_3 n_1)) (or (< i_7 n_1) (< (+ t_5 s_2) (+ t_8 s_6 1)) (< i_3 n_1))), 52449#(and (or (< i_7 n_1) (<= (+ s_2 (select X_0 (+ i_3 1))) s_6) (<= (+ 2 i_3) n_1) (not (< i_3 n_1))) (or (< i_7 n_1) (<= s_6 (+ s_2 (select X_0 (+ i_3 1)))) (< (+ i_3 1) n_1) (not (< i_3 n_1)))), 52459#(and (or (< i_7 n_1) (<= (+ t_8 s_6) (+ (select X_0 n_1) (select X_0 1)))) (or (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ t_8 s_6)) (< i_7 n_1))), 52467#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) s_2) (< i_3 n_1)) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< s_2 (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)) (< i_3 n_1))), 52452#(and (or (< i_7 n_1) (<= s_6 (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1))))) (or (< i_7 n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6)) (or (< i_7 n_1) (= i_7 n_1))), 52447#(and (or (< i_7 n_1) (< s_2 (+ t_8 s_6 1)) (< i_3 n_1)) (or (< i_7 n_1) (<= (+ t_8 s_6) s_2) (< i_3 n_1))), 52453#(and (or (< i_7 n_1) (<= (+ 2 i_3) n_1) (<= (+ s_2 (select X_0 (+ i_3 1))) (+ t_8 s_6)) (not (< i_3 n_1))) (or (< i_7 n_1) (<= (+ t_8 s_6) (+ s_2 (select X_0 (+ i_3 1)))) (< (+ i_3 1) n_1) (not (< i_3 n_1)))), 52484#(and (or (not (< 1 n_1)) (<= (+ (select X_0 2) (select X_0 1)) (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1)))) (< 2 n_1)) (or (not (< 1 n_1)) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ (select X_0 2) (select X_0 1))) (< 2 n_1))), 52458#(and (or (< i_7 n_1) (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6)) (or (< i_7 n_1) (<= s_6 (+ (select X_0 n_1) (select X_0 1))))), 52478#(and (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1)))) (not (< i_7 n_1))) (or (< (+ i_7 1) n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ (select X_0 (+ i_7 1)) t_8 s_6)) (not (< i_7 n_1)))), 52450#(and (or (< i_7 n_1) (< (+ i_3 1) n_1) (<= s_6 (+ t_5 s_2 (select X_0 (+ i_3 1)))) (not (< i_3 n_1))) (or (<= n_1 i_3) (< i_7 n_1) (<= (+ 2 i_3) n_1) (<= (+ t_5 s_2 (select X_0 (+ i_3 1))) s_6))), 52460#(and (<= s_6 (+ (select X_0 n_1) (select X_0 1))) (= i_7 n_1) (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6)), 52470#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< i_3 n_1) (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ t_5 s_2))) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< (+ t_5 s_2) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)) (< i_3 n_1))), 52474#(and (or (< (+ i_7 1) n_1) (< (+ t_5 s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) s_6 1)) (not (< i_7 n_1)) (< (+ i_3 1) n_1) (not (< i_3 n_1))) (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ t_5 s_2 (select X_0 (+ i_3 1)))) (not (< i_7 n_1)) (< (+ i_3 1) n_1) (not (< i_3 n_1)))), 52462#(and (= (select X_0 i_7) t_8) (or (< i_7 n_1) (= i_7 n_1)) (<= s_6 (select X_0 1)) (or (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ t_8 s_6)) (< i_7 n_1))), 52473#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< (+ i_3 1) n_1) (< (+ s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) s_6 1)) (not (< i_3 n_1))) (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ s_2 (select X_0 (+ i_3 1)))) (not (< i_7 n_1)) (< (+ i_3 1) n_1) (not (< i_3 n_1)))), 52446#(and (or (<= (+ i_3 1) n_1) (< i_7 n_1) (<= (+ t_5 s_2) s_6)) (or (<= s_6 (+ t_5 s_2)) (< i_7 n_1) (< i_3 n_1))), 52463#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) s_2)) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< s_2 (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)))), 52445#(and (or (< i_7 n_1) (< s_2 (+ s_6 1)) (< i_3 n_1)) (or (< i_7 n_1) (< i_3 n_1) (<= s_6 s_2))), 52466#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) s_2) (< i_3 n_1)) (or (< (+ i_7 1) n_1) (< s_2 (+ (select X_0 (+ i_7 1)) t_8 s_6 1)) (not (< i_7 n_1)) (< i_3 n_1))), 52468#(and (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ t_5 s_2)) (not (< i_7 n_1)) (< i_3 n_1)) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< i_3 n_1) (< (+ t_5 s_2) (+ (select X_0 (+ i_7 1)) s_6 1)))), 52465#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< s_2 (+ (select X_0 (+ i_7 1)) s_6 1)) (< i_3 n_1)) (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) s_2) (not (< i_7 n_1)) (< i_3 n_1))), 52443#(and (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) s_2) (not (< i_7 n_1))) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< s_2 (+ (select X_0 (+ i_7 1)) s_6 1)))), 52444#(and (or (< (+ i_7 1) n_1) (< s_2 (+ (select X_0 (+ i_7 1)) t_8 s_6 1)) (not (< i_7 n_1))) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) s_2))), 52486#(and (<= (select X_0 i_7) s_6) (= i_7 1) (<= s_6 (select X_0 i_7))), 52480#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< (+ t_5 s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)) (< (+ i_3 1) n_1) (not (< i_3 n_1))) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ t_5 s_2 (select X_0 (+ i_3 1)))) (< (+ i_3 1) n_1) (not (< i_3 n_1))))] [2022-03-15 21:19:57,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 21:19:57,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:19:57,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 21:19:57,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=5311, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 21:19:57,307 INFO L87 Difference]: Start difference. First operand 2169 states and 9101 transitions. Second operand has 62 states, 61 states have (on average 5.0) internal successors, (305), 62 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:25:00,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:25:00,011 INFO L93 Difference]: Finished difference Result 19275 states and 72947 transitions. [2022-03-15 21:25:00,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1106 states. [2022-03-15 21:25:00,011 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 5.0) internal successors, (305), 62 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 21:25:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:25:00,112 INFO L225 Difference]: With dead ends: 19275 [2022-03-15 21:25:00,112 INFO L226 Difference]: Without dead ends: 18958 [2022-03-15 21:25:00,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1524 GetRequests, 318 SyntacticMatches, 58 SemanticMatches, 1148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605080 ImplicationChecksByTransitivity, 280.6s TimeCoverageRelationStatistics Valid=69615, Invalid=1251735, Unknown=0, NotChecked=0, Total=1321350 [2022-03-15 21:25:00,194 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 7941 mSDsluCounter, 15450 mSDsCounter, 0 mSdLazyCounter, 39361 mSolverCounterSat, 2270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7941 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 41631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2270 IncrementalHoareTripleChecker+Valid, 39361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:25:00,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7941 Valid, 1497 Invalid, 41631 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2270 Valid, 39361 Invalid, 0 Unknown, 0 Unchecked, 21.2s Time] [2022-03-15 21:25:00,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18958 states. [2022-03-15 21:25:00,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18958 to 2479. [2022-03-15 21:25:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2479 states, 2478 states have (on average 4.164648910411622) internal successors, (10320), 2478 states have internal predecessors, (10320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:25:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 10320 transitions. [2022-03-15 21:25:00,358 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 10320 transitions. Word has length 29 [2022-03-15 21:25:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:25:00,358 INFO L470 AbstractCegarLoop]: Abstraction has 2479 states and 10320 transitions. [2022-03-15 21:25:00,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 5.0) internal successors, (305), 62 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:25:00,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 10320 transitions. [2022-03-15 21:25:00,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:25:00,364 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:25:00,364 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:25:00,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 21:25:00,579 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,SelfDestructingSolverStorable12 [2022-03-15 21:25:00,579 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err8INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:25:00,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:25:00,580 INFO L85 PathProgramCache]: Analyzing trace with hash 356005701, now seen corresponding path program 1 times [2022-03-15 21:25:00,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:25:00,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143078278] [2022-03-15 21:25:00,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:25:00,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:25:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:25:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:25:00,837 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:25:00,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143078278] [2022-03-15 21:25:00,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143078278] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:25:00,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863538953] [2022-03-15 21:25:00,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:25:00,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:25:00,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:25:00,838 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:25:00,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 21:25:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:25:00,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 21:25:00,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:25:01,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:25:01,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:25:01,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:25:01,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-03-15 21:25:01,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:25:01,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:25:01,514 INFO L353 Elim1Store]: treesize reduction 36, result has 50.7 percent of original size [2022-03-15 21:25:01,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 25 treesize of output 46 [2022-03-15 21:25:01,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:25:01,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:25:01,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:25:01,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:25:01,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2022-03-15 21:25:01,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:25:01,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863538953] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:25:01,598 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:25:01,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 28 [2022-03-15 21:25:01,598 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [293634697] [2022-03-15 21:25:01,598 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:25:01,600 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:25:01,850 INFO L252 McrAutomatonBuilder]: Finished intersection with 398 states and 985 transitions. [2022-03-15 21:25:01,850 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:25:16,256 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 60 new interpolants: [79078#(and (or (<= (+ i_3 1) n_1) (<= (+ t_5 t_4 s_2) s_6)) (or (<= (+ i_3 1) n_1) (<= s_6 (+ t_5 t_4 s_2)))), 79120#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) s_2) (< i_3 n_1)) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< s_2 (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)) (< i_3 n_1))), 79126#(and (or (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ t_5 t_4 s_2)) (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< i_3 n_1)) (or (<= (+ i_3 1) n_1) (<= n_1 (+ i_7 1)) (< (+ 2 i_7) n_1) (<= (+ t_5 t_4 s_2) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)))))), 79127#(and (or (<= (+ i_3 1) n_1) (<= n_1 1) (< 2 n_1) (<= (+ t_5 t_4 s_2) (+ (select X_0 2) (select X_0 1)))) (or (<= (+ (select X_0 2) (select X_0 1)) (+ t_5 t_4 s_2)) (not (< 1 n_1)) (< 2 n_1) (< i_3 n_1))), 79118#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ t_5 s_2 (select X_0 n_1)))) (or (< (+ i_7 1) n_1) (<= (+ 2 i_3) n_1) (not (< i_7 n_1)) (<= (+ t_5 s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) t_8 s_6)) (not (< i_3 n_1)))), 79113#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ t_4 s_2))) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< (+ t_4 s_2) (+ (select X_0 (+ i_7 1)) t_8 s_6 1)))), 79090#(and (or (<= n_1 i_3) (<= (+ t_5 s_2 (select X_0 n_1)) s_6) (< i_7 n_1) (<= (+ 2 i_3) n_1)) (or (<= s_6 (+ t_5 s_2 (select X_0 n_1))) (< i_7 n_1))), 79132#(and (or (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1)))) (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1)) (or (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)))) (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1))), 79099#(and (or (< i_7 n_1) (<= (+ (select X_0 i_7) s_2 (select X_0 (+ (- 1) n_1))) (+ t_8 s_6))) (<= i_7 n_1) (or (< i_7 n_1) (<= (+ t_8 s_6) (+ (select X_0 i_7) s_2 (select X_0 (+ i_3 1)))))), 79114#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) s_2) (< i_3 n_1)) (or (< (+ i_7 1) n_1) (< s_2 (+ (select X_0 (+ i_7 1)) t_8 s_6 1)) (not (< i_7 n_1)) (< i_3 n_1))), 79097#(and (or (< i_7 n_1) (<= (+ 2 i_3) n_1) (<= (+ t_5 s_2 (select X_0 (+ i_3 1))) (+ t_8 s_6)) (not (< i_3 n_1))) (or (< i_7 n_1) (<= (+ t_8 s_6) (+ t_5 s_2 (select X_0 n_1))))), 79093#(and (or (< i_7 n_1) (<= (+ t_8 s_6) (+ t_4 s_2))) (or (< i_7 n_1) (< (+ t_4 s_2) (+ t_8 s_6 1)))), 79094#(and (or (<= (+ i_3 1) n_1) (< i_7 n_1) (<= (+ t_8 s_6) (+ t_4 s_2))) (or (<= (+ i_3 1) n_1) (<= (+ t_4 s_2) (+ t_8 s_6)) (< i_7 n_1))), 79091#(and (or (< i_7 n_1) (<= s_6 (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1))))) (or (< i_7 n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6))), 79111#(and (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ t_5 s_2 (select X_0 n_1))) (not (< i_7 n_1))) (or (< (+ i_7 1) n_1) (<= (+ 2 i_3) n_1) (not (< i_7 n_1)) (<= (+ t_5 s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) s_6)) (not (< i_3 n_1)))), 79124#(and (or (not (< 1 n_1)) (<= (+ (select X_0 2) (select X_0 1)) (+ t_4 s_2)) (< 2 n_1)) (or (< (+ t_4 s_2) (+ (select X_0 2) 1 (select X_0 1))) (not (< 1 n_1)) (< 2 n_1))), 79110#(and (or (<= (+ i_3 1) n_1) (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ t_5 t_4 s_2) (+ (select X_0 (+ i_7 1)) s_6))) (or (<= (+ i_3 1) n_1) (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ t_5 t_4 s_2)) (not (< i_7 n_1)))), 79107#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< s_2 (+ (select X_0 (+ i_7 1)) s_6 1)) (< i_3 n_1)) (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) s_2) (not (< i_7 n_1)) (< i_3 n_1))), 79101#(and (or (< i_7 n_1) (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6)) (or (< i_7 n_1) (<= s_6 (+ (select X_0 n_1) (select X_0 1))))), 79109#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ s_2 (select X_0 n_1)))) (or (< (+ i_7 1) n_1) (<= (+ 2 i_3) n_1) (not (< i_7 n_1)) (<= (+ s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) s_6)) (not (< i_3 n_1)))), 79112#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1))))) (or (< (+ i_7 1) n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ (select X_0 (+ i_7 1)) s_6)) (not (< i_7 n_1)))), 79088#(and (or (< i_7 n_1) (<= s_6 (+ s_2 (select X_0 n_1)))) (or (< i_7 n_1) (<= (+ s_2 (select X_0 (+ i_3 1))) s_6) (<= (+ 2 i_3) n_1) (not (< i_3 n_1)))), 79089#(and (or (<= (+ i_3 1) n_1) (< i_7 n_1) (<= (+ t_5 t_4 s_2) s_6)) (or (<= (+ i_3 1) n_1) (< i_7 n_1) (<= s_6 (+ t_5 t_4 s_2)))), 79130#(and (or (not (< 1 n_1)) (<= (+ (select X_0 2) (select X_0 1)) (+ s_2 (select X_0 n_1))) (< 2 n_1)) (or (not (< 1 n_1)) (< (+ s_2 (select X_0 (+ i_3 1))) (+ (select X_0 2) 1 (select X_0 1))) (< (+ i_3 1) n_1) (< 2 n_1) (not (< i_3 n_1)))), 79085#(and (or (< i_7 n_1) (< s_2 (+ s_6 1)) (< i_3 n_1)) (or (< i_7 n_1) (< i_3 n_1) (<= s_6 s_2))), 79096#(and (or (<= (+ i_3 1) n_1) (<= (+ t_5 t_4 s_2) (+ t_8 s_6)) (< i_7 n_1)) (or (<= (+ i_3 1) n_1) (< i_7 n_1) (<= (+ t_8 s_6) (+ t_5 t_4 s_2)))), 79134#(and (<= 0 i_3) (<= s_2 0) (< i_3 1) (<= 0 s_2)), 79136#(and (<= 0 s_6) (= (select X_0 i_7) t_8) (= i_7 1) (<= (+ t_8 s_6) (select X_0 i_7))), 79081#(and (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) s_2) (not (< i_7 n_1))) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< s_2 (+ (select X_0 (+ i_7 1)) s_6 1)))), 79098#(and (or (< i_7 n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ t_8 s_6))) (or (< i_7 n_1) (<= (+ t_8 s_6) (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1)))))), 79106#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< (+ t_4 s_2) (+ (select X_0 (+ i_7 1)) s_6 1))) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ t_4 s_2)))), 79084#(and (or (not (< 1 n_1)) (<= (+ (select X_0 2) (select X_0 1)) s_2) (< 2 n_1)) (or (< s_2 (+ (select X_0 2) 1 (select X_0 1))) (not (< 1 n_1)) (< 2 n_1))), 79128#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ s_2 (select X_0 n_1)))) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< (+ s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)) (< (+ i_3 1) n_1) (not (< i_3 n_1)))), 79129#(and (or (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ t_5 s_2 (select X_0 n_1))) (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1)) (or (<= n_1 (+ i_7 1)) (< (+ 2 i_7) n_1) (<= (+ 2 i_3) n_1) (<= (+ t_5 s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)))) (not (< i_3 n_1)))), 79086#(and (or (<= s_6 (+ t_4 s_2)) (< i_7 n_1)) (or (< i_7 n_1) (< (+ t_4 s_2) (+ s_6 1)))), 79102#(and (or (< i_7 n_1) (<= (+ t_8 s_6) (+ (select X_0 n_1) (select X_0 1)))) (or (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ t_8 s_6)) (< i_7 n_1))), 79131#(and (or (<= n_1 1) (<= (+ 2 i_3) n_1) (< 2 n_1) (<= (+ t_5 s_2 (select X_0 (+ i_3 1))) (+ (select X_0 2) (select X_0 1))) (not (< i_3 n_1))) (or (not (< 1 n_1)) (<= (+ (select X_0 2) (select X_0 1)) (+ t_5 s_2 (select X_0 n_1))) (< 2 n_1))), 79115#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< (+ t_4 s_2) (+ (select X_0 (+ i_7 1)) t_8 s_6 1)) (< i_3 n_1)) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< i_3 n_1) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ t_4 s_2)))), 79087#(and (or (<= (+ i_3 1) n_1) (<= s_6 (+ t_4 s_2)) (< i_7 n_1)) (or (<= (+ i_3 1) n_1) (< i_7 n_1) (<= (+ t_4 s_2) s_6))), 79123#(and (or (not (< 1 n_1)) (<= (+ (select X_0 2) (select X_0 1)) s_2) (< 2 n_1) (< i_3 n_1)) (or (< s_2 (+ (select X_0 2) 1 (select X_0 1))) (not (< 1 n_1)) (< 2 n_1) (< i_3 n_1))), 79125#(and (or (not (< 1 n_1)) (<= (+ (select X_0 2) (select X_0 1)) (+ t_4 s_2)) (< 2 n_1) (< i_3 n_1)) (or (< (+ t_4 s_2) (+ (select X_0 2) 1 (select X_0 1))) (not (< 1 n_1)) (< 2 n_1) (< i_3 n_1))), 79079#(and (or (< i_7 n_1) (<= s_6 s_2)) (or (< i_7 n_1) (< s_2 (+ s_6 1)))), 79083#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) s_2)) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< s_2 (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)))), 79133#(and (or (not (< 1 n_1)) (<= (+ (select X_0 2) (select X_0 1)) (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1)))) (< 2 n_1)) (or (not (< 1 n_1)) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ (select X_0 2) (select X_0 1))) (< 2 n_1))), 79117#(and (or (<= (+ i_3 1) n_1) (< (+ i_7 1) n_1) (<= (+ t_5 t_4 s_2) (+ (select X_0 (+ i_7 1)) t_8 s_6)) (not (< i_7 n_1))) (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ t_5 t_4 s_2)) (not (< i_7 n_1)) (< i_3 n_1))), 79121#(and (or (< (+ t_4 s_2) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)) (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1)) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ t_4 s_2)))), 79082#(and (or (< (+ i_7 1) n_1) (< s_2 (+ (select X_0 (+ i_7 1)) t_8 s_6 1)) (not (< i_7 n_1))) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) s_2))), 78963#(and (<= s_6 (+ t_4 s_2)) (<= (+ t_4 s_2) s_6)), 79092#(and (or (< i_7 n_1) (< s_2 (+ t_8 s_6 1)) (< i_3 n_1)) (or (< i_7 n_1) (<= (+ t_8 s_6) s_2) (< i_3 n_1))), 79103#(and (<= s_6 (+ (select X_0 n_1) (select X_0 1))) (= i_7 n_1) (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6)), 79119#(and (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1)))) (not (< i_7 n_1))) (or (< (+ i_7 1) n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ (select X_0 (+ i_7 1)) t_8 s_6)) (not (< i_7 n_1)))), 79108#(and (or (<= (+ i_3 1) n_1) (< (+ i_7 1) n_1) (<= (+ t_4 s_2) (+ (select X_0 (+ i_7 1)) s_6)) (not (< i_7 n_1))) (or (<= (+ i_3 1) n_1) (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ t_4 s_2)))), 79135#(and (<= (select X_0 i_7) s_6) (= i_7 1) (<= s_6 (select X_0 i_7))), 79100#(and (<= s_6 (+ (select X_0 n_1) (select X_0 1))) (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6)), 79122#(and (or (< (+ t_4 s_2) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)) (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< i_3 n_1)) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ t_4 s_2)) (< i_3 n_1))), 79080#(and (or (< i_7 n_1) (<= (+ t_8 s_6) s_2)) (or (< i_7 n_1) (< s_2 (+ t_8 s_6 1)))), 79095#(and (or (< i_7 n_1) (<= (+ 2 i_3) n_1) (<= (+ s_2 (select X_0 (+ i_3 1))) (+ t_8 s_6)) (not (< i_3 n_1))) (or (< i_7 n_1) (<= (+ t_8 s_6) (+ s_2 (select X_0 n_1))))), 79105#(and (or (< i_7 n_1) (= (select X_0 i_7) t_8)) (or (< i_7 n_1) (= i_7 n_1)) (<= s_6 (select X_0 1)) (or (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ t_8 s_6)) (< i_7 n_1))), 79116#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ s_2 (select X_0 n_1)))) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< (+ i_3 1) n_1) (< (+ s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) t_8 s_6 1)) (not (< i_3 n_1)))), 79104#(and (or (< i_7 n_1) (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6)) (or (< i_7 n_1) (<= s_6 (+ (select X_0 n_1) (select X_0 1)))) (or (< i_7 n_1) (= i_7 n_1)))] [2022-03-15 21:25:16,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-03-15 21:25:16,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:25:16,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-03-15 21:25:16,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=7263, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 21:25:16,258 INFO L87 Difference]: Start difference. First operand 2479 states and 10320 transitions. Second operand has 75 states, 74 states have (on average 4.837837837837838) internal successors, (358), 75 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:29:07,640 INFO L93 Difference]: Finished difference Result 14804 states and 56113 transitions. [2022-03-15 21:29:07,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 829 states. [2022-03-15 21:29:07,641 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 4.837837837837838) internal successors, (358), 75 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 21:29:07,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:29:07,696 INFO L225 Difference]: With dead ends: 14804 [2022-03-15 21:29:07,696 INFO L226 Difference]: Without dead ends: 14306 [2022-03-15 21:29:07,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1243 GetRequests, 312 SyntacticMatches, 48 SemanticMatches, 883 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335968 ImplicationChecksByTransitivity, 204.5s TimeCoverageRelationStatistics Valid=41758, Invalid=740582, Unknown=0, NotChecked=0, Total=782340 [2022-03-15 21:29:07,738 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 8418 mSDsluCounter, 21511 mSDsCounter, 0 mSdLazyCounter, 49023 mSolverCounterSat, 3596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8418 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 52619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3596 IncrementalHoareTripleChecker+Valid, 49023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:29:07,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8418 Valid, 2205 Invalid, 52619 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3596 Valid, 49023 Invalid, 0 Unknown, 0 Unchecked, 27.7s Time] [2022-03-15 21:29:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14306 states. [2022-03-15 21:29:07,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14306 to 2591. [2022-03-15 21:29:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2591 states, 2590 states have (on average 4.162548262548262) internal successors, (10781), 2590 states have internal predecessors, (10781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:07,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 10781 transitions. [2022-03-15 21:29:07,869 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 10781 transitions. Word has length 29 [2022-03-15 21:29:07,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:29:07,869 INFO L470 AbstractCegarLoop]: Abstraction has 2591 states and 10781 transitions. [2022-03-15 21:29:07,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 4.837837837837838) internal successors, (358), 75 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:29:07,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 10781 transitions. [2022-03-15 21:29:07,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:29:07,875 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:29:07,875 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:29:07,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 21:29:08,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 21:29:08,096 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err8INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:29:08,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:29:08,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1924934243, now seen corresponding path program 2 times [2022-03-15 21:29:08,097 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:29:08,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012745391] [2022-03-15 21:29:08,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:29:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:29:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:29:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:08,337 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:29:08,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012745391] [2022-03-15 21:29:08,337 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012745391] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:29:08,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354218231] [2022-03-15 21:29:08,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:29:08,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:29:08,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:29:08,338 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:29:08,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 21:29:08,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:29:08,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:29:08,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 21:29:08,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:29:08,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:29:08,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:29:08,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:29:08,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-03-15 21:29:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:08,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:29:09,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:29:09,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:29:09,317 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 21:29:09,317 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 64 [2022-03-15 21:29:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:29:09,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354218231] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:29:09,477 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:29:09,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 32 [2022-03-15 21:29:09,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [944411490] [2022-03-15 21:29:09,477 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:29:09,479 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:29:09,522 INFO L252 McrAutomatonBuilder]: Finished intersection with 398 states and 985 transitions. [2022-03-15 21:29:09,522 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:29:21,919 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 46 new interpolants: [100960#(and (or (< i_7 n_1) (<= (+ t_8 s_6) (+ (select X_0 n_1) (select X_0 1)))) (or (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ t_8 s_6)) (< i_7 n_1))), 100934#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) s_2)) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< s_2 (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)))), 100957#(and (or (< i_7 n_1) (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6)) (or (< i_7 n_1) (<= s_6 (+ (select X_0 n_1) (select X_0 1))))), 100961#(and (or (< i_7 n_1) (= (select X_0 i_7) t_8)) (or (< i_7 n_1) (= i_7 n_1)) (<= s_6 (select X_0 1)) (or (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ t_8 s_6)) (< i_7 n_1))), 100936#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) s_2) (< i_3 n_1)) (or (< (+ i_7 1) n_1) (< s_2 (+ (select X_0 (+ i_7 1)) t_8 s_6 1)) (not (< i_7 n_1)) (< i_3 n_1))), 100942#(and (or (< i_7 n_1) (<= (+ t_8 s_6) (+ t_5 t_4 s_2)) (< i_3 n_1)) (or (< i_7 n_1) (< (+ t_5 t_4 s_2) (+ t_8 s_6 1)) (< i_3 n_1))), 100938#(and (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ t_5 s_2)) (not (< i_7 n_1)) (< i_3 n_1)) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< i_3 n_1) (< (+ t_5 s_2) (+ (select X_0 (+ i_7 1)) s_6 1)))), 100928#(and (or (<= (+ i_3 1) n_1) (< i_7 n_1) (<= (+ t_5 s_2) s_6)) (or (<= s_6 (+ t_5 s_2)) (< i_7 n_1) (< i_3 n_1))), 100962#(and (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1)))) (not (< i_7 n_1))) (or (< (+ i_7 1) n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ (select X_0 (+ i_7 1)) t_8 s_6)) (not (< i_7 n_1)))), 100947#(and (or (<= n_1 i_3) (<= (+ t_5 s_2 (select X_0 n_1)) s_6) (< i_7 n_1) (<= (+ 2 i_3) n_1)) (or (<= s_6 (+ t_5 s_2 (select X_0 n_1))) (< i_7 n_1))), 100950#(and (or (< i_7 n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ t_8 s_6))) (or (< i_7 n_1) (<= (+ t_8 s_6) (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1)))))), 100968#(and (or (not (< 1 n_1)) (<= (+ (select X_0 2) (select X_0 1)) (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1)))) (< 2 n_1)) (or (not (< 1 n_1)) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ (select X_0 2) (select X_0 1))) (< 2 n_1))), 100931#(and (or (<= (+ t_8 s_6) (+ t_5 s_2)) (< i_7 n_1) (< i_3 n_1)) (or (< i_7 n_1) (< (+ t_5 s_2) (+ t_8 s_6 1)) (< i_3 n_1))), 100948#(and (or (< i_7 n_1) (<= s_6 (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1))))) (or (< i_7 n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6))), 100930#(and (or (< i_7 n_1) (< s_2 (+ t_8 s_6 1)) (< i_3 n_1)) (or (< i_7 n_1) (<= (+ t_8 s_6) s_2) (< i_3 n_1))), 100935#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< s_2 (+ (select X_0 (+ i_7 1)) s_6 1)) (< i_3 n_1)) (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) s_2) (not (< i_7 n_1)) (< i_3 n_1))), 100955#(and (<= s_6 (+ (select X_0 n_1) (select X_0 1))) (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6)), 100964#(and (or (not (< 1 n_1)) (< (+ t_5 s_2) (+ (select X_0 2) 1 (select X_0 1))) (< 2 n_1) (< i_3 n_1)) (or (<= (+ (select X_0 2) (select X_0 1)) (+ t_5 s_2)) (not (< 1 n_1)) (< 2 n_1) (< i_3 n_1))), 100965#(and (or (not (< 1 n_1)) (< (+ t_5 t_4 s_2) (+ (select X_0 2) 1 (select X_0 1))) (< 2 n_1) (< i_3 n_1)) (or (<= (+ (select X_0 2) (select X_0 1)) (+ t_5 t_4 s_2)) (not (< 1 n_1)) (< 2 n_1) (< i_3 n_1))), 100959#(and (or (< i_7 n_1) (<= (+ (select X_0 i_7) s_2 (select X_0 (+ (- 1) n_1))) (+ t_8 s_6))) (<= i_7 n_1) (or (< i_7 n_1) (<= (+ t_8 s_6) (+ (select X_0 i_7) s_2 (select X_0 (+ i_3 1)))))), 100956#(and (<= s_6 (+ (select X_0 n_1) (select X_0 1))) (= i_7 n_1) (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6)), 100970#(and (<= 0 s_6) (= (select X_0 i_7) t_8) (= i_7 1) (<= (+ t_8 s_6) (select X_0 i_7))), 100943#(and (or (< (+ i_7 1) n_1) (< (+ t_5 t_4 s_2) (+ (select X_0 (+ i_7 1)) s_6 1)) (not (< i_7 n_1)) (< i_3 n_1)) (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ t_5 t_4 s_2)) (not (< i_7 n_1)) (< i_3 n_1))), 100944#(and (or (< (+ i_7 1) n_1) (< (+ t_5 t_4 s_2) (+ (select X_0 (+ i_7 1)) t_8 s_6 1)) (not (< i_7 n_1)) (< i_3 n_1)) (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ t_5 t_4 s_2)) (not (< i_7 n_1)) (< i_3 n_1))), 100926#(and (or (< i_7 n_1) (<= s_6 s_2)) (or (< i_7 n_1) (< s_2 (+ s_6 1)))), 100937#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) s_2) (< i_3 n_1)) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< s_2 (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)) (< i_3 n_1))), 100946#(and (or (not (< 1 n_1)) (<= (+ (select X_0 2) (select X_0 1)) s_2) (< 2 n_1)) (or (< s_2 (+ (select X_0 2) 1 (select X_0 1))) (not (< 1 n_1)) (< 2 n_1))), 100945#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< (+ t_5 t_4 s_2) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)) (< i_3 n_1)) (or (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ t_5 t_4 s_2)) (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< i_3 n_1))), 100933#(and (or (< (+ i_7 1) n_1) (< s_2 (+ (select X_0 (+ i_7 1)) t_8 s_6 1)) (not (< i_7 n_1))) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) s_2))), 100927#(and (or (< i_7 n_1) (< s_2 (+ s_6 1)) (< i_3 n_1)) (or (< i_7 n_1) (< i_3 n_1) (<= s_6 s_2))), 100963#(and (or (not (< 1 n_1)) (<= (+ (select X_0 2) (select X_0 1)) s_2) (< 2 n_1) (< i_3 n_1)) (or (< s_2 (+ (select X_0 2) 1 (select X_0 1))) (not (< 1 n_1)) (< 2 n_1) (< i_3 n_1))), 100929#(and (or (< i_7 n_1) (<= (+ t_8 s_6) s_2)) (or (< i_7 n_1) (< s_2 (+ t_8 s_6 1)))), 100940#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< i_3 n_1) (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ t_5 s_2))) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< (+ t_5 s_2) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)) (< i_3 n_1))), 100952#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1))))) (or (< (+ i_7 1) n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ (select X_0 (+ i_7 1)) s_6)) (not (< i_7 n_1)))), 100969#(and (<= (select X_0 i_7) s_6) (= i_7 1) (<= s_6 (select X_0 i_7))), 100954#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< (+ t_5 s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)) (< (+ i_3 1) n_1) (not (< i_3 n_1))) (or (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ t_5 s_2 (select X_0 n_1))) (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1))), 100951#(and (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ t_5 s_2 (select X_0 n_1))) (not (< i_7 n_1))) (or (< (+ i_7 1) n_1) (< (+ t_5 s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) s_6 1)) (not (< i_7 n_1)) (< (+ i_3 1) n_1) (not (< i_3 n_1)))), 100932#(and (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) s_2) (not (< i_7 n_1))) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< s_2 (+ (select X_0 (+ i_7 1)) s_6 1)))), 100939#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< i_3 n_1) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ t_5 s_2))) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< i_3 n_1) (< (+ t_5 s_2) (+ (select X_0 (+ i_7 1)) t_8 s_6 1)))), 100966#(and (or (< (+ t_5 s_2 (select X_0 (+ i_3 1))) (+ (select X_0 2) 1 (select X_0 1))) (not (< 1 n_1)) (< (+ i_3 1) n_1) (< 2 n_1) (not (< i_3 n_1))) (or (not (< 1 n_1)) (<= (+ (select X_0 2) (select X_0 1)) (+ t_5 s_2 (select X_0 n_1))) (< 2 n_1))), 100971#(and (<= 0 i_3) (<= s_2 0) (< i_3 1) (<= 0 s_2)), 100949#(and (or (< i_7 n_1) (< (+ t_5 s_2 (select X_0 (+ i_3 1))) (+ t_8 s_6 1)) (< (+ i_3 1) n_1) (not (< i_3 n_1))) (or (< i_7 n_1) (<= (+ t_8 s_6) (+ t_5 s_2 (select X_0 n_1))))), 100953#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ t_5 s_2 (select X_0 n_1)))) (or (< (+ i_7 1) n_1) (< (+ t_5 s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) t_8 s_6 1)) (not (< i_7 n_1)) (< (+ i_3 1) n_1) (not (< i_3 n_1)))), 100941#(and (or (<= (+ i_3 1) n_1) (< i_7 n_1) (<= (+ t_5 t_4 s_2) s_6)) (or (< i_7 n_1) (<= s_6 (+ t_5 t_4 s_2)) (< i_3 n_1))), 100967#(and (or (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ s_2 (select X_0 n_1) (select X_0 (+ i_3 1)))) (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1)) (or (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)))) (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1))), 100958#(and (or (< i_7 n_1) (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6)) (or (< i_7 n_1) (<= s_6 (+ (select X_0 n_1) (select X_0 1)))) (or (< i_7 n_1) (= i_7 n_1)))] [2022-03-15 21:29:21,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 21:29:21,920 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:29:21,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 21:29:21,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=5783, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 21:29:21,921 INFO L87 Difference]: Start difference. First operand 2591 states and 10781 transitions. Second operand has 61 states, 60 states have (on average 5.033333333333333) internal successors, (302), 61 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:53,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:30:53,129 INFO L93 Difference]: Finished difference Result 11721 states and 44415 transitions. [2022-03-15 21:30:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 415 states. [2022-03-15 21:30:53,130 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 5.033333333333333) internal successors, (302), 61 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 21:30:53,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:30:53,158 INFO L225 Difference]: With dead ends: 11721 [2022-03-15 21:30:53,158 INFO L226 Difference]: Without dead ends: 11467 [2022-03-15 21:30:53,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 836 GetRequests, 309 SyntacticMatches, 59 SemanticMatches, 468 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86478 ImplicationChecksByTransitivity, 80.4s TimeCoverageRelationStatistics Valid=14696, Invalid=205734, Unknown=0, NotChecked=0, Total=220430 [2022-03-15 21:30:53,167 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 5952 mSDsluCounter, 11015 mSDsCounter, 0 mSdLazyCounter, 25133 mSolverCounterSat, 1929 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5952 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 27062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1929 IncrementalHoareTripleChecker+Valid, 25133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:30:53,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5952 Valid, 1092 Invalid, 27062 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1929 Valid, 25133 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2022-03-15 21:30:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11467 states. [2022-03-15 21:30:53,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11467 to 2561. [2022-03-15 21:30:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 2560 states have (on average 4.17421875) internal successors, (10686), 2560 states have internal predecessors, (10686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 10686 transitions. [2022-03-15 21:30:53,270 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 10686 transitions. Word has length 29 [2022-03-15 21:30:53,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:30:53,271 INFO L470 AbstractCegarLoop]: Abstraction has 2561 states and 10686 transitions. [2022-03-15 21:30:53,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 5.033333333333333) internal successors, (302), 61 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:30:53,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 10686 transitions. [2022-03-15 21:30:53,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 21:30:53,275 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:30:53,276 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:30:53,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-03-15 21:30:53,489 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,SelfDestructingSolverStorable14 [2022-03-15 21:30:53,489 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err8INUSE_VIOLATION, thread1Err9INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION (and 7 more)] === [2022-03-15 21:30:53,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:30:53,489 INFO L85 PathProgramCache]: Analyzing trace with hash -326696059, now seen corresponding path program 3 times [2022-03-15 21:30:53,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:30:53,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550094328] [2022-03-15 21:30:53,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:30:53,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:30:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:30:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:53,691 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:30:53,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550094328] [2022-03-15 21:30:53,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550094328] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:30:53,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500608990] [2022-03-15 21:30:53,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:30:53,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:30:53,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:30:53,693 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 21:30:53,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 21:30:53,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 21:30:53,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:30:53,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 21:30:53,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:30:53,941 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-03-15 21:30:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:53,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:30:54,172 INFO L353 Elim1Store]: treesize reduction 36, result has 50.7 percent of original size [2022-03-15 21:30:54,173 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 49 [2022-03-15 21:30:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:30:54,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500608990] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:30:54,306 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:30:54,306 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2022-03-15 21:30:54,306 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1894581482] [2022-03-15 21:30:54,306 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:30:54,308 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:30:54,360 INFO L252 McrAutomatonBuilder]: Finished intersection with 464 states and 1204 transitions. [2022-03-15 21:30:54,360 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:31:11,885 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 53 new interpolants: [118826#(and (or (< (+ i_7 1) n_1) (< (+ t_5 t_4 s_2) (+ (select X_0 (+ i_7 1)) t_8 s_6 1)) (not (< i_7 n_1)) (< i_3 n_1)) (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ t_5 t_4 s_2)) (not (< i_7 n_1)) (< i_3 n_1))), 118836#(and (or (<= (+ (select X_0 2) (select X_0 1)) (+ s_2 (select X_0 (+ i_3 1)))) (not (< 1 n_1)) (<= (+ 2 i_3) n_1) (< 2 n_1)) (or (not (< 1 n_1)) (<= (+ 2 i_3) n_1) (<= (+ s_2 (select X_0 (+ i_3 1))) (+ (select X_0 2) (select X_0 1))) (< 2 n_1))), 118831#(and (or (< (+ i_7 1) n_1) (<= (+ 2 i_3) n_1) (not (< i_7 n_1)) (<= (+ t_4 s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) t_8 s_6))) (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ t_4 s_2 (select X_0 (+ i_3 1)))) (<= (+ 2 i_3) n_1) (not (< i_7 n_1)))), 118852#(and (or (not (< 1 n_1)) (<= (+ 2 i_3) n_1) (< 2 n_1)) (or (<= (+ 3 i_3) n_1) (not (< 1 n_1)) (<= (+ (select X_0 (+ 2 i_3)) s_2 (select X_0 (+ i_3 1))) (+ (select X_0 2) (select X_0 1))) (< 2 n_1)) (or (<= (+ 3 i_3) n_1) (not (< 1 n_1)) (< 2 n_1) (<= (+ (select X_0 2) (select X_0 1)) (+ (select X_0 (+ 2 i_3)) s_2 (select X_0 (+ i_3 1)))))), 118825#(and (or (< (+ i_7 1) n_1) (< (+ t_5 t_4 s_2) (+ (select X_0 (+ i_7 1)) s_6 1)) (not (< i_7 n_1)) (< i_3 n_1)) (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ t_5 t_4 s_2)) (not (< i_7 n_1)) (< i_3 n_1))), 118812#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) s_2) (< i_3 n_1)) (or (< (+ i_7 1) n_1) (< s_2 (+ (select X_0 (+ i_7 1)) t_8 s_6 1)) (not (< i_7 n_1)) (< i_3 n_1))), 118845#(and (or (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ t_8 s_6)) (< i_7 n_1) (< 2 n_1)) (or (<= 2 n_1) (< i_7 n_1)) (or (< i_7 n_1) (<= (+ t_8 s_6) (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1)))) (< 2 n_1))), 118816#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< i_3 n_1) (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ t_5 s_2))) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< (+ t_5 s_2) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)) (< i_3 n_1))), 118850#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ 3 i_3) n_1) (<= (+ (select X_0 (+ 2 i_3)) s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))))) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ 3 i_3) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ (select X_0 (+ 2 i_3)) s_2 (select X_0 (+ i_3 1))))) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ 2 i_3) n_1))), 118840#(and (or (< i_7 n_1) (<= (+ 2 i_3) n_1)) (or (< (+ 2 i_3) n_1) (< i_7 n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6)) (or (< (+ 2 i_3) n_1) (< i_7 n_1) (= i_7 n_1)) (or (< (+ 2 i_3) n_1) (< i_7 n_1) (<= s_6 (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1)))))), 118823#(and (or (<= (+ i_3 1) n_1) (< i_7 n_1) (<= (+ t_5 t_4 s_2) s_6)) (or (< i_7 n_1) (<= s_6 (+ t_5 t_4 s_2)) (< i_3 n_1))), 118807#(and (or (<= (+ t_8 s_6) (+ t_5 s_2)) (< i_7 n_1) (< i_3 n_1)) (or (< i_7 n_1) (< (+ t_5 s_2) (+ t_8 s_6 1)) (< i_3 n_1))), 118833#(and (or (not (< 1 n_1)) (<= (+ (select X_0 2) (select X_0 1)) s_2) (< 2 n_1)) (or (< s_2 (+ (select X_0 2) 1 (select X_0 1))) (not (< 1 n_1)) (< 2 n_1))), 118838#(and (or (<= (+ (select X_0 2) (select X_0 1)) (+ t_4 s_2 (select X_0 (+ i_3 1)))) (not (< 1 n_1)) (<= (+ 2 i_3) n_1) (< 2 n_1)) (or (<= (+ t_4 s_2 (select X_0 (+ i_3 1))) (+ (select X_0 2) (select X_0 1))) (not (< 1 n_1)) (<= (+ 2 i_3) n_1) (< 2 n_1))), 118824#(and (or (< i_7 n_1) (<= (+ t_8 s_6) (+ t_5 t_4 s_2)) (< i_3 n_1)) (or (< i_7 n_1) (< (+ t_5 t_4 s_2) (+ t_8 s_6 1)) (< i_3 n_1))), 118818#(and (or (< i_7 n_1) (<= (+ 2 i_3) n_1) (<= (+ t_8 s_6) (+ s_2 (select X_0 (+ i_3 1))))) (or (< i_7 n_1) (<= (+ 2 i_3) n_1) (<= (+ s_2 (select X_0 (+ i_3 1))) (+ t_8 s_6)))), 118827#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< (+ t_5 t_4 s_2) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)) (< i_3 n_1)) (or (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ t_5 t_4 s_2)) (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< i_3 n_1))), 118853#(and (<= i_3 0) (<= s_2 0) (<= 0 s_2)), 118828#(and (or (< i_7 n_1) (<= (+ 2 i_3) n_1) (<= (+ t_4 s_2 (select X_0 (+ i_3 1))) s_6)) (or (< i_7 n_1) (<= s_6 (+ t_4 s_2 (select X_0 (+ i_3 1)))) (<= (+ 2 i_3) n_1))), 118804#(and (or (<= (+ i_3 1) n_1) (< i_7 n_1) (<= (+ t_5 s_2) s_6)) (or (<= s_6 (+ t_5 s_2)) (< i_7 n_1) (< i_3 n_1))), 118803#(and (or (< i_7 n_1) (< s_2 (+ s_6 1)) (< i_3 n_1)) (or (< i_7 n_1) (< i_3 n_1) (<= s_6 s_2))), 118847#(and (or (<= s_6 (select X_0 (+ (- 1) n_1))) (< 2 n_1)) (<= 2 n_1) (or (= i_7 n_1) (< 2 n_1)) (or (= (select X_0 i_7) t_8) (< 2 n_1)) (or (<= (select X_0 (+ (- 1) n_1)) s_6) (< 2 n_1))), 118821#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ 2 i_3) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ s_2 (select X_0 (+ i_3 1))))) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ 2 i_3) n_1) (<= (+ s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)))))), 118817#(and (or (< i_7 n_1) (<= (+ s_2 (select X_0 (+ i_3 1))) s_6) (<= (+ 2 i_3) n_1)) (or (< i_7 n_1) (<= (+ 2 i_3) n_1) (<= s_6 (+ s_2 (select X_0 (+ i_3 1)))))), 118846#(and (<= 2 n_1) (or (= i_7 n_1) (< 2 n_1)) (or (<= s_6 (+ (select X_0 i_7) (select X_0 (+ (- 1) n_1)))) (< 2 n_1)) (or (<= (+ (select X_0 i_7) (select X_0 (+ (- 1) n_1))) s_6) (< 2 n_1))), 118849#(and (or (< (+ i_7 1) n_1) (<= (+ 2 i_3) n_1) (not (< i_7 n_1))) (or (<= (+ (select X_0 (+ 2 i_3)) s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) t_8 s_6)) (< (+ i_7 1) n_1) (<= (+ 3 i_3) n_1) (not (< i_7 n_1))) (or (< (+ i_7 1) n_1) (<= (+ 3 i_3) n_1) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ (select X_0 (+ 2 i_3)) s_2 (select X_0 (+ i_3 1)))) (not (< i_7 n_1)))), 118820#(and (or (< (+ i_7 1) n_1) (<= (+ 2 i_3) n_1) (not (< i_7 n_1)) (<= (+ s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) t_8 s_6))) (or (< (+ i_7 1) n_1) (<= (+ 2 i_3) n_1) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ s_2 (select X_0 (+ i_3 1)))) (not (< i_7 n_1)))), 118834#(and (or (not (< 1 n_1)) (<= (+ (select X_0 2) (select X_0 1)) s_2) (< 2 n_1) (< i_3 n_1)) (or (< s_2 (+ (select X_0 2) 1 (select X_0 1))) (not (< 1 n_1)) (< 2 n_1) (< i_3 n_1))), 118844#(and (or (<= 2 n_1) (< i_7 n_1)) (or (< i_7 n_1) (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6) (< 2 n_1)) (or (< i_7 n_1) (<= s_6 (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1)))) (< 2 n_1))), 118848#(and (or (< (+ i_7 1) n_1) (< (+ 2 i_3) n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ (select X_0 (+ i_7 1)) s_6)) (not (< i_7 n_1))) (or (< (+ i_7 1) n_1) (<= (+ 3 i_3) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ (select X_0 (+ 2 i_3)) s_2 (select X_0 (+ i_3 1))))) (or (< (+ i_7 1) n_1) (<= (+ 2 i_3) n_1) (not (< i_7 n_1)))), 118832#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ 2 i_3) n_1) (<= (+ t_4 s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))))) (or (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) (+ t_4 s_2 (select X_0 (+ i_3 1)))) (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ 2 i_3) n_1))), 118809#(and (or (< (+ i_7 1) n_1) (< s_2 (+ (select X_0 (+ i_7 1)) t_8 s_6 1)) (not (< i_7 n_1))) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) s_2))), 118822#(and (or (<= (+ i_3 1) n_1) (<= (+ t_5 t_4 s_2) s_6)) (or (<= (+ i_3 1) n_1) (<= s_6 (+ t_5 t_4 s_2)))), 118835#(and (or (not (< 1 n_1)) (< (+ t_5 s_2) (+ (select X_0 2) 1 (select X_0 1))) (< 2 n_1) (< i_3 n_1)) (or (<= (+ (select X_0 2) (select X_0 1)) (+ t_5 s_2)) (not (< 1 n_1)) (< 2 n_1) (< i_3 n_1))), 118837#(and (or (not (< 1 n_1)) (< (+ t_5 t_4 s_2) (+ (select X_0 2) 1 (select X_0 1))) (< 2 n_1) (< i_3 n_1)) (or (<= (+ (select X_0 2) (select X_0 1)) (+ t_5 t_4 s_2)) (not (< 1 n_1)) (< 2 n_1) (< i_3 n_1))), 118842#(and (or (< i_7 n_1) (<= (+ 2 i_3) n_1)) (or (< (+ 2 i_3) n_1) (< i_7 n_1) (= i_7 n_1)) (or (< (+ 2 i_3) n_1) (< i_7 n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ t_8 s_6))) (or (< i_7 n_1) (<= (+ 3 i_3) n_1) (<= (+ t_8 s_6) (+ (select X_0 (+ 2 i_3)) s_2 (select X_0 (+ i_3 1)))))), 118830#(and (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ t_4 s_2 (select X_0 (+ i_3 1)))) (<= (+ 2 i_3) n_1) (not (< i_7 n_1))) (or (< (+ i_7 1) n_1) (<= (+ 2 i_3) n_1) (not (< i_7 n_1)) (<= (+ t_4 s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) s_6)))), 118843#(and (<= 2 n_1) (or (<= s_6 (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1)))) (< 2 n_1)) (or (<= (+ (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6) (< 2 n_1))), 118805#(and (or (< i_7 n_1) (<= (+ t_8 s_6) s_2)) (or (< i_7 n_1) (< s_2 (+ t_8 s_6 1)))), 118815#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< i_3 n_1) (<= (+ (select X_0 (+ i_7 1)) t_8 s_6) (+ t_5 s_2))) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< i_3 n_1) (< (+ t_5 s_2) (+ (select X_0 (+ i_7 1)) t_8 s_6 1)))), 118819#(and (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ s_2 (select X_0 (+ i_3 1)))) (<= (+ 2 i_3) n_1) (not (< i_7 n_1))) (or (< (+ i_7 1) n_1) (<= (+ 2 i_3) n_1) (not (< i_7 n_1)) (<= (+ s_2 (select X_0 (+ i_3 1))) (+ (select X_0 (+ i_7 1)) s_6)))), 118839#(and (or (< i_7 n_1) (<= (+ 2 i_3) n_1)) (or (< (+ 2 i_3) n_1) (< i_7 n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) s_6)) (or (< (+ 2 i_3) n_1) (< i_7 n_1) (<= s_6 (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1)))))), 118841#(and (or (< i_7 n_1) (<= (+ 2 i_3) n_1)) (or (< (+ 2 i_3) n_1) (< i_7 n_1) (<= (+ s_2 (select X_0 n_1) (select X_0 (+ (- 1) n_1))) (+ t_8 s_6))) (or (< i_7 n_1) (<= (+ 3 i_3) n_1) (<= (+ t_8 s_6) (+ (select X_0 (+ 2 i_3)) s_2 (select X_0 (+ i_3 1)))))), 118851#(and (<= 1 i_7) (<= (select X_0 i_7) s_6) (<= s_6 (select X_0 i_7))), 118829#(and (or (< i_7 n_1) (<= (+ t_4 s_2 (select X_0 (+ i_3 1))) (+ t_8 s_6)) (<= (+ 2 i_3) n_1)) (or (< i_7 n_1) (<= (+ 2 i_3) n_1) (<= (+ t_8 s_6) (+ t_4 s_2 (select X_0 (+ i_3 1)))))), 118808#(and (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) s_2) (not (< i_7 n_1))) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< s_2 (+ (select X_0 (+ i_7 1)) s_6 1)))), 118806#(and (or (< i_7 n_1) (< s_2 (+ t_8 s_6 1)) (< i_3 n_1)) (or (< i_7 n_1) (<= (+ t_8 s_6) s_2) (< i_3 n_1))), 118802#(and (or (< i_7 n_1) (<= s_6 s_2)) (or (< i_7 n_1) (< s_2 (+ s_6 1)))), 118811#(and (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< s_2 (+ (select X_0 (+ i_7 1)) s_6 1)) (< i_3 n_1)) (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) s_2) (not (< i_7 n_1)) (< i_3 n_1))), 118810#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) s_2)) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< s_2 (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)))), 118813#(and (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7))) s_2) (< i_3 n_1)) (or (not (< (+ i_7 1) n_1)) (< (+ 2 i_7) n_1) (< s_2 (+ (select X_0 (+ i_7 1)) s_6 (select X_0 (+ 2 i_7)) 1)) (< i_3 n_1))), 118814#(and (or (< (+ i_7 1) n_1) (<= (+ (select X_0 (+ i_7 1)) s_6) (+ t_5 s_2)) (not (< i_7 n_1)) (< i_3 n_1)) (or (< (+ i_7 1) n_1) (not (< i_7 n_1)) (< i_3 n_1) (< (+ t_5 s_2) (+ (select X_0 (+ i_7 1)) s_6 1)))), 118854#(and (<= 1 i_7) (<= 0 s_6) (= (select X_0 i_7) t_8) (<= (+ t_8 s_6) (select X_0 i_7)))] [2022-03-15 21:31:11,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-03-15 21:31:11,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:31:11,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-03-15 21:31:11,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=6223, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 21:31:11,887 INFO L87 Difference]: Start difference. First operand 2561 states and 10686 transitions. Second operand has 67 states, 66 states have (on average 5.363636363636363) internal successors, (354), 67 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 21:33:14,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 566 states. [2022-03-15 21:33:14,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1064 GetRequests, 357 SyntacticMatches, 71 SemanticMatches, 635 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175906 ImplicationChecksByTransitivity, 114.6s TimeCoverageRelationStatistics Valid=32382, Invalid=372750, Unknown=0, NotChecked=0, Total=405132 [2022-03-15 21:33:14,113 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 2732 mSDsluCounter, 6273 mSDsCounter, 0 mSdLazyCounter, 19256 mSolverCounterSat, 2516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2732 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 21772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2516 IncrementalHoareTripleChecker+Valid, 19256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:33:14,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2732 Valid, 158 Invalid, 21772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2516 Valid, 19256 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-03-15 21:33:14,114 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (10 of 11 remaining) [2022-03-15 21:33:14,125 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 21:33:14,125 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:33:14,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 21:33:14,329 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,SelfDestructingSolverStorable15 [2022-03-15 21:33:14,329 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (2561states) and FLOYD_HOARE automaton (currently 566 states, 67 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 637 known predicates. [2022-03-15 21:33:14,331 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8INUSE_VIOLATION (9 of 11 remaining) [2022-03-15 21:33:14,331 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9INUSE_VIOLATION (8 of 11 remaining) [2022-03-15 21:33:14,331 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (7 of 11 remaining) [2022-03-15 21:33:14,331 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (6 of 11 remaining) [2022-03-15 21:33:14,331 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err0INUSE_VIOLATION (5 of 11 remaining) [2022-03-15 21:33:14,331 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err3INUSE_VIOLATION (4 of 11 remaining) [2022-03-15 21:33:14,331 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork0Err6INUSE_VIOLATION (3 of 11 remaining) [2022-03-15 21:33:14,331 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork0Err7INUSE_VIOLATION (2 of 11 remaining) [2022-03-15 21:33:14,331 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Thread1of1ForFork1Err4INUSE_VIOLATION (1 of 11 remaining) [2022-03-15 21:33:14,332 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Thread1of1ForFork1Err5INUSE_VIOLATION (0 of 11 remaining) [2022-03-15 21:33:14,337 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1] [2022-03-15 21:33:14,339 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 21:33:14,339 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 21:33:14,350 INFO L202 PluginConnector]: Adding new model parallel-sum-1-dsl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 09:33:14 BasicIcfg [2022-03-15 21:33:14,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 21:33:14,351 INFO L158 Benchmark]: Toolchain (without parser) took 859453.90ms. Allocated memory was 199.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 163.3MB in the beginning and 565.0MB in the end (delta: -401.8MB). Peak memory consumption was 944.2MB. Max. memory is 8.0GB. [2022-03-15 21:33:14,351 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 199.2MB. Free memory is still 164.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 21:33:14,351 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.90ms. Allocated memory is still 199.2MB. Free memory was 163.3MB in the beginning and 161.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:33:14,352 INFO L158 Benchmark]: Boogie Preprocessor took 24.28ms. Allocated memory is still 199.2MB. Free memory was 161.7MB in the beginning and 160.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:33:14,352 INFO L158 Benchmark]: RCFGBuilder took 202.61ms. Allocated memory is still 199.2MB. Free memory was 160.6MB in the beginning and 149.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-15 21:33:14,352 INFO L158 Benchmark]: TraceAbstraction took 859203.82ms. Allocated memory was 199.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 149.1MB in the beginning and 565.0MB in the end (delta: -415.9MB). Peak memory consumption was 930.6MB. Max. memory is 8.0GB. [2022-03-15 21:33:14,353 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.09ms. Allocated memory is still 199.2MB. Free memory is still 164.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.90ms. Allocated memory is still 199.2MB. Free memory was 163.3MB in the beginning and 161.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.28ms. Allocated memory is still 199.2MB. Free memory was 161.7MB in the beginning and 160.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 202.61ms. Allocated memory is still 199.2MB. Free memory was 160.6MB in the beginning and 149.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 859203.82ms. Allocated memory was 199.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 149.1MB in the beginning and 565.0MB in the end (delta: -415.9MB). Peak memory consumption was 930.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 59 PlacesBefore, 57 PlacesAfterwards, 48 TransitionsBefore, 46 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1932 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1497, positive: 1437, positive conditional: 0, positive unconditional: 1437, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 230, positive: 223, positive conditional: 0, positive unconditional: 223, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1497, positive: 1214, positive conditional: 0, positive unconditional: 1214, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 230, unknown conditional: 0, unknown unconditional: 230] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 223, Positive conditional cache size: 0, Positive unconditional cache size: 223, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (2561states) and FLOYD_HOARE automaton (currently 566 states, 67 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 637 known predicates. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2561states) and FLOYD_HOARE automaton (currently 566 states, 67 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 637 known predicates. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2561states) and FLOYD_HOARE automaton (currently 566 states, 67 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 637 known predicates. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2561states) and FLOYD_HOARE automaton (currently 566 states, 67 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 637 known predicates. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2561states) and FLOYD_HOARE automaton (currently 566 states, 67 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 637 known predicates. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2561states) and FLOYD_HOARE automaton (currently 566 states, 67 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 637 known predicates. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2561states) and FLOYD_HOARE automaton (currently 566 states, 67 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 637 known predicates. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2561states) and FLOYD_HOARE automaton (currently 566 states, 67 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 637 known predicates. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2561states) and FLOYD_HOARE automaton (currently 566 states, 67 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 637 known predicates. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2561states) and FLOYD_HOARE automaton (currently 566 states, 67 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 637 known predicates. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2561states) and FLOYD_HOARE automaton (currently 566 states, 67 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 637 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 71 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 859.1s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 761.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29614 SdHoareTripleChecker+Valid, 80.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29614 mSDsluCounter, 8162 SdHoareTripleChecker+Invalid, 69.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68701 mSDsCounter, 11400 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 157743 IncrementalHoareTripleChecker+Invalid, 169143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11400 mSolverCounterUnsat, 441 mSDtfsCounter, 157743 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8204 GetRequests, 4070 SyntacticMatches, 548 SemanticMatches, 3585 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 1211453 ImplicationChecksByTransitivity, 687.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2591occurred in iteration=14, InterpolantAutomatonStates: 2690, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 51216 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 701 NumberOfCodeBlocks, 701 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 956 ConstructedInterpolants, 60 QuantifiedInterpolants, 11125 SizeOfPredicates, 63 NumberOfNonLiveVariables, 1328 ConjunctsInSsa, 233 ConjunctsInUnsatCore, 38 InterpolantComputations, 5 PerfectInterpolantSequences, 22/142 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